Show More
@@ -1,3698 +1,3697 b'' | |||||
1 | # localrepo.py - read/write repository class for mercurial |
|
1 | # localrepo.py - read/write repository class for mercurial | |
2 | # |
|
2 | # | |
3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> |
|
3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> | |
4 | # |
|
4 | # | |
5 | # This software may be used and distributed according to the terms of the |
|
5 | # This software may be used and distributed according to the terms of the | |
6 | # GNU General Public License version 2 or any later version. |
|
6 | # GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | from __future__ import absolute_import |
|
8 | from __future__ import absolute_import | |
9 |
|
9 | |||
10 | import errno |
|
10 | import errno | |
11 | import functools |
|
11 | import functools | |
12 | import os |
|
12 | import os | |
13 | import random |
|
13 | import random | |
14 | import sys |
|
14 | import sys | |
15 | import time |
|
15 | import time | |
16 | import weakref |
|
16 | import weakref | |
17 |
|
17 | |||
18 | from .i18n import _ |
|
18 | from .i18n import _ | |
19 | from .node import ( |
|
19 | from .node import ( | |
20 | bin, |
|
20 | bin, | |
21 | hex, |
|
21 | hex, | |
22 | nullid, |
|
22 | nullid, | |
23 | nullrev, |
|
23 | nullrev, | |
24 | short, |
|
24 | short, | |
25 | ) |
|
25 | ) | |
26 | from .pycompat import ( |
|
26 | from .pycompat import ( | |
27 | delattr, |
|
27 | delattr, | |
28 | getattr, |
|
28 | getattr, | |
29 | ) |
|
29 | ) | |
30 | from . import ( |
|
30 | from . import ( | |
31 | bookmarks, |
|
31 | bookmarks, | |
32 | branchmap, |
|
32 | branchmap, | |
33 | bundle2, |
|
33 | bundle2, | |
34 | bundlecaches, |
|
34 | bundlecaches, | |
35 | changegroup, |
|
35 | changegroup, | |
36 | color, |
|
36 | color, | |
37 | commit, |
|
37 | commit, | |
38 | context, |
|
38 | context, | |
39 | dirstate, |
|
39 | dirstate, | |
40 | dirstateguard, |
|
40 | dirstateguard, | |
41 | discovery, |
|
41 | discovery, | |
42 | encoding, |
|
42 | encoding, | |
43 | error, |
|
43 | error, | |
44 | exchange, |
|
44 | exchange, | |
45 | extensions, |
|
45 | extensions, | |
46 | filelog, |
|
46 | filelog, | |
47 | hook, |
|
47 | hook, | |
48 | lock as lockmod, |
|
48 | lock as lockmod, | |
49 | match as matchmod, |
|
49 | match as matchmod, | |
50 | mergestate as mergestatemod, |
|
50 | mergestate as mergestatemod, | |
51 | mergeutil, |
|
51 | mergeutil, | |
52 | namespaces, |
|
52 | namespaces, | |
53 | narrowspec, |
|
53 | narrowspec, | |
54 | obsolete, |
|
54 | obsolete, | |
55 | pathutil, |
|
55 | pathutil, | |
56 | phases, |
|
56 | phases, | |
57 | pushkey, |
|
57 | pushkey, | |
58 | pycompat, |
|
58 | pycompat, | |
59 | rcutil, |
|
59 | rcutil, | |
60 | repoview, |
|
60 | repoview, | |
61 | requirements as requirementsmod, |
|
61 | requirements as requirementsmod, | |
62 | revlog, |
|
62 | revlog, | |
63 | revset, |
|
63 | revset, | |
64 | revsetlang, |
|
64 | revsetlang, | |
65 | scmutil, |
|
65 | scmutil, | |
66 | sparse, |
|
66 | sparse, | |
67 | store as storemod, |
|
67 | store as storemod, | |
68 | subrepoutil, |
|
68 | subrepoutil, | |
69 | tags as tagsmod, |
|
69 | tags as tagsmod, | |
70 | transaction, |
|
70 | transaction, | |
71 | txnutil, |
|
71 | txnutil, | |
72 | util, |
|
72 | util, | |
73 | vfs as vfsmod, |
|
73 | vfs as vfsmod, | |
74 | ) |
|
74 | ) | |
75 |
|
75 | |||
76 | from .interfaces import ( |
|
76 | from .interfaces import ( | |
77 | repository, |
|
77 | repository, | |
78 | util as interfaceutil, |
|
78 | util as interfaceutil, | |
79 | ) |
|
79 | ) | |
80 |
|
80 | |||
81 | from .utils import ( |
|
81 | from .utils import ( | |
82 | hashutil, |
|
82 | hashutil, | |
83 | procutil, |
|
83 | procutil, | |
84 | stringutil, |
|
84 | stringutil, | |
85 | ) |
|
85 | ) | |
86 |
|
86 | |||
87 | from .revlogutils import ( |
|
87 | from .revlogutils import ( | |
88 | concurrency_checker as revlogchecker, |
|
88 | concurrency_checker as revlogchecker, | |
89 | constants as revlogconst, |
|
89 | constants as revlogconst, | |
90 | ) |
|
90 | ) | |
91 |
|
91 | |||
92 | release = lockmod.release |
|
92 | release = lockmod.release | |
93 | urlerr = util.urlerr |
|
93 | urlerr = util.urlerr | |
94 | urlreq = util.urlreq |
|
94 | urlreq = util.urlreq | |
95 |
|
95 | |||
96 | # set of (path, vfs-location) tuples. vfs-location is: |
|
96 | # set of (path, vfs-location) tuples. vfs-location is: | |
97 | # - 'plain for vfs relative paths |
|
97 | # - 'plain for vfs relative paths | |
98 | # - '' for svfs relative paths |
|
98 | # - '' for svfs relative paths | |
99 | _cachedfiles = set() |
|
99 | _cachedfiles = set() | |
100 |
|
100 | |||
101 |
|
101 | |||
102 | class _basefilecache(scmutil.filecache): |
|
102 | class _basefilecache(scmutil.filecache): | |
103 | """All filecache usage on repo are done for logic that should be unfiltered""" |
|
103 | """All filecache usage on repo are done for logic that should be unfiltered""" | |
104 |
|
104 | |||
105 | def __get__(self, repo, type=None): |
|
105 | def __get__(self, repo, type=None): | |
106 | if repo is None: |
|
106 | if repo is None: | |
107 | return self |
|
107 | return self | |
108 | # proxy to unfiltered __dict__ since filtered repo has no entry |
|
108 | # proxy to unfiltered __dict__ since filtered repo has no entry | |
109 | unfi = repo.unfiltered() |
|
109 | unfi = repo.unfiltered() | |
110 | try: |
|
110 | try: | |
111 | return unfi.__dict__[self.sname] |
|
111 | return unfi.__dict__[self.sname] | |
112 | except KeyError: |
|
112 | except KeyError: | |
113 | pass |
|
113 | pass | |
114 | return super(_basefilecache, self).__get__(unfi, type) |
|
114 | return super(_basefilecache, self).__get__(unfi, type) | |
115 |
|
115 | |||
116 | def set(self, repo, value): |
|
116 | def set(self, repo, value): | |
117 | return super(_basefilecache, self).set(repo.unfiltered(), value) |
|
117 | return super(_basefilecache, self).set(repo.unfiltered(), value) | |
118 |
|
118 | |||
119 |
|
119 | |||
120 | class repofilecache(_basefilecache): |
|
120 | class repofilecache(_basefilecache): | |
121 | """filecache for files in .hg but outside of .hg/store""" |
|
121 | """filecache for files in .hg but outside of .hg/store""" | |
122 |
|
122 | |||
123 | def __init__(self, *paths): |
|
123 | def __init__(self, *paths): | |
124 | super(repofilecache, self).__init__(*paths) |
|
124 | super(repofilecache, self).__init__(*paths) | |
125 | for path in paths: |
|
125 | for path in paths: | |
126 | _cachedfiles.add((path, b'plain')) |
|
126 | _cachedfiles.add((path, b'plain')) | |
127 |
|
127 | |||
128 | def join(self, obj, fname): |
|
128 | def join(self, obj, fname): | |
129 | return obj.vfs.join(fname) |
|
129 | return obj.vfs.join(fname) | |
130 |
|
130 | |||
131 |
|
131 | |||
132 | class storecache(_basefilecache): |
|
132 | class storecache(_basefilecache): | |
133 | """filecache for files in the store""" |
|
133 | """filecache for files in the store""" | |
134 |
|
134 | |||
135 | def __init__(self, *paths): |
|
135 | def __init__(self, *paths): | |
136 | super(storecache, self).__init__(*paths) |
|
136 | super(storecache, self).__init__(*paths) | |
137 | for path in paths: |
|
137 | for path in paths: | |
138 | _cachedfiles.add((path, b'')) |
|
138 | _cachedfiles.add((path, b'')) | |
139 |
|
139 | |||
140 | def join(self, obj, fname): |
|
140 | def join(self, obj, fname): | |
141 | return obj.sjoin(fname) |
|
141 | return obj.sjoin(fname) | |
142 |
|
142 | |||
143 |
|
143 | |||
144 | class mixedrepostorecache(_basefilecache): |
|
144 | class mixedrepostorecache(_basefilecache): | |
145 | """filecache for a mix files in .hg/store and outside""" |
|
145 | """filecache for a mix files in .hg/store and outside""" | |
146 |
|
146 | |||
147 | def __init__(self, *pathsandlocations): |
|
147 | def __init__(self, *pathsandlocations): | |
148 | # scmutil.filecache only uses the path for passing back into our |
|
148 | # scmutil.filecache only uses the path for passing back into our | |
149 | # join(), so we can safely pass a list of paths and locations |
|
149 | # join(), so we can safely pass a list of paths and locations | |
150 | super(mixedrepostorecache, self).__init__(*pathsandlocations) |
|
150 | super(mixedrepostorecache, self).__init__(*pathsandlocations) | |
151 | _cachedfiles.update(pathsandlocations) |
|
151 | _cachedfiles.update(pathsandlocations) | |
152 |
|
152 | |||
153 | def join(self, obj, fnameandlocation): |
|
153 | def join(self, obj, fnameandlocation): | |
154 | fname, location = fnameandlocation |
|
154 | fname, location = fnameandlocation | |
155 | if location == b'plain': |
|
155 | if location == b'plain': | |
156 | return obj.vfs.join(fname) |
|
156 | return obj.vfs.join(fname) | |
157 | else: |
|
157 | else: | |
158 | if location != b'': |
|
158 | if location != b'': | |
159 | raise error.ProgrammingError( |
|
159 | raise error.ProgrammingError( | |
160 | b'unexpected location: %s' % location |
|
160 | b'unexpected location: %s' % location | |
161 | ) |
|
161 | ) | |
162 | return obj.sjoin(fname) |
|
162 | return obj.sjoin(fname) | |
163 |
|
163 | |||
164 |
|
164 | |||
165 | def isfilecached(repo, name): |
|
165 | def isfilecached(repo, name): | |
166 | """check if a repo has already cached "name" filecache-ed property |
|
166 | """check if a repo has already cached "name" filecache-ed property | |
167 |
|
167 | |||
168 | This returns (cachedobj-or-None, iscached) tuple. |
|
168 | This returns (cachedobj-or-None, iscached) tuple. | |
169 | """ |
|
169 | """ | |
170 | cacheentry = repo.unfiltered()._filecache.get(name, None) |
|
170 | cacheentry = repo.unfiltered()._filecache.get(name, None) | |
171 | if not cacheentry: |
|
171 | if not cacheentry: | |
172 | return None, False |
|
172 | return None, False | |
173 | return cacheentry.obj, True |
|
173 | return cacheentry.obj, True | |
174 |
|
174 | |||
175 |
|
175 | |||
176 | class unfilteredpropertycache(util.propertycache): |
|
176 | class unfilteredpropertycache(util.propertycache): | |
177 | """propertycache that apply to unfiltered repo only""" |
|
177 | """propertycache that apply to unfiltered repo only""" | |
178 |
|
178 | |||
179 | def __get__(self, repo, type=None): |
|
179 | def __get__(self, repo, type=None): | |
180 | unfi = repo.unfiltered() |
|
180 | unfi = repo.unfiltered() | |
181 | if unfi is repo: |
|
181 | if unfi is repo: | |
182 | return super(unfilteredpropertycache, self).__get__(unfi) |
|
182 | return super(unfilteredpropertycache, self).__get__(unfi) | |
183 | return getattr(unfi, self.name) |
|
183 | return getattr(unfi, self.name) | |
184 |
|
184 | |||
185 |
|
185 | |||
186 | class filteredpropertycache(util.propertycache): |
|
186 | class filteredpropertycache(util.propertycache): | |
187 | """propertycache that must take filtering in account""" |
|
187 | """propertycache that must take filtering in account""" | |
188 |
|
188 | |||
189 | def cachevalue(self, obj, value): |
|
189 | def cachevalue(self, obj, value): | |
190 | object.__setattr__(obj, self.name, value) |
|
190 | object.__setattr__(obj, self.name, value) | |
191 |
|
191 | |||
192 |
|
192 | |||
193 | def hasunfilteredcache(repo, name): |
|
193 | def hasunfilteredcache(repo, name): | |
194 | """check if a repo has an unfilteredpropertycache value for <name>""" |
|
194 | """check if a repo has an unfilteredpropertycache value for <name>""" | |
195 | return name in vars(repo.unfiltered()) |
|
195 | return name in vars(repo.unfiltered()) | |
196 |
|
196 | |||
197 |
|
197 | |||
198 | def unfilteredmethod(orig): |
|
198 | def unfilteredmethod(orig): | |
199 | """decorate method that always need to be run on unfiltered version""" |
|
199 | """decorate method that always need to be run on unfiltered version""" | |
200 |
|
200 | |||
201 | @functools.wraps(orig) |
|
201 | @functools.wraps(orig) | |
202 | def wrapper(repo, *args, **kwargs): |
|
202 | def wrapper(repo, *args, **kwargs): | |
203 | return orig(repo.unfiltered(), *args, **kwargs) |
|
203 | return orig(repo.unfiltered(), *args, **kwargs) | |
204 |
|
204 | |||
205 | return wrapper |
|
205 | return wrapper | |
206 |
|
206 | |||
207 |
|
207 | |||
208 | moderncaps = { |
|
208 | moderncaps = { | |
209 | b'lookup', |
|
209 | b'lookup', | |
210 | b'branchmap', |
|
210 | b'branchmap', | |
211 | b'pushkey', |
|
211 | b'pushkey', | |
212 | b'known', |
|
212 | b'known', | |
213 | b'getbundle', |
|
213 | b'getbundle', | |
214 | b'unbundle', |
|
214 | b'unbundle', | |
215 | } |
|
215 | } | |
216 | legacycaps = moderncaps.union({b'changegroupsubset'}) |
|
216 | legacycaps = moderncaps.union({b'changegroupsubset'}) | |
217 |
|
217 | |||
218 |
|
218 | |||
219 | @interfaceutil.implementer(repository.ipeercommandexecutor) |
|
219 | @interfaceutil.implementer(repository.ipeercommandexecutor) | |
220 | class localcommandexecutor(object): |
|
220 | class localcommandexecutor(object): | |
221 | def __init__(self, peer): |
|
221 | def __init__(self, peer): | |
222 | self._peer = peer |
|
222 | self._peer = peer | |
223 | self._sent = False |
|
223 | self._sent = False | |
224 | self._closed = False |
|
224 | self._closed = False | |
225 |
|
225 | |||
226 | def __enter__(self): |
|
226 | def __enter__(self): | |
227 | return self |
|
227 | return self | |
228 |
|
228 | |||
229 | def __exit__(self, exctype, excvalue, exctb): |
|
229 | def __exit__(self, exctype, excvalue, exctb): | |
230 | self.close() |
|
230 | self.close() | |
231 |
|
231 | |||
232 | def callcommand(self, command, args): |
|
232 | def callcommand(self, command, args): | |
233 | if self._sent: |
|
233 | if self._sent: | |
234 | raise error.ProgrammingError( |
|
234 | raise error.ProgrammingError( | |
235 | b'callcommand() cannot be used after sendcommands()' |
|
235 | b'callcommand() cannot be used after sendcommands()' | |
236 | ) |
|
236 | ) | |
237 |
|
237 | |||
238 | if self._closed: |
|
238 | if self._closed: | |
239 | raise error.ProgrammingError( |
|
239 | raise error.ProgrammingError( | |
240 | b'callcommand() cannot be used after close()' |
|
240 | b'callcommand() cannot be used after close()' | |
241 | ) |
|
241 | ) | |
242 |
|
242 | |||
243 | # We don't need to support anything fancy. Just call the named |
|
243 | # We don't need to support anything fancy. Just call the named | |
244 | # method on the peer and return a resolved future. |
|
244 | # method on the peer and return a resolved future. | |
245 | fn = getattr(self._peer, pycompat.sysstr(command)) |
|
245 | fn = getattr(self._peer, pycompat.sysstr(command)) | |
246 |
|
246 | |||
247 | f = pycompat.futures.Future() |
|
247 | f = pycompat.futures.Future() | |
248 |
|
248 | |||
249 | try: |
|
249 | try: | |
250 | result = fn(**pycompat.strkwargs(args)) |
|
250 | result = fn(**pycompat.strkwargs(args)) | |
251 | except Exception: |
|
251 | except Exception: | |
252 | pycompat.future_set_exception_info(f, sys.exc_info()[1:]) |
|
252 | pycompat.future_set_exception_info(f, sys.exc_info()[1:]) | |
253 | else: |
|
253 | else: | |
254 | f.set_result(result) |
|
254 | f.set_result(result) | |
255 |
|
255 | |||
256 | return f |
|
256 | return f | |
257 |
|
257 | |||
258 | def sendcommands(self): |
|
258 | def sendcommands(self): | |
259 | self._sent = True |
|
259 | self._sent = True | |
260 |
|
260 | |||
261 | def close(self): |
|
261 | def close(self): | |
262 | self._closed = True |
|
262 | self._closed = True | |
263 |
|
263 | |||
264 |
|
264 | |||
265 | @interfaceutil.implementer(repository.ipeercommands) |
|
265 | @interfaceutil.implementer(repository.ipeercommands) | |
266 | class localpeer(repository.peer): |
|
266 | class localpeer(repository.peer): | |
267 | '''peer for a local repo; reflects only the most recent API''' |
|
267 | '''peer for a local repo; reflects only the most recent API''' | |
268 |
|
268 | |||
269 | def __init__(self, repo, caps=None): |
|
269 | def __init__(self, repo, caps=None): | |
270 | super(localpeer, self).__init__() |
|
270 | super(localpeer, self).__init__() | |
271 |
|
271 | |||
272 | if caps is None: |
|
272 | if caps is None: | |
273 | caps = moderncaps.copy() |
|
273 | caps = moderncaps.copy() | |
274 | self._repo = repo.filtered(b'served') |
|
274 | self._repo = repo.filtered(b'served') | |
275 | self.ui = repo.ui |
|
275 | self.ui = repo.ui | |
276 | self._caps = repo._restrictcapabilities(caps) |
|
276 | self._caps = repo._restrictcapabilities(caps) | |
277 |
|
277 | |||
278 | # Begin of _basepeer interface. |
|
278 | # Begin of _basepeer interface. | |
279 |
|
279 | |||
280 | def url(self): |
|
280 | def url(self): | |
281 | return self._repo.url() |
|
281 | return self._repo.url() | |
282 |
|
282 | |||
283 | def local(self): |
|
283 | def local(self): | |
284 | return self._repo |
|
284 | return self._repo | |
285 |
|
285 | |||
286 | def peer(self): |
|
286 | def peer(self): | |
287 | return self |
|
287 | return self | |
288 |
|
288 | |||
289 | def canpush(self): |
|
289 | def canpush(self): | |
290 | return True |
|
290 | return True | |
291 |
|
291 | |||
292 | def close(self): |
|
292 | def close(self): | |
293 | self._repo.close() |
|
293 | self._repo.close() | |
294 |
|
294 | |||
295 | # End of _basepeer interface. |
|
295 | # End of _basepeer interface. | |
296 |
|
296 | |||
297 | # Begin of _basewirecommands interface. |
|
297 | # Begin of _basewirecommands interface. | |
298 |
|
298 | |||
299 | def branchmap(self): |
|
299 | def branchmap(self): | |
300 | return self._repo.branchmap() |
|
300 | return self._repo.branchmap() | |
301 |
|
301 | |||
302 | def capabilities(self): |
|
302 | def capabilities(self): | |
303 | return self._caps |
|
303 | return self._caps | |
304 |
|
304 | |||
305 | def clonebundles(self): |
|
305 | def clonebundles(self): | |
306 | return self._repo.tryread(bundlecaches.CB_MANIFEST_FILE) |
|
306 | return self._repo.tryread(bundlecaches.CB_MANIFEST_FILE) | |
307 |
|
307 | |||
308 | def debugwireargs(self, one, two, three=None, four=None, five=None): |
|
308 | def debugwireargs(self, one, two, three=None, four=None, five=None): | |
309 | """Used to test argument passing over the wire""" |
|
309 | """Used to test argument passing over the wire""" | |
310 | return b"%s %s %s %s %s" % ( |
|
310 | return b"%s %s %s %s %s" % ( | |
311 | one, |
|
311 | one, | |
312 | two, |
|
312 | two, | |
313 | pycompat.bytestr(three), |
|
313 | pycompat.bytestr(three), | |
314 | pycompat.bytestr(four), |
|
314 | pycompat.bytestr(four), | |
315 | pycompat.bytestr(five), |
|
315 | pycompat.bytestr(five), | |
316 | ) |
|
316 | ) | |
317 |
|
317 | |||
318 | def getbundle( |
|
318 | def getbundle( | |
319 | self, source, heads=None, common=None, bundlecaps=None, **kwargs |
|
319 | self, source, heads=None, common=None, bundlecaps=None, **kwargs | |
320 | ): |
|
320 | ): | |
321 | chunks = exchange.getbundlechunks( |
|
321 | chunks = exchange.getbundlechunks( | |
322 | self._repo, |
|
322 | self._repo, | |
323 | source, |
|
323 | source, | |
324 | heads=heads, |
|
324 | heads=heads, | |
325 | common=common, |
|
325 | common=common, | |
326 | bundlecaps=bundlecaps, |
|
326 | bundlecaps=bundlecaps, | |
327 | **kwargs |
|
327 | **kwargs | |
328 | )[1] |
|
328 | )[1] | |
329 | cb = util.chunkbuffer(chunks) |
|
329 | cb = util.chunkbuffer(chunks) | |
330 |
|
330 | |||
331 | if exchange.bundle2requested(bundlecaps): |
|
331 | if exchange.bundle2requested(bundlecaps): | |
332 | # When requesting a bundle2, getbundle returns a stream to make the |
|
332 | # When requesting a bundle2, getbundle returns a stream to make the | |
333 | # wire level function happier. We need to build a proper object |
|
333 | # wire level function happier. We need to build a proper object | |
334 | # from it in local peer. |
|
334 | # from it in local peer. | |
335 | return bundle2.getunbundler(self.ui, cb) |
|
335 | return bundle2.getunbundler(self.ui, cb) | |
336 | else: |
|
336 | else: | |
337 | return changegroup.getunbundler(b'01', cb, None) |
|
337 | return changegroup.getunbundler(b'01', cb, None) | |
338 |
|
338 | |||
339 | def heads(self): |
|
339 | def heads(self): | |
340 | return self._repo.heads() |
|
340 | return self._repo.heads() | |
341 |
|
341 | |||
342 | def known(self, nodes): |
|
342 | def known(self, nodes): | |
343 | return self._repo.known(nodes) |
|
343 | return self._repo.known(nodes) | |
344 |
|
344 | |||
345 | def listkeys(self, namespace): |
|
345 | def listkeys(self, namespace): | |
346 | return self._repo.listkeys(namespace) |
|
346 | return self._repo.listkeys(namespace) | |
347 |
|
347 | |||
348 | def lookup(self, key): |
|
348 | def lookup(self, key): | |
349 | return self._repo.lookup(key) |
|
349 | return self._repo.lookup(key) | |
350 |
|
350 | |||
351 | def pushkey(self, namespace, key, old, new): |
|
351 | def pushkey(self, namespace, key, old, new): | |
352 | return self._repo.pushkey(namespace, key, old, new) |
|
352 | return self._repo.pushkey(namespace, key, old, new) | |
353 |
|
353 | |||
354 | def stream_out(self): |
|
354 | def stream_out(self): | |
355 | raise error.Abort(_(b'cannot perform stream clone against local peer')) |
|
355 | raise error.Abort(_(b'cannot perform stream clone against local peer')) | |
356 |
|
356 | |||
357 | def unbundle(self, bundle, heads, url): |
|
357 | def unbundle(self, bundle, heads, url): | |
358 | """apply a bundle on a repo |
|
358 | """apply a bundle on a repo | |
359 |
|
359 | |||
360 | This function handles the repo locking itself.""" |
|
360 | This function handles the repo locking itself.""" | |
361 | try: |
|
361 | try: | |
362 | try: |
|
362 | try: | |
363 | bundle = exchange.readbundle(self.ui, bundle, None) |
|
363 | bundle = exchange.readbundle(self.ui, bundle, None) | |
364 | ret = exchange.unbundle(self._repo, bundle, heads, b'push', url) |
|
364 | ret = exchange.unbundle(self._repo, bundle, heads, b'push', url) | |
365 | if util.safehasattr(ret, b'getchunks'): |
|
365 | if util.safehasattr(ret, b'getchunks'): | |
366 | # This is a bundle20 object, turn it into an unbundler. |
|
366 | # This is a bundle20 object, turn it into an unbundler. | |
367 | # This little dance should be dropped eventually when the |
|
367 | # This little dance should be dropped eventually when the | |
368 | # API is finally improved. |
|
368 | # API is finally improved. | |
369 | stream = util.chunkbuffer(ret.getchunks()) |
|
369 | stream = util.chunkbuffer(ret.getchunks()) | |
370 | ret = bundle2.getunbundler(self.ui, stream) |
|
370 | ret = bundle2.getunbundler(self.ui, stream) | |
371 | return ret |
|
371 | return ret | |
372 | except Exception as exc: |
|
372 | except Exception as exc: | |
373 | # If the exception contains output salvaged from a bundle2 |
|
373 | # If the exception contains output salvaged from a bundle2 | |
374 | # reply, we need to make sure it is printed before continuing |
|
374 | # reply, we need to make sure it is printed before continuing | |
375 | # to fail. So we build a bundle2 with such output and consume |
|
375 | # to fail. So we build a bundle2 with such output and consume | |
376 | # it directly. |
|
376 | # it directly. | |
377 | # |
|
377 | # | |
378 | # This is not very elegant but allows a "simple" solution for |
|
378 | # This is not very elegant but allows a "simple" solution for | |
379 | # issue4594 |
|
379 | # issue4594 | |
380 | output = getattr(exc, '_bundle2salvagedoutput', ()) |
|
380 | output = getattr(exc, '_bundle2salvagedoutput', ()) | |
381 | if output: |
|
381 | if output: | |
382 | bundler = bundle2.bundle20(self._repo.ui) |
|
382 | bundler = bundle2.bundle20(self._repo.ui) | |
383 | for out in output: |
|
383 | for out in output: | |
384 | bundler.addpart(out) |
|
384 | bundler.addpart(out) | |
385 | stream = util.chunkbuffer(bundler.getchunks()) |
|
385 | stream = util.chunkbuffer(bundler.getchunks()) | |
386 | b = bundle2.getunbundler(self.ui, stream) |
|
386 | b = bundle2.getunbundler(self.ui, stream) | |
387 | bundle2.processbundle(self._repo, b) |
|
387 | bundle2.processbundle(self._repo, b) | |
388 | raise |
|
388 | raise | |
389 | except error.PushRaced as exc: |
|
389 | except error.PushRaced as exc: | |
390 | raise error.ResponseError( |
|
390 | raise error.ResponseError( | |
391 | _(b'push failed:'), stringutil.forcebytestr(exc) |
|
391 | _(b'push failed:'), stringutil.forcebytestr(exc) | |
392 | ) |
|
392 | ) | |
393 |
|
393 | |||
394 | # End of _basewirecommands interface. |
|
394 | # End of _basewirecommands interface. | |
395 |
|
395 | |||
396 | # Begin of peer interface. |
|
396 | # Begin of peer interface. | |
397 |
|
397 | |||
398 | def commandexecutor(self): |
|
398 | def commandexecutor(self): | |
399 | return localcommandexecutor(self) |
|
399 | return localcommandexecutor(self) | |
400 |
|
400 | |||
401 | # End of peer interface. |
|
401 | # End of peer interface. | |
402 |
|
402 | |||
403 |
|
403 | |||
404 | @interfaceutil.implementer(repository.ipeerlegacycommands) |
|
404 | @interfaceutil.implementer(repository.ipeerlegacycommands) | |
405 | class locallegacypeer(localpeer): |
|
405 | class locallegacypeer(localpeer): | |
406 | """peer extension which implements legacy methods too; used for tests with |
|
406 | """peer extension which implements legacy methods too; used for tests with | |
407 | restricted capabilities""" |
|
407 | restricted capabilities""" | |
408 |
|
408 | |||
409 | def __init__(self, repo): |
|
409 | def __init__(self, repo): | |
410 | super(locallegacypeer, self).__init__(repo, caps=legacycaps) |
|
410 | super(locallegacypeer, self).__init__(repo, caps=legacycaps) | |
411 |
|
411 | |||
412 | # Begin of baselegacywirecommands interface. |
|
412 | # Begin of baselegacywirecommands interface. | |
413 |
|
413 | |||
414 | def between(self, pairs): |
|
414 | def between(self, pairs): | |
415 | return self._repo.between(pairs) |
|
415 | return self._repo.between(pairs) | |
416 |
|
416 | |||
417 | def branches(self, nodes): |
|
417 | def branches(self, nodes): | |
418 | return self._repo.branches(nodes) |
|
418 | return self._repo.branches(nodes) | |
419 |
|
419 | |||
420 | def changegroup(self, nodes, source): |
|
420 | def changegroup(self, nodes, source): | |
421 | outgoing = discovery.outgoing( |
|
421 | outgoing = discovery.outgoing( | |
422 | self._repo, missingroots=nodes, ancestorsof=self._repo.heads() |
|
422 | self._repo, missingroots=nodes, ancestorsof=self._repo.heads() | |
423 | ) |
|
423 | ) | |
424 | return changegroup.makechangegroup(self._repo, outgoing, b'01', source) |
|
424 | return changegroup.makechangegroup(self._repo, outgoing, b'01', source) | |
425 |
|
425 | |||
426 | def changegroupsubset(self, bases, heads, source): |
|
426 | def changegroupsubset(self, bases, heads, source): | |
427 | outgoing = discovery.outgoing( |
|
427 | outgoing = discovery.outgoing( | |
428 | self._repo, missingroots=bases, ancestorsof=heads |
|
428 | self._repo, missingroots=bases, ancestorsof=heads | |
429 | ) |
|
429 | ) | |
430 | return changegroup.makechangegroup(self._repo, outgoing, b'01', source) |
|
430 | return changegroup.makechangegroup(self._repo, outgoing, b'01', source) | |
431 |
|
431 | |||
432 | # End of baselegacywirecommands interface. |
|
432 | # End of baselegacywirecommands interface. | |
433 |
|
433 | |||
434 |
|
434 | |||
435 | # Functions receiving (ui, features) that extensions can register to impact |
|
435 | # Functions receiving (ui, features) that extensions can register to impact | |
436 | # the ability to load repositories with custom requirements. Only |
|
436 | # the ability to load repositories with custom requirements. Only | |
437 | # functions defined in loaded extensions are called. |
|
437 | # functions defined in loaded extensions are called. | |
438 | # |
|
438 | # | |
439 | # The function receives a set of requirement strings that the repository |
|
439 | # The function receives a set of requirement strings that the repository | |
440 | # is capable of opening. Functions will typically add elements to the |
|
440 | # is capable of opening. Functions will typically add elements to the | |
441 | # set to reflect that the extension knows how to handle that requirements. |
|
441 | # set to reflect that the extension knows how to handle that requirements. | |
442 | featuresetupfuncs = set() |
|
442 | featuresetupfuncs = set() | |
443 |
|
443 | |||
444 |
|
444 | |||
445 | def _getsharedvfs(hgvfs, requirements): |
|
445 | def _getsharedvfs(hgvfs, requirements): | |
446 | """returns the vfs object pointing to root of shared source |
|
446 | """returns the vfs object pointing to root of shared source | |
447 | repo for a shared repository |
|
447 | repo for a shared repository | |
448 |
|
448 | |||
449 | hgvfs is vfs pointing at .hg/ of current repo (shared one) |
|
449 | hgvfs is vfs pointing at .hg/ of current repo (shared one) | |
450 | requirements is a set of requirements of current repo (shared one) |
|
450 | requirements is a set of requirements of current repo (shared one) | |
451 | """ |
|
451 | """ | |
452 | # The ``shared`` or ``relshared`` requirements indicate the |
|
452 | # The ``shared`` or ``relshared`` requirements indicate the | |
453 | # store lives in the path contained in the ``.hg/sharedpath`` file. |
|
453 | # store lives in the path contained in the ``.hg/sharedpath`` file. | |
454 | # This is an absolute path for ``shared`` and relative to |
|
454 | # This is an absolute path for ``shared`` and relative to | |
455 | # ``.hg/`` for ``relshared``. |
|
455 | # ``.hg/`` for ``relshared``. | |
456 | sharedpath = hgvfs.read(b'sharedpath').rstrip(b'\n') |
|
456 | sharedpath = hgvfs.read(b'sharedpath').rstrip(b'\n') | |
457 | if requirementsmod.RELATIVE_SHARED_REQUIREMENT in requirements: |
|
457 | if requirementsmod.RELATIVE_SHARED_REQUIREMENT in requirements: | |
458 | sharedpath = hgvfs.join(sharedpath) |
|
458 | sharedpath = hgvfs.join(sharedpath) | |
459 |
|
459 | |||
460 | sharedvfs = vfsmod.vfs(sharedpath, realpath=True) |
|
460 | sharedvfs = vfsmod.vfs(sharedpath, realpath=True) | |
461 |
|
461 | |||
462 | if not sharedvfs.exists(): |
|
462 | if not sharedvfs.exists(): | |
463 | raise error.RepoError( |
|
463 | raise error.RepoError( | |
464 | _(b'.hg/sharedpath points to nonexistent directory %s') |
|
464 | _(b'.hg/sharedpath points to nonexistent directory %s') | |
465 | % sharedvfs.base |
|
465 | % sharedvfs.base | |
466 | ) |
|
466 | ) | |
467 | return sharedvfs |
|
467 | return sharedvfs | |
468 |
|
468 | |||
469 |
|
469 | |||
470 | def _readrequires(vfs, allowmissing): |
|
470 | def _readrequires(vfs, allowmissing): | |
471 | """reads the require file present at root of this vfs |
|
471 | """reads the require file present at root of this vfs | |
472 | and return a set of requirements |
|
472 | and return a set of requirements | |
473 |
|
473 | |||
474 | If allowmissing is True, we suppress ENOENT if raised""" |
|
474 | If allowmissing is True, we suppress ENOENT if raised""" | |
475 | # requires file contains a newline-delimited list of |
|
475 | # requires file contains a newline-delimited list of | |
476 | # features/capabilities the opener (us) must have in order to use |
|
476 | # features/capabilities the opener (us) must have in order to use | |
477 | # the repository. This file was introduced in Mercurial 0.9.2, |
|
477 | # the repository. This file was introduced in Mercurial 0.9.2, | |
478 | # which means very old repositories may not have one. We assume |
|
478 | # which means very old repositories may not have one. We assume | |
479 | # a missing file translates to no requirements. |
|
479 | # a missing file translates to no requirements. | |
480 | try: |
|
480 | try: | |
481 | requirements = set(vfs.read(b'requires').splitlines()) |
|
481 | requirements = set(vfs.read(b'requires').splitlines()) | |
482 | except IOError as e: |
|
482 | except IOError as e: | |
483 | if not (allowmissing and e.errno == errno.ENOENT): |
|
483 | if not (allowmissing and e.errno == errno.ENOENT): | |
484 | raise |
|
484 | raise | |
485 | requirements = set() |
|
485 | requirements = set() | |
486 | return requirements |
|
486 | return requirements | |
487 |
|
487 | |||
488 |
|
488 | |||
489 | def makelocalrepository(baseui, path, intents=None): |
|
489 | def makelocalrepository(baseui, path, intents=None): | |
490 | """Create a local repository object. |
|
490 | """Create a local repository object. | |
491 |
|
491 | |||
492 | Given arguments needed to construct a local repository, this function |
|
492 | Given arguments needed to construct a local repository, this function | |
493 | performs various early repository loading functionality (such as |
|
493 | performs various early repository loading functionality (such as | |
494 | reading the ``.hg/requires`` and ``.hg/hgrc`` files), validates that |
|
494 | reading the ``.hg/requires`` and ``.hg/hgrc`` files), validates that | |
495 | the repository can be opened, derives a type suitable for representing |
|
495 | the repository can be opened, derives a type suitable for representing | |
496 | that repository, and returns an instance of it. |
|
496 | that repository, and returns an instance of it. | |
497 |
|
497 | |||
498 | The returned object conforms to the ``repository.completelocalrepository`` |
|
498 | The returned object conforms to the ``repository.completelocalrepository`` | |
499 | interface. |
|
499 | interface. | |
500 |
|
500 | |||
501 | The repository type is derived by calling a series of factory functions |
|
501 | The repository type is derived by calling a series of factory functions | |
502 | for each aspect/interface of the final repository. These are defined by |
|
502 | for each aspect/interface of the final repository. These are defined by | |
503 | ``REPO_INTERFACES``. |
|
503 | ``REPO_INTERFACES``. | |
504 |
|
504 | |||
505 | Each factory function is called to produce a type implementing a specific |
|
505 | Each factory function is called to produce a type implementing a specific | |
506 | interface. The cumulative list of returned types will be combined into a |
|
506 | interface. The cumulative list of returned types will be combined into a | |
507 | new type and that type will be instantiated to represent the local |
|
507 | new type and that type will be instantiated to represent the local | |
508 | repository. |
|
508 | repository. | |
509 |
|
509 | |||
510 | The factory functions each receive various state that may be consulted |
|
510 | The factory functions each receive various state that may be consulted | |
511 | as part of deriving a type. |
|
511 | as part of deriving a type. | |
512 |
|
512 | |||
513 | Extensions should wrap these factory functions to customize repository type |
|
513 | Extensions should wrap these factory functions to customize repository type | |
514 | creation. Note that an extension's wrapped function may be called even if |
|
514 | creation. Note that an extension's wrapped function may be called even if | |
515 | that extension is not loaded for the repo being constructed. Extensions |
|
515 | that extension is not loaded for the repo being constructed. Extensions | |
516 | should check if their ``__name__`` appears in the |
|
516 | should check if their ``__name__`` appears in the | |
517 | ``extensionmodulenames`` set passed to the factory function and no-op if |
|
517 | ``extensionmodulenames`` set passed to the factory function and no-op if | |
518 | not. |
|
518 | not. | |
519 | """ |
|
519 | """ | |
520 | ui = baseui.copy() |
|
520 | ui = baseui.copy() | |
521 | # Prevent copying repo configuration. |
|
521 | # Prevent copying repo configuration. | |
522 | ui.copy = baseui.copy |
|
522 | ui.copy = baseui.copy | |
523 |
|
523 | |||
524 | # Working directory VFS rooted at repository root. |
|
524 | # Working directory VFS rooted at repository root. | |
525 | wdirvfs = vfsmod.vfs(path, expandpath=True, realpath=True) |
|
525 | wdirvfs = vfsmod.vfs(path, expandpath=True, realpath=True) | |
526 |
|
526 | |||
527 | # Main VFS for .hg/ directory. |
|
527 | # Main VFS for .hg/ directory. | |
528 | hgpath = wdirvfs.join(b'.hg') |
|
528 | hgpath = wdirvfs.join(b'.hg') | |
529 | hgvfs = vfsmod.vfs(hgpath, cacheaudited=True) |
|
529 | hgvfs = vfsmod.vfs(hgpath, cacheaudited=True) | |
530 | # Whether this repository is shared one or not |
|
530 | # Whether this repository is shared one or not | |
531 | shared = False |
|
531 | shared = False | |
532 | # If this repository is shared, vfs pointing to shared repo |
|
532 | # If this repository is shared, vfs pointing to shared repo | |
533 | sharedvfs = None |
|
533 | sharedvfs = None | |
534 |
|
534 | |||
535 | # The .hg/ path should exist and should be a directory. All other |
|
535 | # The .hg/ path should exist and should be a directory. All other | |
536 | # cases are errors. |
|
536 | # cases are errors. | |
537 | if not hgvfs.isdir(): |
|
537 | if not hgvfs.isdir(): | |
538 | try: |
|
538 | try: | |
539 | hgvfs.stat() |
|
539 | hgvfs.stat() | |
540 | except OSError as e: |
|
540 | except OSError as e: | |
541 | if e.errno != errno.ENOENT: |
|
541 | if e.errno != errno.ENOENT: | |
542 | raise |
|
542 | raise | |
543 | except ValueError as e: |
|
543 | except ValueError as e: | |
544 | # Can be raised on Python 3.8 when path is invalid. |
|
544 | # Can be raised on Python 3.8 when path is invalid. | |
545 | raise error.Abort( |
|
545 | raise error.Abort( | |
546 | _(b'invalid path %s: %s') % (path, pycompat.bytestr(e)) |
|
546 | _(b'invalid path %s: %s') % (path, pycompat.bytestr(e)) | |
547 | ) |
|
547 | ) | |
548 |
|
548 | |||
549 | raise error.RepoError(_(b'repository %s not found') % path) |
|
549 | raise error.RepoError(_(b'repository %s not found') % path) | |
550 |
|
550 | |||
551 | requirements = _readrequires(hgvfs, True) |
|
551 | requirements = _readrequires(hgvfs, True) | |
552 | shared = ( |
|
552 | shared = ( | |
553 | requirementsmod.SHARED_REQUIREMENT in requirements |
|
553 | requirementsmod.SHARED_REQUIREMENT in requirements | |
554 | or requirementsmod.RELATIVE_SHARED_REQUIREMENT in requirements |
|
554 | or requirementsmod.RELATIVE_SHARED_REQUIREMENT in requirements | |
555 | ) |
|
555 | ) | |
556 | storevfs = None |
|
556 | storevfs = None | |
557 | if shared: |
|
557 | if shared: | |
558 | # This is a shared repo |
|
558 | # This is a shared repo | |
559 | sharedvfs = _getsharedvfs(hgvfs, requirements) |
|
559 | sharedvfs = _getsharedvfs(hgvfs, requirements) | |
560 | storevfs = vfsmod.vfs(sharedvfs.join(b'store')) |
|
560 | storevfs = vfsmod.vfs(sharedvfs.join(b'store')) | |
561 | else: |
|
561 | else: | |
562 | storevfs = vfsmod.vfs(hgvfs.join(b'store')) |
|
562 | storevfs = vfsmod.vfs(hgvfs.join(b'store')) | |
563 |
|
563 | |||
564 | # if .hg/requires contains the sharesafe requirement, it means |
|
564 | # if .hg/requires contains the sharesafe requirement, it means | |
565 | # there exists a `.hg/store/requires` too and we should read it |
|
565 | # there exists a `.hg/store/requires` too and we should read it | |
566 | # NOTE: presence of SHARESAFE_REQUIREMENT imply that store requirement |
|
566 | # NOTE: presence of SHARESAFE_REQUIREMENT imply that store requirement | |
567 | # is present. We never write SHARESAFE_REQUIREMENT for a repo if store |
|
567 | # is present. We never write SHARESAFE_REQUIREMENT for a repo if store | |
568 | # is not present, refer checkrequirementscompat() for that |
|
568 | # is not present, refer checkrequirementscompat() for that | |
569 | # |
|
569 | # | |
570 | # However, if SHARESAFE_REQUIREMENT is not present, it means that the |
|
570 | # However, if SHARESAFE_REQUIREMENT is not present, it means that the | |
571 | # repository was shared the old way. We check the share source .hg/requires |
|
571 | # repository was shared the old way. We check the share source .hg/requires | |
572 | # for SHARESAFE_REQUIREMENT to detect whether the current repository needs |
|
572 | # for SHARESAFE_REQUIREMENT to detect whether the current repository needs | |
573 | # to be reshared |
|
573 | # to be reshared | |
574 | hint = _("see `hg help config.format.use-share-safe` for more information") |
|
574 | hint = _("see `hg help config.format.use-share-safe` for more information") | |
575 | if requirementsmod.SHARESAFE_REQUIREMENT in requirements: |
|
575 | if requirementsmod.SHARESAFE_REQUIREMENT in requirements: | |
576 |
|
576 | |||
577 | if ( |
|
577 | if ( | |
578 | shared |
|
578 | shared | |
579 | and requirementsmod.SHARESAFE_REQUIREMENT |
|
579 | and requirementsmod.SHARESAFE_REQUIREMENT | |
580 | not in _readrequires(sharedvfs, True) |
|
580 | not in _readrequires(sharedvfs, True) | |
581 | ): |
|
581 | ): | |
582 | mismatch_warn = ui.configbool( |
|
582 | mismatch_warn = ui.configbool( | |
583 | b'share', b'safe-mismatch.source-not-safe.warn' |
|
583 | b'share', b'safe-mismatch.source-not-safe.warn' | |
584 | ) |
|
584 | ) | |
585 | mismatch_config = ui.config( |
|
585 | mismatch_config = ui.config( | |
586 | b'share', b'safe-mismatch.source-not-safe' |
|
586 | b'share', b'safe-mismatch.source-not-safe' | |
587 | ) |
|
587 | ) | |
588 | if mismatch_config in ( |
|
588 | if mismatch_config in ( | |
589 | b'downgrade-allow', |
|
589 | b'downgrade-allow', | |
590 | b'allow', |
|
590 | b'allow', | |
591 | b'downgrade-abort', |
|
591 | b'downgrade-abort', | |
592 | ): |
|
592 | ): | |
593 | # prevent cyclic import localrepo -> upgrade -> localrepo |
|
593 | # prevent cyclic import localrepo -> upgrade -> localrepo | |
594 | from . import upgrade |
|
594 | from . import upgrade | |
595 |
|
595 | |||
596 | upgrade.downgrade_share_to_non_safe( |
|
596 | upgrade.downgrade_share_to_non_safe( | |
597 | ui, |
|
597 | ui, | |
598 | hgvfs, |
|
598 | hgvfs, | |
599 | sharedvfs, |
|
599 | sharedvfs, | |
600 | requirements, |
|
600 | requirements, | |
601 | mismatch_config, |
|
601 | mismatch_config, | |
602 | mismatch_warn, |
|
602 | mismatch_warn, | |
603 | ) |
|
603 | ) | |
604 | elif mismatch_config == b'abort': |
|
604 | elif mismatch_config == b'abort': | |
605 | raise error.Abort( |
|
605 | raise error.Abort( | |
606 | _(b"share source does not support share-safe requirement"), |
|
606 | _(b"share source does not support share-safe requirement"), | |
607 | hint=hint, |
|
607 | hint=hint, | |
608 | ) |
|
608 | ) | |
609 | else: |
|
609 | else: | |
610 | raise error.Abort( |
|
610 | raise error.Abort( | |
611 | _( |
|
611 | _( | |
612 | b"share-safe mismatch with source.\nUnrecognized" |
|
612 | b"share-safe mismatch with source.\nUnrecognized" | |
613 | b" value '%s' of `share.safe-mismatch.source-not-safe`" |
|
613 | b" value '%s' of `share.safe-mismatch.source-not-safe`" | |
614 | b" set." |
|
614 | b" set." | |
615 | ) |
|
615 | ) | |
616 | % mismatch_config, |
|
616 | % mismatch_config, | |
617 | hint=hint, |
|
617 | hint=hint, | |
618 | ) |
|
618 | ) | |
619 | else: |
|
619 | else: | |
620 | requirements |= _readrequires(storevfs, False) |
|
620 | requirements |= _readrequires(storevfs, False) | |
621 | elif shared: |
|
621 | elif shared: | |
622 | sourcerequires = _readrequires(sharedvfs, False) |
|
622 | sourcerequires = _readrequires(sharedvfs, False) | |
623 | if requirementsmod.SHARESAFE_REQUIREMENT in sourcerequires: |
|
623 | if requirementsmod.SHARESAFE_REQUIREMENT in sourcerequires: | |
624 | mismatch_config = ui.config(b'share', b'safe-mismatch.source-safe') |
|
624 | mismatch_config = ui.config(b'share', b'safe-mismatch.source-safe') | |
625 | mismatch_warn = ui.configbool( |
|
625 | mismatch_warn = ui.configbool( | |
626 | b'share', b'safe-mismatch.source-safe.warn' |
|
626 | b'share', b'safe-mismatch.source-safe.warn' | |
627 | ) |
|
627 | ) | |
628 | if mismatch_config in ( |
|
628 | if mismatch_config in ( | |
629 | b'upgrade-allow', |
|
629 | b'upgrade-allow', | |
630 | b'allow', |
|
630 | b'allow', | |
631 | b'upgrade-abort', |
|
631 | b'upgrade-abort', | |
632 | ): |
|
632 | ): | |
633 | # prevent cyclic import localrepo -> upgrade -> localrepo |
|
633 | # prevent cyclic import localrepo -> upgrade -> localrepo | |
634 | from . import upgrade |
|
634 | from . import upgrade | |
635 |
|
635 | |||
636 | upgrade.upgrade_share_to_safe( |
|
636 | upgrade.upgrade_share_to_safe( | |
637 | ui, |
|
637 | ui, | |
638 | hgvfs, |
|
638 | hgvfs, | |
639 | storevfs, |
|
639 | storevfs, | |
640 | requirements, |
|
640 | requirements, | |
641 | mismatch_config, |
|
641 | mismatch_config, | |
642 | mismatch_warn, |
|
642 | mismatch_warn, | |
643 | ) |
|
643 | ) | |
644 | elif mismatch_config == b'abort': |
|
644 | elif mismatch_config == b'abort': | |
645 | raise error.Abort( |
|
645 | raise error.Abort( | |
646 | _( |
|
646 | _( | |
647 | b'version mismatch: source uses share-safe' |
|
647 | b'version mismatch: source uses share-safe' | |
648 | b' functionality while the current share does not' |
|
648 | b' functionality while the current share does not' | |
649 | ), |
|
649 | ), | |
650 | hint=hint, |
|
650 | hint=hint, | |
651 | ) |
|
651 | ) | |
652 | else: |
|
652 | else: | |
653 | raise error.Abort( |
|
653 | raise error.Abort( | |
654 | _( |
|
654 | _( | |
655 | b"share-safe mismatch with source.\nUnrecognized" |
|
655 | b"share-safe mismatch with source.\nUnrecognized" | |
656 | b" value '%s' of `share.safe-mismatch.source-safe` set." |
|
656 | b" value '%s' of `share.safe-mismatch.source-safe` set." | |
657 | ) |
|
657 | ) | |
658 | % mismatch_config, |
|
658 | % mismatch_config, | |
659 | hint=hint, |
|
659 | hint=hint, | |
660 | ) |
|
660 | ) | |
661 |
|
661 | |||
662 | # The .hg/hgrc file may load extensions or contain config options |
|
662 | # The .hg/hgrc file may load extensions or contain config options | |
663 | # that influence repository construction. Attempt to load it and |
|
663 | # that influence repository construction. Attempt to load it and | |
664 | # process any new extensions that it may have pulled in. |
|
664 | # process any new extensions that it may have pulled in. | |
665 | if loadhgrc(ui, wdirvfs, hgvfs, requirements, sharedvfs): |
|
665 | if loadhgrc(ui, wdirvfs, hgvfs, requirements, sharedvfs): | |
666 | afterhgrcload(ui, wdirvfs, hgvfs, requirements) |
|
666 | afterhgrcload(ui, wdirvfs, hgvfs, requirements) | |
667 | extensions.loadall(ui) |
|
667 | extensions.loadall(ui) | |
668 | extensions.populateui(ui) |
|
668 | extensions.populateui(ui) | |
669 |
|
669 | |||
670 | # Set of module names of extensions loaded for this repository. |
|
670 | # Set of module names of extensions loaded for this repository. | |
671 | extensionmodulenames = {m.__name__ for n, m in extensions.extensions(ui)} |
|
671 | extensionmodulenames = {m.__name__ for n, m in extensions.extensions(ui)} | |
672 |
|
672 | |||
673 | supportedrequirements = gathersupportedrequirements(ui) |
|
673 | supportedrequirements = gathersupportedrequirements(ui) | |
674 |
|
674 | |||
675 | # We first validate the requirements are known. |
|
675 | # We first validate the requirements are known. | |
676 | ensurerequirementsrecognized(requirements, supportedrequirements) |
|
676 | ensurerequirementsrecognized(requirements, supportedrequirements) | |
677 |
|
677 | |||
678 | # Then we validate that the known set is reasonable to use together. |
|
678 | # Then we validate that the known set is reasonable to use together. | |
679 | ensurerequirementscompatible(ui, requirements) |
|
679 | ensurerequirementscompatible(ui, requirements) | |
680 |
|
680 | |||
681 | # TODO there are unhandled edge cases related to opening repositories with |
|
681 | # TODO there are unhandled edge cases related to opening repositories with | |
682 | # shared storage. If storage is shared, we should also test for requirements |
|
682 | # shared storage. If storage is shared, we should also test for requirements | |
683 | # compatibility in the pointed-to repo. This entails loading the .hg/hgrc in |
|
683 | # compatibility in the pointed-to repo. This entails loading the .hg/hgrc in | |
684 | # that repo, as that repo may load extensions needed to open it. This is a |
|
684 | # that repo, as that repo may load extensions needed to open it. This is a | |
685 | # bit complicated because we don't want the other hgrc to overwrite settings |
|
685 | # bit complicated because we don't want the other hgrc to overwrite settings | |
686 | # in this hgrc. |
|
686 | # in this hgrc. | |
687 | # |
|
687 | # | |
688 | # This bug is somewhat mitigated by the fact that we copy the .hg/requires |
|
688 | # This bug is somewhat mitigated by the fact that we copy the .hg/requires | |
689 | # file when sharing repos. But if a requirement is added after the share is |
|
689 | # file when sharing repos. But if a requirement is added after the share is | |
690 | # performed, thereby introducing a new requirement for the opener, we may |
|
690 | # performed, thereby introducing a new requirement for the opener, we may | |
691 | # will not see that and could encounter a run-time error interacting with |
|
691 | # will not see that and could encounter a run-time error interacting with | |
692 | # that shared store since it has an unknown-to-us requirement. |
|
692 | # that shared store since it has an unknown-to-us requirement. | |
693 |
|
693 | |||
694 | # At this point, we know we should be capable of opening the repository. |
|
694 | # At this point, we know we should be capable of opening the repository. | |
695 | # Now get on with doing that. |
|
695 | # Now get on with doing that. | |
696 |
|
696 | |||
697 | features = set() |
|
697 | features = set() | |
698 |
|
698 | |||
699 | # The "store" part of the repository holds versioned data. How it is |
|
699 | # The "store" part of the repository holds versioned data. How it is | |
700 | # accessed is determined by various requirements. If `shared` or |
|
700 | # accessed is determined by various requirements. If `shared` or | |
701 | # `relshared` requirements are present, this indicates current repository |
|
701 | # `relshared` requirements are present, this indicates current repository | |
702 | # is a share and store exists in path mentioned in `.hg/sharedpath` |
|
702 | # is a share and store exists in path mentioned in `.hg/sharedpath` | |
703 | if shared: |
|
703 | if shared: | |
704 | storebasepath = sharedvfs.base |
|
704 | storebasepath = sharedvfs.base | |
705 | cachepath = sharedvfs.join(b'cache') |
|
705 | cachepath = sharedvfs.join(b'cache') | |
706 | features.add(repository.REPO_FEATURE_SHARED_STORAGE) |
|
706 | features.add(repository.REPO_FEATURE_SHARED_STORAGE) | |
707 | else: |
|
707 | else: | |
708 | storebasepath = hgvfs.base |
|
708 | storebasepath = hgvfs.base | |
709 | cachepath = hgvfs.join(b'cache') |
|
709 | cachepath = hgvfs.join(b'cache') | |
710 | wcachepath = hgvfs.join(b'wcache') |
|
710 | wcachepath = hgvfs.join(b'wcache') | |
711 |
|
711 | |||
712 | # The store has changed over time and the exact layout is dictated by |
|
712 | # The store has changed over time and the exact layout is dictated by | |
713 | # requirements. The store interface abstracts differences across all |
|
713 | # requirements. The store interface abstracts differences across all | |
714 | # of them. |
|
714 | # of them. | |
715 | store = makestore( |
|
715 | store = makestore( | |
716 | requirements, |
|
716 | requirements, | |
717 | storebasepath, |
|
717 | storebasepath, | |
718 | lambda base: vfsmod.vfs(base, cacheaudited=True), |
|
718 | lambda base: vfsmod.vfs(base, cacheaudited=True), | |
719 | ) |
|
719 | ) | |
720 | hgvfs.createmode = store.createmode |
|
720 | hgvfs.createmode = store.createmode | |
721 |
|
721 | |||
722 | storevfs = store.vfs |
|
722 | storevfs = store.vfs | |
723 | storevfs.options = resolvestorevfsoptions(ui, requirements, features) |
|
723 | storevfs.options = resolvestorevfsoptions(ui, requirements, features) | |
724 |
|
724 | |||
725 | # The cache vfs is used to manage cache files. |
|
725 | # The cache vfs is used to manage cache files. | |
726 | cachevfs = vfsmod.vfs(cachepath, cacheaudited=True) |
|
726 | cachevfs = vfsmod.vfs(cachepath, cacheaudited=True) | |
727 | cachevfs.createmode = store.createmode |
|
727 | cachevfs.createmode = store.createmode | |
728 | # The cache vfs is used to manage cache files related to the working copy |
|
728 | # The cache vfs is used to manage cache files related to the working copy | |
729 | wcachevfs = vfsmod.vfs(wcachepath, cacheaudited=True) |
|
729 | wcachevfs = vfsmod.vfs(wcachepath, cacheaudited=True) | |
730 | wcachevfs.createmode = store.createmode |
|
730 | wcachevfs.createmode = store.createmode | |
731 |
|
731 | |||
732 | # Now resolve the type for the repository object. We do this by repeatedly |
|
732 | # Now resolve the type for the repository object. We do this by repeatedly | |
733 | # calling a factory function to produces types for specific aspects of the |
|
733 | # calling a factory function to produces types for specific aspects of the | |
734 | # repo's operation. The aggregate returned types are used as base classes |
|
734 | # repo's operation. The aggregate returned types are used as base classes | |
735 | # for a dynamically-derived type, which will represent our new repository. |
|
735 | # for a dynamically-derived type, which will represent our new repository. | |
736 |
|
736 | |||
737 | bases = [] |
|
737 | bases = [] | |
738 | extrastate = {} |
|
738 | extrastate = {} | |
739 |
|
739 | |||
740 | for iface, fn in REPO_INTERFACES: |
|
740 | for iface, fn in REPO_INTERFACES: | |
741 | # We pass all potentially useful state to give extensions tons of |
|
741 | # We pass all potentially useful state to give extensions tons of | |
742 | # flexibility. |
|
742 | # flexibility. | |
743 | typ = fn()( |
|
743 | typ = fn()( | |
744 | ui=ui, |
|
744 | ui=ui, | |
745 | intents=intents, |
|
745 | intents=intents, | |
746 | requirements=requirements, |
|
746 | requirements=requirements, | |
747 | features=features, |
|
747 | features=features, | |
748 | wdirvfs=wdirvfs, |
|
748 | wdirvfs=wdirvfs, | |
749 | hgvfs=hgvfs, |
|
749 | hgvfs=hgvfs, | |
750 | store=store, |
|
750 | store=store, | |
751 | storevfs=storevfs, |
|
751 | storevfs=storevfs, | |
752 | storeoptions=storevfs.options, |
|
752 | storeoptions=storevfs.options, | |
753 | cachevfs=cachevfs, |
|
753 | cachevfs=cachevfs, | |
754 | wcachevfs=wcachevfs, |
|
754 | wcachevfs=wcachevfs, | |
755 | extensionmodulenames=extensionmodulenames, |
|
755 | extensionmodulenames=extensionmodulenames, | |
756 | extrastate=extrastate, |
|
756 | extrastate=extrastate, | |
757 | baseclasses=bases, |
|
757 | baseclasses=bases, | |
758 | ) |
|
758 | ) | |
759 |
|
759 | |||
760 | if not isinstance(typ, type): |
|
760 | if not isinstance(typ, type): | |
761 | raise error.ProgrammingError( |
|
761 | raise error.ProgrammingError( | |
762 | b'unable to construct type for %s' % iface |
|
762 | b'unable to construct type for %s' % iface | |
763 | ) |
|
763 | ) | |
764 |
|
764 | |||
765 | bases.append(typ) |
|
765 | bases.append(typ) | |
766 |
|
766 | |||
767 | # type() allows you to use characters in type names that wouldn't be |
|
767 | # type() allows you to use characters in type names that wouldn't be | |
768 | # recognized as Python symbols in source code. We abuse that to add |
|
768 | # recognized as Python symbols in source code. We abuse that to add | |
769 | # rich information about our constructed repo. |
|
769 | # rich information about our constructed repo. | |
770 | name = pycompat.sysstr( |
|
770 | name = pycompat.sysstr( | |
771 | b'derivedrepo:%s<%s>' % (wdirvfs.base, b','.join(sorted(requirements))) |
|
771 | b'derivedrepo:%s<%s>' % (wdirvfs.base, b','.join(sorted(requirements))) | |
772 | ) |
|
772 | ) | |
773 |
|
773 | |||
774 | cls = type(name, tuple(bases), {}) |
|
774 | cls = type(name, tuple(bases), {}) | |
775 |
|
775 | |||
776 | return cls( |
|
776 | return cls( | |
777 | baseui=baseui, |
|
777 | baseui=baseui, | |
778 | ui=ui, |
|
778 | ui=ui, | |
779 | origroot=path, |
|
779 | origroot=path, | |
780 | wdirvfs=wdirvfs, |
|
780 | wdirvfs=wdirvfs, | |
781 | hgvfs=hgvfs, |
|
781 | hgvfs=hgvfs, | |
782 | requirements=requirements, |
|
782 | requirements=requirements, | |
783 | supportedrequirements=supportedrequirements, |
|
783 | supportedrequirements=supportedrequirements, | |
784 | sharedpath=storebasepath, |
|
784 | sharedpath=storebasepath, | |
785 | store=store, |
|
785 | store=store, | |
786 | cachevfs=cachevfs, |
|
786 | cachevfs=cachevfs, | |
787 | wcachevfs=wcachevfs, |
|
787 | wcachevfs=wcachevfs, | |
788 | features=features, |
|
788 | features=features, | |
789 | intents=intents, |
|
789 | intents=intents, | |
790 | ) |
|
790 | ) | |
791 |
|
791 | |||
792 |
|
792 | |||
793 | def loadhgrc(ui, wdirvfs, hgvfs, requirements, sharedvfs=None): |
|
793 | def loadhgrc(ui, wdirvfs, hgvfs, requirements, sharedvfs=None): | |
794 | """Load hgrc files/content into a ui instance. |
|
794 | """Load hgrc files/content into a ui instance. | |
795 |
|
795 | |||
796 | This is called during repository opening to load any additional |
|
796 | This is called during repository opening to load any additional | |
797 | config files or settings relevant to the current repository. |
|
797 | config files or settings relevant to the current repository. | |
798 |
|
798 | |||
799 | Returns a bool indicating whether any additional configs were loaded. |
|
799 | Returns a bool indicating whether any additional configs were loaded. | |
800 |
|
800 | |||
801 | Extensions should monkeypatch this function to modify how per-repo |
|
801 | Extensions should monkeypatch this function to modify how per-repo | |
802 | configs are loaded. For example, an extension may wish to pull in |
|
802 | configs are loaded. For example, an extension may wish to pull in | |
803 | configs from alternate files or sources. |
|
803 | configs from alternate files or sources. | |
804 |
|
804 | |||
805 | sharedvfs is vfs object pointing to source repo if the current one is a |
|
805 | sharedvfs is vfs object pointing to source repo if the current one is a | |
806 | shared one |
|
806 | shared one | |
807 | """ |
|
807 | """ | |
808 | if not rcutil.use_repo_hgrc(): |
|
808 | if not rcutil.use_repo_hgrc(): | |
809 | return False |
|
809 | return False | |
810 |
|
810 | |||
811 | ret = False |
|
811 | ret = False | |
812 | # first load config from shared source if we has to |
|
812 | # first load config from shared source if we has to | |
813 | if requirementsmod.SHARESAFE_REQUIREMENT in requirements and sharedvfs: |
|
813 | if requirementsmod.SHARESAFE_REQUIREMENT in requirements and sharedvfs: | |
814 | try: |
|
814 | try: | |
815 | ui.readconfig(sharedvfs.join(b'hgrc'), root=sharedvfs.base) |
|
815 | ui.readconfig(sharedvfs.join(b'hgrc'), root=sharedvfs.base) | |
816 | ret = True |
|
816 | ret = True | |
817 | except IOError: |
|
817 | except IOError: | |
818 | pass |
|
818 | pass | |
819 |
|
819 | |||
820 | try: |
|
820 | try: | |
821 | ui.readconfig(hgvfs.join(b'hgrc'), root=wdirvfs.base) |
|
821 | ui.readconfig(hgvfs.join(b'hgrc'), root=wdirvfs.base) | |
822 | ret = True |
|
822 | ret = True | |
823 | except IOError: |
|
823 | except IOError: | |
824 | pass |
|
824 | pass | |
825 |
|
825 | |||
826 | try: |
|
826 | try: | |
827 | ui.readconfig(hgvfs.join(b'hgrc-not-shared'), root=wdirvfs.base) |
|
827 | ui.readconfig(hgvfs.join(b'hgrc-not-shared'), root=wdirvfs.base) | |
828 | ret = True |
|
828 | ret = True | |
829 | except IOError: |
|
829 | except IOError: | |
830 | pass |
|
830 | pass | |
831 |
|
831 | |||
832 | return ret |
|
832 | return ret | |
833 |
|
833 | |||
834 |
|
834 | |||
835 | def afterhgrcload(ui, wdirvfs, hgvfs, requirements): |
|
835 | def afterhgrcload(ui, wdirvfs, hgvfs, requirements): | |
836 | """Perform additional actions after .hg/hgrc is loaded. |
|
836 | """Perform additional actions after .hg/hgrc is loaded. | |
837 |
|
837 | |||
838 | This function is called during repository loading immediately after |
|
838 | This function is called during repository loading immediately after | |
839 | the .hg/hgrc file is loaded and before per-repo extensions are loaded. |
|
839 | the .hg/hgrc file is loaded and before per-repo extensions are loaded. | |
840 |
|
840 | |||
841 | The function can be used to validate configs, automatically add |
|
841 | The function can be used to validate configs, automatically add | |
842 | options (including extensions) based on requirements, etc. |
|
842 | options (including extensions) based on requirements, etc. | |
843 | """ |
|
843 | """ | |
844 |
|
844 | |||
845 | # Map of requirements to list of extensions to load automatically when |
|
845 | # Map of requirements to list of extensions to load automatically when | |
846 | # requirement is present. |
|
846 | # requirement is present. | |
847 | autoextensions = { |
|
847 | autoextensions = { | |
848 | b'git': [b'git'], |
|
848 | b'git': [b'git'], | |
849 | b'largefiles': [b'largefiles'], |
|
849 | b'largefiles': [b'largefiles'], | |
850 | b'lfs': [b'lfs'], |
|
850 | b'lfs': [b'lfs'], | |
851 | } |
|
851 | } | |
852 |
|
852 | |||
853 | for requirement, names in sorted(autoextensions.items()): |
|
853 | for requirement, names in sorted(autoextensions.items()): | |
854 | if requirement not in requirements: |
|
854 | if requirement not in requirements: | |
855 | continue |
|
855 | continue | |
856 |
|
856 | |||
857 | for name in names: |
|
857 | for name in names: | |
858 | if not ui.hasconfig(b'extensions', name): |
|
858 | if not ui.hasconfig(b'extensions', name): | |
859 | ui.setconfig(b'extensions', name, b'', source=b'autoload') |
|
859 | ui.setconfig(b'extensions', name, b'', source=b'autoload') | |
860 |
|
860 | |||
861 |
|
861 | |||
862 | def gathersupportedrequirements(ui): |
|
862 | def gathersupportedrequirements(ui): | |
863 | """Determine the complete set of recognized requirements.""" |
|
863 | """Determine the complete set of recognized requirements.""" | |
864 | # Start with all requirements supported by this file. |
|
864 | # Start with all requirements supported by this file. | |
865 | supported = set(localrepository._basesupported) |
|
865 | supported = set(localrepository._basesupported) | |
866 |
|
866 | |||
867 | # Execute ``featuresetupfuncs`` entries if they belong to an extension |
|
867 | # Execute ``featuresetupfuncs`` entries if they belong to an extension | |
868 | # relevant to this ui instance. |
|
868 | # relevant to this ui instance. | |
869 | modules = {m.__name__ for n, m in extensions.extensions(ui)} |
|
869 | modules = {m.__name__ for n, m in extensions.extensions(ui)} | |
870 |
|
870 | |||
871 | for fn in featuresetupfuncs: |
|
871 | for fn in featuresetupfuncs: | |
872 | if fn.__module__ in modules: |
|
872 | if fn.__module__ in modules: | |
873 | fn(ui, supported) |
|
873 | fn(ui, supported) | |
874 |
|
874 | |||
875 | # Add derived requirements from registered compression engines. |
|
875 | # Add derived requirements from registered compression engines. | |
876 | for name in util.compengines: |
|
876 | for name in util.compengines: | |
877 | engine = util.compengines[name] |
|
877 | engine = util.compengines[name] | |
878 | if engine.available() and engine.revlogheader(): |
|
878 | if engine.available() and engine.revlogheader(): | |
879 | supported.add(b'exp-compression-%s' % name) |
|
879 | supported.add(b'exp-compression-%s' % name) | |
880 | if engine.name() == b'zstd': |
|
880 | if engine.name() == b'zstd': | |
881 | supported.add(b'revlog-compression-zstd') |
|
881 | supported.add(b'revlog-compression-zstd') | |
882 |
|
882 | |||
883 | return supported |
|
883 | return supported | |
884 |
|
884 | |||
885 |
|
885 | |||
886 | def ensurerequirementsrecognized(requirements, supported): |
|
886 | def ensurerequirementsrecognized(requirements, supported): | |
887 | """Validate that a set of local requirements is recognized. |
|
887 | """Validate that a set of local requirements is recognized. | |
888 |
|
888 | |||
889 | Receives a set of requirements. Raises an ``error.RepoError`` if there |
|
889 | Receives a set of requirements. Raises an ``error.RepoError`` if there | |
890 | exists any requirement in that set that currently loaded code doesn't |
|
890 | exists any requirement in that set that currently loaded code doesn't | |
891 | recognize. |
|
891 | recognize. | |
892 |
|
892 | |||
893 | Returns a set of supported requirements. |
|
893 | Returns a set of supported requirements. | |
894 | """ |
|
894 | """ | |
895 | missing = set() |
|
895 | missing = set() | |
896 |
|
896 | |||
897 | for requirement in requirements: |
|
897 | for requirement in requirements: | |
898 | if requirement in supported: |
|
898 | if requirement in supported: | |
899 | continue |
|
899 | continue | |
900 |
|
900 | |||
901 | if not requirement or not requirement[0:1].isalnum(): |
|
901 | if not requirement or not requirement[0:1].isalnum(): | |
902 | raise error.RequirementError(_(b'.hg/requires file is corrupt')) |
|
902 | raise error.RequirementError(_(b'.hg/requires file is corrupt')) | |
903 |
|
903 | |||
904 | missing.add(requirement) |
|
904 | missing.add(requirement) | |
905 |
|
905 | |||
906 | if missing: |
|
906 | if missing: | |
907 | raise error.RequirementError( |
|
907 | raise error.RequirementError( | |
908 | _(b'repository requires features unknown to this Mercurial: %s') |
|
908 | _(b'repository requires features unknown to this Mercurial: %s') | |
909 | % b' '.join(sorted(missing)), |
|
909 | % b' '.join(sorted(missing)), | |
910 | hint=_( |
|
910 | hint=_( | |
911 | b'see https://mercurial-scm.org/wiki/MissingRequirement ' |
|
911 | b'see https://mercurial-scm.org/wiki/MissingRequirement ' | |
912 | b'for more information' |
|
912 | b'for more information' | |
913 | ), |
|
913 | ), | |
914 | ) |
|
914 | ) | |
915 |
|
915 | |||
916 |
|
916 | |||
917 | def ensurerequirementscompatible(ui, requirements): |
|
917 | def ensurerequirementscompatible(ui, requirements): | |
918 | """Validates that a set of recognized requirements is mutually compatible. |
|
918 | """Validates that a set of recognized requirements is mutually compatible. | |
919 |
|
919 | |||
920 | Some requirements may not be compatible with others or require |
|
920 | Some requirements may not be compatible with others or require | |
921 | config options that aren't enabled. This function is called during |
|
921 | config options that aren't enabled. This function is called during | |
922 | repository opening to ensure that the set of requirements needed |
|
922 | repository opening to ensure that the set of requirements needed | |
923 | to open a repository is sane and compatible with config options. |
|
923 | to open a repository is sane and compatible with config options. | |
924 |
|
924 | |||
925 | Extensions can monkeypatch this function to perform additional |
|
925 | Extensions can monkeypatch this function to perform additional | |
926 | checking. |
|
926 | checking. | |
927 |
|
927 | |||
928 | ``error.RepoError`` should be raised on failure. |
|
928 | ``error.RepoError`` should be raised on failure. | |
929 | """ |
|
929 | """ | |
930 | if ( |
|
930 | if ( | |
931 | requirementsmod.SPARSE_REQUIREMENT in requirements |
|
931 | requirementsmod.SPARSE_REQUIREMENT in requirements | |
932 | and not sparse.enabled |
|
932 | and not sparse.enabled | |
933 | ): |
|
933 | ): | |
934 | raise error.RepoError( |
|
934 | raise error.RepoError( | |
935 | _( |
|
935 | _( | |
936 | b'repository is using sparse feature but ' |
|
936 | b'repository is using sparse feature but ' | |
937 | b'sparse is not enabled; enable the ' |
|
937 | b'sparse is not enabled; enable the ' | |
938 | b'"sparse" extensions to access' |
|
938 | b'"sparse" extensions to access' | |
939 | ) |
|
939 | ) | |
940 | ) |
|
940 | ) | |
941 |
|
941 | |||
942 |
|
942 | |||
943 | def makestore(requirements, path, vfstype): |
|
943 | def makestore(requirements, path, vfstype): | |
944 | """Construct a storage object for a repository.""" |
|
944 | """Construct a storage object for a repository.""" | |
945 | if b'store' in requirements: |
|
945 | if b'store' in requirements: | |
946 | if b'fncache' in requirements: |
|
946 | if b'fncache' in requirements: | |
947 | return storemod.fncachestore( |
|
947 | dotencode = requirementsmod.DOTENCODE_REQUIREMENT in requirements | |
948 | path, vfstype, b'dotencode' in requirements |
|
948 | return storemod.fncachestore(path, vfstype, dotencode) | |
949 | ) |
|
|||
950 |
|
949 | |||
951 | return storemod.encodedstore(path, vfstype) |
|
950 | return storemod.encodedstore(path, vfstype) | |
952 |
|
951 | |||
953 | return storemod.basicstore(path, vfstype) |
|
952 | return storemod.basicstore(path, vfstype) | |
954 |
|
953 | |||
955 |
|
954 | |||
956 | def resolvestorevfsoptions(ui, requirements, features): |
|
955 | def resolvestorevfsoptions(ui, requirements, features): | |
957 | """Resolve the options to pass to the store vfs opener. |
|
956 | """Resolve the options to pass to the store vfs opener. | |
958 |
|
957 | |||
959 | The returned dict is used to influence behavior of the storage layer. |
|
958 | The returned dict is used to influence behavior of the storage layer. | |
960 | """ |
|
959 | """ | |
961 | options = {} |
|
960 | options = {} | |
962 |
|
961 | |||
963 | if requirementsmod.TREEMANIFEST_REQUIREMENT in requirements: |
|
962 | if requirementsmod.TREEMANIFEST_REQUIREMENT in requirements: | |
964 | options[b'treemanifest'] = True |
|
963 | options[b'treemanifest'] = True | |
965 |
|
964 | |||
966 | # experimental config: format.manifestcachesize |
|
965 | # experimental config: format.manifestcachesize | |
967 | manifestcachesize = ui.configint(b'format', b'manifestcachesize') |
|
966 | manifestcachesize = ui.configint(b'format', b'manifestcachesize') | |
968 | if manifestcachesize is not None: |
|
967 | if manifestcachesize is not None: | |
969 | options[b'manifestcachesize'] = manifestcachesize |
|
968 | options[b'manifestcachesize'] = manifestcachesize | |
970 |
|
969 | |||
971 | # In the absence of another requirement superseding a revlog-related |
|
970 | # In the absence of another requirement superseding a revlog-related | |
972 | # requirement, we have to assume the repo is using revlog version 0. |
|
971 | # requirement, we have to assume the repo is using revlog version 0. | |
973 | # This revlog format is super old and we don't bother trying to parse |
|
972 | # This revlog format is super old and we don't bother trying to parse | |
974 | # opener options for it because those options wouldn't do anything |
|
973 | # opener options for it because those options wouldn't do anything | |
975 | # meaningful on such old repos. |
|
974 | # meaningful on such old repos. | |
976 | if ( |
|
975 | if ( | |
977 | requirementsmod.REVLOGV1_REQUIREMENT in requirements |
|
976 | requirementsmod.REVLOGV1_REQUIREMENT in requirements | |
978 | or requirementsmod.REVLOGV2_REQUIREMENT in requirements |
|
977 | or requirementsmod.REVLOGV2_REQUIREMENT in requirements | |
979 | ): |
|
978 | ): | |
980 | options.update(resolverevlogstorevfsoptions(ui, requirements, features)) |
|
979 | options.update(resolverevlogstorevfsoptions(ui, requirements, features)) | |
981 | else: # explicitly mark repo as using revlogv0 |
|
980 | else: # explicitly mark repo as using revlogv0 | |
982 | options[b'revlogv0'] = True |
|
981 | options[b'revlogv0'] = True | |
983 |
|
982 | |||
984 | if requirementsmod.COPIESSDC_REQUIREMENT in requirements: |
|
983 | if requirementsmod.COPIESSDC_REQUIREMENT in requirements: | |
985 | options[b'copies-storage'] = b'changeset-sidedata' |
|
984 | options[b'copies-storage'] = b'changeset-sidedata' | |
986 | else: |
|
985 | else: | |
987 | writecopiesto = ui.config(b'experimental', b'copies.write-to') |
|
986 | writecopiesto = ui.config(b'experimental', b'copies.write-to') | |
988 | copiesextramode = (b'changeset-only', b'compatibility') |
|
987 | copiesextramode = (b'changeset-only', b'compatibility') | |
989 | if writecopiesto in copiesextramode: |
|
988 | if writecopiesto in copiesextramode: | |
990 | options[b'copies-storage'] = b'extra' |
|
989 | options[b'copies-storage'] = b'extra' | |
991 |
|
990 | |||
992 | return options |
|
991 | return options | |
993 |
|
992 | |||
994 |
|
993 | |||
995 | def resolverevlogstorevfsoptions(ui, requirements, features): |
|
994 | def resolverevlogstorevfsoptions(ui, requirements, features): | |
996 | """Resolve opener options specific to revlogs.""" |
|
995 | """Resolve opener options specific to revlogs.""" | |
997 |
|
996 | |||
998 | options = {} |
|
997 | options = {} | |
999 | options[b'flagprocessors'] = {} |
|
998 | options[b'flagprocessors'] = {} | |
1000 |
|
999 | |||
1001 | if requirementsmod.REVLOGV1_REQUIREMENT in requirements: |
|
1000 | if requirementsmod.REVLOGV1_REQUIREMENT in requirements: | |
1002 | options[b'revlogv1'] = True |
|
1001 | options[b'revlogv1'] = True | |
1003 | if requirementsmod.REVLOGV2_REQUIREMENT in requirements: |
|
1002 | if requirementsmod.REVLOGV2_REQUIREMENT in requirements: | |
1004 | options[b'revlogv2'] = True |
|
1003 | options[b'revlogv2'] = True | |
1005 |
|
1004 | |||
1006 | if requirementsmod.GENERALDELTA_REQUIREMENT in requirements: |
|
1005 | if requirementsmod.GENERALDELTA_REQUIREMENT in requirements: | |
1007 | options[b'generaldelta'] = True |
|
1006 | options[b'generaldelta'] = True | |
1008 |
|
1007 | |||
1009 | # experimental config: format.chunkcachesize |
|
1008 | # experimental config: format.chunkcachesize | |
1010 | chunkcachesize = ui.configint(b'format', b'chunkcachesize') |
|
1009 | chunkcachesize = ui.configint(b'format', b'chunkcachesize') | |
1011 | if chunkcachesize is not None: |
|
1010 | if chunkcachesize is not None: | |
1012 | options[b'chunkcachesize'] = chunkcachesize |
|
1011 | options[b'chunkcachesize'] = chunkcachesize | |
1013 |
|
1012 | |||
1014 | deltabothparents = ui.configbool( |
|
1013 | deltabothparents = ui.configbool( | |
1015 | b'storage', b'revlog.optimize-delta-parent-choice' |
|
1014 | b'storage', b'revlog.optimize-delta-parent-choice' | |
1016 | ) |
|
1015 | ) | |
1017 | options[b'deltabothparents'] = deltabothparents |
|
1016 | options[b'deltabothparents'] = deltabothparents | |
1018 |
|
1017 | |||
1019 | lazydelta = ui.configbool(b'storage', b'revlog.reuse-external-delta') |
|
1018 | lazydelta = ui.configbool(b'storage', b'revlog.reuse-external-delta') | |
1020 | lazydeltabase = False |
|
1019 | lazydeltabase = False | |
1021 | if lazydelta: |
|
1020 | if lazydelta: | |
1022 | lazydeltabase = ui.configbool( |
|
1021 | lazydeltabase = ui.configbool( | |
1023 | b'storage', b'revlog.reuse-external-delta-parent' |
|
1022 | b'storage', b'revlog.reuse-external-delta-parent' | |
1024 | ) |
|
1023 | ) | |
1025 | if lazydeltabase is None: |
|
1024 | if lazydeltabase is None: | |
1026 | lazydeltabase = not scmutil.gddeltaconfig(ui) |
|
1025 | lazydeltabase = not scmutil.gddeltaconfig(ui) | |
1027 | options[b'lazydelta'] = lazydelta |
|
1026 | options[b'lazydelta'] = lazydelta | |
1028 | options[b'lazydeltabase'] = lazydeltabase |
|
1027 | options[b'lazydeltabase'] = lazydeltabase | |
1029 |
|
1028 | |||
1030 | chainspan = ui.configbytes(b'experimental', b'maxdeltachainspan') |
|
1029 | chainspan = ui.configbytes(b'experimental', b'maxdeltachainspan') | |
1031 | if 0 <= chainspan: |
|
1030 | if 0 <= chainspan: | |
1032 | options[b'maxdeltachainspan'] = chainspan |
|
1031 | options[b'maxdeltachainspan'] = chainspan | |
1033 |
|
1032 | |||
1034 | mmapindexthreshold = ui.configbytes(b'experimental', b'mmapindexthreshold') |
|
1033 | mmapindexthreshold = ui.configbytes(b'experimental', b'mmapindexthreshold') | |
1035 | if mmapindexthreshold is not None: |
|
1034 | if mmapindexthreshold is not None: | |
1036 | options[b'mmapindexthreshold'] = mmapindexthreshold |
|
1035 | options[b'mmapindexthreshold'] = mmapindexthreshold | |
1037 |
|
1036 | |||
1038 | withsparseread = ui.configbool(b'experimental', b'sparse-read') |
|
1037 | withsparseread = ui.configbool(b'experimental', b'sparse-read') | |
1039 | srdensitythres = float( |
|
1038 | srdensitythres = float( | |
1040 | ui.config(b'experimental', b'sparse-read.density-threshold') |
|
1039 | ui.config(b'experimental', b'sparse-read.density-threshold') | |
1041 | ) |
|
1040 | ) | |
1042 | srmingapsize = ui.configbytes(b'experimental', b'sparse-read.min-gap-size') |
|
1041 | srmingapsize = ui.configbytes(b'experimental', b'sparse-read.min-gap-size') | |
1043 | options[b'with-sparse-read'] = withsparseread |
|
1042 | options[b'with-sparse-read'] = withsparseread | |
1044 | options[b'sparse-read-density-threshold'] = srdensitythres |
|
1043 | options[b'sparse-read-density-threshold'] = srdensitythres | |
1045 | options[b'sparse-read-min-gap-size'] = srmingapsize |
|
1044 | options[b'sparse-read-min-gap-size'] = srmingapsize | |
1046 |
|
1045 | |||
1047 | sparserevlog = requirementsmod.SPARSEREVLOG_REQUIREMENT in requirements |
|
1046 | sparserevlog = requirementsmod.SPARSEREVLOG_REQUIREMENT in requirements | |
1048 | options[b'sparse-revlog'] = sparserevlog |
|
1047 | options[b'sparse-revlog'] = sparserevlog | |
1049 | if sparserevlog: |
|
1048 | if sparserevlog: | |
1050 | options[b'generaldelta'] = True |
|
1049 | options[b'generaldelta'] = True | |
1051 |
|
1050 | |||
1052 | sidedata = requirementsmod.SIDEDATA_REQUIREMENT in requirements |
|
1051 | sidedata = requirementsmod.SIDEDATA_REQUIREMENT in requirements | |
1053 | options[b'side-data'] = sidedata |
|
1052 | options[b'side-data'] = sidedata | |
1054 |
|
1053 | |||
1055 | maxchainlen = None |
|
1054 | maxchainlen = None | |
1056 | if sparserevlog: |
|
1055 | if sparserevlog: | |
1057 | maxchainlen = revlogconst.SPARSE_REVLOG_MAX_CHAIN_LENGTH |
|
1056 | maxchainlen = revlogconst.SPARSE_REVLOG_MAX_CHAIN_LENGTH | |
1058 | # experimental config: format.maxchainlen |
|
1057 | # experimental config: format.maxchainlen | |
1059 | maxchainlen = ui.configint(b'format', b'maxchainlen', maxchainlen) |
|
1058 | maxchainlen = ui.configint(b'format', b'maxchainlen', maxchainlen) | |
1060 | if maxchainlen is not None: |
|
1059 | if maxchainlen is not None: | |
1061 | options[b'maxchainlen'] = maxchainlen |
|
1060 | options[b'maxchainlen'] = maxchainlen | |
1062 |
|
1061 | |||
1063 | for r in requirements: |
|
1062 | for r in requirements: | |
1064 | # we allow multiple compression engine requirement to co-exist because |
|
1063 | # we allow multiple compression engine requirement to co-exist because | |
1065 | # strickly speaking, revlog seems to support mixed compression style. |
|
1064 | # strickly speaking, revlog seems to support mixed compression style. | |
1066 | # |
|
1065 | # | |
1067 | # The compression used for new entries will be "the last one" |
|
1066 | # The compression used for new entries will be "the last one" | |
1068 | prefix = r.startswith |
|
1067 | prefix = r.startswith | |
1069 | if prefix(b'revlog-compression-') or prefix(b'exp-compression-'): |
|
1068 | if prefix(b'revlog-compression-') or prefix(b'exp-compression-'): | |
1070 | options[b'compengine'] = r.split(b'-', 2)[2] |
|
1069 | options[b'compengine'] = r.split(b'-', 2)[2] | |
1071 |
|
1070 | |||
1072 | options[b'zlib.level'] = ui.configint(b'storage', b'revlog.zlib.level') |
|
1071 | options[b'zlib.level'] = ui.configint(b'storage', b'revlog.zlib.level') | |
1073 | if options[b'zlib.level'] is not None: |
|
1072 | if options[b'zlib.level'] is not None: | |
1074 | if not (0 <= options[b'zlib.level'] <= 9): |
|
1073 | if not (0 <= options[b'zlib.level'] <= 9): | |
1075 | msg = _(b'invalid value for `storage.revlog.zlib.level` config: %d') |
|
1074 | msg = _(b'invalid value for `storage.revlog.zlib.level` config: %d') | |
1076 | raise error.Abort(msg % options[b'zlib.level']) |
|
1075 | raise error.Abort(msg % options[b'zlib.level']) | |
1077 | options[b'zstd.level'] = ui.configint(b'storage', b'revlog.zstd.level') |
|
1076 | options[b'zstd.level'] = ui.configint(b'storage', b'revlog.zstd.level') | |
1078 | if options[b'zstd.level'] is not None: |
|
1077 | if options[b'zstd.level'] is not None: | |
1079 | if not (0 <= options[b'zstd.level'] <= 22): |
|
1078 | if not (0 <= options[b'zstd.level'] <= 22): | |
1080 | msg = _(b'invalid value for `storage.revlog.zstd.level` config: %d') |
|
1079 | msg = _(b'invalid value for `storage.revlog.zstd.level` config: %d') | |
1081 | raise error.Abort(msg % options[b'zstd.level']) |
|
1080 | raise error.Abort(msg % options[b'zstd.level']) | |
1082 |
|
1081 | |||
1083 | if requirementsmod.NARROW_REQUIREMENT in requirements: |
|
1082 | if requirementsmod.NARROW_REQUIREMENT in requirements: | |
1084 | options[b'enableellipsis'] = True |
|
1083 | options[b'enableellipsis'] = True | |
1085 |
|
1084 | |||
1086 | if ui.configbool(b'experimental', b'rust.index'): |
|
1085 | if ui.configbool(b'experimental', b'rust.index'): | |
1087 | options[b'rust.index'] = True |
|
1086 | options[b'rust.index'] = True | |
1088 | if requirementsmod.NODEMAP_REQUIREMENT in requirements: |
|
1087 | if requirementsmod.NODEMAP_REQUIREMENT in requirements: | |
1089 | slow_path = ui.config( |
|
1088 | slow_path = ui.config( | |
1090 | b'storage', b'revlog.persistent-nodemap.slow-path' |
|
1089 | b'storage', b'revlog.persistent-nodemap.slow-path' | |
1091 | ) |
|
1090 | ) | |
1092 | if slow_path not in (b'allow', b'warn', b'abort'): |
|
1091 | if slow_path not in (b'allow', b'warn', b'abort'): | |
1093 | default = ui.config_default( |
|
1092 | default = ui.config_default( | |
1094 | b'storage', b'revlog.persistent-nodemap.slow-path' |
|
1093 | b'storage', b'revlog.persistent-nodemap.slow-path' | |
1095 | ) |
|
1094 | ) | |
1096 | msg = _( |
|
1095 | msg = _( | |
1097 | b'unknown value for config ' |
|
1096 | b'unknown value for config ' | |
1098 | b'"storage.revlog.persistent-nodemap.slow-path": "%s"\n' |
|
1097 | b'"storage.revlog.persistent-nodemap.slow-path": "%s"\n' | |
1099 | ) |
|
1098 | ) | |
1100 | ui.warn(msg % slow_path) |
|
1099 | ui.warn(msg % slow_path) | |
1101 | if not ui.quiet: |
|
1100 | if not ui.quiet: | |
1102 | ui.warn(_(b'falling back to default value: %s\n') % default) |
|
1101 | ui.warn(_(b'falling back to default value: %s\n') % default) | |
1103 | slow_path = default |
|
1102 | slow_path = default | |
1104 |
|
1103 | |||
1105 | msg = _( |
|
1104 | msg = _( | |
1106 | b"accessing `persistent-nodemap` repository without associated " |
|
1105 | b"accessing `persistent-nodemap` repository without associated " | |
1107 | b"fast implementation." |
|
1106 | b"fast implementation." | |
1108 | ) |
|
1107 | ) | |
1109 | hint = _( |
|
1108 | hint = _( | |
1110 | b"check `hg help config.format.use-persistent-nodemap` " |
|
1109 | b"check `hg help config.format.use-persistent-nodemap` " | |
1111 | b"for details" |
|
1110 | b"for details" | |
1112 | ) |
|
1111 | ) | |
1113 | if not revlog.HAS_FAST_PERSISTENT_NODEMAP: |
|
1112 | if not revlog.HAS_FAST_PERSISTENT_NODEMAP: | |
1114 | if slow_path == b'warn': |
|
1113 | if slow_path == b'warn': | |
1115 | msg = b"warning: " + msg + b'\n' |
|
1114 | msg = b"warning: " + msg + b'\n' | |
1116 | ui.warn(msg) |
|
1115 | ui.warn(msg) | |
1117 | if not ui.quiet: |
|
1116 | if not ui.quiet: | |
1118 | hint = b'(' + hint + b')\n' |
|
1117 | hint = b'(' + hint + b')\n' | |
1119 | ui.warn(hint) |
|
1118 | ui.warn(hint) | |
1120 | if slow_path == b'abort': |
|
1119 | if slow_path == b'abort': | |
1121 | raise error.Abort(msg, hint=hint) |
|
1120 | raise error.Abort(msg, hint=hint) | |
1122 | options[b'persistent-nodemap'] = True |
|
1121 | options[b'persistent-nodemap'] = True | |
1123 | if ui.configbool(b'storage', b'revlog.persistent-nodemap.mmap'): |
|
1122 | if ui.configbool(b'storage', b'revlog.persistent-nodemap.mmap'): | |
1124 | options[b'persistent-nodemap.mmap'] = True |
|
1123 | options[b'persistent-nodemap.mmap'] = True | |
1125 | if ui.configbool(b'devel', b'persistent-nodemap'): |
|
1124 | if ui.configbool(b'devel', b'persistent-nodemap'): | |
1126 | options[b'devel-force-nodemap'] = True |
|
1125 | options[b'devel-force-nodemap'] = True | |
1127 |
|
1126 | |||
1128 | return options |
|
1127 | return options | |
1129 |
|
1128 | |||
1130 |
|
1129 | |||
1131 | def makemain(**kwargs): |
|
1130 | def makemain(**kwargs): | |
1132 | """Produce a type conforming to ``ilocalrepositorymain``.""" |
|
1131 | """Produce a type conforming to ``ilocalrepositorymain``.""" | |
1133 | return localrepository |
|
1132 | return localrepository | |
1134 |
|
1133 | |||
1135 |
|
1134 | |||
1136 | @interfaceutil.implementer(repository.ilocalrepositoryfilestorage) |
|
1135 | @interfaceutil.implementer(repository.ilocalrepositoryfilestorage) | |
1137 | class revlogfilestorage(object): |
|
1136 | class revlogfilestorage(object): | |
1138 | """File storage when using revlogs.""" |
|
1137 | """File storage when using revlogs.""" | |
1139 |
|
1138 | |||
1140 | def file(self, path): |
|
1139 | def file(self, path): | |
1141 | if path[0] == b'/': |
|
1140 | if path[0] == b'/': | |
1142 | path = path[1:] |
|
1141 | path = path[1:] | |
1143 |
|
1142 | |||
1144 | return filelog.filelog(self.svfs, path) |
|
1143 | return filelog.filelog(self.svfs, path) | |
1145 |
|
1144 | |||
1146 |
|
1145 | |||
1147 | @interfaceutil.implementer(repository.ilocalrepositoryfilestorage) |
|
1146 | @interfaceutil.implementer(repository.ilocalrepositoryfilestorage) | |
1148 | class revlognarrowfilestorage(object): |
|
1147 | class revlognarrowfilestorage(object): | |
1149 | """File storage when using revlogs and narrow files.""" |
|
1148 | """File storage when using revlogs and narrow files.""" | |
1150 |
|
1149 | |||
1151 | def file(self, path): |
|
1150 | def file(self, path): | |
1152 | if path[0] == b'/': |
|
1151 | if path[0] == b'/': | |
1153 | path = path[1:] |
|
1152 | path = path[1:] | |
1154 |
|
1153 | |||
1155 | return filelog.narrowfilelog(self.svfs, path, self._storenarrowmatch) |
|
1154 | return filelog.narrowfilelog(self.svfs, path, self._storenarrowmatch) | |
1156 |
|
1155 | |||
1157 |
|
1156 | |||
1158 | def makefilestorage(requirements, features, **kwargs): |
|
1157 | def makefilestorage(requirements, features, **kwargs): | |
1159 | """Produce a type conforming to ``ilocalrepositoryfilestorage``.""" |
|
1158 | """Produce a type conforming to ``ilocalrepositoryfilestorage``.""" | |
1160 | features.add(repository.REPO_FEATURE_REVLOG_FILE_STORAGE) |
|
1159 | features.add(repository.REPO_FEATURE_REVLOG_FILE_STORAGE) | |
1161 | features.add(repository.REPO_FEATURE_STREAM_CLONE) |
|
1160 | features.add(repository.REPO_FEATURE_STREAM_CLONE) | |
1162 |
|
1161 | |||
1163 | if requirementsmod.NARROW_REQUIREMENT in requirements: |
|
1162 | if requirementsmod.NARROW_REQUIREMENT in requirements: | |
1164 | return revlognarrowfilestorage |
|
1163 | return revlognarrowfilestorage | |
1165 | else: |
|
1164 | else: | |
1166 | return revlogfilestorage |
|
1165 | return revlogfilestorage | |
1167 |
|
1166 | |||
1168 |
|
1167 | |||
1169 | # List of repository interfaces and factory functions for them. Each |
|
1168 | # List of repository interfaces and factory functions for them. Each | |
1170 | # will be called in order during ``makelocalrepository()`` to iteratively |
|
1169 | # will be called in order during ``makelocalrepository()`` to iteratively | |
1171 | # derive the final type for a local repository instance. We capture the |
|
1170 | # derive the final type for a local repository instance. We capture the | |
1172 | # function as a lambda so we don't hold a reference and the module-level |
|
1171 | # function as a lambda so we don't hold a reference and the module-level | |
1173 | # functions can be wrapped. |
|
1172 | # functions can be wrapped. | |
1174 | REPO_INTERFACES = [ |
|
1173 | REPO_INTERFACES = [ | |
1175 | (repository.ilocalrepositorymain, lambda: makemain), |
|
1174 | (repository.ilocalrepositorymain, lambda: makemain), | |
1176 | (repository.ilocalrepositoryfilestorage, lambda: makefilestorage), |
|
1175 | (repository.ilocalrepositoryfilestorage, lambda: makefilestorage), | |
1177 | ] |
|
1176 | ] | |
1178 |
|
1177 | |||
1179 |
|
1178 | |||
1180 | @interfaceutil.implementer(repository.ilocalrepositorymain) |
|
1179 | @interfaceutil.implementer(repository.ilocalrepositorymain) | |
1181 | class localrepository(object): |
|
1180 | class localrepository(object): | |
1182 | """Main class for representing local repositories. |
|
1181 | """Main class for representing local repositories. | |
1183 |
|
1182 | |||
1184 | All local repositories are instances of this class. |
|
1183 | All local repositories are instances of this class. | |
1185 |
|
1184 | |||
1186 | Constructed on its own, instances of this class are not usable as |
|
1185 | Constructed on its own, instances of this class are not usable as | |
1187 | repository objects. To obtain a usable repository object, call |
|
1186 | repository objects. To obtain a usable repository object, call | |
1188 | ``hg.repository()``, ``localrepo.instance()``, or |
|
1187 | ``hg.repository()``, ``localrepo.instance()``, or | |
1189 | ``localrepo.makelocalrepository()``. The latter is the lowest-level. |
|
1188 | ``localrepo.makelocalrepository()``. The latter is the lowest-level. | |
1190 | ``instance()`` adds support for creating new repositories. |
|
1189 | ``instance()`` adds support for creating new repositories. | |
1191 | ``hg.repository()`` adds more extension integration, including calling |
|
1190 | ``hg.repository()`` adds more extension integration, including calling | |
1192 | ``reposetup()``. Generally speaking, ``hg.repository()`` should be |
|
1191 | ``reposetup()``. Generally speaking, ``hg.repository()`` should be | |
1193 | used. |
|
1192 | used. | |
1194 | """ |
|
1193 | """ | |
1195 |
|
1194 | |||
1196 | # obsolete experimental requirements: |
|
1195 | # obsolete experimental requirements: | |
1197 | # - manifestv2: An experimental new manifest format that allowed |
|
1196 | # - manifestv2: An experimental new manifest format that allowed | |
1198 | # for stem compression of long paths. Experiment ended up not |
|
1197 | # for stem compression of long paths. Experiment ended up not | |
1199 | # being successful (repository sizes went up due to worse delta |
|
1198 | # being successful (repository sizes went up due to worse delta | |
1200 | # chains), and the code was deleted in 4.6. |
|
1199 | # chains), and the code was deleted in 4.6. | |
1201 | supportedformats = { |
|
1200 | supportedformats = { | |
1202 | requirementsmod.REVLOGV1_REQUIREMENT, |
|
1201 | requirementsmod.REVLOGV1_REQUIREMENT, | |
1203 | requirementsmod.GENERALDELTA_REQUIREMENT, |
|
1202 | requirementsmod.GENERALDELTA_REQUIREMENT, | |
1204 | requirementsmod.TREEMANIFEST_REQUIREMENT, |
|
1203 | requirementsmod.TREEMANIFEST_REQUIREMENT, | |
1205 | requirementsmod.COPIESSDC_REQUIREMENT, |
|
1204 | requirementsmod.COPIESSDC_REQUIREMENT, | |
1206 | requirementsmod.REVLOGV2_REQUIREMENT, |
|
1205 | requirementsmod.REVLOGV2_REQUIREMENT, | |
1207 | requirementsmod.SIDEDATA_REQUIREMENT, |
|
1206 | requirementsmod.SIDEDATA_REQUIREMENT, | |
1208 | requirementsmod.SPARSEREVLOG_REQUIREMENT, |
|
1207 | requirementsmod.SPARSEREVLOG_REQUIREMENT, | |
1209 | requirementsmod.NODEMAP_REQUIREMENT, |
|
1208 | requirementsmod.NODEMAP_REQUIREMENT, | |
1210 | bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT, |
|
1209 | bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT, | |
1211 | requirementsmod.SHARESAFE_REQUIREMENT, |
|
1210 | requirementsmod.SHARESAFE_REQUIREMENT, | |
1212 | } |
|
1211 | } | |
1213 | _basesupported = supportedformats | { |
|
1212 | _basesupported = supportedformats | { | |
1214 | b'store', |
|
1213 | b'store', | |
1215 | b'fncache', |
|
1214 | b'fncache', | |
1216 | requirementsmod.SHARED_REQUIREMENT, |
|
1215 | requirementsmod.SHARED_REQUIREMENT, | |
1217 | requirementsmod.RELATIVE_SHARED_REQUIREMENT, |
|
1216 | requirementsmod.RELATIVE_SHARED_REQUIREMENT, | |
1218 | b'dotencode', |
|
1217 | requirementsmod.DOTENCODE_REQUIREMENT, | |
1219 | requirementsmod.SPARSE_REQUIREMENT, |
|
1218 | requirementsmod.SPARSE_REQUIREMENT, | |
1220 | requirementsmod.INTERNAL_PHASE_REQUIREMENT, |
|
1219 | requirementsmod.INTERNAL_PHASE_REQUIREMENT, | |
1221 | } |
|
1220 | } | |
1222 |
|
1221 | |||
1223 | # list of prefix for file which can be written without 'wlock' |
|
1222 | # list of prefix for file which can be written without 'wlock' | |
1224 | # Extensions should extend this list when needed |
|
1223 | # Extensions should extend this list when needed | |
1225 | _wlockfreeprefix = { |
|
1224 | _wlockfreeprefix = { | |
1226 | # We migh consider requiring 'wlock' for the next |
|
1225 | # We migh consider requiring 'wlock' for the next | |
1227 | # two, but pretty much all the existing code assume |
|
1226 | # two, but pretty much all the existing code assume | |
1228 | # wlock is not needed so we keep them excluded for |
|
1227 | # wlock is not needed so we keep them excluded for | |
1229 | # now. |
|
1228 | # now. | |
1230 | b'hgrc', |
|
1229 | b'hgrc', | |
1231 | b'requires', |
|
1230 | b'requires', | |
1232 | # XXX cache is a complicatged business someone |
|
1231 | # XXX cache is a complicatged business someone | |
1233 | # should investigate this in depth at some point |
|
1232 | # should investigate this in depth at some point | |
1234 | b'cache/', |
|
1233 | b'cache/', | |
1235 | # XXX shouldn't be dirstate covered by the wlock? |
|
1234 | # XXX shouldn't be dirstate covered by the wlock? | |
1236 | b'dirstate', |
|
1235 | b'dirstate', | |
1237 | # XXX bisect was still a bit too messy at the time |
|
1236 | # XXX bisect was still a bit too messy at the time | |
1238 | # this changeset was introduced. Someone should fix |
|
1237 | # this changeset was introduced. Someone should fix | |
1239 | # the remainig bit and drop this line |
|
1238 | # the remainig bit and drop this line | |
1240 | b'bisect.state', |
|
1239 | b'bisect.state', | |
1241 | } |
|
1240 | } | |
1242 |
|
1241 | |||
1243 | def __init__( |
|
1242 | def __init__( | |
1244 | self, |
|
1243 | self, | |
1245 | baseui, |
|
1244 | baseui, | |
1246 | ui, |
|
1245 | ui, | |
1247 | origroot, |
|
1246 | origroot, | |
1248 | wdirvfs, |
|
1247 | wdirvfs, | |
1249 | hgvfs, |
|
1248 | hgvfs, | |
1250 | requirements, |
|
1249 | requirements, | |
1251 | supportedrequirements, |
|
1250 | supportedrequirements, | |
1252 | sharedpath, |
|
1251 | sharedpath, | |
1253 | store, |
|
1252 | store, | |
1254 | cachevfs, |
|
1253 | cachevfs, | |
1255 | wcachevfs, |
|
1254 | wcachevfs, | |
1256 | features, |
|
1255 | features, | |
1257 | intents=None, |
|
1256 | intents=None, | |
1258 | ): |
|
1257 | ): | |
1259 | """Create a new local repository instance. |
|
1258 | """Create a new local repository instance. | |
1260 |
|
1259 | |||
1261 | Most callers should use ``hg.repository()``, ``localrepo.instance()``, |
|
1260 | Most callers should use ``hg.repository()``, ``localrepo.instance()``, | |
1262 | or ``localrepo.makelocalrepository()`` for obtaining a new repository |
|
1261 | or ``localrepo.makelocalrepository()`` for obtaining a new repository | |
1263 | object. |
|
1262 | object. | |
1264 |
|
1263 | |||
1265 | Arguments: |
|
1264 | Arguments: | |
1266 |
|
1265 | |||
1267 | baseui |
|
1266 | baseui | |
1268 | ``ui.ui`` instance that ``ui`` argument was based off of. |
|
1267 | ``ui.ui`` instance that ``ui`` argument was based off of. | |
1269 |
|
1268 | |||
1270 | ui |
|
1269 | ui | |
1271 | ``ui.ui`` instance for use by the repository. |
|
1270 | ``ui.ui`` instance for use by the repository. | |
1272 |
|
1271 | |||
1273 | origroot |
|
1272 | origroot | |
1274 | ``bytes`` path to working directory root of this repository. |
|
1273 | ``bytes`` path to working directory root of this repository. | |
1275 |
|
1274 | |||
1276 | wdirvfs |
|
1275 | wdirvfs | |
1277 | ``vfs.vfs`` rooted at the working directory. |
|
1276 | ``vfs.vfs`` rooted at the working directory. | |
1278 |
|
1277 | |||
1279 | hgvfs |
|
1278 | hgvfs | |
1280 | ``vfs.vfs`` rooted at .hg/ |
|
1279 | ``vfs.vfs`` rooted at .hg/ | |
1281 |
|
1280 | |||
1282 | requirements |
|
1281 | requirements | |
1283 | ``set`` of bytestrings representing repository opening requirements. |
|
1282 | ``set`` of bytestrings representing repository opening requirements. | |
1284 |
|
1283 | |||
1285 | supportedrequirements |
|
1284 | supportedrequirements | |
1286 | ``set`` of bytestrings representing repository requirements that we |
|
1285 | ``set`` of bytestrings representing repository requirements that we | |
1287 | know how to open. May be a supetset of ``requirements``. |
|
1286 | know how to open. May be a supetset of ``requirements``. | |
1288 |
|
1287 | |||
1289 | sharedpath |
|
1288 | sharedpath | |
1290 | ``bytes`` Defining path to storage base directory. Points to a |
|
1289 | ``bytes`` Defining path to storage base directory. Points to a | |
1291 | ``.hg/`` directory somewhere. |
|
1290 | ``.hg/`` directory somewhere. | |
1292 |
|
1291 | |||
1293 | store |
|
1292 | store | |
1294 | ``store.basicstore`` (or derived) instance providing access to |
|
1293 | ``store.basicstore`` (or derived) instance providing access to | |
1295 | versioned storage. |
|
1294 | versioned storage. | |
1296 |
|
1295 | |||
1297 | cachevfs |
|
1296 | cachevfs | |
1298 | ``vfs.vfs`` used for cache files. |
|
1297 | ``vfs.vfs`` used for cache files. | |
1299 |
|
1298 | |||
1300 | wcachevfs |
|
1299 | wcachevfs | |
1301 | ``vfs.vfs`` used for cache files related to the working copy. |
|
1300 | ``vfs.vfs`` used for cache files related to the working copy. | |
1302 |
|
1301 | |||
1303 | features |
|
1302 | features | |
1304 | ``set`` of bytestrings defining features/capabilities of this |
|
1303 | ``set`` of bytestrings defining features/capabilities of this | |
1305 | instance. |
|
1304 | instance. | |
1306 |
|
1305 | |||
1307 | intents |
|
1306 | intents | |
1308 | ``set`` of system strings indicating what this repo will be used |
|
1307 | ``set`` of system strings indicating what this repo will be used | |
1309 | for. |
|
1308 | for. | |
1310 | """ |
|
1309 | """ | |
1311 | self.baseui = baseui |
|
1310 | self.baseui = baseui | |
1312 | self.ui = ui |
|
1311 | self.ui = ui | |
1313 | self.origroot = origroot |
|
1312 | self.origroot = origroot | |
1314 | # vfs rooted at working directory. |
|
1313 | # vfs rooted at working directory. | |
1315 | self.wvfs = wdirvfs |
|
1314 | self.wvfs = wdirvfs | |
1316 | self.root = wdirvfs.base |
|
1315 | self.root = wdirvfs.base | |
1317 | # vfs rooted at .hg/. Used to access most non-store paths. |
|
1316 | # vfs rooted at .hg/. Used to access most non-store paths. | |
1318 | self.vfs = hgvfs |
|
1317 | self.vfs = hgvfs | |
1319 | self.path = hgvfs.base |
|
1318 | self.path = hgvfs.base | |
1320 | self.requirements = requirements |
|
1319 | self.requirements = requirements | |
1321 | self.supported = supportedrequirements |
|
1320 | self.supported = supportedrequirements | |
1322 | self.sharedpath = sharedpath |
|
1321 | self.sharedpath = sharedpath | |
1323 | self.store = store |
|
1322 | self.store = store | |
1324 | self.cachevfs = cachevfs |
|
1323 | self.cachevfs = cachevfs | |
1325 | self.wcachevfs = wcachevfs |
|
1324 | self.wcachevfs = wcachevfs | |
1326 | self.features = features |
|
1325 | self.features = features | |
1327 |
|
1326 | |||
1328 | self.filtername = None |
|
1327 | self.filtername = None | |
1329 |
|
1328 | |||
1330 | if self.ui.configbool(b'devel', b'all-warnings') or self.ui.configbool( |
|
1329 | if self.ui.configbool(b'devel', b'all-warnings') or self.ui.configbool( | |
1331 | b'devel', b'check-locks' |
|
1330 | b'devel', b'check-locks' | |
1332 | ): |
|
1331 | ): | |
1333 | self.vfs.audit = self._getvfsward(self.vfs.audit) |
|
1332 | self.vfs.audit = self._getvfsward(self.vfs.audit) | |
1334 | # A list of callback to shape the phase if no data were found. |
|
1333 | # A list of callback to shape the phase if no data were found. | |
1335 | # Callback are in the form: func(repo, roots) --> processed root. |
|
1334 | # Callback are in the form: func(repo, roots) --> processed root. | |
1336 | # This list it to be filled by extension during repo setup |
|
1335 | # This list it to be filled by extension during repo setup | |
1337 | self._phasedefaults = [] |
|
1336 | self._phasedefaults = [] | |
1338 |
|
1337 | |||
1339 | color.setup(self.ui) |
|
1338 | color.setup(self.ui) | |
1340 |
|
1339 | |||
1341 | self.spath = self.store.path |
|
1340 | self.spath = self.store.path | |
1342 | self.svfs = self.store.vfs |
|
1341 | self.svfs = self.store.vfs | |
1343 | self.sjoin = self.store.join |
|
1342 | self.sjoin = self.store.join | |
1344 | if self.ui.configbool(b'devel', b'all-warnings') or self.ui.configbool( |
|
1343 | if self.ui.configbool(b'devel', b'all-warnings') or self.ui.configbool( | |
1345 | b'devel', b'check-locks' |
|
1344 | b'devel', b'check-locks' | |
1346 | ): |
|
1345 | ): | |
1347 | if util.safehasattr(self.svfs, b'vfs'): # this is filtervfs |
|
1346 | if util.safehasattr(self.svfs, b'vfs'): # this is filtervfs | |
1348 | self.svfs.vfs.audit = self._getsvfsward(self.svfs.vfs.audit) |
|
1347 | self.svfs.vfs.audit = self._getsvfsward(self.svfs.vfs.audit) | |
1349 | else: # standard vfs |
|
1348 | else: # standard vfs | |
1350 | self.svfs.audit = self._getsvfsward(self.svfs.audit) |
|
1349 | self.svfs.audit = self._getsvfsward(self.svfs.audit) | |
1351 |
|
1350 | |||
1352 | self._dirstatevalidatewarned = False |
|
1351 | self._dirstatevalidatewarned = False | |
1353 |
|
1352 | |||
1354 | self._branchcaches = branchmap.BranchMapCache() |
|
1353 | self._branchcaches = branchmap.BranchMapCache() | |
1355 | self._revbranchcache = None |
|
1354 | self._revbranchcache = None | |
1356 | self._filterpats = {} |
|
1355 | self._filterpats = {} | |
1357 | self._datafilters = {} |
|
1356 | self._datafilters = {} | |
1358 | self._transref = self._lockref = self._wlockref = None |
|
1357 | self._transref = self._lockref = self._wlockref = None | |
1359 |
|
1358 | |||
1360 | # A cache for various files under .hg/ that tracks file changes, |
|
1359 | # A cache for various files under .hg/ that tracks file changes, | |
1361 | # (used by the filecache decorator) |
|
1360 | # (used by the filecache decorator) | |
1362 | # |
|
1361 | # | |
1363 | # Maps a property name to its util.filecacheentry |
|
1362 | # Maps a property name to its util.filecacheentry | |
1364 | self._filecache = {} |
|
1363 | self._filecache = {} | |
1365 |
|
1364 | |||
1366 | # hold sets of revision to be filtered |
|
1365 | # hold sets of revision to be filtered | |
1367 | # should be cleared when something might have changed the filter value: |
|
1366 | # should be cleared when something might have changed the filter value: | |
1368 | # - new changesets, |
|
1367 | # - new changesets, | |
1369 | # - phase change, |
|
1368 | # - phase change, | |
1370 | # - new obsolescence marker, |
|
1369 | # - new obsolescence marker, | |
1371 | # - working directory parent change, |
|
1370 | # - working directory parent change, | |
1372 | # - bookmark changes |
|
1371 | # - bookmark changes | |
1373 | self.filteredrevcache = {} |
|
1372 | self.filteredrevcache = {} | |
1374 |
|
1373 | |||
1375 | # post-dirstate-status hooks |
|
1374 | # post-dirstate-status hooks | |
1376 | self._postdsstatus = [] |
|
1375 | self._postdsstatus = [] | |
1377 |
|
1376 | |||
1378 | # generic mapping between names and nodes |
|
1377 | # generic mapping between names and nodes | |
1379 | self.names = namespaces.namespaces() |
|
1378 | self.names = namespaces.namespaces() | |
1380 |
|
1379 | |||
1381 | # Key to signature value. |
|
1380 | # Key to signature value. | |
1382 | self._sparsesignaturecache = {} |
|
1381 | self._sparsesignaturecache = {} | |
1383 | # Signature to cached matcher instance. |
|
1382 | # Signature to cached matcher instance. | |
1384 | self._sparsematchercache = {} |
|
1383 | self._sparsematchercache = {} | |
1385 |
|
1384 | |||
1386 | self._extrafilterid = repoview.extrafilter(ui) |
|
1385 | self._extrafilterid = repoview.extrafilter(ui) | |
1387 |
|
1386 | |||
1388 | self.filecopiesmode = None |
|
1387 | self.filecopiesmode = None | |
1389 | if requirementsmod.COPIESSDC_REQUIREMENT in self.requirements: |
|
1388 | if requirementsmod.COPIESSDC_REQUIREMENT in self.requirements: | |
1390 | self.filecopiesmode = b'changeset-sidedata' |
|
1389 | self.filecopiesmode = b'changeset-sidedata' | |
1391 |
|
1390 | |||
1392 | def _getvfsward(self, origfunc): |
|
1391 | def _getvfsward(self, origfunc): | |
1393 | """build a ward for self.vfs""" |
|
1392 | """build a ward for self.vfs""" | |
1394 | rref = weakref.ref(self) |
|
1393 | rref = weakref.ref(self) | |
1395 |
|
1394 | |||
1396 | def checkvfs(path, mode=None): |
|
1395 | def checkvfs(path, mode=None): | |
1397 | ret = origfunc(path, mode=mode) |
|
1396 | ret = origfunc(path, mode=mode) | |
1398 | repo = rref() |
|
1397 | repo = rref() | |
1399 | if ( |
|
1398 | if ( | |
1400 | repo is None |
|
1399 | repo is None | |
1401 | or not util.safehasattr(repo, b'_wlockref') |
|
1400 | or not util.safehasattr(repo, b'_wlockref') | |
1402 | or not util.safehasattr(repo, b'_lockref') |
|
1401 | or not util.safehasattr(repo, b'_lockref') | |
1403 | ): |
|
1402 | ): | |
1404 | return |
|
1403 | return | |
1405 | if mode in (None, b'r', b'rb'): |
|
1404 | if mode in (None, b'r', b'rb'): | |
1406 | return |
|
1405 | return | |
1407 | if path.startswith(repo.path): |
|
1406 | if path.startswith(repo.path): | |
1408 | # truncate name relative to the repository (.hg) |
|
1407 | # truncate name relative to the repository (.hg) | |
1409 | path = path[len(repo.path) + 1 :] |
|
1408 | path = path[len(repo.path) + 1 :] | |
1410 | if path.startswith(b'cache/'): |
|
1409 | if path.startswith(b'cache/'): | |
1411 | msg = b'accessing cache with vfs instead of cachevfs: "%s"' |
|
1410 | msg = b'accessing cache with vfs instead of cachevfs: "%s"' | |
1412 | repo.ui.develwarn(msg % path, stacklevel=3, config=b"cache-vfs") |
|
1411 | repo.ui.develwarn(msg % path, stacklevel=3, config=b"cache-vfs") | |
1413 | # path prefixes covered by 'lock' |
|
1412 | # path prefixes covered by 'lock' | |
1414 | vfs_path_prefixes = ( |
|
1413 | vfs_path_prefixes = ( | |
1415 | b'journal.', |
|
1414 | b'journal.', | |
1416 | b'undo.', |
|
1415 | b'undo.', | |
1417 | b'strip-backup/', |
|
1416 | b'strip-backup/', | |
1418 | b'cache/', |
|
1417 | b'cache/', | |
1419 | ) |
|
1418 | ) | |
1420 | if any(path.startswith(prefix) for prefix in vfs_path_prefixes): |
|
1419 | if any(path.startswith(prefix) for prefix in vfs_path_prefixes): | |
1421 | if repo._currentlock(repo._lockref) is None: |
|
1420 | if repo._currentlock(repo._lockref) is None: | |
1422 | repo.ui.develwarn( |
|
1421 | repo.ui.develwarn( | |
1423 | b'write with no lock: "%s"' % path, |
|
1422 | b'write with no lock: "%s"' % path, | |
1424 | stacklevel=3, |
|
1423 | stacklevel=3, | |
1425 | config=b'check-locks', |
|
1424 | config=b'check-locks', | |
1426 | ) |
|
1425 | ) | |
1427 | elif repo._currentlock(repo._wlockref) is None: |
|
1426 | elif repo._currentlock(repo._wlockref) is None: | |
1428 | # rest of vfs files are covered by 'wlock' |
|
1427 | # rest of vfs files are covered by 'wlock' | |
1429 | # |
|
1428 | # | |
1430 | # exclude special files |
|
1429 | # exclude special files | |
1431 | for prefix in self._wlockfreeprefix: |
|
1430 | for prefix in self._wlockfreeprefix: | |
1432 | if path.startswith(prefix): |
|
1431 | if path.startswith(prefix): | |
1433 | return |
|
1432 | return | |
1434 | repo.ui.develwarn( |
|
1433 | repo.ui.develwarn( | |
1435 | b'write with no wlock: "%s"' % path, |
|
1434 | b'write with no wlock: "%s"' % path, | |
1436 | stacklevel=3, |
|
1435 | stacklevel=3, | |
1437 | config=b'check-locks', |
|
1436 | config=b'check-locks', | |
1438 | ) |
|
1437 | ) | |
1439 | return ret |
|
1438 | return ret | |
1440 |
|
1439 | |||
1441 | return checkvfs |
|
1440 | return checkvfs | |
1442 |
|
1441 | |||
1443 | def _getsvfsward(self, origfunc): |
|
1442 | def _getsvfsward(self, origfunc): | |
1444 | """build a ward for self.svfs""" |
|
1443 | """build a ward for self.svfs""" | |
1445 | rref = weakref.ref(self) |
|
1444 | rref = weakref.ref(self) | |
1446 |
|
1445 | |||
1447 | def checksvfs(path, mode=None): |
|
1446 | def checksvfs(path, mode=None): | |
1448 | ret = origfunc(path, mode=mode) |
|
1447 | ret = origfunc(path, mode=mode) | |
1449 | repo = rref() |
|
1448 | repo = rref() | |
1450 | if repo is None or not util.safehasattr(repo, b'_lockref'): |
|
1449 | if repo is None or not util.safehasattr(repo, b'_lockref'): | |
1451 | return |
|
1450 | return | |
1452 | if mode in (None, b'r', b'rb'): |
|
1451 | if mode in (None, b'r', b'rb'): | |
1453 | return |
|
1452 | return | |
1454 | if path.startswith(repo.sharedpath): |
|
1453 | if path.startswith(repo.sharedpath): | |
1455 | # truncate name relative to the repository (.hg) |
|
1454 | # truncate name relative to the repository (.hg) | |
1456 | path = path[len(repo.sharedpath) + 1 :] |
|
1455 | path = path[len(repo.sharedpath) + 1 :] | |
1457 | if repo._currentlock(repo._lockref) is None: |
|
1456 | if repo._currentlock(repo._lockref) is None: | |
1458 | repo.ui.develwarn( |
|
1457 | repo.ui.develwarn( | |
1459 | b'write with no lock: "%s"' % path, stacklevel=4 |
|
1458 | b'write with no lock: "%s"' % path, stacklevel=4 | |
1460 | ) |
|
1459 | ) | |
1461 | return ret |
|
1460 | return ret | |
1462 |
|
1461 | |||
1463 | return checksvfs |
|
1462 | return checksvfs | |
1464 |
|
1463 | |||
1465 | def close(self): |
|
1464 | def close(self): | |
1466 | self._writecaches() |
|
1465 | self._writecaches() | |
1467 |
|
1466 | |||
1468 | def _writecaches(self): |
|
1467 | def _writecaches(self): | |
1469 | if self._revbranchcache: |
|
1468 | if self._revbranchcache: | |
1470 | self._revbranchcache.write() |
|
1469 | self._revbranchcache.write() | |
1471 |
|
1470 | |||
1472 | def _restrictcapabilities(self, caps): |
|
1471 | def _restrictcapabilities(self, caps): | |
1473 | if self.ui.configbool(b'experimental', b'bundle2-advertise'): |
|
1472 | if self.ui.configbool(b'experimental', b'bundle2-advertise'): | |
1474 | caps = set(caps) |
|
1473 | caps = set(caps) | |
1475 | capsblob = bundle2.encodecaps( |
|
1474 | capsblob = bundle2.encodecaps( | |
1476 | bundle2.getrepocaps(self, role=b'client') |
|
1475 | bundle2.getrepocaps(self, role=b'client') | |
1477 | ) |
|
1476 | ) | |
1478 | caps.add(b'bundle2=' + urlreq.quote(capsblob)) |
|
1477 | caps.add(b'bundle2=' + urlreq.quote(capsblob)) | |
1479 | return caps |
|
1478 | return caps | |
1480 |
|
1479 | |||
1481 | # Don't cache auditor/nofsauditor, or you'll end up with reference cycle: |
|
1480 | # Don't cache auditor/nofsauditor, or you'll end up with reference cycle: | |
1482 | # self -> auditor -> self._checknested -> self |
|
1481 | # self -> auditor -> self._checknested -> self | |
1483 |
|
1482 | |||
1484 | @property |
|
1483 | @property | |
1485 | def auditor(self): |
|
1484 | def auditor(self): | |
1486 | # This is only used by context.workingctx.match in order to |
|
1485 | # This is only used by context.workingctx.match in order to | |
1487 | # detect files in subrepos. |
|
1486 | # detect files in subrepos. | |
1488 | return pathutil.pathauditor(self.root, callback=self._checknested) |
|
1487 | return pathutil.pathauditor(self.root, callback=self._checknested) | |
1489 |
|
1488 | |||
1490 | @property |
|
1489 | @property | |
1491 | def nofsauditor(self): |
|
1490 | def nofsauditor(self): | |
1492 | # This is only used by context.basectx.match in order to detect |
|
1491 | # This is only used by context.basectx.match in order to detect | |
1493 | # files in subrepos. |
|
1492 | # files in subrepos. | |
1494 | return pathutil.pathauditor( |
|
1493 | return pathutil.pathauditor( | |
1495 | self.root, callback=self._checknested, realfs=False, cached=True |
|
1494 | self.root, callback=self._checknested, realfs=False, cached=True | |
1496 | ) |
|
1495 | ) | |
1497 |
|
1496 | |||
1498 | def _checknested(self, path): |
|
1497 | def _checknested(self, path): | |
1499 | """Determine if path is a legal nested repository.""" |
|
1498 | """Determine if path is a legal nested repository.""" | |
1500 | if not path.startswith(self.root): |
|
1499 | if not path.startswith(self.root): | |
1501 | return False |
|
1500 | return False | |
1502 | subpath = path[len(self.root) + 1 :] |
|
1501 | subpath = path[len(self.root) + 1 :] | |
1503 | normsubpath = util.pconvert(subpath) |
|
1502 | normsubpath = util.pconvert(subpath) | |
1504 |
|
1503 | |||
1505 | # XXX: Checking against the current working copy is wrong in |
|
1504 | # XXX: Checking against the current working copy is wrong in | |
1506 | # the sense that it can reject things like |
|
1505 | # the sense that it can reject things like | |
1507 | # |
|
1506 | # | |
1508 | # $ hg cat -r 10 sub/x.txt |
|
1507 | # $ hg cat -r 10 sub/x.txt | |
1509 | # |
|
1508 | # | |
1510 | # if sub/ is no longer a subrepository in the working copy |
|
1509 | # if sub/ is no longer a subrepository in the working copy | |
1511 | # parent revision. |
|
1510 | # parent revision. | |
1512 | # |
|
1511 | # | |
1513 | # However, it can of course also allow things that would have |
|
1512 | # However, it can of course also allow things that would have | |
1514 | # been rejected before, such as the above cat command if sub/ |
|
1513 | # been rejected before, such as the above cat command if sub/ | |
1515 | # is a subrepository now, but was a normal directory before. |
|
1514 | # is a subrepository now, but was a normal directory before. | |
1516 | # The old path auditor would have rejected by mistake since it |
|
1515 | # The old path auditor would have rejected by mistake since it | |
1517 | # panics when it sees sub/.hg/. |
|
1516 | # panics when it sees sub/.hg/. | |
1518 | # |
|
1517 | # | |
1519 | # All in all, checking against the working copy seems sensible |
|
1518 | # All in all, checking against the working copy seems sensible | |
1520 | # since we want to prevent access to nested repositories on |
|
1519 | # since we want to prevent access to nested repositories on | |
1521 | # the filesystem *now*. |
|
1520 | # the filesystem *now*. | |
1522 | ctx = self[None] |
|
1521 | ctx = self[None] | |
1523 | parts = util.splitpath(subpath) |
|
1522 | parts = util.splitpath(subpath) | |
1524 | while parts: |
|
1523 | while parts: | |
1525 | prefix = b'/'.join(parts) |
|
1524 | prefix = b'/'.join(parts) | |
1526 | if prefix in ctx.substate: |
|
1525 | if prefix in ctx.substate: | |
1527 | if prefix == normsubpath: |
|
1526 | if prefix == normsubpath: | |
1528 | return True |
|
1527 | return True | |
1529 | else: |
|
1528 | else: | |
1530 | sub = ctx.sub(prefix) |
|
1529 | sub = ctx.sub(prefix) | |
1531 | return sub.checknested(subpath[len(prefix) + 1 :]) |
|
1530 | return sub.checknested(subpath[len(prefix) + 1 :]) | |
1532 | else: |
|
1531 | else: | |
1533 | parts.pop() |
|
1532 | parts.pop() | |
1534 | return False |
|
1533 | return False | |
1535 |
|
1534 | |||
1536 | def peer(self): |
|
1535 | def peer(self): | |
1537 | return localpeer(self) # not cached to avoid reference cycle |
|
1536 | return localpeer(self) # not cached to avoid reference cycle | |
1538 |
|
1537 | |||
1539 | def unfiltered(self): |
|
1538 | def unfiltered(self): | |
1540 | """Return unfiltered version of the repository |
|
1539 | """Return unfiltered version of the repository | |
1541 |
|
1540 | |||
1542 | Intended to be overwritten by filtered repo.""" |
|
1541 | Intended to be overwritten by filtered repo.""" | |
1543 | return self |
|
1542 | return self | |
1544 |
|
1543 | |||
1545 | def filtered(self, name, visibilityexceptions=None): |
|
1544 | def filtered(self, name, visibilityexceptions=None): | |
1546 | """Return a filtered version of a repository |
|
1545 | """Return a filtered version of a repository | |
1547 |
|
1546 | |||
1548 | The `name` parameter is the identifier of the requested view. This |
|
1547 | The `name` parameter is the identifier of the requested view. This | |
1549 | will return a repoview object set "exactly" to the specified view. |
|
1548 | will return a repoview object set "exactly" to the specified view. | |
1550 |
|
1549 | |||
1551 | This function does not apply recursive filtering to a repository. For |
|
1550 | This function does not apply recursive filtering to a repository. For | |
1552 | example calling `repo.filtered("served")` will return a repoview using |
|
1551 | example calling `repo.filtered("served")` will return a repoview using | |
1553 | the "served" view, regardless of the initial view used by `repo`. |
|
1552 | the "served" view, regardless of the initial view used by `repo`. | |
1554 |
|
1553 | |||
1555 | In other word, there is always only one level of `repoview` "filtering". |
|
1554 | In other word, there is always only one level of `repoview` "filtering". | |
1556 | """ |
|
1555 | """ | |
1557 | if self._extrafilterid is not None and b'%' not in name: |
|
1556 | if self._extrafilterid is not None and b'%' not in name: | |
1558 | name = name + b'%' + self._extrafilterid |
|
1557 | name = name + b'%' + self._extrafilterid | |
1559 |
|
1558 | |||
1560 | cls = repoview.newtype(self.unfiltered().__class__) |
|
1559 | cls = repoview.newtype(self.unfiltered().__class__) | |
1561 | return cls(self, name, visibilityexceptions) |
|
1560 | return cls(self, name, visibilityexceptions) | |
1562 |
|
1561 | |||
1563 | @mixedrepostorecache( |
|
1562 | @mixedrepostorecache( | |
1564 | (b'bookmarks', b'plain'), |
|
1563 | (b'bookmarks', b'plain'), | |
1565 | (b'bookmarks.current', b'plain'), |
|
1564 | (b'bookmarks.current', b'plain'), | |
1566 | (b'bookmarks', b''), |
|
1565 | (b'bookmarks', b''), | |
1567 | (b'00changelog.i', b''), |
|
1566 | (b'00changelog.i', b''), | |
1568 | ) |
|
1567 | ) | |
1569 | def _bookmarks(self): |
|
1568 | def _bookmarks(self): | |
1570 | # Since the multiple files involved in the transaction cannot be |
|
1569 | # Since the multiple files involved in the transaction cannot be | |
1571 | # written atomically (with current repository format), there is a race |
|
1570 | # written atomically (with current repository format), there is a race | |
1572 | # condition here. |
|
1571 | # condition here. | |
1573 | # |
|
1572 | # | |
1574 | # 1) changelog content A is read |
|
1573 | # 1) changelog content A is read | |
1575 | # 2) outside transaction update changelog to content B |
|
1574 | # 2) outside transaction update changelog to content B | |
1576 | # 3) outside transaction update bookmark file referring to content B |
|
1575 | # 3) outside transaction update bookmark file referring to content B | |
1577 | # 4) bookmarks file content is read and filtered against changelog-A |
|
1576 | # 4) bookmarks file content is read and filtered against changelog-A | |
1578 | # |
|
1577 | # | |
1579 | # When this happens, bookmarks against nodes missing from A are dropped. |
|
1578 | # When this happens, bookmarks against nodes missing from A are dropped. | |
1580 | # |
|
1579 | # | |
1581 | # Having this happening during read is not great, but it become worse |
|
1580 | # Having this happening during read is not great, but it become worse | |
1582 | # when this happen during write because the bookmarks to the "unknown" |
|
1581 | # when this happen during write because the bookmarks to the "unknown" | |
1583 | # nodes will be dropped for good. However, writes happen within locks. |
|
1582 | # nodes will be dropped for good. However, writes happen within locks. | |
1584 | # This locking makes it possible to have a race free consistent read. |
|
1583 | # This locking makes it possible to have a race free consistent read. | |
1585 | # For this purpose data read from disc before locking are |
|
1584 | # For this purpose data read from disc before locking are | |
1586 | # "invalidated" right after the locks are taken. This invalidations are |
|
1585 | # "invalidated" right after the locks are taken. This invalidations are | |
1587 | # "light", the `filecache` mechanism keep the data in memory and will |
|
1586 | # "light", the `filecache` mechanism keep the data in memory and will | |
1588 | # reuse them if the underlying files did not changed. Not parsing the |
|
1587 | # reuse them if the underlying files did not changed. Not parsing the | |
1589 | # same data multiple times helps performances. |
|
1588 | # same data multiple times helps performances. | |
1590 | # |
|
1589 | # | |
1591 | # Unfortunately in the case describe above, the files tracked by the |
|
1590 | # Unfortunately in the case describe above, the files tracked by the | |
1592 | # bookmarks file cache might not have changed, but the in-memory |
|
1591 | # bookmarks file cache might not have changed, but the in-memory | |
1593 | # content is still "wrong" because we used an older changelog content |
|
1592 | # content is still "wrong" because we used an older changelog content | |
1594 | # to process the on-disk data. So after locking, the changelog would be |
|
1593 | # to process the on-disk data. So after locking, the changelog would be | |
1595 | # refreshed but `_bookmarks` would be preserved. |
|
1594 | # refreshed but `_bookmarks` would be preserved. | |
1596 | # Adding `00changelog.i` to the list of tracked file is not |
|
1595 | # Adding `00changelog.i` to the list of tracked file is not | |
1597 | # enough, because at the time we build the content for `_bookmarks` in |
|
1596 | # enough, because at the time we build the content for `_bookmarks` in | |
1598 | # (4), the changelog file has already diverged from the content used |
|
1597 | # (4), the changelog file has already diverged from the content used | |
1599 | # for loading `changelog` in (1) |
|
1598 | # for loading `changelog` in (1) | |
1600 | # |
|
1599 | # | |
1601 | # To prevent the issue, we force the changelog to be explicitly |
|
1600 | # To prevent the issue, we force the changelog to be explicitly | |
1602 | # reloaded while computing `_bookmarks`. The data race can still happen |
|
1601 | # reloaded while computing `_bookmarks`. The data race can still happen | |
1603 | # without the lock (with a narrower window), but it would no longer go |
|
1602 | # without the lock (with a narrower window), but it would no longer go | |
1604 | # undetected during the lock time refresh. |
|
1603 | # undetected during the lock time refresh. | |
1605 | # |
|
1604 | # | |
1606 | # The new schedule is as follow |
|
1605 | # The new schedule is as follow | |
1607 | # |
|
1606 | # | |
1608 | # 1) filecache logic detect that `_bookmarks` needs to be computed |
|
1607 | # 1) filecache logic detect that `_bookmarks` needs to be computed | |
1609 | # 2) cachestat for `bookmarks` and `changelog` are captured (for book) |
|
1608 | # 2) cachestat for `bookmarks` and `changelog` are captured (for book) | |
1610 | # 3) We force `changelog` filecache to be tested |
|
1609 | # 3) We force `changelog` filecache to be tested | |
1611 | # 4) cachestat for `changelog` are captured (for changelog) |
|
1610 | # 4) cachestat for `changelog` are captured (for changelog) | |
1612 | # 5) `_bookmarks` is computed and cached |
|
1611 | # 5) `_bookmarks` is computed and cached | |
1613 | # |
|
1612 | # | |
1614 | # The step in (3) ensure we have a changelog at least as recent as the |
|
1613 | # The step in (3) ensure we have a changelog at least as recent as the | |
1615 | # cache stat computed in (1). As a result at locking time: |
|
1614 | # cache stat computed in (1). As a result at locking time: | |
1616 | # * if the changelog did not changed since (1) -> we can reuse the data |
|
1615 | # * if the changelog did not changed since (1) -> we can reuse the data | |
1617 | # * otherwise -> the bookmarks get refreshed. |
|
1616 | # * otherwise -> the bookmarks get refreshed. | |
1618 | self._refreshchangelog() |
|
1617 | self._refreshchangelog() | |
1619 | return bookmarks.bmstore(self) |
|
1618 | return bookmarks.bmstore(self) | |
1620 |
|
1619 | |||
1621 | def _refreshchangelog(self): |
|
1620 | def _refreshchangelog(self): | |
1622 | """make sure the in memory changelog match the on-disk one""" |
|
1621 | """make sure the in memory changelog match the on-disk one""" | |
1623 | if 'changelog' in vars(self) and self.currenttransaction() is None: |
|
1622 | if 'changelog' in vars(self) and self.currenttransaction() is None: | |
1624 | del self.changelog |
|
1623 | del self.changelog | |
1625 |
|
1624 | |||
1626 | @property |
|
1625 | @property | |
1627 | def _activebookmark(self): |
|
1626 | def _activebookmark(self): | |
1628 | return self._bookmarks.active |
|
1627 | return self._bookmarks.active | |
1629 |
|
1628 | |||
1630 | # _phasesets depend on changelog. what we need is to call |
|
1629 | # _phasesets depend on changelog. what we need is to call | |
1631 | # _phasecache.invalidate() if '00changelog.i' was changed, but it |
|
1630 | # _phasecache.invalidate() if '00changelog.i' was changed, but it | |
1632 | # can't be easily expressed in filecache mechanism. |
|
1631 | # can't be easily expressed in filecache mechanism. | |
1633 | @storecache(b'phaseroots', b'00changelog.i') |
|
1632 | @storecache(b'phaseroots', b'00changelog.i') | |
1634 | def _phasecache(self): |
|
1633 | def _phasecache(self): | |
1635 | return phases.phasecache(self, self._phasedefaults) |
|
1634 | return phases.phasecache(self, self._phasedefaults) | |
1636 |
|
1635 | |||
1637 | @storecache(b'obsstore') |
|
1636 | @storecache(b'obsstore') | |
1638 | def obsstore(self): |
|
1637 | def obsstore(self): | |
1639 | return obsolete.makestore(self.ui, self) |
|
1638 | return obsolete.makestore(self.ui, self) | |
1640 |
|
1639 | |||
1641 | @storecache(b'00changelog.i') |
|
1640 | @storecache(b'00changelog.i') | |
1642 | def changelog(self): |
|
1641 | def changelog(self): | |
1643 | # load dirstate before changelog to avoid race see issue6303 |
|
1642 | # load dirstate before changelog to avoid race see issue6303 | |
1644 | self.dirstate.prefetch_parents() |
|
1643 | self.dirstate.prefetch_parents() | |
1645 | return self.store.changelog( |
|
1644 | return self.store.changelog( | |
1646 | txnutil.mayhavepending(self.root), |
|
1645 | txnutil.mayhavepending(self.root), | |
1647 | concurrencychecker=revlogchecker.get_checker(self.ui, b'changelog'), |
|
1646 | concurrencychecker=revlogchecker.get_checker(self.ui, b'changelog'), | |
1648 | ) |
|
1647 | ) | |
1649 |
|
1648 | |||
1650 | @storecache(b'00manifest.i') |
|
1649 | @storecache(b'00manifest.i') | |
1651 | def manifestlog(self): |
|
1650 | def manifestlog(self): | |
1652 | return self.store.manifestlog(self, self._storenarrowmatch) |
|
1651 | return self.store.manifestlog(self, self._storenarrowmatch) | |
1653 |
|
1652 | |||
1654 | @repofilecache(b'dirstate') |
|
1653 | @repofilecache(b'dirstate') | |
1655 | def dirstate(self): |
|
1654 | def dirstate(self): | |
1656 | return self._makedirstate() |
|
1655 | return self._makedirstate() | |
1657 |
|
1656 | |||
1658 | def _makedirstate(self): |
|
1657 | def _makedirstate(self): | |
1659 | """Extension point for wrapping the dirstate per-repo.""" |
|
1658 | """Extension point for wrapping the dirstate per-repo.""" | |
1660 | sparsematchfn = lambda: sparse.matcher(self) |
|
1659 | sparsematchfn = lambda: sparse.matcher(self) | |
1661 |
|
1660 | |||
1662 | return dirstate.dirstate( |
|
1661 | return dirstate.dirstate( | |
1663 | self.vfs, self.ui, self.root, self._dirstatevalidate, sparsematchfn |
|
1662 | self.vfs, self.ui, self.root, self._dirstatevalidate, sparsematchfn | |
1664 | ) |
|
1663 | ) | |
1665 |
|
1664 | |||
1666 | def _dirstatevalidate(self, node): |
|
1665 | def _dirstatevalidate(self, node): | |
1667 | try: |
|
1666 | try: | |
1668 | self.changelog.rev(node) |
|
1667 | self.changelog.rev(node) | |
1669 | return node |
|
1668 | return node | |
1670 | except error.LookupError: |
|
1669 | except error.LookupError: | |
1671 | if not self._dirstatevalidatewarned: |
|
1670 | if not self._dirstatevalidatewarned: | |
1672 | self._dirstatevalidatewarned = True |
|
1671 | self._dirstatevalidatewarned = True | |
1673 | self.ui.warn( |
|
1672 | self.ui.warn( | |
1674 | _(b"warning: ignoring unknown working parent %s!\n") |
|
1673 | _(b"warning: ignoring unknown working parent %s!\n") | |
1675 | % short(node) |
|
1674 | % short(node) | |
1676 | ) |
|
1675 | ) | |
1677 | return nullid |
|
1676 | return nullid | |
1678 |
|
1677 | |||
1679 | @storecache(narrowspec.FILENAME) |
|
1678 | @storecache(narrowspec.FILENAME) | |
1680 | def narrowpats(self): |
|
1679 | def narrowpats(self): | |
1681 | """matcher patterns for this repository's narrowspec |
|
1680 | """matcher patterns for this repository's narrowspec | |
1682 |
|
1681 | |||
1683 | A tuple of (includes, excludes). |
|
1682 | A tuple of (includes, excludes). | |
1684 | """ |
|
1683 | """ | |
1685 | return narrowspec.load(self) |
|
1684 | return narrowspec.load(self) | |
1686 |
|
1685 | |||
1687 | @storecache(narrowspec.FILENAME) |
|
1686 | @storecache(narrowspec.FILENAME) | |
1688 | def _storenarrowmatch(self): |
|
1687 | def _storenarrowmatch(self): | |
1689 | if requirementsmod.NARROW_REQUIREMENT not in self.requirements: |
|
1688 | if requirementsmod.NARROW_REQUIREMENT not in self.requirements: | |
1690 | return matchmod.always() |
|
1689 | return matchmod.always() | |
1691 | include, exclude = self.narrowpats |
|
1690 | include, exclude = self.narrowpats | |
1692 | return narrowspec.match(self.root, include=include, exclude=exclude) |
|
1691 | return narrowspec.match(self.root, include=include, exclude=exclude) | |
1693 |
|
1692 | |||
1694 | @storecache(narrowspec.FILENAME) |
|
1693 | @storecache(narrowspec.FILENAME) | |
1695 | def _narrowmatch(self): |
|
1694 | def _narrowmatch(self): | |
1696 | if requirementsmod.NARROW_REQUIREMENT not in self.requirements: |
|
1695 | if requirementsmod.NARROW_REQUIREMENT not in self.requirements: | |
1697 | return matchmod.always() |
|
1696 | return matchmod.always() | |
1698 | narrowspec.checkworkingcopynarrowspec(self) |
|
1697 | narrowspec.checkworkingcopynarrowspec(self) | |
1699 | include, exclude = self.narrowpats |
|
1698 | include, exclude = self.narrowpats | |
1700 | return narrowspec.match(self.root, include=include, exclude=exclude) |
|
1699 | return narrowspec.match(self.root, include=include, exclude=exclude) | |
1701 |
|
1700 | |||
1702 | def narrowmatch(self, match=None, includeexact=False): |
|
1701 | def narrowmatch(self, match=None, includeexact=False): | |
1703 | """matcher corresponding the the repo's narrowspec |
|
1702 | """matcher corresponding the the repo's narrowspec | |
1704 |
|
1703 | |||
1705 | If `match` is given, then that will be intersected with the narrow |
|
1704 | If `match` is given, then that will be intersected with the narrow | |
1706 | matcher. |
|
1705 | matcher. | |
1707 |
|
1706 | |||
1708 | If `includeexact` is True, then any exact matches from `match` will |
|
1707 | If `includeexact` is True, then any exact matches from `match` will | |
1709 | be included even if they're outside the narrowspec. |
|
1708 | be included even if they're outside the narrowspec. | |
1710 | """ |
|
1709 | """ | |
1711 | if match: |
|
1710 | if match: | |
1712 | if includeexact and not self._narrowmatch.always(): |
|
1711 | if includeexact and not self._narrowmatch.always(): | |
1713 | # do not exclude explicitly-specified paths so that they can |
|
1712 | # do not exclude explicitly-specified paths so that they can | |
1714 | # be warned later on |
|
1713 | # be warned later on | |
1715 | em = matchmod.exact(match.files()) |
|
1714 | em = matchmod.exact(match.files()) | |
1716 | nm = matchmod.unionmatcher([self._narrowmatch, em]) |
|
1715 | nm = matchmod.unionmatcher([self._narrowmatch, em]) | |
1717 | return matchmod.intersectmatchers(match, nm) |
|
1716 | return matchmod.intersectmatchers(match, nm) | |
1718 | return matchmod.intersectmatchers(match, self._narrowmatch) |
|
1717 | return matchmod.intersectmatchers(match, self._narrowmatch) | |
1719 | return self._narrowmatch |
|
1718 | return self._narrowmatch | |
1720 |
|
1719 | |||
1721 | def setnarrowpats(self, newincludes, newexcludes): |
|
1720 | def setnarrowpats(self, newincludes, newexcludes): | |
1722 | narrowspec.save(self, newincludes, newexcludes) |
|
1721 | narrowspec.save(self, newincludes, newexcludes) | |
1723 | self.invalidate(clearfilecache=True) |
|
1722 | self.invalidate(clearfilecache=True) | |
1724 |
|
1723 | |||
1725 | @unfilteredpropertycache |
|
1724 | @unfilteredpropertycache | |
1726 | def _quick_access_changeid_null(self): |
|
1725 | def _quick_access_changeid_null(self): | |
1727 | return { |
|
1726 | return { | |
1728 | b'null': (nullrev, nullid), |
|
1727 | b'null': (nullrev, nullid), | |
1729 | nullrev: (nullrev, nullid), |
|
1728 | nullrev: (nullrev, nullid), | |
1730 | nullid: (nullrev, nullid), |
|
1729 | nullid: (nullrev, nullid), | |
1731 | } |
|
1730 | } | |
1732 |
|
1731 | |||
1733 | @unfilteredpropertycache |
|
1732 | @unfilteredpropertycache | |
1734 | def _quick_access_changeid_wc(self): |
|
1733 | def _quick_access_changeid_wc(self): | |
1735 | # also fast path access to the working copy parents |
|
1734 | # also fast path access to the working copy parents | |
1736 | # however, only do it for filter that ensure wc is visible. |
|
1735 | # however, only do it for filter that ensure wc is visible. | |
1737 | quick = self._quick_access_changeid_null.copy() |
|
1736 | quick = self._quick_access_changeid_null.copy() | |
1738 | cl = self.unfiltered().changelog |
|
1737 | cl = self.unfiltered().changelog | |
1739 | for node in self.dirstate.parents(): |
|
1738 | for node in self.dirstate.parents(): | |
1740 | if node == nullid: |
|
1739 | if node == nullid: | |
1741 | continue |
|
1740 | continue | |
1742 | rev = cl.index.get_rev(node) |
|
1741 | rev = cl.index.get_rev(node) | |
1743 | if rev is None: |
|
1742 | if rev is None: | |
1744 | # unknown working copy parent case: |
|
1743 | # unknown working copy parent case: | |
1745 | # |
|
1744 | # | |
1746 | # skip the fast path and let higher code deal with it |
|
1745 | # skip the fast path and let higher code deal with it | |
1747 | continue |
|
1746 | continue | |
1748 | pair = (rev, node) |
|
1747 | pair = (rev, node) | |
1749 | quick[rev] = pair |
|
1748 | quick[rev] = pair | |
1750 | quick[node] = pair |
|
1749 | quick[node] = pair | |
1751 | # also add the parents of the parents |
|
1750 | # also add the parents of the parents | |
1752 | for r in cl.parentrevs(rev): |
|
1751 | for r in cl.parentrevs(rev): | |
1753 | if r == nullrev: |
|
1752 | if r == nullrev: | |
1754 | continue |
|
1753 | continue | |
1755 | n = cl.node(r) |
|
1754 | n = cl.node(r) | |
1756 | pair = (r, n) |
|
1755 | pair = (r, n) | |
1757 | quick[r] = pair |
|
1756 | quick[r] = pair | |
1758 | quick[n] = pair |
|
1757 | quick[n] = pair | |
1759 | p1node = self.dirstate.p1() |
|
1758 | p1node = self.dirstate.p1() | |
1760 | if p1node != nullid: |
|
1759 | if p1node != nullid: | |
1761 | quick[b'.'] = quick[p1node] |
|
1760 | quick[b'.'] = quick[p1node] | |
1762 | return quick |
|
1761 | return quick | |
1763 |
|
1762 | |||
1764 | @unfilteredmethod |
|
1763 | @unfilteredmethod | |
1765 | def _quick_access_changeid_invalidate(self): |
|
1764 | def _quick_access_changeid_invalidate(self): | |
1766 | if '_quick_access_changeid_wc' in vars(self): |
|
1765 | if '_quick_access_changeid_wc' in vars(self): | |
1767 | del self.__dict__['_quick_access_changeid_wc'] |
|
1766 | del self.__dict__['_quick_access_changeid_wc'] | |
1768 |
|
1767 | |||
1769 | @property |
|
1768 | @property | |
1770 | def _quick_access_changeid(self): |
|
1769 | def _quick_access_changeid(self): | |
1771 | """an helper dictionnary for __getitem__ calls |
|
1770 | """an helper dictionnary for __getitem__ calls | |
1772 |
|
1771 | |||
1773 | This contains a list of symbol we can recognise right away without |
|
1772 | This contains a list of symbol we can recognise right away without | |
1774 | further processing. |
|
1773 | further processing. | |
1775 | """ |
|
1774 | """ | |
1776 | if self.filtername in repoview.filter_has_wc: |
|
1775 | if self.filtername in repoview.filter_has_wc: | |
1777 | return self._quick_access_changeid_wc |
|
1776 | return self._quick_access_changeid_wc | |
1778 | return self._quick_access_changeid_null |
|
1777 | return self._quick_access_changeid_null | |
1779 |
|
1778 | |||
1780 | def __getitem__(self, changeid): |
|
1779 | def __getitem__(self, changeid): | |
1781 | # dealing with special cases |
|
1780 | # dealing with special cases | |
1782 | if changeid is None: |
|
1781 | if changeid is None: | |
1783 | return context.workingctx(self) |
|
1782 | return context.workingctx(self) | |
1784 | if isinstance(changeid, context.basectx): |
|
1783 | if isinstance(changeid, context.basectx): | |
1785 | return changeid |
|
1784 | return changeid | |
1786 |
|
1785 | |||
1787 | # dealing with multiple revisions |
|
1786 | # dealing with multiple revisions | |
1788 | if isinstance(changeid, slice): |
|
1787 | if isinstance(changeid, slice): | |
1789 | # wdirrev isn't contiguous so the slice shouldn't include it |
|
1788 | # wdirrev isn't contiguous so the slice shouldn't include it | |
1790 | return [ |
|
1789 | return [ | |
1791 | self[i] |
|
1790 | self[i] | |
1792 | for i in pycompat.xrange(*changeid.indices(len(self))) |
|
1791 | for i in pycompat.xrange(*changeid.indices(len(self))) | |
1793 | if i not in self.changelog.filteredrevs |
|
1792 | if i not in self.changelog.filteredrevs | |
1794 | ] |
|
1793 | ] | |
1795 |
|
1794 | |||
1796 | # dealing with some special values |
|
1795 | # dealing with some special values | |
1797 | quick_access = self._quick_access_changeid.get(changeid) |
|
1796 | quick_access = self._quick_access_changeid.get(changeid) | |
1798 | if quick_access is not None: |
|
1797 | if quick_access is not None: | |
1799 | rev, node = quick_access |
|
1798 | rev, node = quick_access | |
1800 | return context.changectx(self, rev, node, maybe_filtered=False) |
|
1799 | return context.changectx(self, rev, node, maybe_filtered=False) | |
1801 | if changeid == b'tip': |
|
1800 | if changeid == b'tip': | |
1802 | node = self.changelog.tip() |
|
1801 | node = self.changelog.tip() | |
1803 | rev = self.changelog.rev(node) |
|
1802 | rev = self.changelog.rev(node) | |
1804 | return context.changectx(self, rev, node) |
|
1803 | return context.changectx(self, rev, node) | |
1805 |
|
1804 | |||
1806 | # dealing with arbitrary values |
|
1805 | # dealing with arbitrary values | |
1807 | try: |
|
1806 | try: | |
1808 | if isinstance(changeid, int): |
|
1807 | if isinstance(changeid, int): | |
1809 | node = self.changelog.node(changeid) |
|
1808 | node = self.changelog.node(changeid) | |
1810 | rev = changeid |
|
1809 | rev = changeid | |
1811 | elif changeid == b'.': |
|
1810 | elif changeid == b'.': | |
1812 | # this is a hack to delay/avoid loading obsmarkers |
|
1811 | # this is a hack to delay/avoid loading obsmarkers | |
1813 | # when we know that '.' won't be hidden |
|
1812 | # when we know that '.' won't be hidden | |
1814 | node = self.dirstate.p1() |
|
1813 | node = self.dirstate.p1() | |
1815 | rev = self.unfiltered().changelog.rev(node) |
|
1814 | rev = self.unfiltered().changelog.rev(node) | |
1816 | elif len(changeid) == 20: |
|
1815 | elif len(changeid) == 20: | |
1817 | try: |
|
1816 | try: | |
1818 | node = changeid |
|
1817 | node = changeid | |
1819 | rev = self.changelog.rev(changeid) |
|
1818 | rev = self.changelog.rev(changeid) | |
1820 | except error.FilteredLookupError: |
|
1819 | except error.FilteredLookupError: | |
1821 | changeid = hex(changeid) # for the error message |
|
1820 | changeid = hex(changeid) # for the error message | |
1822 | raise |
|
1821 | raise | |
1823 | except LookupError: |
|
1822 | except LookupError: | |
1824 | # check if it might have come from damaged dirstate |
|
1823 | # check if it might have come from damaged dirstate | |
1825 | # |
|
1824 | # | |
1826 | # XXX we could avoid the unfiltered if we had a recognizable |
|
1825 | # XXX we could avoid the unfiltered if we had a recognizable | |
1827 | # exception for filtered changeset access |
|
1826 | # exception for filtered changeset access | |
1828 | if ( |
|
1827 | if ( | |
1829 | self.local() |
|
1828 | self.local() | |
1830 | and changeid in self.unfiltered().dirstate.parents() |
|
1829 | and changeid in self.unfiltered().dirstate.parents() | |
1831 | ): |
|
1830 | ): | |
1832 | msg = _(b"working directory has unknown parent '%s'!") |
|
1831 | msg = _(b"working directory has unknown parent '%s'!") | |
1833 | raise error.Abort(msg % short(changeid)) |
|
1832 | raise error.Abort(msg % short(changeid)) | |
1834 | changeid = hex(changeid) # for the error message |
|
1833 | changeid = hex(changeid) # for the error message | |
1835 | raise |
|
1834 | raise | |
1836 |
|
1835 | |||
1837 | elif len(changeid) == 40: |
|
1836 | elif len(changeid) == 40: | |
1838 | node = bin(changeid) |
|
1837 | node = bin(changeid) | |
1839 | rev = self.changelog.rev(node) |
|
1838 | rev = self.changelog.rev(node) | |
1840 | else: |
|
1839 | else: | |
1841 | raise error.ProgrammingError( |
|
1840 | raise error.ProgrammingError( | |
1842 | b"unsupported changeid '%s' of type %s" |
|
1841 | b"unsupported changeid '%s' of type %s" | |
1843 | % (changeid, pycompat.bytestr(type(changeid))) |
|
1842 | % (changeid, pycompat.bytestr(type(changeid))) | |
1844 | ) |
|
1843 | ) | |
1845 |
|
1844 | |||
1846 | return context.changectx(self, rev, node) |
|
1845 | return context.changectx(self, rev, node) | |
1847 |
|
1846 | |||
1848 | except (error.FilteredIndexError, error.FilteredLookupError): |
|
1847 | except (error.FilteredIndexError, error.FilteredLookupError): | |
1849 | raise error.FilteredRepoLookupError( |
|
1848 | raise error.FilteredRepoLookupError( | |
1850 | _(b"filtered revision '%s'") % pycompat.bytestr(changeid) |
|
1849 | _(b"filtered revision '%s'") % pycompat.bytestr(changeid) | |
1851 | ) |
|
1850 | ) | |
1852 | except (IndexError, LookupError): |
|
1851 | except (IndexError, LookupError): | |
1853 | raise error.RepoLookupError( |
|
1852 | raise error.RepoLookupError( | |
1854 | _(b"unknown revision '%s'") % pycompat.bytestr(changeid) |
|
1853 | _(b"unknown revision '%s'") % pycompat.bytestr(changeid) | |
1855 | ) |
|
1854 | ) | |
1856 | except error.WdirUnsupported: |
|
1855 | except error.WdirUnsupported: | |
1857 | return context.workingctx(self) |
|
1856 | return context.workingctx(self) | |
1858 |
|
1857 | |||
1859 | def __contains__(self, changeid): |
|
1858 | def __contains__(self, changeid): | |
1860 | """True if the given changeid exists""" |
|
1859 | """True if the given changeid exists""" | |
1861 | try: |
|
1860 | try: | |
1862 | self[changeid] |
|
1861 | self[changeid] | |
1863 | return True |
|
1862 | return True | |
1864 | except error.RepoLookupError: |
|
1863 | except error.RepoLookupError: | |
1865 | return False |
|
1864 | return False | |
1866 |
|
1865 | |||
1867 | def __nonzero__(self): |
|
1866 | def __nonzero__(self): | |
1868 | return True |
|
1867 | return True | |
1869 |
|
1868 | |||
1870 | __bool__ = __nonzero__ |
|
1869 | __bool__ = __nonzero__ | |
1871 |
|
1870 | |||
1872 | def __len__(self): |
|
1871 | def __len__(self): | |
1873 | # no need to pay the cost of repoview.changelog |
|
1872 | # no need to pay the cost of repoview.changelog | |
1874 | unfi = self.unfiltered() |
|
1873 | unfi = self.unfiltered() | |
1875 | return len(unfi.changelog) |
|
1874 | return len(unfi.changelog) | |
1876 |
|
1875 | |||
1877 | def __iter__(self): |
|
1876 | def __iter__(self): | |
1878 | return iter(self.changelog) |
|
1877 | return iter(self.changelog) | |
1879 |
|
1878 | |||
1880 | def revs(self, expr, *args): |
|
1879 | def revs(self, expr, *args): | |
1881 | """Find revisions matching a revset. |
|
1880 | """Find revisions matching a revset. | |
1882 |
|
1881 | |||
1883 | The revset is specified as a string ``expr`` that may contain |
|
1882 | The revset is specified as a string ``expr`` that may contain | |
1884 | %-formatting to escape certain types. See ``revsetlang.formatspec``. |
|
1883 | %-formatting to escape certain types. See ``revsetlang.formatspec``. | |
1885 |
|
1884 | |||
1886 | Revset aliases from the configuration are not expanded. To expand |
|
1885 | Revset aliases from the configuration are not expanded. To expand | |
1887 | user aliases, consider calling ``scmutil.revrange()`` or |
|
1886 | user aliases, consider calling ``scmutil.revrange()`` or | |
1888 | ``repo.anyrevs([expr], user=True)``. |
|
1887 | ``repo.anyrevs([expr], user=True)``. | |
1889 |
|
1888 | |||
1890 | Returns a smartset.abstractsmartset, which is a list-like interface |
|
1889 | Returns a smartset.abstractsmartset, which is a list-like interface | |
1891 | that contains integer revisions. |
|
1890 | that contains integer revisions. | |
1892 | """ |
|
1891 | """ | |
1893 | tree = revsetlang.spectree(expr, *args) |
|
1892 | tree = revsetlang.spectree(expr, *args) | |
1894 | return revset.makematcher(tree)(self) |
|
1893 | return revset.makematcher(tree)(self) | |
1895 |
|
1894 | |||
1896 | def set(self, expr, *args): |
|
1895 | def set(self, expr, *args): | |
1897 | """Find revisions matching a revset and emit changectx instances. |
|
1896 | """Find revisions matching a revset and emit changectx instances. | |
1898 |
|
1897 | |||
1899 | This is a convenience wrapper around ``revs()`` that iterates the |
|
1898 | This is a convenience wrapper around ``revs()`` that iterates the | |
1900 | result and is a generator of changectx instances. |
|
1899 | result and is a generator of changectx instances. | |
1901 |
|
1900 | |||
1902 | Revset aliases from the configuration are not expanded. To expand |
|
1901 | Revset aliases from the configuration are not expanded. To expand | |
1903 | user aliases, consider calling ``scmutil.revrange()``. |
|
1902 | user aliases, consider calling ``scmutil.revrange()``. | |
1904 | """ |
|
1903 | """ | |
1905 | for r in self.revs(expr, *args): |
|
1904 | for r in self.revs(expr, *args): | |
1906 | yield self[r] |
|
1905 | yield self[r] | |
1907 |
|
1906 | |||
1908 | def anyrevs(self, specs, user=False, localalias=None): |
|
1907 | def anyrevs(self, specs, user=False, localalias=None): | |
1909 | """Find revisions matching one of the given revsets. |
|
1908 | """Find revisions matching one of the given revsets. | |
1910 |
|
1909 | |||
1911 | Revset aliases from the configuration are not expanded by default. To |
|
1910 | Revset aliases from the configuration are not expanded by default. To | |
1912 | expand user aliases, specify ``user=True``. To provide some local |
|
1911 | expand user aliases, specify ``user=True``. To provide some local | |
1913 | definitions overriding user aliases, set ``localalias`` to |
|
1912 | definitions overriding user aliases, set ``localalias`` to | |
1914 | ``{name: definitionstring}``. |
|
1913 | ``{name: definitionstring}``. | |
1915 | """ |
|
1914 | """ | |
1916 | if specs == [b'null']: |
|
1915 | if specs == [b'null']: | |
1917 | return revset.baseset([nullrev]) |
|
1916 | return revset.baseset([nullrev]) | |
1918 | if specs == [b'.']: |
|
1917 | if specs == [b'.']: | |
1919 | quick_data = self._quick_access_changeid.get(b'.') |
|
1918 | quick_data = self._quick_access_changeid.get(b'.') | |
1920 | if quick_data is not None: |
|
1919 | if quick_data is not None: | |
1921 | return revset.baseset([quick_data[0]]) |
|
1920 | return revset.baseset([quick_data[0]]) | |
1922 | if user: |
|
1921 | if user: | |
1923 | m = revset.matchany( |
|
1922 | m = revset.matchany( | |
1924 | self.ui, |
|
1923 | self.ui, | |
1925 | specs, |
|
1924 | specs, | |
1926 | lookup=revset.lookupfn(self), |
|
1925 | lookup=revset.lookupfn(self), | |
1927 | localalias=localalias, |
|
1926 | localalias=localalias, | |
1928 | ) |
|
1927 | ) | |
1929 | else: |
|
1928 | else: | |
1930 | m = revset.matchany(None, specs, localalias=localalias) |
|
1929 | m = revset.matchany(None, specs, localalias=localalias) | |
1931 | return m(self) |
|
1930 | return m(self) | |
1932 |
|
1931 | |||
1933 | def url(self): |
|
1932 | def url(self): | |
1934 | return b'file:' + self.root |
|
1933 | return b'file:' + self.root | |
1935 |
|
1934 | |||
1936 | def hook(self, name, throw=False, **args): |
|
1935 | def hook(self, name, throw=False, **args): | |
1937 | """Call a hook, passing this repo instance. |
|
1936 | """Call a hook, passing this repo instance. | |
1938 |
|
1937 | |||
1939 | This a convenience method to aid invoking hooks. Extensions likely |
|
1938 | This a convenience method to aid invoking hooks. Extensions likely | |
1940 | won't call this unless they have registered a custom hook or are |
|
1939 | won't call this unless they have registered a custom hook or are | |
1941 | replacing code that is expected to call a hook. |
|
1940 | replacing code that is expected to call a hook. | |
1942 | """ |
|
1941 | """ | |
1943 | return hook.hook(self.ui, self, name, throw, **args) |
|
1942 | return hook.hook(self.ui, self, name, throw, **args) | |
1944 |
|
1943 | |||
1945 | @filteredpropertycache |
|
1944 | @filteredpropertycache | |
1946 | def _tagscache(self): |
|
1945 | def _tagscache(self): | |
1947 | """Returns a tagscache object that contains various tags related |
|
1946 | """Returns a tagscache object that contains various tags related | |
1948 | caches.""" |
|
1947 | caches.""" | |
1949 |
|
1948 | |||
1950 | # This simplifies its cache management by having one decorated |
|
1949 | # This simplifies its cache management by having one decorated | |
1951 | # function (this one) and the rest simply fetch things from it. |
|
1950 | # function (this one) and the rest simply fetch things from it. | |
1952 | class tagscache(object): |
|
1951 | class tagscache(object): | |
1953 | def __init__(self): |
|
1952 | def __init__(self): | |
1954 | # These two define the set of tags for this repository. tags |
|
1953 | # These two define the set of tags for this repository. tags | |
1955 | # maps tag name to node; tagtypes maps tag name to 'global' or |
|
1954 | # maps tag name to node; tagtypes maps tag name to 'global' or | |
1956 | # 'local'. (Global tags are defined by .hgtags across all |
|
1955 | # 'local'. (Global tags are defined by .hgtags across all | |
1957 | # heads, and local tags are defined in .hg/localtags.) |
|
1956 | # heads, and local tags are defined in .hg/localtags.) | |
1958 | # They constitute the in-memory cache of tags. |
|
1957 | # They constitute the in-memory cache of tags. | |
1959 | self.tags = self.tagtypes = None |
|
1958 | self.tags = self.tagtypes = None | |
1960 |
|
1959 | |||
1961 | self.nodetagscache = self.tagslist = None |
|
1960 | self.nodetagscache = self.tagslist = None | |
1962 |
|
1961 | |||
1963 | cache = tagscache() |
|
1962 | cache = tagscache() | |
1964 | cache.tags, cache.tagtypes = self._findtags() |
|
1963 | cache.tags, cache.tagtypes = self._findtags() | |
1965 |
|
1964 | |||
1966 | return cache |
|
1965 | return cache | |
1967 |
|
1966 | |||
1968 | def tags(self): |
|
1967 | def tags(self): | |
1969 | '''return a mapping of tag to node''' |
|
1968 | '''return a mapping of tag to node''' | |
1970 | t = {} |
|
1969 | t = {} | |
1971 | if self.changelog.filteredrevs: |
|
1970 | if self.changelog.filteredrevs: | |
1972 | tags, tt = self._findtags() |
|
1971 | tags, tt = self._findtags() | |
1973 | else: |
|
1972 | else: | |
1974 | tags = self._tagscache.tags |
|
1973 | tags = self._tagscache.tags | |
1975 | rev = self.changelog.rev |
|
1974 | rev = self.changelog.rev | |
1976 | for k, v in pycompat.iteritems(tags): |
|
1975 | for k, v in pycompat.iteritems(tags): | |
1977 | try: |
|
1976 | try: | |
1978 | # ignore tags to unknown nodes |
|
1977 | # ignore tags to unknown nodes | |
1979 | rev(v) |
|
1978 | rev(v) | |
1980 | t[k] = v |
|
1979 | t[k] = v | |
1981 | except (error.LookupError, ValueError): |
|
1980 | except (error.LookupError, ValueError): | |
1982 | pass |
|
1981 | pass | |
1983 | return t |
|
1982 | return t | |
1984 |
|
1983 | |||
1985 | def _findtags(self): |
|
1984 | def _findtags(self): | |
1986 | """Do the hard work of finding tags. Return a pair of dicts |
|
1985 | """Do the hard work of finding tags. Return a pair of dicts | |
1987 | (tags, tagtypes) where tags maps tag name to node, and tagtypes |
|
1986 | (tags, tagtypes) where tags maps tag name to node, and tagtypes | |
1988 | maps tag name to a string like \'global\' or \'local\'. |
|
1987 | maps tag name to a string like \'global\' or \'local\'. | |
1989 | Subclasses or extensions are free to add their own tags, but |
|
1988 | Subclasses or extensions are free to add their own tags, but | |
1990 | should be aware that the returned dicts will be retained for the |
|
1989 | should be aware that the returned dicts will be retained for the | |
1991 | duration of the localrepo object.""" |
|
1990 | duration of the localrepo object.""" | |
1992 |
|
1991 | |||
1993 | # XXX what tagtype should subclasses/extensions use? Currently |
|
1992 | # XXX what tagtype should subclasses/extensions use? Currently | |
1994 | # mq and bookmarks add tags, but do not set the tagtype at all. |
|
1993 | # mq and bookmarks add tags, but do not set the tagtype at all. | |
1995 | # Should each extension invent its own tag type? Should there |
|
1994 | # Should each extension invent its own tag type? Should there | |
1996 | # be one tagtype for all such "virtual" tags? Or is the status |
|
1995 | # be one tagtype for all such "virtual" tags? Or is the status | |
1997 | # quo fine? |
|
1996 | # quo fine? | |
1998 |
|
1997 | |||
1999 | # map tag name to (node, hist) |
|
1998 | # map tag name to (node, hist) | |
2000 | alltags = tagsmod.findglobaltags(self.ui, self) |
|
1999 | alltags = tagsmod.findglobaltags(self.ui, self) | |
2001 | # map tag name to tag type |
|
2000 | # map tag name to tag type | |
2002 | tagtypes = {tag: b'global' for tag in alltags} |
|
2001 | tagtypes = {tag: b'global' for tag in alltags} | |
2003 |
|
2002 | |||
2004 | tagsmod.readlocaltags(self.ui, self, alltags, tagtypes) |
|
2003 | tagsmod.readlocaltags(self.ui, self, alltags, tagtypes) | |
2005 |
|
2004 | |||
2006 | # Build the return dicts. Have to re-encode tag names because |
|
2005 | # Build the return dicts. Have to re-encode tag names because | |
2007 | # the tags module always uses UTF-8 (in order not to lose info |
|
2006 | # the tags module always uses UTF-8 (in order not to lose info | |
2008 | # writing to the cache), but the rest of Mercurial wants them in |
|
2007 | # writing to the cache), but the rest of Mercurial wants them in | |
2009 | # local encoding. |
|
2008 | # local encoding. | |
2010 | tags = {} |
|
2009 | tags = {} | |
2011 | for (name, (node, hist)) in pycompat.iteritems(alltags): |
|
2010 | for (name, (node, hist)) in pycompat.iteritems(alltags): | |
2012 | if node != nullid: |
|
2011 | if node != nullid: | |
2013 | tags[encoding.tolocal(name)] = node |
|
2012 | tags[encoding.tolocal(name)] = node | |
2014 | tags[b'tip'] = self.changelog.tip() |
|
2013 | tags[b'tip'] = self.changelog.tip() | |
2015 | tagtypes = { |
|
2014 | tagtypes = { | |
2016 | encoding.tolocal(name): value |
|
2015 | encoding.tolocal(name): value | |
2017 | for (name, value) in pycompat.iteritems(tagtypes) |
|
2016 | for (name, value) in pycompat.iteritems(tagtypes) | |
2018 | } |
|
2017 | } | |
2019 | return (tags, tagtypes) |
|
2018 | return (tags, tagtypes) | |
2020 |
|
2019 | |||
2021 | def tagtype(self, tagname): |
|
2020 | def tagtype(self, tagname): | |
2022 | """ |
|
2021 | """ | |
2023 | return the type of the given tag. result can be: |
|
2022 | return the type of the given tag. result can be: | |
2024 |
|
2023 | |||
2025 | 'local' : a local tag |
|
2024 | 'local' : a local tag | |
2026 | 'global' : a global tag |
|
2025 | 'global' : a global tag | |
2027 | None : tag does not exist |
|
2026 | None : tag does not exist | |
2028 | """ |
|
2027 | """ | |
2029 |
|
2028 | |||
2030 | return self._tagscache.tagtypes.get(tagname) |
|
2029 | return self._tagscache.tagtypes.get(tagname) | |
2031 |
|
2030 | |||
2032 | def tagslist(self): |
|
2031 | def tagslist(self): | |
2033 | '''return a list of tags ordered by revision''' |
|
2032 | '''return a list of tags ordered by revision''' | |
2034 | if not self._tagscache.tagslist: |
|
2033 | if not self._tagscache.tagslist: | |
2035 | l = [] |
|
2034 | l = [] | |
2036 | for t, n in pycompat.iteritems(self.tags()): |
|
2035 | for t, n in pycompat.iteritems(self.tags()): | |
2037 | l.append((self.changelog.rev(n), t, n)) |
|
2036 | l.append((self.changelog.rev(n), t, n)) | |
2038 | self._tagscache.tagslist = [(t, n) for r, t, n in sorted(l)] |
|
2037 | self._tagscache.tagslist = [(t, n) for r, t, n in sorted(l)] | |
2039 |
|
2038 | |||
2040 | return self._tagscache.tagslist |
|
2039 | return self._tagscache.tagslist | |
2041 |
|
2040 | |||
2042 | def nodetags(self, node): |
|
2041 | def nodetags(self, node): | |
2043 | '''return the tags associated with a node''' |
|
2042 | '''return the tags associated with a node''' | |
2044 | if not self._tagscache.nodetagscache: |
|
2043 | if not self._tagscache.nodetagscache: | |
2045 | nodetagscache = {} |
|
2044 | nodetagscache = {} | |
2046 | for t, n in pycompat.iteritems(self._tagscache.tags): |
|
2045 | for t, n in pycompat.iteritems(self._tagscache.tags): | |
2047 | nodetagscache.setdefault(n, []).append(t) |
|
2046 | nodetagscache.setdefault(n, []).append(t) | |
2048 | for tags in pycompat.itervalues(nodetagscache): |
|
2047 | for tags in pycompat.itervalues(nodetagscache): | |
2049 | tags.sort() |
|
2048 | tags.sort() | |
2050 | self._tagscache.nodetagscache = nodetagscache |
|
2049 | self._tagscache.nodetagscache = nodetagscache | |
2051 | return self._tagscache.nodetagscache.get(node, []) |
|
2050 | return self._tagscache.nodetagscache.get(node, []) | |
2052 |
|
2051 | |||
2053 | def nodebookmarks(self, node): |
|
2052 | def nodebookmarks(self, node): | |
2054 | """return the list of bookmarks pointing to the specified node""" |
|
2053 | """return the list of bookmarks pointing to the specified node""" | |
2055 | return self._bookmarks.names(node) |
|
2054 | return self._bookmarks.names(node) | |
2056 |
|
2055 | |||
2057 | def branchmap(self): |
|
2056 | def branchmap(self): | |
2058 | """returns a dictionary {branch: [branchheads]} with branchheads |
|
2057 | """returns a dictionary {branch: [branchheads]} with branchheads | |
2059 | ordered by increasing revision number""" |
|
2058 | ordered by increasing revision number""" | |
2060 | return self._branchcaches[self] |
|
2059 | return self._branchcaches[self] | |
2061 |
|
2060 | |||
2062 | @unfilteredmethod |
|
2061 | @unfilteredmethod | |
2063 | def revbranchcache(self): |
|
2062 | def revbranchcache(self): | |
2064 | if not self._revbranchcache: |
|
2063 | if not self._revbranchcache: | |
2065 | self._revbranchcache = branchmap.revbranchcache(self.unfiltered()) |
|
2064 | self._revbranchcache = branchmap.revbranchcache(self.unfiltered()) | |
2066 | return self._revbranchcache |
|
2065 | return self._revbranchcache | |
2067 |
|
2066 | |||
2068 | def register_changeset(self, rev, changelogrevision): |
|
2067 | def register_changeset(self, rev, changelogrevision): | |
2069 | self.revbranchcache().setdata(rev, changelogrevision) |
|
2068 | self.revbranchcache().setdata(rev, changelogrevision) | |
2070 |
|
2069 | |||
2071 | def branchtip(self, branch, ignoremissing=False): |
|
2070 | def branchtip(self, branch, ignoremissing=False): | |
2072 | """return the tip node for a given branch |
|
2071 | """return the tip node for a given branch | |
2073 |
|
2072 | |||
2074 | If ignoremissing is True, then this method will not raise an error. |
|
2073 | If ignoremissing is True, then this method will not raise an error. | |
2075 | This is helpful for callers that only expect None for a missing branch |
|
2074 | This is helpful for callers that only expect None for a missing branch | |
2076 | (e.g. namespace). |
|
2075 | (e.g. namespace). | |
2077 |
|
2076 | |||
2078 | """ |
|
2077 | """ | |
2079 | try: |
|
2078 | try: | |
2080 | return self.branchmap().branchtip(branch) |
|
2079 | return self.branchmap().branchtip(branch) | |
2081 | except KeyError: |
|
2080 | except KeyError: | |
2082 | if not ignoremissing: |
|
2081 | if not ignoremissing: | |
2083 | raise error.RepoLookupError(_(b"unknown branch '%s'") % branch) |
|
2082 | raise error.RepoLookupError(_(b"unknown branch '%s'") % branch) | |
2084 | else: |
|
2083 | else: | |
2085 | pass |
|
2084 | pass | |
2086 |
|
2085 | |||
2087 | def lookup(self, key): |
|
2086 | def lookup(self, key): | |
2088 | node = scmutil.revsymbol(self, key).node() |
|
2087 | node = scmutil.revsymbol(self, key).node() | |
2089 | if node is None: |
|
2088 | if node is None: | |
2090 | raise error.RepoLookupError(_(b"unknown revision '%s'") % key) |
|
2089 | raise error.RepoLookupError(_(b"unknown revision '%s'") % key) | |
2091 | return node |
|
2090 | return node | |
2092 |
|
2091 | |||
2093 | def lookupbranch(self, key): |
|
2092 | def lookupbranch(self, key): | |
2094 | if self.branchmap().hasbranch(key): |
|
2093 | if self.branchmap().hasbranch(key): | |
2095 | return key |
|
2094 | return key | |
2096 |
|
2095 | |||
2097 | return scmutil.revsymbol(self, key).branch() |
|
2096 | return scmutil.revsymbol(self, key).branch() | |
2098 |
|
2097 | |||
2099 | def known(self, nodes): |
|
2098 | def known(self, nodes): | |
2100 | cl = self.changelog |
|
2099 | cl = self.changelog | |
2101 | get_rev = cl.index.get_rev |
|
2100 | get_rev = cl.index.get_rev | |
2102 | filtered = cl.filteredrevs |
|
2101 | filtered = cl.filteredrevs | |
2103 | result = [] |
|
2102 | result = [] | |
2104 | for n in nodes: |
|
2103 | for n in nodes: | |
2105 | r = get_rev(n) |
|
2104 | r = get_rev(n) | |
2106 | resp = not (r is None or r in filtered) |
|
2105 | resp = not (r is None or r in filtered) | |
2107 | result.append(resp) |
|
2106 | result.append(resp) | |
2108 | return result |
|
2107 | return result | |
2109 |
|
2108 | |||
2110 | def local(self): |
|
2109 | def local(self): | |
2111 | return self |
|
2110 | return self | |
2112 |
|
2111 | |||
2113 | def publishing(self): |
|
2112 | def publishing(self): | |
2114 | # it's safe (and desirable) to trust the publish flag unconditionally |
|
2113 | # it's safe (and desirable) to trust the publish flag unconditionally | |
2115 | # so that we don't finalize changes shared between users via ssh or nfs |
|
2114 | # so that we don't finalize changes shared between users via ssh or nfs | |
2116 | return self.ui.configbool(b'phases', b'publish', untrusted=True) |
|
2115 | return self.ui.configbool(b'phases', b'publish', untrusted=True) | |
2117 |
|
2116 | |||
2118 | def cancopy(self): |
|
2117 | def cancopy(self): | |
2119 | # so statichttprepo's override of local() works |
|
2118 | # so statichttprepo's override of local() works | |
2120 | if not self.local(): |
|
2119 | if not self.local(): | |
2121 | return False |
|
2120 | return False | |
2122 | if not self.publishing(): |
|
2121 | if not self.publishing(): | |
2123 | return True |
|
2122 | return True | |
2124 | # if publishing we can't copy if there is filtered content |
|
2123 | # if publishing we can't copy if there is filtered content | |
2125 | return not self.filtered(b'visible').changelog.filteredrevs |
|
2124 | return not self.filtered(b'visible').changelog.filteredrevs | |
2126 |
|
2125 | |||
2127 | def shared(self): |
|
2126 | def shared(self): | |
2128 | '''the type of shared repository (None if not shared)''' |
|
2127 | '''the type of shared repository (None if not shared)''' | |
2129 | if self.sharedpath != self.path: |
|
2128 | if self.sharedpath != self.path: | |
2130 | return b'store' |
|
2129 | return b'store' | |
2131 | return None |
|
2130 | return None | |
2132 |
|
2131 | |||
2133 | def wjoin(self, f, *insidef): |
|
2132 | def wjoin(self, f, *insidef): | |
2134 | return self.vfs.reljoin(self.root, f, *insidef) |
|
2133 | return self.vfs.reljoin(self.root, f, *insidef) | |
2135 |
|
2134 | |||
2136 | def setparents(self, p1, p2=nullid): |
|
2135 | def setparents(self, p1, p2=nullid): | |
2137 | self[None].setparents(p1, p2) |
|
2136 | self[None].setparents(p1, p2) | |
2138 | self._quick_access_changeid_invalidate() |
|
2137 | self._quick_access_changeid_invalidate() | |
2139 |
|
2138 | |||
2140 | def filectx(self, path, changeid=None, fileid=None, changectx=None): |
|
2139 | def filectx(self, path, changeid=None, fileid=None, changectx=None): | |
2141 | """changeid must be a changeset revision, if specified. |
|
2140 | """changeid must be a changeset revision, if specified. | |
2142 | fileid can be a file revision or node.""" |
|
2141 | fileid can be a file revision or node.""" | |
2143 | return context.filectx( |
|
2142 | return context.filectx( | |
2144 | self, path, changeid, fileid, changectx=changectx |
|
2143 | self, path, changeid, fileid, changectx=changectx | |
2145 | ) |
|
2144 | ) | |
2146 |
|
2145 | |||
2147 | def getcwd(self): |
|
2146 | def getcwd(self): | |
2148 | return self.dirstate.getcwd() |
|
2147 | return self.dirstate.getcwd() | |
2149 |
|
2148 | |||
2150 | def pathto(self, f, cwd=None): |
|
2149 | def pathto(self, f, cwd=None): | |
2151 | return self.dirstate.pathto(f, cwd) |
|
2150 | return self.dirstate.pathto(f, cwd) | |
2152 |
|
2151 | |||
2153 | def _loadfilter(self, filter): |
|
2152 | def _loadfilter(self, filter): | |
2154 | if filter not in self._filterpats: |
|
2153 | if filter not in self._filterpats: | |
2155 | l = [] |
|
2154 | l = [] | |
2156 | for pat, cmd in self.ui.configitems(filter): |
|
2155 | for pat, cmd in self.ui.configitems(filter): | |
2157 | if cmd == b'!': |
|
2156 | if cmd == b'!': | |
2158 | continue |
|
2157 | continue | |
2159 | mf = matchmod.match(self.root, b'', [pat]) |
|
2158 | mf = matchmod.match(self.root, b'', [pat]) | |
2160 | fn = None |
|
2159 | fn = None | |
2161 | params = cmd |
|
2160 | params = cmd | |
2162 | for name, filterfn in pycompat.iteritems(self._datafilters): |
|
2161 | for name, filterfn in pycompat.iteritems(self._datafilters): | |
2163 | if cmd.startswith(name): |
|
2162 | if cmd.startswith(name): | |
2164 | fn = filterfn |
|
2163 | fn = filterfn | |
2165 | params = cmd[len(name) :].lstrip() |
|
2164 | params = cmd[len(name) :].lstrip() | |
2166 | break |
|
2165 | break | |
2167 | if not fn: |
|
2166 | if not fn: | |
2168 | fn = lambda s, c, **kwargs: procutil.filter(s, c) |
|
2167 | fn = lambda s, c, **kwargs: procutil.filter(s, c) | |
2169 | fn.__name__ = 'commandfilter' |
|
2168 | fn.__name__ = 'commandfilter' | |
2170 | # Wrap old filters not supporting keyword arguments |
|
2169 | # Wrap old filters not supporting keyword arguments | |
2171 | if not pycompat.getargspec(fn)[2]: |
|
2170 | if not pycompat.getargspec(fn)[2]: | |
2172 | oldfn = fn |
|
2171 | oldfn = fn | |
2173 | fn = lambda s, c, oldfn=oldfn, **kwargs: oldfn(s, c) |
|
2172 | fn = lambda s, c, oldfn=oldfn, **kwargs: oldfn(s, c) | |
2174 | fn.__name__ = 'compat-' + oldfn.__name__ |
|
2173 | fn.__name__ = 'compat-' + oldfn.__name__ | |
2175 | l.append((mf, fn, params)) |
|
2174 | l.append((mf, fn, params)) | |
2176 | self._filterpats[filter] = l |
|
2175 | self._filterpats[filter] = l | |
2177 | return self._filterpats[filter] |
|
2176 | return self._filterpats[filter] | |
2178 |
|
2177 | |||
2179 | def _filter(self, filterpats, filename, data): |
|
2178 | def _filter(self, filterpats, filename, data): | |
2180 | for mf, fn, cmd in filterpats: |
|
2179 | for mf, fn, cmd in filterpats: | |
2181 | if mf(filename): |
|
2180 | if mf(filename): | |
2182 | self.ui.debug( |
|
2181 | self.ui.debug( | |
2183 | b"filtering %s through %s\n" |
|
2182 | b"filtering %s through %s\n" | |
2184 | % (filename, cmd or pycompat.sysbytes(fn.__name__)) |
|
2183 | % (filename, cmd or pycompat.sysbytes(fn.__name__)) | |
2185 | ) |
|
2184 | ) | |
2186 | data = fn(data, cmd, ui=self.ui, repo=self, filename=filename) |
|
2185 | data = fn(data, cmd, ui=self.ui, repo=self, filename=filename) | |
2187 | break |
|
2186 | break | |
2188 |
|
2187 | |||
2189 | return data |
|
2188 | return data | |
2190 |
|
2189 | |||
2191 | @unfilteredpropertycache |
|
2190 | @unfilteredpropertycache | |
2192 | def _encodefilterpats(self): |
|
2191 | def _encodefilterpats(self): | |
2193 | return self._loadfilter(b'encode') |
|
2192 | return self._loadfilter(b'encode') | |
2194 |
|
2193 | |||
2195 | @unfilteredpropertycache |
|
2194 | @unfilteredpropertycache | |
2196 | def _decodefilterpats(self): |
|
2195 | def _decodefilterpats(self): | |
2197 | return self._loadfilter(b'decode') |
|
2196 | return self._loadfilter(b'decode') | |
2198 |
|
2197 | |||
2199 | def adddatafilter(self, name, filter): |
|
2198 | def adddatafilter(self, name, filter): | |
2200 | self._datafilters[name] = filter |
|
2199 | self._datafilters[name] = filter | |
2201 |
|
2200 | |||
2202 | def wread(self, filename): |
|
2201 | def wread(self, filename): | |
2203 | if self.wvfs.islink(filename): |
|
2202 | if self.wvfs.islink(filename): | |
2204 | data = self.wvfs.readlink(filename) |
|
2203 | data = self.wvfs.readlink(filename) | |
2205 | else: |
|
2204 | else: | |
2206 | data = self.wvfs.read(filename) |
|
2205 | data = self.wvfs.read(filename) | |
2207 | return self._filter(self._encodefilterpats, filename, data) |
|
2206 | return self._filter(self._encodefilterpats, filename, data) | |
2208 |
|
2207 | |||
2209 | def wwrite(self, filename, data, flags, backgroundclose=False, **kwargs): |
|
2208 | def wwrite(self, filename, data, flags, backgroundclose=False, **kwargs): | |
2210 | """write ``data`` into ``filename`` in the working directory |
|
2209 | """write ``data`` into ``filename`` in the working directory | |
2211 |
|
2210 | |||
2212 | This returns length of written (maybe decoded) data. |
|
2211 | This returns length of written (maybe decoded) data. | |
2213 | """ |
|
2212 | """ | |
2214 | data = self._filter(self._decodefilterpats, filename, data) |
|
2213 | data = self._filter(self._decodefilterpats, filename, data) | |
2215 | if b'l' in flags: |
|
2214 | if b'l' in flags: | |
2216 | self.wvfs.symlink(data, filename) |
|
2215 | self.wvfs.symlink(data, filename) | |
2217 | else: |
|
2216 | else: | |
2218 | self.wvfs.write( |
|
2217 | self.wvfs.write( | |
2219 | filename, data, backgroundclose=backgroundclose, **kwargs |
|
2218 | filename, data, backgroundclose=backgroundclose, **kwargs | |
2220 | ) |
|
2219 | ) | |
2221 | if b'x' in flags: |
|
2220 | if b'x' in flags: | |
2222 | self.wvfs.setflags(filename, False, True) |
|
2221 | self.wvfs.setflags(filename, False, True) | |
2223 | else: |
|
2222 | else: | |
2224 | self.wvfs.setflags(filename, False, False) |
|
2223 | self.wvfs.setflags(filename, False, False) | |
2225 | return len(data) |
|
2224 | return len(data) | |
2226 |
|
2225 | |||
2227 | def wwritedata(self, filename, data): |
|
2226 | def wwritedata(self, filename, data): | |
2228 | return self._filter(self._decodefilterpats, filename, data) |
|
2227 | return self._filter(self._decodefilterpats, filename, data) | |
2229 |
|
2228 | |||
2230 | def currenttransaction(self): |
|
2229 | def currenttransaction(self): | |
2231 | """return the current transaction or None if non exists""" |
|
2230 | """return the current transaction or None if non exists""" | |
2232 | if self._transref: |
|
2231 | if self._transref: | |
2233 | tr = self._transref() |
|
2232 | tr = self._transref() | |
2234 | else: |
|
2233 | else: | |
2235 | tr = None |
|
2234 | tr = None | |
2236 |
|
2235 | |||
2237 | if tr and tr.running(): |
|
2236 | if tr and tr.running(): | |
2238 | return tr |
|
2237 | return tr | |
2239 | return None |
|
2238 | return None | |
2240 |
|
2239 | |||
2241 | def transaction(self, desc, report=None): |
|
2240 | def transaction(self, desc, report=None): | |
2242 | if self.ui.configbool(b'devel', b'all-warnings') or self.ui.configbool( |
|
2241 | if self.ui.configbool(b'devel', b'all-warnings') or self.ui.configbool( | |
2243 | b'devel', b'check-locks' |
|
2242 | b'devel', b'check-locks' | |
2244 | ): |
|
2243 | ): | |
2245 | if self._currentlock(self._lockref) is None: |
|
2244 | if self._currentlock(self._lockref) is None: | |
2246 | raise error.ProgrammingError(b'transaction requires locking') |
|
2245 | raise error.ProgrammingError(b'transaction requires locking') | |
2247 | tr = self.currenttransaction() |
|
2246 | tr = self.currenttransaction() | |
2248 | if tr is not None: |
|
2247 | if tr is not None: | |
2249 | return tr.nest(name=desc) |
|
2248 | return tr.nest(name=desc) | |
2250 |
|
2249 | |||
2251 | # abort here if the journal already exists |
|
2250 | # abort here if the journal already exists | |
2252 | if self.svfs.exists(b"journal"): |
|
2251 | if self.svfs.exists(b"journal"): | |
2253 | raise error.RepoError( |
|
2252 | raise error.RepoError( | |
2254 | _(b"abandoned transaction found"), |
|
2253 | _(b"abandoned transaction found"), | |
2255 | hint=_(b"run 'hg recover' to clean up transaction"), |
|
2254 | hint=_(b"run 'hg recover' to clean up transaction"), | |
2256 | ) |
|
2255 | ) | |
2257 |
|
2256 | |||
2258 | idbase = b"%.40f#%f" % (random.random(), time.time()) |
|
2257 | idbase = b"%.40f#%f" % (random.random(), time.time()) | |
2259 | ha = hex(hashutil.sha1(idbase).digest()) |
|
2258 | ha = hex(hashutil.sha1(idbase).digest()) | |
2260 | txnid = b'TXN:' + ha |
|
2259 | txnid = b'TXN:' + ha | |
2261 | self.hook(b'pretxnopen', throw=True, txnname=desc, txnid=txnid) |
|
2260 | self.hook(b'pretxnopen', throw=True, txnname=desc, txnid=txnid) | |
2262 |
|
2261 | |||
2263 | self._writejournal(desc) |
|
2262 | self._writejournal(desc) | |
2264 | renames = [(vfs, x, undoname(x)) for vfs, x in self._journalfiles()] |
|
2263 | renames = [(vfs, x, undoname(x)) for vfs, x in self._journalfiles()] | |
2265 | if report: |
|
2264 | if report: | |
2266 | rp = report |
|
2265 | rp = report | |
2267 | else: |
|
2266 | else: | |
2268 | rp = self.ui.warn |
|
2267 | rp = self.ui.warn | |
2269 | vfsmap = {b'plain': self.vfs, b'store': self.svfs} # root of .hg/ |
|
2268 | vfsmap = {b'plain': self.vfs, b'store': self.svfs} # root of .hg/ | |
2270 | # we must avoid cyclic reference between repo and transaction. |
|
2269 | # we must avoid cyclic reference between repo and transaction. | |
2271 | reporef = weakref.ref(self) |
|
2270 | reporef = weakref.ref(self) | |
2272 | # Code to track tag movement |
|
2271 | # Code to track tag movement | |
2273 | # |
|
2272 | # | |
2274 | # Since tags are all handled as file content, it is actually quite hard |
|
2273 | # Since tags are all handled as file content, it is actually quite hard | |
2275 | # to track these movement from a code perspective. So we fallback to a |
|
2274 | # to track these movement from a code perspective. So we fallback to a | |
2276 | # tracking at the repository level. One could envision to track changes |
|
2275 | # tracking at the repository level. One could envision to track changes | |
2277 | # to the '.hgtags' file through changegroup apply but that fails to |
|
2276 | # to the '.hgtags' file through changegroup apply but that fails to | |
2278 | # cope with case where transaction expose new heads without changegroup |
|
2277 | # cope with case where transaction expose new heads without changegroup | |
2279 | # being involved (eg: phase movement). |
|
2278 | # being involved (eg: phase movement). | |
2280 | # |
|
2279 | # | |
2281 | # For now, We gate the feature behind a flag since this likely comes |
|
2280 | # For now, We gate the feature behind a flag since this likely comes | |
2282 | # with performance impacts. The current code run more often than needed |
|
2281 | # with performance impacts. The current code run more often than needed | |
2283 | # and do not use caches as much as it could. The current focus is on |
|
2282 | # and do not use caches as much as it could. The current focus is on | |
2284 | # the behavior of the feature so we disable it by default. The flag |
|
2283 | # the behavior of the feature so we disable it by default. The flag | |
2285 | # will be removed when we are happy with the performance impact. |
|
2284 | # will be removed when we are happy with the performance impact. | |
2286 | # |
|
2285 | # | |
2287 | # Once this feature is no longer experimental move the following |
|
2286 | # Once this feature is no longer experimental move the following | |
2288 | # documentation to the appropriate help section: |
|
2287 | # documentation to the appropriate help section: | |
2289 | # |
|
2288 | # | |
2290 | # The ``HG_TAG_MOVED`` variable will be set if the transaction touched |
|
2289 | # The ``HG_TAG_MOVED`` variable will be set if the transaction touched | |
2291 | # tags (new or changed or deleted tags). In addition the details of |
|
2290 | # tags (new or changed or deleted tags). In addition the details of | |
2292 | # these changes are made available in a file at: |
|
2291 | # these changes are made available in a file at: | |
2293 | # ``REPOROOT/.hg/changes/tags.changes``. |
|
2292 | # ``REPOROOT/.hg/changes/tags.changes``. | |
2294 | # Make sure you check for HG_TAG_MOVED before reading that file as it |
|
2293 | # Make sure you check for HG_TAG_MOVED before reading that file as it | |
2295 | # might exist from a previous transaction even if no tag were touched |
|
2294 | # might exist from a previous transaction even if no tag were touched | |
2296 | # in this one. Changes are recorded in a line base format:: |
|
2295 | # in this one. Changes are recorded in a line base format:: | |
2297 | # |
|
2296 | # | |
2298 | # <action> <hex-node> <tag-name>\n |
|
2297 | # <action> <hex-node> <tag-name>\n | |
2299 | # |
|
2298 | # | |
2300 | # Actions are defined as follow: |
|
2299 | # Actions are defined as follow: | |
2301 | # "-R": tag is removed, |
|
2300 | # "-R": tag is removed, | |
2302 | # "+A": tag is added, |
|
2301 | # "+A": tag is added, | |
2303 | # "-M": tag is moved (old value), |
|
2302 | # "-M": tag is moved (old value), | |
2304 | # "+M": tag is moved (new value), |
|
2303 | # "+M": tag is moved (new value), | |
2305 | tracktags = lambda x: None |
|
2304 | tracktags = lambda x: None | |
2306 | # experimental config: experimental.hook-track-tags |
|
2305 | # experimental config: experimental.hook-track-tags | |
2307 | shouldtracktags = self.ui.configbool( |
|
2306 | shouldtracktags = self.ui.configbool( | |
2308 | b'experimental', b'hook-track-tags' |
|
2307 | b'experimental', b'hook-track-tags' | |
2309 | ) |
|
2308 | ) | |
2310 | if desc != b'strip' and shouldtracktags: |
|
2309 | if desc != b'strip' and shouldtracktags: | |
2311 | oldheads = self.changelog.headrevs() |
|
2310 | oldheads = self.changelog.headrevs() | |
2312 |
|
2311 | |||
2313 | def tracktags(tr2): |
|
2312 | def tracktags(tr2): | |
2314 | repo = reporef() |
|
2313 | repo = reporef() | |
2315 | oldfnodes = tagsmod.fnoderevs(repo.ui, repo, oldheads) |
|
2314 | oldfnodes = tagsmod.fnoderevs(repo.ui, repo, oldheads) | |
2316 | newheads = repo.changelog.headrevs() |
|
2315 | newheads = repo.changelog.headrevs() | |
2317 | newfnodes = tagsmod.fnoderevs(repo.ui, repo, newheads) |
|
2316 | newfnodes = tagsmod.fnoderevs(repo.ui, repo, newheads) | |
2318 | # notes: we compare lists here. |
|
2317 | # notes: we compare lists here. | |
2319 | # As we do it only once buiding set would not be cheaper |
|
2318 | # As we do it only once buiding set would not be cheaper | |
2320 | changes = tagsmod.difftags(repo.ui, repo, oldfnodes, newfnodes) |
|
2319 | changes = tagsmod.difftags(repo.ui, repo, oldfnodes, newfnodes) | |
2321 | if changes: |
|
2320 | if changes: | |
2322 | tr2.hookargs[b'tag_moved'] = b'1' |
|
2321 | tr2.hookargs[b'tag_moved'] = b'1' | |
2323 | with repo.vfs( |
|
2322 | with repo.vfs( | |
2324 | b'changes/tags.changes', b'w', atomictemp=True |
|
2323 | b'changes/tags.changes', b'w', atomictemp=True | |
2325 | ) as changesfile: |
|
2324 | ) as changesfile: | |
2326 | # note: we do not register the file to the transaction |
|
2325 | # note: we do not register the file to the transaction | |
2327 | # because we needs it to still exist on the transaction |
|
2326 | # because we needs it to still exist on the transaction | |
2328 | # is close (for txnclose hooks) |
|
2327 | # is close (for txnclose hooks) | |
2329 | tagsmod.writediff(changesfile, changes) |
|
2328 | tagsmod.writediff(changesfile, changes) | |
2330 |
|
2329 | |||
2331 | def validate(tr2): |
|
2330 | def validate(tr2): | |
2332 | """will run pre-closing hooks""" |
|
2331 | """will run pre-closing hooks""" | |
2333 | # XXX the transaction API is a bit lacking here so we take a hacky |
|
2332 | # XXX the transaction API is a bit lacking here so we take a hacky | |
2334 | # path for now |
|
2333 | # path for now | |
2335 | # |
|
2334 | # | |
2336 | # We cannot add this as a "pending" hooks since the 'tr.hookargs' |
|
2335 | # We cannot add this as a "pending" hooks since the 'tr.hookargs' | |
2337 | # dict is copied before these run. In addition we needs the data |
|
2336 | # dict is copied before these run. In addition we needs the data | |
2338 | # available to in memory hooks too. |
|
2337 | # available to in memory hooks too. | |
2339 | # |
|
2338 | # | |
2340 | # Moreover, we also need to make sure this runs before txnclose |
|
2339 | # Moreover, we also need to make sure this runs before txnclose | |
2341 | # hooks and there is no "pending" mechanism that would execute |
|
2340 | # hooks and there is no "pending" mechanism that would execute | |
2342 | # logic only if hooks are about to run. |
|
2341 | # logic only if hooks are about to run. | |
2343 | # |
|
2342 | # | |
2344 | # Fixing this limitation of the transaction is also needed to track |
|
2343 | # Fixing this limitation of the transaction is also needed to track | |
2345 | # other families of changes (bookmarks, phases, obsolescence). |
|
2344 | # other families of changes (bookmarks, phases, obsolescence). | |
2346 | # |
|
2345 | # | |
2347 | # This will have to be fixed before we remove the experimental |
|
2346 | # This will have to be fixed before we remove the experimental | |
2348 | # gating. |
|
2347 | # gating. | |
2349 | tracktags(tr2) |
|
2348 | tracktags(tr2) | |
2350 | repo = reporef() |
|
2349 | repo = reporef() | |
2351 |
|
2350 | |||
2352 | singleheadopt = (b'experimental', b'single-head-per-branch') |
|
2351 | singleheadopt = (b'experimental', b'single-head-per-branch') | |
2353 | singlehead = repo.ui.configbool(*singleheadopt) |
|
2352 | singlehead = repo.ui.configbool(*singleheadopt) | |
2354 | if singlehead: |
|
2353 | if singlehead: | |
2355 | singleheadsub = repo.ui.configsuboptions(*singleheadopt)[1] |
|
2354 | singleheadsub = repo.ui.configsuboptions(*singleheadopt)[1] | |
2356 | accountclosed = singleheadsub.get( |
|
2355 | accountclosed = singleheadsub.get( | |
2357 | b"account-closed-heads", False |
|
2356 | b"account-closed-heads", False | |
2358 | ) |
|
2357 | ) | |
2359 | if singleheadsub.get(b"public-changes-only", False): |
|
2358 | if singleheadsub.get(b"public-changes-only", False): | |
2360 | filtername = b"immutable" |
|
2359 | filtername = b"immutable" | |
2361 | else: |
|
2360 | else: | |
2362 | filtername = b"visible" |
|
2361 | filtername = b"visible" | |
2363 | scmutil.enforcesinglehead( |
|
2362 | scmutil.enforcesinglehead( | |
2364 | repo, tr2, desc, accountclosed, filtername |
|
2363 | repo, tr2, desc, accountclosed, filtername | |
2365 | ) |
|
2364 | ) | |
2366 | if hook.hashook(repo.ui, b'pretxnclose-bookmark'): |
|
2365 | if hook.hashook(repo.ui, b'pretxnclose-bookmark'): | |
2367 | for name, (old, new) in sorted( |
|
2366 | for name, (old, new) in sorted( | |
2368 | tr.changes[b'bookmarks'].items() |
|
2367 | tr.changes[b'bookmarks'].items() | |
2369 | ): |
|
2368 | ): | |
2370 | args = tr.hookargs.copy() |
|
2369 | args = tr.hookargs.copy() | |
2371 | args.update(bookmarks.preparehookargs(name, old, new)) |
|
2370 | args.update(bookmarks.preparehookargs(name, old, new)) | |
2372 | repo.hook( |
|
2371 | repo.hook( | |
2373 | b'pretxnclose-bookmark', |
|
2372 | b'pretxnclose-bookmark', | |
2374 | throw=True, |
|
2373 | throw=True, | |
2375 | **pycompat.strkwargs(args) |
|
2374 | **pycompat.strkwargs(args) | |
2376 | ) |
|
2375 | ) | |
2377 | if hook.hashook(repo.ui, b'pretxnclose-phase'): |
|
2376 | if hook.hashook(repo.ui, b'pretxnclose-phase'): | |
2378 | cl = repo.unfiltered().changelog |
|
2377 | cl = repo.unfiltered().changelog | |
2379 | for revs, (old, new) in tr.changes[b'phases']: |
|
2378 | for revs, (old, new) in tr.changes[b'phases']: | |
2380 | for rev in revs: |
|
2379 | for rev in revs: | |
2381 | args = tr.hookargs.copy() |
|
2380 | args = tr.hookargs.copy() | |
2382 | node = hex(cl.node(rev)) |
|
2381 | node = hex(cl.node(rev)) | |
2383 | args.update(phases.preparehookargs(node, old, new)) |
|
2382 | args.update(phases.preparehookargs(node, old, new)) | |
2384 | repo.hook( |
|
2383 | repo.hook( | |
2385 | b'pretxnclose-phase', |
|
2384 | b'pretxnclose-phase', | |
2386 | throw=True, |
|
2385 | throw=True, | |
2387 | **pycompat.strkwargs(args) |
|
2386 | **pycompat.strkwargs(args) | |
2388 | ) |
|
2387 | ) | |
2389 |
|
2388 | |||
2390 | repo.hook( |
|
2389 | repo.hook( | |
2391 | b'pretxnclose', throw=True, **pycompat.strkwargs(tr.hookargs) |
|
2390 | b'pretxnclose', throw=True, **pycompat.strkwargs(tr.hookargs) | |
2392 | ) |
|
2391 | ) | |
2393 |
|
2392 | |||
2394 | def releasefn(tr, success): |
|
2393 | def releasefn(tr, success): | |
2395 | repo = reporef() |
|
2394 | repo = reporef() | |
2396 | if repo is None: |
|
2395 | if repo is None: | |
2397 | # If the repo has been GC'd (and this release function is being |
|
2396 | # If the repo has been GC'd (and this release function is being | |
2398 | # called from transaction.__del__), there's not much we can do, |
|
2397 | # called from transaction.__del__), there's not much we can do, | |
2399 | # so just leave the unfinished transaction there and let the |
|
2398 | # so just leave the unfinished transaction there and let the | |
2400 | # user run `hg recover`. |
|
2399 | # user run `hg recover`. | |
2401 | return |
|
2400 | return | |
2402 | if success: |
|
2401 | if success: | |
2403 | # this should be explicitly invoked here, because |
|
2402 | # this should be explicitly invoked here, because | |
2404 | # in-memory changes aren't written out at closing |
|
2403 | # in-memory changes aren't written out at closing | |
2405 | # transaction, if tr.addfilegenerator (via |
|
2404 | # transaction, if tr.addfilegenerator (via | |
2406 | # dirstate.write or so) isn't invoked while |
|
2405 | # dirstate.write or so) isn't invoked while | |
2407 | # transaction running |
|
2406 | # transaction running | |
2408 | repo.dirstate.write(None) |
|
2407 | repo.dirstate.write(None) | |
2409 | else: |
|
2408 | else: | |
2410 | # discard all changes (including ones already written |
|
2409 | # discard all changes (including ones already written | |
2411 | # out) in this transaction |
|
2410 | # out) in this transaction | |
2412 | narrowspec.restorebackup(self, b'journal.narrowspec') |
|
2411 | narrowspec.restorebackup(self, b'journal.narrowspec') | |
2413 | narrowspec.restorewcbackup(self, b'journal.narrowspec.dirstate') |
|
2412 | narrowspec.restorewcbackup(self, b'journal.narrowspec.dirstate') | |
2414 | repo.dirstate.restorebackup(None, b'journal.dirstate') |
|
2413 | repo.dirstate.restorebackup(None, b'journal.dirstate') | |
2415 |
|
2414 | |||
2416 | repo.invalidate(clearfilecache=True) |
|
2415 | repo.invalidate(clearfilecache=True) | |
2417 |
|
2416 | |||
2418 | tr = transaction.transaction( |
|
2417 | tr = transaction.transaction( | |
2419 | rp, |
|
2418 | rp, | |
2420 | self.svfs, |
|
2419 | self.svfs, | |
2421 | vfsmap, |
|
2420 | vfsmap, | |
2422 | b"journal", |
|
2421 | b"journal", | |
2423 | b"undo", |
|
2422 | b"undo", | |
2424 | aftertrans(renames), |
|
2423 | aftertrans(renames), | |
2425 | self.store.createmode, |
|
2424 | self.store.createmode, | |
2426 | validator=validate, |
|
2425 | validator=validate, | |
2427 | releasefn=releasefn, |
|
2426 | releasefn=releasefn, | |
2428 | checkambigfiles=_cachedfiles, |
|
2427 | checkambigfiles=_cachedfiles, | |
2429 | name=desc, |
|
2428 | name=desc, | |
2430 | ) |
|
2429 | ) | |
2431 | tr.changes[b'origrepolen'] = len(self) |
|
2430 | tr.changes[b'origrepolen'] = len(self) | |
2432 | tr.changes[b'obsmarkers'] = set() |
|
2431 | tr.changes[b'obsmarkers'] = set() | |
2433 | tr.changes[b'phases'] = [] |
|
2432 | tr.changes[b'phases'] = [] | |
2434 | tr.changes[b'bookmarks'] = {} |
|
2433 | tr.changes[b'bookmarks'] = {} | |
2435 |
|
2434 | |||
2436 | tr.hookargs[b'txnid'] = txnid |
|
2435 | tr.hookargs[b'txnid'] = txnid | |
2437 | tr.hookargs[b'txnname'] = desc |
|
2436 | tr.hookargs[b'txnname'] = desc | |
2438 | tr.hookargs[b'changes'] = tr.changes |
|
2437 | tr.hookargs[b'changes'] = tr.changes | |
2439 | # note: writing the fncache only during finalize mean that the file is |
|
2438 | # note: writing the fncache only during finalize mean that the file is | |
2440 | # outdated when running hooks. As fncache is used for streaming clone, |
|
2439 | # outdated when running hooks. As fncache is used for streaming clone, | |
2441 | # this is not expected to break anything that happen during the hooks. |
|
2440 | # this is not expected to break anything that happen during the hooks. | |
2442 | tr.addfinalize(b'flush-fncache', self.store.write) |
|
2441 | tr.addfinalize(b'flush-fncache', self.store.write) | |
2443 |
|
2442 | |||
2444 | def txnclosehook(tr2): |
|
2443 | def txnclosehook(tr2): | |
2445 | """To be run if transaction is successful, will schedule a hook run""" |
|
2444 | """To be run if transaction is successful, will schedule a hook run""" | |
2446 | # Don't reference tr2 in hook() so we don't hold a reference. |
|
2445 | # Don't reference tr2 in hook() so we don't hold a reference. | |
2447 | # This reduces memory consumption when there are multiple |
|
2446 | # This reduces memory consumption when there are multiple | |
2448 | # transactions per lock. This can likely go away if issue5045 |
|
2447 | # transactions per lock. This can likely go away if issue5045 | |
2449 | # fixes the function accumulation. |
|
2448 | # fixes the function accumulation. | |
2450 | hookargs = tr2.hookargs |
|
2449 | hookargs = tr2.hookargs | |
2451 |
|
2450 | |||
2452 | def hookfunc(unused_success): |
|
2451 | def hookfunc(unused_success): | |
2453 | repo = reporef() |
|
2452 | repo = reporef() | |
2454 | if hook.hashook(repo.ui, b'txnclose-bookmark'): |
|
2453 | if hook.hashook(repo.ui, b'txnclose-bookmark'): | |
2455 | bmchanges = sorted(tr.changes[b'bookmarks'].items()) |
|
2454 | bmchanges = sorted(tr.changes[b'bookmarks'].items()) | |
2456 | for name, (old, new) in bmchanges: |
|
2455 | for name, (old, new) in bmchanges: | |
2457 | args = tr.hookargs.copy() |
|
2456 | args = tr.hookargs.copy() | |
2458 | args.update(bookmarks.preparehookargs(name, old, new)) |
|
2457 | args.update(bookmarks.preparehookargs(name, old, new)) | |
2459 | repo.hook( |
|
2458 | repo.hook( | |
2460 | b'txnclose-bookmark', |
|
2459 | b'txnclose-bookmark', | |
2461 | throw=False, |
|
2460 | throw=False, | |
2462 | **pycompat.strkwargs(args) |
|
2461 | **pycompat.strkwargs(args) | |
2463 | ) |
|
2462 | ) | |
2464 |
|
2463 | |||
2465 | if hook.hashook(repo.ui, b'txnclose-phase'): |
|
2464 | if hook.hashook(repo.ui, b'txnclose-phase'): | |
2466 | cl = repo.unfiltered().changelog |
|
2465 | cl = repo.unfiltered().changelog | |
2467 | phasemv = sorted( |
|
2466 | phasemv = sorted( | |
2468 | tr.changes[b'phases'], key=lambda r: r[0][0] |
|
2467 | tr.changes[b'phases'], key=lambda r: r[0][0] | |
2469 | ) |
|
2468 | ) | |
2470 | for revs, (old, new) in phasemv: |
|
2469 | for revs, (old, new) in phasemv: | |
2471 | for rev in revs: |
|
2470 | for rev in revs: | |
2472 | args = tr.hookargs.copy() |
|
2471 | args = tr.hookargs.copy() | |
2473 | node = hex(cl.node(rev)) |
|
2472 | node = hex(cl.node(rev)) | |
2474 | args.update(phases.preparehookargs(node, old, new)) |
|
2473 | args.update(phases.preparehookargs(node, old, new)) | |
2475 | repo.hook( |
|
2474 | repo.hook( | |
2476 | b'txnclose-phase', |
|
2475 | b'txnclose-phase', | |
2477 | throw=False, |
|
2476 | throw=False, | |
2478 | **pycompat.strkwargs(args) |
|
2477 | **pycompat.strkwargs(args) | |
2479 | ) |
|
2478 | ) | |
2480 |
|
2479 | |||
2481 | repo.hook( |
|
2480 | repo.hook( | |
2482 | b'txnclose', throw=False, **pycompat.strkwargs(hookargs) |
|
2481 | b'txnclose', throw=False, **pycompat.strkwargs(hookargs) | |
2483 | ) |
|
2482 | ) | |
2484 |
|
2483 | |||
2485 | reporef()._afterlock(hookfunc) |
|
2484 | reporef()._afterlock(hookfunc) | |
2486 |
|
2485 | |||
2487 | tr.addfinalize(b'txnclose-hook', txnclosehook) |
|
2486 | tr.addfinalize(b'txnclose-hook', txnclosehook) | |
2488 | # Include a leading "-" to make it happen before the transaction summary |
|
2487 | # Include a leading "-" to make it happen before the transaction summary | |
2489 | # reports registered via scmutil.registersummarycallback() whose names |
|
2488 | # reports registered via scmutil.registersummarycallback() whose names | |
2490 | # are 00-txnreport etc. That way, the caches will be warm when the |
|
2489 | # are 00-txnreport etc. That way, the caches will be warm when the | |
2491 | # callbacks run. |
|
2490 | # callbacks run. | |
2492 | tr.addpostclose(b'-warm-cache', self._buildcacheupdater(tr)) |
|
2491 | tr.addpostclose(b'-warm-cache', self._buildcacheupdater(tr)) | |
2493 |
|
2492 | |||
2494 | def txnaborthook(tr2): |
|
2493 | def txnaborthook(tr2): | |
2495 | """To be run if transaction is aborted""" |
|
2494 | """To be run if transaction is aborted""" | |
2496 | reporef().hook( |
|
2495 | reporef().hook( | |
2497 | b'txnabort', throw=False, **pycompat.strkwargs(tr2.hookargs) |
|
2496 | b'txnabort', throw=False, **pycompat.strkwargs(tr2.hookargs) | |
2498 | ) |
|
2497 | ) | |
2499 |
|
2498 | |||
2500 | tr.addabort(b'txnabort-hook', txnaborthook) |
|
2499 | tr.addabort(b'txnabort-hook', txnaborthook) | |
2501 | # avoid eager cache invalidation. in-memory data should be identical |
|
2500 | # avoid eager cache invalidation. in-memory data should be identical | |
2502 | # to stored data if transaction has no error. |
|
2501 | # to stored data if transaction has no error. | |
2503 | tr.addpostclose(b'refresh-filecachestats', self._refreshfilecachestats) |
|
2502 | tr.addpostclose(b'refresh-filecachestats', self._refreshfilecachestats) | |
2504 | self._transref = weakref.ref(tr) |
|
2503 | self._transref = weakref.ref(tr) | |
2505 | scmutil.registersummarycallback(self, tr, desc) |
|
2504 | scmutil.registersummarycallback(self, tr, desc) | |
2506 | return tr |
|
2505 | return tr | |
2507 |
|
2506 | |||
2508 | def _journalfiles(self): |
|
2507 | def _journalfiles(self): | |
2509 | return ( |
|
2508 | return ( | |
2510 | (self.svfs, b'journal'), |
|
2509 | (self.svfs, b'journal'), | |
2511 | (self.svfs, b'journal.narrowspec'), |
|
2510 | (self.svfs, b'journal.narrowspec'), | |
2512 | (self.vfs, b'journal.narrowspec.dirstate'), |
|
2511 | (self.vfs, b'journal.narrowspec.dirstate'), | |
2513 | (self.vfs, b'journal.dirstate'), |
|
2512 | (self.vfs, b'journal.dirstate'), | |
2514 | (self.vfs, b'journal.branch'), |
|
2513 | (self.vfs, b'journal.branch'), | |
2515 | (self.vfs, b'journal.desc'), |
|
2514 | (self.vfs, b'journal.desc'), | |
2516 | (bookmarks.bookmarksvfs(self), b'journal.bookmarks'), |
|
2515 | (bookmarks.bookmarksvfs(self), b'journal.bookmarks'), | |
2517 | (self.svfs, b'journal.phaseroots'), |
|
2516 | (self.svfs, b'journal.phaseroots'), | |
2518 | ) |
|
2517 | ) | |
2519 |
|
2518 | |||
2520 | def undofiles(self): |
|
2519 | def undofiles(self): | |
2521 | return [(vfs, undoname(x)) for vfs, x in self._journalfiles()] |
|
2520 | return [(vfs, undoname(x)) for vfs, x in self._journalfiles()] | |
2522 |
|
2521 | |||
2523 | @unfilteredmethod |
|
2522 | @unfilteredmethod | |
2524 | def _writejournal(self, desc): |
|
2523 | def _writejournal(self, desc): | |
2525 | self.dirstate.savebackup(None, b'journal.dirstate') |
|
2524 | self.dirstate.savebackup(None, b'journal.dirstate') | |
2526 | narrowspec.savewcbackup(self, b'journal.narrowspec.dirstate') |
|
2525 | narrowspec.savewcbackup(self, b'journal.narrowspec.dirstate') | |
2527 | narrowspec.savebackup(self, b'journal.narrowspec') |
|
2526 | narrowspec.savebackup(self, b'journal.narrowspec') | |
2528 | self.vfs.write( |
|
2527 | self.vfs.write( | |
2529 | b"journal.branch", encoding.fromlocal(self.dirstate.branch()) |
|
2528 | b"journal.branch", encoding.fromlocal(self.dirstate.branch()) | |
2530 | ) |
|
2529 | ) | |
2531 | self.vfs.write(b"journal.desc", b"%d\n%s\n" % (len(self), desc)) |
|
2530 | self.vfs.write(b"journal.desc", b"%d\n%s\n" % (len(self), desc)) | |
2532 | bookmarksvfs = bookmarks.bookmarksvfs(self) |
|
2531 | bookmarksvfs = bookmarks.bookmarksvfs(self) | |
2533 | bookmarksvfs.write( |
|
2532 | bookmarksvfs.write( | |
2534 | b"journal.bookmarks", bookmarksvfs.tryread(b"bookmarks") |
|
2533 | b"journal.bookmarks", bookmarksvfs.tryread(b"bookmarks") | |
2535 | ) |
|
2534 | ) | |
2536 | self.svfs.write(b"journal.phaseroots", self.svfs.tryread(b"phaseroots")) |
|
2535 | self.svfs.write(b"journal.phaseroots", self.svfs.tryread(b"phaseroots")) | |
2537 |
|
2536 | |||
2538 | def recover(self): |
|
2537 | def recover(self): | |
2539 | with self.lock(): |
|
2538 | with self.lock(): | |
2540 | if self.svfs.exists(b"journal"): |
|
2539 | if self.svfs.exists(b"journal"): | |
2541 | self.ui.status(_(b"rolling back interrupted transaction\n")) |
|
2540 | self.ui.status(_(b"rolling back interrupted transaction\n")) | |
2542 | vfsmap = { |
|
2541 | vfsmap = { | |
2543 | b'': self.svfs, |
|
2542 | b'': self.svfs, | |
2544 | b'plain': self.vfs, |
|
2543 | b'plain': self.vfs, | |
2545 | } |
|
2544 | } | |
2546 | transaction.rollback( |
|
2545 | transaction.rollback( | |
2547 | self.svfs, |
|
2546 | self.svfs, | |
2548 | vfsmap, |
|
2547 | vfsmap, | |
2549 | b"journal", |
|
2548 | b"journal", | |
2550 | self.ui.warn, |
|
2549 | self.ui.warn, | |
2551 | checkambigfiles=_cachedfiles, |
|
2550 | checkambigfiles=_cachedfiles, | |
2552 | ) |
|
2551 | ) | |
2553 | self.invalidate() |
|
2552 | self.invalidate() | |
2554 | return True |
|
2553 | return True | |
2555 | else: |
|
2554 | else: | |
2556 | self.ui.warn(_(b"no interrupted transaction available\n")) |
|
2555 | self.ui.warn(_(b"no interrupted transaction available\n")) | |
2557 | return False |
|
2556 | return False | |
2558 |
|
2557 | |||
2559 | def rollback(self, dryrun=False, force=False): |
|
2558 | def rollback(self, dryrun=False, force=False): | |
2560 | wlock = lock = dsguard = None |
|
2559 | wlock = lock = dsguard = None | |
2561 | try: |
|
2560 | try: | |
2562 | wlock = self.wlock() |
|
2561 | wlock = self.wlock() | |
2563 | lock = self.lock() |
|
2562 | lock = self.lock() | |
2564 | if self.svfs.exists(b"undo"): |
|
2563 | if self.svfs.exists(b"undo"): | |
2565 | dsguard = dirstateguard.dirstateguard(self, b'rollback') |
|
2564 | dsguard = dirstateguard.dirstateguard(self, b'rollback') | |
2566 |
|
2565 | |||
2567 | return self._rollback(dryrun, force, dsguard) |
|
2566 | return self._rollback(dryrun, force, dsguard) | |
2568 | else: |
|
2567 | else: | |
2569 | self.ui.warn(_(b"no rollback information available\n")) |
|
2568 | self.ui.warn(_(b"no rollback information available\n")) | |
2570 | return 1 |
|
2569 | return 1 | |
2571 | finally: |
|
2570 | finally: | |
2572 | release(dsguard, lock, wlock) |
|
2571 | release(dsguard, lock, wlock) | |
2573 |
|
2572 | |||
2574 | @unfilteredmethod # Until we get smarter cache management |
|
2573 | @unfilteredmethod # Until we get smarter cache management | |
2575 | def _rollback(self, dryrun, force, dsguard): |
|
2574 | def _rollback(self, dryrun, force, dsguard): | |
2576 | ui = self.ui |
|
2575 | ui = self.ui | |
2577 | try: |
|
2576 | try: | |
2578 | args = self.vfs.read(b'undo.desc').splitlines() |
|
2577 | args = self.vfs.read(b'undo.desc').splitlines() | |
2579 | (oldlen, desc, detail) = (int(args[0]), args[1], None) |
|
2578 | (oldlen, desc, detail) = (int(args[0]), args[1], None) | |
2580 | if len(args) >= 3: |
|
2579 | if len(args) >= 3: | |
2581 | detail = args[2] |
|
2580 | detail = args[2] | |
2582 | oldtip = oldlen - 1 |
|
2581 | oldtip = oldlen - 1 | |
2583 |
|
2582 | |||
2584 | if detail and ui.verbose: |
|
2583 | if detail and ui.verbose: | |
2585 | msg = _( |
|
2584 | msg = _( | |
2586 | b'repository tip rolled back to revision %d' |
|
2585 | b'repository tip rolled back to revision %d' | |
2587 | b' (undo %s: %s)\n' |
|
2586 | b' (undo %s: %s)\n' | |
2588 | ) % (oldtip, desc, detail) |
|
2587 | ) % (oldtip, desc, detail) | |
2589 | else: |
|
2588 | else: | |
2590 | msg = _( |
|
2589 | msg = _( | |
2591 | b'repository tip rolled back to revision %d (undo %s)\n' |
|
2590 | b'repository tip rolled back to revision %d (undo %s)\n' | |
2592 | ) % (oldtip, desc) |
|
2591 | ) % (oldtip, desc) | |
2593 | except IOError: |
|
2592 | except IOError: | |
2594 | msg = _(b'rolling back unknown transaction\n') |
|
2593 | msg = _(b'rolling back unknown transaction\n') | |
2595 | desc = None |
|
2594 | desc = None | |
2596 |
|
2595 | |||
2597 | if not force and self[b'.'] != self[b'tip'] and desc == b'commit': |
|
2596 | if not force and self[b'.'] != self[b'tip'] and desc == b'commit': | |
2598 | raise error.Abort( |
|
2597 | raise error.Abort( | |
2599 | _( |
|
2598 | _( | |
2600 | b'rollback of last commit while not checked out ' |
|
2599 | b'rollback of last commit while not checked out ' | |
2601 | b'may lose data' |
|
2600 | b'may lose data' | |
2602 | ), |
|
2601 | ), | |
2603 | hint=_(b'use -f to force'), |
|
2602 | hint=_(b'use -f to force'), | |
2604 | ) |
|
2603 | ) | |
2605 |
|
2604 | |||
2606 | ui.status(msg) |
|
2605 | ui.status(msg) | |
2607 | if dryrun: |
|
2606 | if dryrun: | |
2608 | return 0 |
|
2607 | return 0 | |
2609 |
|
2608 | |||
2610 | parents = self.dirstate.parents() |
|
2609 | parents = self.dirstate.parents() | |
2611 | self.destroying() |
|
2610 | self.destroying() | |
2612 | vfsmap = {b'plain': self.vfs, b'': self.svfs} |
|
2611 | vfsmap = {b'plain': self.vfs, b'': self.svfs} | |
2613 | transaction.rollback( |
|
2612 | transaction.rollback( | |
2614 | self.svfs, vfsmap, b'undo', ui.warn, checkambigfiles=_cachedfiles |
|
2613 | self.svfs, vfsmap, b'undo', ui.warn, checkambigfiles=_cachedfiles | |
2615 | ) |
|
2614 | ) | |
2616 | bookmarksvfs = bookmarks.bookmarksvfs(self) |
|
2615 | bookmarksvfs = bookmarks.bookmarksvfs(self) | |
2617 | if bookmarksvfs.exists(b'undo.bookmarks'): |
|
2616 | if bookmarksvfs.exists(b'undo.bookmarks'): | |
2618 | bookmarksvfs.rename( |
|
2617 | bookmarksvfs.rename( | |
2619 | b'undo.bookmarks', b'bookmarks', checkambig=True |
|
2618 | b'undo.bookmarks', b'bookmarks', checkambig=True | |
2620 | ) |
|
2619 | ) | |
2621 | if self.svfs.exists(b'undo.phaseroots'): |
|
2620 | if self.svfs.exists(b'undo.phaseroots'): | |
2622 | self.svfs.rename(b'undo.phaseroots', b'phaseroots', checkambig=True) |
|
2621 | self.svfs.rename(b'undo.phaseroots', b'phaseroots', checkambig=True) | |
2623 | self.invalidate() |
|
2622 | self.invalidate() | |
2624 |
|
2623 | |||
2625 | has_node = self.changelog.index.has_node |
|
2624 | has_node = self.changelog.index.has_node | |
2626 | parentgone = any(not has_node(p) for p in parents) |
|
2625 | parentgone = any(not has_node(p) for p in parents) | |
2627 | if parentgone: |
|
2626 | if parentgone: | |
2628 | # prevent dirstateguard from overwriting already restored one |
|
2627 | # prevent dirstateguard from overwriting already restored one | |
2629 | dsguard.close() |
|
2628 | dsguard.close() | |
2630 |
|
2629 | |||
2631 | narrowspec.restorebackup(self, b'undo.narrowspec') |
|
2630 | narrowspec.restorebackup(self, b'undo.narrowspec') | |
2632 | narrowspec.restorewcbackup(self, b'undo.narrowspec.dirstate') |
|
2631 | narrowspec.restorewcbackup(self, b'undo.narrowspec.dirstate') | |
2633 | self.dirstate.restorebackup(None, b'undo.dirstate') |
|
2632 | self.dirstate.restorebackup(None, b'undo.dirstate') | |
2634 | try: |
|
2633 | try: | |
2635 | branch = self.vfs.read(b'undo.branch') |
|
2634 | branch = self.vfs.read(b'undo.branch') | |
2636 | self.dirstate.setbranch(encoding.tolocal(branch)) |
|
2635 | self.dirstate.setbranch(encoding.tolocal(branch)) | |
2637 | except IOError: |
|
2636 | except IOError: | |
2638 | ui.warn( |
|
2637 | ui.warn( | |
2639 | _( |
|
2638 | _( | |
2640 | b'named branch could not be reset: ' |
|
2639 | b'named branch could not be reset: ' | |
2641 | b'current branch is still \'%s\'\n' |
|
2640 | b'current branch is still \'%s\'\n' | |
2642 | ) |
|
2641 | ) | |
2643 | % self.dirstate.branch() |
|
2642 | % self.dirstate.branch() | |
2644 | ) |
|
2643 | ) | |
2645 |
|
2644 | |||
2646 | parents = tuple([p.rev() for p in self[None].parents()]) |
|
2645 | parents = tuple([p.rev() for p in self[None].parents()]) | |
2647 | if len(parents) > 1: |
|
2646 | if len(parents) > 1: | |
2648 | ui.status( |
|
2647 | ui.status( | |
2649 | _( |
|
2648 | _( | |
2650 | b'working directory now based on ' |
|
2649 | b'working directory now based on ' | |
2651 | b'revisions %d and %d\n' |
|
2650 | b'revisions %d and %d\n' | |
2652 | ) |
|
2651 | ) | |
2653 | % parents |
|
2652 | % parents | |
2654 | ) |
|
2653 | ) | |
2655 | else: |
|
2654 | else: | |
2656 | ui.status( |
|
2655 | ui.status( | |
2657 | _(b'working directory now based on revision %d\n') % parents |
|
2656 | _(b'working directory now based on revision %d\n') % parents | |
2658 | ) |
|
2657 | ) | |
2659 | mergestatemod.mergestate.clean(self) |
|
2658 | mergestatemod.mergestate.clean(self) | |
2660 |
|
2659 | |||
2661 | # TODO: if we know which new heads may result from this rollback, pass |
|
2660 | # TODO: if we know which new heads may result from this rollback, pass | |
2662 | # them to destroy(), which will prevent the branchhead cache from being |
|
2661 | # them to destroy(), which will prevent the branchhead cache from being | |
2663 | # invalidated. |
|
2662 | # invalidated. | |
2664 | self.destroyed() |
|
2663 | self.destroyed() | |
2665 | return 0 |
|
2664 | return 0 | |
2666 |
|
2665 | |||
2667 | def _buildcacheupdater(self, newtransaction): |
|
2666 | def _buildcacheupdater(self, newtransaction): | |
2668 | """called during transaction to build the callback updating cache |
|
2667 | """called during transaction to build the callback updating cache | |
2669 |
|
2668 | |||
2670 | Lives on the repository to help extension who might want to augment |
|
2669 | Lives on the repository to help extension who might want to augment | |
2671 | this logic. For this purpose, the created transaction is passed to the |
|
2670 | this logic. For this purpose, the created transaction is passed to the | |
2672 | method. |
|
2671 | method. | |
2673 | """ |
|
2672 | """ | |
2674 | # we must avoid cyclic reference between repo and transaction. |
|
2673 | # we must avoid cyclic reference between repo and transaction. | |
2675 | reporef = weakref.ref(self) |
|
2674 | reporef = weakref.ref(self) | |
2676 |
|
2675 | |||
2677 | def updater(tr): |
|
2676 | def updater(tr): | |
2678 | repo = reporef() |
|
2677 | repo = reporef() | |
2679 | repo.updatecaches(tr) |
|
2678 | repo.updatecaches(tr) | |
2680 |
|
2679 | |||
2681 | return updater |
|
2680 | return updater | |
2682 |
|
2681 | |||
2683 | @unfilteredmethod |
|
2682 | @unfilteredmethod | |
2684 | def updatecaches(self, tr=None, full=False): |
|
2683 | def updatecaches(self, tr=None, full=False): | |
2685 | """warm appropriate caches |
|
2684 | """warm appropriate caches | |
2686 |
|
2685 | |||
2687 | If this function is called after a transaction closed. The transaction |
|
2686 | If this function is called after a transaction closed. The transaction | |
2688 | will be available in the 'tr' argument. This can be used to selectively |
|
2687 | will be available in the 'tr' argument. This can be used to selectively | |
2689 | update caches relevant to the changes in that transaction. |
|
2688 | update caches relevant to the changes in that transaction. | |
2690 |
|
2689 | |||
2691 | If 'full' is set, make sure all caches the function knows about have |
|
2690 | If 'full' is set, make sure all caches the function knows about have | |
2692 | up-to-date data. Even the ones usually loaded more lazily. |
|
2691 | up-to-date data. Even the ones usually loaded more lazily. | |
2693 | """ |
|
2692 | """ | |
2694 | if tr is not None and tr.hookargs.get(b'source') == b'strip': |
|
2693 | if tr is not None and tr.hookargs.get(b'source') == b'strip': | |
2695 | # During strip, many caches are invalid but |
|
2694 | # During strip, many caches are invalid but | |
2696 | # later call to `destroyed` will refresh them. |
|
2695 | # later call to `destroyed` will refresh them. | |
2697 | return |
|
2696 | return | |
2698 |
|
2697 | |||
2699 | if tr is None or tr.changes[b'origrepolen'] < len(self): |
|
2698 | if tr is None or tr.changes[b'origrepolen'] < len(self): | |
2700 | # accessing the 'served' branchmap should refresh all the others, |
|
2699 | # accessing the 'served' branchmap should refresh all the others, | |
2701 | self.ui.debug(b'updating the branch cache\n') |
|
2700 | self.ui.debug(b'updating the branch cache\n') | |
2702 | self.filtered(b'served').branchmap() |
|
2701 | self.filtered(b'served').branchmap() | |
2703 | self.filtered(b'served.hidden').branchmap() |
|
2702 | self.filtered(b'served.hidden').branchmap() | |
2704 |
|
2703 | |||
2705 | if full: |
|
2704 | if full: | |
2706 | unfi = self.unfiltered() |
|
2705 | unfi = self.unfiltered() | |
2707 |
|
2706 | |||
2708 | self.changelog.update_caches(transaction=tr) |
|
2707 | self.changelog.update_caches(transaction=tr) | |
2709 | self.manifestlog.update_caches(transaction=tr) |
|
2708 | self.manifestlog.update_caches(transaction=tr) | |
2710 |
|
2709 | |||
2711 | rbc = unfi.revbranchcache() |
|
2710 | rbc = unfi.revbranchcache() | |
2712 | for r in unfi.changelog: |
|
2711 | for r in unfi.changelog: | |
2713 | rbc.branchinfo(r) |
|
2712 | rbc.branchinfo(r) | |
2714 | rbc.write() |
|
2713 | rbc.write() | |
2715 |
|
2714 | |||
2716 | # ensure the working copy parents are in the manifestfulltextcache |
|
2715 | # ensure the working copy parents are in the manifestfulltextcache | |
2717 | for ctx in self[b'.'].parents(): |
|
2716 | for ctx in self[b'.'].parents(): | |
2718 | ctx.manifest() # accessing the manifest is enough |
|
2717 | ctx.manifest() # accessing the manifest is enough | |
2719 |
|
2718 | |||
2720 | # accessing fnode cache warms the cache |
|
2719 | # accessing fnode cache warms the cache | |
2721 | tagsmod.fnoderevs(self.ui, unfi, unfi.changelog.revs()) |
|
2720 | tagsmod.fnoderevs(self.ui, unfi, unfi.changelog.revs()) | |
2722 | # accessing tags warm the cache |
|
2721 | # accessing tags warm the cache | |
2723 | self.tags() |
|
2722 | self.tags() | |
2724 | self.filtered(b'served').tags() |
|
2723 | self.filtered(b'served').tags() | |
2725 |
|
2724 | |||
2726 | # The `full` arg is documented as updating even the lazily-loaded |
|
2725 | # The `full` arg is documented as updating even the lazily-loaded | |
2727 | # caches immediately, so we're forcing a write to cause these caches |
|
2726 | # caches immediately, so we're forcing a write to cause these caches | |
2728 | # to be warmed up even if they haven't explicitly been requested |
|
2727 | # to be warmed up even if they haven't explicitly been requested | |
2729 | # yet (if they've never been used by hg, they won't ever have been |
|
2728 | # yet (if they've never been used by hg, they won't ever have been | |
2730 | # written, even if they're a subset of another kind of cache that |
|
2729 | # written, even if they're a subset of another kind of cache that | |
2731 | # *has* been used). |
|
2730 | # *has* been used). | |
2732 | for filt in repoview.filtertable.keys(): |
|
2731 | for filt in repoview.filtertable.keys(): | |
2733 | filtered = self.filtered(filt) |
|
2732 | filtered = self.filtered(filt) | |
2734 | filtered.branchmap().write(filtered) |
|
2733 | filtered.branchmap().write(filtered) | |
2735 |
|
2734 | |||
2736 | def invalidatecaches(self): |
|
2735 | def invalidatecaches(self): | |
2737 |
|
2736 | |||
2738 | if '_tagscache' in vars(self): |
|
2737 | if '_tagscache' in vars(self): | |
2739 | # can't use delattr on proxy |
|
2738 | # can't use delattr on proxy | |
2740 | del self.__dict__['_tagscache'] |
|
2739 | del self.__dict__['_tagscache'] | |
2741 |
|
2740 | |||
2742 | self._branchcaches.clear() |
|
2741 | self._branchcaches.clear() | |
2743 | self.invalidatevolatilesets() |
|
2742 | self.invalidatevolatilesets() | |
2744 | self._sparsesignaturecache.clear() |
|
2743 | self._sparsesignaturecache.clear() | |
2745 |
|
2744 | |||
2746 | def invalidatevolatilesets(self): |
|
2745 | def invalidatevolatilesets(self): | |
2747 | self.filteredrevcache.clear() |
|
2746 | self.filteredrevcache.clear() | |
2748 | obsolete.clearobscaches(self) |
|
2747 | obsolete.clearobscaches(self) | |
2749 | self._quick_access_changeid_invalidate() |
|
2748 | self._quick_access_changeid_invalidate() | |
2750 |
|
2749 | |||
2751 | def invalidatedirstate(self): |
|
2750 | def invalidatedirstate(self): | |
2752 | """Invalidates the dirstate, causing the next call to dirstate |
|
2751 | """Invalidates the dirstate, causing the next call to dirstate | |
2753 | to check if it was modified since the last time it was read, |
|
2752 | to check if it was modified since the last time it was read, | |
2754 | rereading it if it has. |
|
2753 | rereading it if it has. | |
2755 |
|
2754 | |||
2756 | This is different to dirstate.invalidate() that it doesn't always |
|
2755 | This is different to dirstate.invalidate() that it doesn't always | |
2757 | rereads the dirstate. Use dirstate.invalidate() if you want to |
|
2756 | rereads the dirstate. Use dirstate.invalidate() if you want to | |
2758 | explicitly read the dirstate again (i.e. restoring it to a previous |
|
2757 | explicitly read the dirstate again (i.e. restoring it to a previous | |
2759 | known good state).""" |
|
2758 | known good state).""" | |
2760 | if hasunfilteredcache(self, 'dirstate'): |
|
2759 | if hasunfilteredcache(self, 'dirstate'): | |
2761 | for k in self.dirstate._filecache: |
|
2760 | for k in self.dirstate._filecache: | |
2762 | try: |
|
2761 | try: | |
2763 | delattr(self.dirstate, k) |
|
2762 | delattr(self.dirstate, k) | |
2764 | except AttributeError: |
|
2763 | except AttributeError: | |
2765 | pass |
|
2764 | pass | |
2766 | delattr(self.unfiltered(), 'dirstate') |
|
2765 | delattr(self.unfiltered(), 'dirstate') | |
2767 |
|
2766 | |||
2768 | def invalidate(self, clearfilecache=False): |
|
2767 | def invalidate(self, clearfilecache=False): | |
2769 | """Invalidates both store and non-store parts other than dirstate |
|
2768 | """Invalidates both store and non-store parts other than dirstate | |
2770 |
|
2769 | |||
2771 | If a transaction is running, invalidation of store is omitted, |
|
2770 | If a transaction is running, invalidation of store is omitted, | |
2772 | because discarding in-memory changes might cause inconsistency |
|
2771 | because discarding in-memory changes might cause inconsistency | |
2773 | (e.g. incomplete fncache causes unintentional failure, but |
|
2772 | (e.g. incomplete fncache causes unintentional failure, but | |
2774 | redundant one doesn't). |
|
2773 | redundant one doesn't). | |
2775 | """ |
|
2774 | """ | |
2776 | unfiltered = self.unfiltered() # all file caches are stored unfiltered |
|
2775 | unfiltered = self.unfiltered() # all file caches are stored unfiltered | |
2777 | for k in list(self._filecache.keys()): |
|
2776 | for k in list(self._filecache.keys()): | |
2778 | # dirstate is invalidated separately in invalidatedirstate() |
|
2777 | # dirstate is invalidated separately in invalidatedirstate() | |
2779 | if k == b'dirstate': |
|
2778 | if k == b'dirstate': | |
2780 | continue |
|
2779 | continue | |
2781 | if ( |
|
2780 | if ( | |
2782 | k == b'changelog' |
|
2781 | k == b'changelog' | |
2783 | and self.currenttransaction() |
|
2782 | and self.currenttransaction() | |
2784 | and self.changelog._delayed |
|
2783 | and self.changelog._delayed | |
2785 | ): |
|
2784 | ): | |
2786 | # The changelog object may store unwritten revisions. We don't |
|
2785 | # The changelog object may store unwritten revisions. We don't | |
2787 | # want to lose them. |
|
2786 | # want to lose them. | |
2788 | # TODO: Solve the problem instead of working around it. |
|
2787 | # TODO: Solve the problem instead of working around it. | |
2789 | continue |
|
2788 | continue | |
2790 |
|
2789 | |||
2791 | if clearfilecache: |
|
2790 | if clearfilecache: | |
2792 | del self._filecache[k] |
|
2791 | del self._filecache[k] | |
2793 | try: |
|
2792 | try: | |
2794 | delattr(unfiltered, k) |
|
2793 | delattr(unfiltered, k) | |
2795 | except AttributeError: |
|
2794 | except AttributeError: | |
2796 | pass |
|
2795 | pass | |
2797 | self.invalidatecaches() |
|
2796 | self.invalidatecaches() | |
2798 | if not self.currenttransaction(): |
|
2797 | if not self.currenttransaction(): | |
2799 | # TODO: Changing contents of store outside transaction |
|
2798 | # TODO: Changing contents of store outside transaction | |
2800 | # causes inconsistency. We should make in-memory store |
|
2799 | # causes inconsistency. We should make in-memory store | |
2801 | # changes detectable, and abort if changed. |
|
2800 | # changes detectable, and abort if changed. | |
2802 | self.store.invalidatecaches() |
|
2801 | self.store.invalidatecaches() | |
2803 |
|
2802 | |||
2804 | def invalidateall(self): |
|
2803 | def invalidateall(self): | |
2805 | """Fully invalidates both store and non-store parts, causing the |
|
2804 | """Fully invalidates both store and non-store parts, causing the | |
2806 | subsequent operation to reread any outside changes.""" |
|
2805 | subsequent operation to reread any outside changes.""" | |
2807 | # extension should hook this to invalidate its caches |
|
2806 | # extension should hook this to invalidate its caches | |
2808 | self.invalidate() |
|
2807 | self.invalidate() | |
2809 | self.invalidatedirstate() |
|
2808 | self.invalidatedirstate() | |
2810 |
|
2809 | |||
2811 | @unfilteredmethod |
|
2810 | @unfilteredmethod | |
2812 | def _refreshfilecachestats(self, tr): |
|
2811 | def _refreshfilecachestats(self, tr): | |
2813 | """Reload stats of cached files so that they are flagged as valid""" |
|
2812 | """Reload stats of cached files so that they are flagged as valid""" | |
2814 | for k, ce in self._filecache.items(): |
|
2813 | for k, ce in self._filecache.items(): | |
2815 | k = pycompat.sysstr(k) |
|
2814 | k = pycompat.sysstr(k) | |
2816 | if k == 'dirstate' or k not in self.__dict__: |
|
2815 | if k == 'dirstate' or k not in self.__dict__: | |
2817 | continue |
|
2816 | continue | |
2818 | ce.refresh() |
|
2817 | ce.refresh() | |
2819 |
|
2818 | |||
2820 | def _lock( |
|
2819 | def _lock( | |
2821 | self, |
|
2820 | self, | |
2822 | vfs, |
|
2821 | vfs, | |
2823 | lockname, |
|
2822 | lockname, | |
2824 | wait, |
|
2823 | wait, | |
2825 | releasefn, |
|
2824 | releasefn, | |
2826 | acquirefn, |
|
2825 | acquirefn, | |
2827 | desc, |
|
2826 | desc, | |
2828 | ): |
|
2827 | ): | |
2829 | timeout = 0 |
|
2828 | timeout = 0 | |
2830 | warntimeout = 0 |
|
2829 | warntimeout = 0 | |
2831 | if wait: |
|
2830 | if wait: | |
2832 | timeout = self.ui.configint(b"ui", b"timeout") |
|
2831 | timeout = self.ui.configint(b"ui", b"timeout") | |
2833 | warntimeout = self.ui.configint(b"ui", b"timeout.warn") |
|
2832 | warntimeout = self.ui.configint(b"ui", b"timeout.warn") | |
2834 | # internal config: ui.signal-safe-lock |
|
2833 | # internal config: ui.signal-safe-lock | |
2835 | signalsafe = self.ui.configbool(b'ui', b'signal-safe-lock') |
|
2834 | signalsafe = self.ui.configbool(b'ui', b'signal-safe-lock') | |
2836 |
|
2835 | |||
2837 | l = lockmod.trylock( |
|
2836 | l = lockmod.trylock( | |
2838 | self.ui, |
|
2837 | self.ui, | |
2839 | vfs, |
|
2838 | vfs, | |
2840 | lockname, |
|
2839 | lockname, | |
2841 | timeout, |
|
2840 | timeout, | |
2842 | warntimeout, |
|
2841 | warntimeout, | |
2843 | releasefn=releasefn, |
|
2842 | releasefn=releasefn, | |
2844 | acquirefn=acquirefn, |
|
2843 | acquirefn=acquirefn, | |
2845 | desc=desc, |
|
2844 | desc=desc, | |
2846 | signalsafe=signalsafe, |
|
2845 | signalsafe=signalsafe, | |
2847 | ) |
|
2846 | ) | |
2848 | return l |
|
2847 | return l | |
2849 |
|
2848 | |||
2850 | def _afterlock(self, callback): |
|
2849 | def _afterlock(self, callback): | |
2851 | """add a callback to be run when the repository is fully unlocked |
|
2850 | """add a callback to be run when the repository is fully unlocked | |
2852 |
|
2851 | |||
2853 | The callback will be executed when the outermost lock is released |
|
2852 | The callback will be executed when the outermost lock is released | |
2854 | (with wlock being higher level than 'lock').""" |
|
2853 | (with wlock being higher level than 'lock').""" | |
2855 | for ref in (self._wlockref, self._lockref): |
|
2854 | for ref in (self._wlockref, self._lockref): | |
2856 | l = ref and ref() |
|
2855 | l = ref and ref() | |
2857 | if l and l.held: |
|
2856 | if l and l.held: | |
2858 | l.postrelease.append(callback) |
|
2857 | l.postrelease.append(callback) | |
2859 | break |
|
2858 | break | |
2860 | else: # no lock have been found. |
|
2859 | else: # no lock have been found. | |
2861 | callback(True) |
|
2860 | callback(True) | |
2862 |
|
2861 | |||
2863 | def lock(self, wait=True): |
|
2862 | def lock(self, wait=True): | |
2864 | """Lock the repository store (.hg/store) and return a weak reference |
|
2863 | """Lock the repository store (.hg/store) and return a weak reference | |
2865 | to the lock. Use this before modifying the store (e.g. committing or |
|
2864 | to the lock. Use this before modifying the store (e.g. committing or | |
2866 | stripping). If you are opening a transaction, get a lock as well.) |
|
2865 | stripping). If you are opening a transaction, get a lock as well.) | |
2867 |
|
2866 | |||
2868 | If both 'lock' and 'wlock' must be acquired, ensure you always acquires |
|
2867 | If both 'lock' and 'wlock' must be acquired, ensure you always acquires | |
2869 | 'wlock' first to avoid a dead-lock hazard.""" |
|
2868 | 'wlock' first to avoid a dead-lock hazard.""" | |
2870 | l = self._currentlock(self._lockref) |
|
2869 | l = self._currentlock(self._lockref) | |
2871 | if l is not None: |
|
2870 | if l is not None: | |
2872 | l.lock() |
|
2871 | l.lock() | |
2873 | return l |
|
2872 | return l | |
2874 |
|
2873 | |||
2875 | l = self._lock( |
|
2874 | l = self._lock( | |
2876 | vfs=self.svfs, |
|
2875 | vfs=self.svfs, | |
2877 | lockname=b"lock", |
|
2876 | lockname=b"lock", | |
2878 | wait=wait, |
|
2877 | wait=wait, | |
2879 | releasefn=None, |
|
2878 | releasefn=None, | |
2880 | acquirefn=self.invalidate, |
|
2879 | acquirefn=self.invalidate, | |
2881 | desc=_(b'repository %s') % self.origroot, |
|
2880 | desc=_(b'repository %s') % self.origroot, | |
2882 | ) |
|
2881 | ) | |
2883 | self._lockref = weakref.ref(l) |
|
2882 | self._lockref = weakref.ref(l) | |
2884 | return l |
|
2883 | return l | |
2885 |
|
2884 | |||
2886 | def wlock(self, wait=True): |
|
2885 | def wlock(self, wait=True): | |
2887 | """Lock the non-store parts of the repository (everything under |
|
2886 | """Lock the non-store parts of the repository (everything under | |
2888 | .hg except .hg/store) and return a weak reference to the lock. |
|
2887 | .hg except .hg/store) and return a weak reference to the lock. | |
2889 |
|
2888 | |||
2890 | Use this before modifying files in .hg. |
|
2889 | Use this before modifying files in .hg. | |
2891 |
|
2890 | |||
2892 | If both 'lock' and 'wlock' must be acquired, ensure you always acquires |
|
2891 | If both 'lock' and 'wlock' must be acquired, ensure you always acquires | |
2893 | 'wlock' first to avoid a dead-lock hazard.""" |
|
2892 | 'wlock' first to avoid a dead-lock hazard.""" | |
2894 | l = self._wlockref and self._wlockref() |
|
2893 | l = self._wlockref and self._wlockref() | |
2895 | if l is not None and l.held: |
|
2894 | if l is not None and l.held: | |
2896 | l.lock() |
|
2895 | l.lock() | |
2897 | return l |
|
2896 | return l | |
2898 |
|
2897 | |||
2899 | # We do not need to check for non-waiting lock acquisition. Such |
|
2898 | # We do not need to check for non-waiting lock acquisition. Such | |
2900 | # acquisition would not cause dead-lock as they would just fail. |
|
2899 | # acquisition would not cause dead-lock as they would just fail. | |
2901 | if wait and ( |
|
2900 | if wait and ( | |
2902 | self.ui.configbool(b'devel', b'all-warnings') |
|
2901 | self.ui.configbool(b'devel', b'all-warnings') | |
2903 | or self.ui.configbool(b'devel', b'check-locks') |
|
2902 | or self.ui.configbool(b'devel', b'check-locks') | |
2904 | ): |
|
2903 | ): | |
2905 | if self._currentlock(self._lockref) is not None: |
|
2904 | if self._currentlock(self._lockref) is not None: | |
2906 | self.ui.develwarn(b'"wlock" acquired after "lock"') |
|
2905 | self.ui.develwarn(b'"wlock" acquired after "lock"') | |
2907 |
|
2906 | |||
2908 | def unlock(): |
|
2907 | def unlock(): | |
2909 | if self.dirstate.pendingparentchange(): |
|
2908 | if self.dirstate.pendingparentchange(): | |
2910 | self.dirstate.invalidate() |
|
2909 | self.dirstate.invalidate() | |
2911 | else: |
|
2910 | else: | |
2912 | self.dirstate.write(None) |
|
2911 | self.dirstate.write(None) | |
2913 |
|
2912 | |||
2914 | self._filecache[b'dirstate'].refresh() |
|
2913 | self._filecache[b'dirstate'].refresh() | |
2915 |
|
2914 | |||
2916 | l = self._lock( |
|
2915 | l = self._lock( | |
2917 | self.vfs, |
|
2916 | self.vfs, | |
2918 | b"wlock", |
|
2917 | b"wlock", | |
2919 | wait, |
|
2918 | wait, | |
2920 | unlock, |
|
2919 | unlock, | |
2921 | self.invalidatedirstate, |
|
2920 | self.invalidatedirstate, | |
2922 | _(b'working directory of %s') % self.origroot, |
|
2921 | _(b'working directory of %s') % self.origroot, | |
2923 | ) |
|
2922 | ) | |
2924 | self._wlockref = weakref.ref(l) |
|
2923 | self._wlockref = weakref.ref(l) | |
2925 | return l |
|
2924 | return l | |
2926 |
|
2925 | |||
2927 | def _currentlock(self, lockref): |
|
2926 | def _currentlock(self, lockref): | |
2928 | """Returns the lock if it's held, or None if it's not.""" |
|
2927 | """Returns the lock if it's held, or None if it's not.""" | |
2929 | if lockref is None: |
|
2928 | if lockref is None: | |
2930 | return None |
|
2929 | return None | |
2931 | l = lockref() |
|
2930 | l = lockref() | |
2932 | if l is None or not l.held: |
|
2931 | if l is None or not l.held: | |
2933 | return None |
|
2932 | return None | |
2934 | return l |
|
2933 | return l | |
2935 |
|
2934 | |||
2936 | def currentwlock(self): |
|
2935 | def currentwlock(self): | |
2937 | """Returns the wlock if it's held, or None if it's not.""" |
|
2936 | """Returns the wlock if it's held, or None if it's not.""" | |
2938 | return self._currentlock(self._wlockref) |
|
2937 | return self._currentlock(self._wlockref) | |
2939 |
|
2938 | |||
2940 | def checkcommitpatterns(self, wctx, match, status, fail): |
|
2939 | def checkcommitpatterns(self, wctx, match, status, fail): | |
2941 | """check for commit arguments that aren't committable""" |
|
2940 | """check for commit arguments that aren't committable""" | |
2942 | if match.isexact() or match.prefix(): |
|
2941 | if match.isexact() or match.prefix(): | |
2943 | matched = set(status.modified + status.added + status.removed) |
|
2942 | matched = set(status.modified + status.added + status.removed) | |
2944 |
|
2943 | |||
2945 | for f in match.files(): |
|
2944 | for f in match.files(): | |
2946 | f = self.dirstate.normalize(f) |
|
2945 | f = self.dirstate.normalize(f) | |
2947 | if f == b'.' or f in matched or f in wctx.substate: |
|
2946 | if f == b'.' or f in matched or f in wctx.substate: | |
2948 | continue |
|
2947 | continue | |
2949 | if f in status.deleted: |
|
2948 | if f in status.deleted: | |
2950 | fail(f, _(b'file not found!')) |
|
2949 | fail(f, _(b'file not found!')) | |
2951 | # Is it a directory that exists or used to exist? |
|
2950 | # Is it a directory that exists or used to exist? | |
2952 | if self.wvfs.isdir(f) or wctx.p1().hasdir(f): |
|
2951 | if self.wvfs.isdir(f) or wctx.p1().hasdir(f): | |
2953 | d = f + b'/' |
|
2952 | d = f + b'/' | |
2954 | for mf in matched: |
|
2953 | for mf in matched: | |
2955 | if mf.startswith(d): |
|
2954 | if mf.startswith(d): | |
2956 | break |
|
2955 | break | |
2957 | else: |
|
2956 | else: | |
2958 | fail(f, _(b"no match under directory!")) |
|
2957 | fail(f, _(b"no match under directory!")) | |
2959 | elif f not in self.dirstate: |
|
2958 | elif f not in self.dirstate: | |
2960 | fail(f, _(b"file not tracked!")) |
|
2959 | fail(f, _(b"file not tracked!")) | |
2961 |
|
2960 | |||
2962 | @unfilteredmethod |
|
2961 | @unfilteredmethod | |
2963 | def commit( |
|
2962 | def commit( | |
2964 | self, |
|
2963 | self, | |
2965 | text=b"", |
|
2964 | text=b"", | |
2966 | user=None, |
|
2965 | user=None, | |
2967 | date=None, |
|
2966 | date=None, | |
2968 | match=None, |
|
2967 | match=None, | |
2969 | force=False, |
|
2968 | force=False, | |
2970 | editor=None, |
|
2969 | editor=None, | |
2971 | extra=None, |
|
2970 | extra=None, | |
2972 | ): |
|
2971 | ): | |
2973 | """Add a new revision to current repository. |
|
2972 | """Add a new revision to current repository. | |
2974 |
|
2973 | |||
2975 | Revision information is gathered from the working directory, |
|
2974 | Revision information is gathered from the working directory, | |
2976 | match can be used to filter the committed files. If editor is |
|
2975 | match can be used to filter the committed files. If editor is | |
2977 | supplied, it is called to get a commit message. |
|
2976 | supplied, it is called to get a commit message. | |
2978 | """ |
|
2977 | """ | |
2979 | if extra is None: |
|
2978 | if extra is None: | |
2980 | extra = {} |
|
2979 | extra = {} | |
2981 |
|
2980 | |||
2982 | def fail(f, msg): |
|
2981 | def fail(f, msg): | |
2983 | raise error.InputError(b'%s: %s' % (f, msg)) |
|
2982 | raise error.InputError(b'%s: %s' % (f, msg)) | |
2984 |
|
2983 | |||
2985 | if not match: |
|
2984 | if not match: | |
2986 | match = matchmod.always() |
|
2985 | match = matchmod.always() | |
2987 |
|
2986 | |||
2988 | if not force: |
|
2987 | if not force: | |
2989 | match.bad = fail |
|
2988 | match.bad = fail | |
2990 |
|
2989 | |||
2991 | # lock() for recent changelog (see issue4368) |
|
2990 | # lock() for recent changelog (see issue4368) | |
2992 | with self.wlock(), self.lock(): |
|
2991 | with self.wlock(), self.lock(): | |
2993 | wctx = self[None] |
|
2992 | wctx = self[None] | |
2994 | merge = len(wctx.parents()) > 1 |
|
2993 | merge = len(wctx.parents()) > 1 | |
2995 |
|
2994 | |||
2996 | if not force and merge and not match.always(): |
|
2995 | if not force and merge and not match.always(): | |
2997 | raise error.Abort( |
|
2996 | raise error.Abort( | |
2998 | _( |
|
2997 | _( | |
2999 | b'cannot partially commit a merge ' |
|
2998 | b'cannot partially commit a merge ' | |
3000 | b'(do not specify files or patterns)' |
|
2999 | b'(do not specify files or patterns)' | |
3001 | ) |
|
3000 | ) | |
3002 | ) |
|
3001 | ) | |
3003 |
|
3002 | |||
3004 | status = self.status(match=match, clean=force) |
|
3003 | status = self.status(match=match, clean=force) | |
3005 | if force: |
|
3004 | if force: | |
3006 | status.modified.extend( |
|
3005 | status.modified.extend( | |
3007 | status.clean |
|
3006 | status.clean | |
3008 | ) # mq may commit clean files |
|
3007 | ) # mq may commit clean files | |
3009 |
|
3008 | |||
3010 | # check subrepos |
|
3009 | # check subrepos | |
3011 | subs, commitsubs, newstate = subrepoutil.precommit( |
|
3010 | subs, commitsubs, newstate = subrepoutil.precommit( | |
3012 | self.ui, wctx, status, match, force=force |
|
3011 | self.ui, wctx, status, match, force=force | |
3013 | ) |
|
3012 | ) | |
3014 |
|
3013 | |||
3015 | # make sure all explicit patterns are matched |
|
3014 | # make sure all explicit patterns are matched | |
3016 | if not force: |
|
3015 | if not force: | |
3017 | self.checkcommitpatterns(wctx, match, status, fail) |
|
3016 | self.checkcommitpatterns(wctx, match, status, fail) | |
3018 |
|
3017 | |||
3019 | cctx = context.workingcommitctx( |
|
3018 | cctx = context.workingcommitctx( | |
3020 | self, status, text, user, date, extra |
|
3019 | self, status, text, user, date, extra | |
3021 | ) |
|
3020 | ) | |
3022 |
|
3021 | |||
3023 | ms = mergestatemod.mergestate.read(self) |
|
3022 | ms = mergestatemod.mergestate.read(self) | |
3024 | mergeutil.checkunresolved(ms) |
|
3023 | mergeutil.checkunresolved(ms) | |
3025 |
|
3024 | |||
3026 | # internal config: ui.allowemptycommit |
|
3025 | # internal config: ui.allowemptycommit | |
3027 | if cctx.isempty() and not self.ui.configbool( |
|
3026 | if cctx.isempty() and not self.ui.configbool( | |
3028 | b'ui', b'allowemptycommit' |
|
3027 | b'ui', b'allowemptycommit' | |
3029 | ): |
|
3028 | ): | |
3030 | self.ui.debug(b'nothing to commit, clearing merge state\n') |
|
3029 | self.ui.debug(b'nothing to commit, clearing merge state\n') | |
3031 | ms.reset() |
|
3030 | ms.reset() | |
3032 | return None |
|
3031 | return None | |
3033 |
|
3032 | |||
3034 | if merge and cctx.deleted(): |
|
3033 | if merge and cctx.deleted(): | |
3035 | raise error.Abort(_(b"cannot commit merge with missing files")) |
|
3034 | raise error.Abort(_(b"cannot commit merge with missing files")) | |
3036 |
|
3035 | |||
3037 | if editor: |
|
3036 | if editor: | |
3038 | cctx._text = editor(self, cctx, subs) |
|
3037 | cctx._text = editor(self, cctx, subs) | |
3039 | edited = text != cctx._text |
|
3038 | edited = text != cctx._text | |
3040 |
|
3039 | |||
3041 | # Save commit message in case this transaction gets rolled back |
|
3040 | # Save commit message in case this transaction gets rolled back | |
3042 | # (e.g. by a pretxncommit hook). Leave the content alone on |
|
3041 | # (e.g. by a pretxncommit hook). Leave the content alone on | |
3043 | # the assumption that the user will use the same editor again. |
|
3042 | # the assumption that the user will use the same editor again. | |
3044 | msgfn = self.savecommitmessage(cctx._text) |
|
3043 | msgfn = self.savecommitmessage(cctx._text) | |
3045 |
|
3044 | |||
3046 | # commit subs and write new state |
|
3045 | # commit subs and write new state | |
3047 | if subs: |
|
3046 | if subs: | |
3048 | uipathfn = scmutil.getuipathfn(self) |
|
3047 | uipathfn = scmutil.getuipathfn(self) | |
3049 | for s in sorted(commitsubs): |
|
3048 | for s in sorted(commitsubs): | |
3050 | sub = wctx.sub(s) |
|
3049 | sub = wctx.sub(s) | |
3051 | self.ui.status( |
|
3050 | self.ui.status( | |
3052 | _(b'committing subrepository %s\n') |
|
3051 | _(b'committing subrepository %s\n') | |
3053 | % uipathfn(subrepoutil.subrelpath(sub)) |
|
3052 | % uipathfn(subrepoutil.subrelpath(sub)) | |
3054 | ) |
|
3053 | ) | |
3055 | sr = sub.commit(cctx._text, user, date) |
|
3054 | sr = sub.commit(cctx._text, user, date) | |
3056 | newstate[s] = (newstate[s][0], sr) |
|
3055 | newstate[s] = (newstate[s][0], sr) | |
3057 | subrepoutil.writestate(self, newstate) |
|
3056 | subrepoutil.writestate(self, newstate) | |
3058 |
|
3057 | |||
3059 | p1, p2 = self.dirstate.parents() |
|
3058 | p1, p2 = self.dirstate.parents() | |
3060 | hookp1, hookp2 = hex(p1), (p2 != nullid and hex(p2) or b'') |
|
3059 | hookp1, hookp2 = hex(p1), (p2 != nullid and hex(p2) or b'') | |
3061 | try: |
|
3060 | try: | |
3062 | self.hook( |
|
3061 | self.hook( | |
3063 | b"precommit", throw=True, parent1=hookp1, parent2=hookp2 |
|
3062 | b"precommit", throw=True, parent1=hookp1, parent2=hookp2 | |
3064 | ) |
|
3063 | ) | |
3065 | with self.transaction(b'commit'): |
|
3064 | with self.transaction(b'commit'): | |
3066 | ret = self.commitctx(cctx, True) |
|
3065 | ret = self.commitctx(cctx, True) | |
3067 | # update bookmarks, dirstate and mergestate |
|
3066 | # update bookmarks, dirstate and mergestate | |
3068 | bookmarks.update(self, [p1, p2], ret) |
|
3067 | bookmarks.update(self, [p1, p2], ret) | |
3069 | cctx.markcommitted(ret) |
|
3068 | cctx.markcommitted(ret) | |
3070 | ms.reset() |
|
3069 | ms.reset() | |
3071 | except: # re-raises |
|
3070 | except: # re-raises | |
3072 | if edited: |
|
3071 | if edited: | |
3073 | self.ui.write( |
|
3072 | self.ui.write( | |
3074 | _(b'note: commit message saved in %s\n') % msgfn |
|
3073 | _(b'note: commit message saved in %s\n') % msgfn | |
3075 | ) |
|
3074 | ) | |
3076 | self.ui.write( |
|
3075 | self.ui.write( | |
3077 | _( |
|
3076 | _( | |
3078 | b"note: use 'hg commit --logfile " |
|
3077 | b"note: use 'hg commit --logfile " | |
3079 | b".hg/last-message.txt --edit' to reuse it\n" |
|
3078 | b".hg/last-message.txt --edit' to reuse it\n" | |
3080 | ) |
|
3079 | ) | |
3081 | ) |
|
3080 | ) | |
3082 | raise |
|
3081 | raise | |
3083 |
|
3082 | |||
3084 | def commithook(unused_success): |
|
3083 | def commithook(unused_success): | |
3085 | # hack for command that use a temporary commit (eg: histedit) |
|
3084 | # hack for command that use a temporary commit (eg: histedit) | |
3086 | # temporary commit got stripped before hook release |
|
3085 | # temporary commit got stripped before hook release | |
3087 | if self.changelog.hasnode(ret): |
|
3086 | if self.changelog.hasnode(ret): | |
3088 | self.hook( |
|
3087 | self.hook( | |
3089 | b"commit", node=hex(ret), parent1=hookp1, parent2=hookp2 |
|
3088 | b"commit", node=hex(ret), parent1=hookp1, parent2=hookp2 | |
3090 | ) |
|
3089 | ) | |
3091 |
|
3090 | |||
3092 | self._afterlock(commithook) |
|
3091 | self._afterlock(commithook) | |
3093 | return ret |
|
3092 | return ret | |
3094 |
|
3093 | |||
3095 | @unfilteredmethod |
|
3094 | @unfilteredmethod | |
3096 | def commitctx(self, ctx, error=False, origctx=None): |
|
3095 | def commitctx(self, ctx, error=False, origctx=None): | |
3097 | return commit.commitctx(self, ctx, error=error, origctx=origctx) |
|
3096 | return commit.commitctx(self, ctx, error=error, origctx=origctx) | |
3098 |
|
3097 | |||
3099 | @unfilteredmethod |
|
3098 | @unfilteredmethod | |
3100 | def destroying(self): |
|
3099 | def destroying(self): | |
3101 | """Inform the repository that nodes are about to be destroyed. |
|
3100 | """Inform the repository that nodes are about to be destroyed. | |
3102 | Intended for use by strip and rollback, so there's a common |
|
3101 | Intended for use by strip and rollback, so there's a common | |
3103 | place for anything that has to be done before destroying history. |
|
3102 | place for anything that has to be done before destroying history. | |
3104 |
|
3103 | |||
3105 | This is mostly useful for saving state that is in memory and waiting |
|
3104 | This is mostly useful for saving state that is in memory and waiting | |
3106 | to be flushed when the current lock is released. Because a call to |
|
3105 | to be flushed when the current lock is released. Because a call to | |
3107 | destroyed is imminent, the repo will be invalidated causing those |
|
3106 | destroyed is imminent, the repo will be invalidated causing those | |
3108 | changes to stay in memory (waiting for the next unlock), or vanish |
|
3107 | changes to stay in memory (waiting for the next unlock), or vanish | |
3109 | completely. |
|
3108 | completely. | |
3110 | """ |
|
3109 | """ | |
3111 | # When using the same lock to commit and strip, the phasecache is left |
|
3110 | # When using the same lock to commit and strip, the phasecache is left | |
3112 | # dirty after committing. Then when we strip, the repo is invalidated, |
|
3111 | # dirty after committing. Then when we strip, the repo is invalidated, | |
3113 | # causing those changes to disappear. |
|
3112 | # causing those changes to disappear. | |
3114 | if '_phasecache' in vars(self): |
|
3113 | if '_phasecache' in vars(self): | |
3115 | self._phasecache.write() |
|
3114 | self._phasecache.write() | |
3116 |
|
3115 | |||
3117 | @unfilteredmethod |
|
3116 | @unfilteredmethod | |
3118 | def destroyed(self): |
|
3117 | def destroyed(self): | |
3119 | """Inform the repository that nodes have been destroyed. |
|
3118 | """Inform the repository that nodes have been destroyed. | |
3120 | Intended for use by strip and rollback, so there's a common |
|
3119 | Intended for use by strip and rollback, so there's a common | |
3121 | place for anything that has to be done after destroying history. |
|
3120 | place for anything that has to be done after destroying history. | |
3122 | """ |
|
3121 | """ | |
3123 | # When one tries to: |
|
3122 | # When one tries to: | |
3124 | # 1) destroy nodes thus calling this method (e.g. strip) |
|
3123 | # 1) destroy nodes thus calling this method (e.g. strip) | |
3125 | # 2) use phasecache somewhere (e.g. commit) |
|
3124 | # 2) use phasecache somewhere (e.g. commit) | |
3126 | # |
|
3125 | # | |
3127 | # then 2) will fail because the phasecache contains nodes that were |
|
3126 | # then 2) will fail because the phasecache contains nodes that were | |
3128 | # removed. We can either remove phasecache from the filecache, |
|
3127 | # removed. We can either remove phasecache from the filecache, | |
3129 | # causing it to reload next time it is accessed, or simply filter |
|
3128 | # causing it to reload next time it is accessed, or simply filter | |
3130 | # the removed nodes now and write the updated cache. |
|
3129 | # the removed nodes now and write the updated cache. | |
3131 | self._phasecache.filterunknown(self) |
|
3130 | self._phasecache.filterunknown(self) | |
3132 | self._phasecache.write() |
|
3131 | self._phasecache.write() | |
3133 |
|
3132 | |||
3134 | # refresh all repository caches |
|
3133 | # refresh all repository caches | |
3135 | self.updatecaches() |
|
3134 | self.updatecaches() | |
3136 |
|
3135 | |||
3137 | # Ensure the persistent tag cache is updated. Doing it now |
|
3136 | # Ensure the persistent tag cache is updated. Doing it now | |
3138 | # means that the tag cache only has to worry about destroyed |
|
3137 | # means that the tag cache only has to worry about destroyed | |
3139 | # heads immediately after a strip/rollback. That in turn |
|
3138 | # heads immediately after a strip/rollback. That in turn | |
3140 | # guarantees that "cachetip == currenttip" (comparing both rev |
|
3139 | # guarantees that "cachetip == currenttip" (comparing both rev | |
3141 | # and node) always means no nodes have been added or destroyed. |
|
3140 | # and node) always means no nodes have been added or destroyed. | |
3142 |
|
3141 | |||
3143 | # XXX this is suboptimal when qrefresh'ing: we strip the current |
|
3142 | # XXX this is suboptimal when qrefresh'ing: we strip the current | |
3144 | # head, refresh the tag cache, then immediately add a new head. |
|
3143 | # head, refresh the tag cache, then immediately add a new head. | |
3145 | # But I think doing it this way is necessary for the "instant |
|
3144 | # But I think doing it this way is necessary for the "instant | |
3146 | # tag cache retrieval" case to work. |
|
3145 | # tag cache retrieval" case to work. | |
3147 | self.invalidate() |
|
3146 | self.invalidate() | |
3148 |
|
3147 | |||
3149 | def status( |
|
3148 | def status( | |
3150 | self, |
|
3149 | self, | |
3151 | node1=b'.', |
|
3150 | node1=b'.', | |
3152 | node2=None, |
|
3151 | node2=None, | |
3153 | match=None, |
|
3152 | match=None, | |
3154 | ignored=False, |
|
3153 | ignored=False, | |
3155 | clean=False, |
|
3154 | clean=False, | |
3156 | unknown=False, |
|
3155 | unknown=False, | |
3157 | listsubrepos=False, |
|
3156 | listsubrepos=False, | |
3158 | ): |
|
3157 | ): | |
3159 | '''a convenience method that calls node1.status(node2)''' |
|
3158 | '''a convenience method that calls node1.status(node2)''' | |
3160 | return self[node1].status( |
|
3159 | return self[node1].status( | |
3161 | node2, match, ignored, clean, unknown, listsubrepos |
|
3160 | node2, match, ignored, clean, unknown, listsubrepos | |
3162 | ) |
|
3161 | ) | |
3163 |
|
3162 | |||
3164 | def addpostdsstatus(self, ps): |
|
3163 | def addpostdsstatus(self, ps): | |
3165 | """Add a callback to run within the wlock, at the point at which status |
|
3164 | """Add a callback to run within the wlock, at the point at which status | |
3166 | fixups happen. |
|
3165 | fixups happen. | |
3167 |
|
3166 | |||
3168 | On status completion, callback(wctx, status) will be called with the |
|
3167 | On status completion, callback(wctx, status) will be called with the | |
3169 | wlock held, unless the dirstate has changed from underneath or the wlock |
|
3168 | wlock held, unless the dirstate has changed from underneath or the wlock | |
3170 | couldn't be grabbed. |
|
3169 | couldn't be grabbed. | |
3171 |
|
3170 | |||
3172 | Callbacks should not capture and use a cached copy of the dirstate -- |
|
3171 | Callbacks should not capture and use a cached copy of the dirstate -- | |
3173 | it might change in the meanwhile. Instead, they should access the |
|
3172 | it might change in the meanwhile. Instead, they should access the | |
3174 | dirstate via wctx.repo().dirstate. |
|
3173 | dirstate via wctx.repo().dirstate. | |
3175 |
|
3174 | |||
3176 | This list is emptied out after each status run -- extensions should |
|
3175 | This list is emptied out after each status run -- extensions should | |
3177 | make sure it adds to this list each time dirstate.status is called. |
|
3176 | make sure it adds to this list each time dirstate.status is called. | |
3178 | Extensions should also make sure they don't call this for statuses |
|
3177 | Extensions should also make sure they don't call this for statuses | |
3179 | that don't involve the dirstate. |
|
3178 | that don't involve the dirstate. | |
3180 | """ |
|
3179 | """ | |
3181 |
|
3180 | |||
3182 | # The list is located here for uniqueness reasons -- it is actually |
|
3181 | # The list is located here for uniqueness reasons -- it is actually | |
3183 | # managed by the workingctx, but that isn't unique per-repo. |
|
3182 | # managed by the workingctx, but that isn't unique per-repo. | |
3184 | self._postdsstatus.append(ps) |
|
3183 | self._postdsstatus.append(ps) | |
3185 |
|
3184 | |||
3186 | def postdsstatus(self): |
|
3185 | def postdsstatus(self): | |
3187 | """Used by workingctx to get the list of post-dirstate-status hooks.""" |
|
3186 | """Used by workingctx to get the list of post-dirstate-status hooks.""" | |
3188 | return self._postdsstatus |
|
3187 | return self._postdsstatus | |
3189 |
|
3188 | |||
3190 | def clearpostdsstatus(self): |
|
3189 | def clearpostdsstatus(self): | |
3191 | """Used by workingctx to clear post-dirstate-status hooks.""" |
|
3190 | """Used by workingctx to clear post-dirstate-status hooks.""" | |
3192 | del self._postdsstatus[:] |
|
3191 | del self._postdsstatus[:] | |
3193 |
|
3192 | |||
3194 | def heads(self, start=None): |
|
3193 | def heads(self, start=None): | |
3195 | if start is None: |
|
3194 | if start is None: | |
3196 | cl = self.changelog |
|
3195 | cl = self.changelog | |
3197 | headrevs = reversed(cl.headrevs()) |
|
3196 | headrevs = reversed(cl.headrevs()) | |
3198 | return [cl.node(rev) for rev in headrevs] |
|
3197 | return [cl.node(rev) for rev in headrevs] | |
3199 |
|
3198 | |||
3200 | heads = self.changelog.heads(start) |
|
3199 | heads = self.changelog.heads(start) | |
3201 | # sort the output in rev descending order |
|
3200 | # sort the output in rev descending order | |
3202 | return sorted(heads, key=self.changelog.rev, reverse=True) |
|
3201 | return sorted(heads, key=self.changelog.rev, reverse=True) | |
3203 |
|
3202 | |||
3204 | def branchheads(self, branch=None, start=None, closed=False): |
|
3203 | def branchheads(self, branch=None, start=None, closed=False): | |
3205 | """return a (possibly filtered) list of heads for the given branch |
|
3204 | """return a (possibly filtered) list of heads for the given branch | |
3206 |
|
3205 | |||
3207 | Heads are returned in topological order, from newest to oldest. |
|
3206 | Heads are returned in topological order, from newest to oldest. | |
3208 | If branch is None, use the dirstate branch. |
|
3207 | If branch is None, use the dirstate branch. | |
3209 | If start is not None, return only heads reachable from start. |
|
3208 | If start is not None, return only heads reachable from start. | |
3210 | If closed is True, return heads that are marked as closed as well. |
|
3209 | If closed is True, return heads that are marked as closed as well. | |
3211 | """ |
|
3210 | """ | |
3212 | if branch is None: |
|
3211 | if branch is None: | |
3213 | branch = self[None].branch() |
|
3212 | branch = self[None].branch() | |
3214 | branches = self.branchmap() |
|
3213 | branches = self.branchmap() | |
3215 | if not branches.hasbranch(branch): |
|
3214 | if not branches.hasbranch(branch): | |
3216 | return [] |
|
3215 | return [] | |
3217 | # the cache returns heads ordered lowest to highest |
|
3216 | # the cache returns heads ordered lowest to highest | |
3218 | bheads = list(reversed(branches.branchheads(branch, closed=closed))) |
|
3217 | bheads = list(reversed(branches.branchheads(branch, closed=closed))) | |
3219 | if start is not None: |
|
3218 | if start is not None: | |
3220 | # filter out the heads that cannot be reached from startrev |
|
3219 | # filter out the heads that cannot be reached from startrev | |
3221 | fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) |
|
3220 | fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) | |
3222 | bheads = [h for h in bheads if h in fbheads] |
|
3221 | bheads = [h for h in bheads if h in fbheads] | |
3223 | return bheads |
|
3222 | return bheads | |
3224 |
|
3223 | |||
3225 | def branches(self, nodes): |
|
3224 | def branches(self, nodes): | |
3226 | if not nodes: |
|
3225 | if not nodes: | |
3227 | nodes = [self.changelog.tip()] |
|
3226 | nodes = [self.changelog.tip()] | |
3228 | b = [] |
|
3227 | b = [] | |
3229 | for n in nodes: |
|
3228 | for n in nodes: | |
3230 | t = n |
|
3229 | t = n | |
3231 | while True: |
|
3230 | while True: | |
3232 | p = self.changelog.parents(n) |
|
3231 | p = self.changelog.parents(n) | |
3233 | if p[1] != nullid or p[0] == nullid: |
|
3232 | if p[1] != nullid or p[0] == nullid: | |
3234 | b.append((t, n, p[0], p[1])) |
|
3233 | b.append((t, n, p[0], p[1])) | |
3235 | break |
|
3234 | break | |
3236 | n = p[0] |
|
3235 | n = p[0] | |
3237 | return b |
|
3236 | return b | |
3238 |
|
3237 | |||
3239 | def between(self, pairs): |
|
3238 | def between(self, pairs): | |
3240 | r = [] |
|
3239 | r = [] | |
3241 |
|
3240 | |||
3242 | for top, bottom in pairs: |
|
3241 | for top, bottom in pairs: | |
3243 | n, l, i = top, [], 0 |
|
3242 | n, l, i = top, [], 0 | |
3244 | f = 1 |
|
3243 | f = 1 | |
3245 |
|
3244 | |||
3246 | while n != bottom and n != nullid: |
|
3245 | while n != bottom and n != nullid: | |
3247 | p = self.changelog.parents(n)[0] |
|
3246 | p = self.changelog.parents(n)[0] | |
3248 | if i == f: |
|
3247 | if i == f: | |
3249 | l.append(n) |
|
3248 | l.append(n) | |
3250 | f = f * 2 |
|
3249 | f = f * 2 | |
3251 | n = p |
|
3250 | n = p | |
3252 | i += 1 |
|
3251 | i += 1 | |
3253 |
|
3252 | |||
3254 | r.append(l) |
|
3253 | r.append(l) | |
3255 |
|
3254 | |||
3256 | return r |
|
3255 | return r | |
3257 |
|
3256 | |||
3258 | def checkpush(self, pushop): |
|
3257 | def checkpush(self, pushop): | |
3259 | """Extensions can override this function if additional checks have |
|
3258 | """Extensions can override this function if additional checks have | |
3260 | to be performed before pushing, or call it if they override push |
|
3259 | to be performed before pushing, or call it if they override push | |
3261 | command. |
|
3260 | command. | |
3262 | """ |
|
3261 | """ | |
3263 |
|
3262 | |||
3264 | @unfilteredpropertycache |
|
3263 | @unfilteredpropertycache | |
3265 | def prepushoutgoinghooks(self): |
|
3264 | def prepushoutgoinghooks(self): | |
3266 | """Return util.hooks consists of a pushop with repo, remote, outgoing |
|
3265 | """Return util.hooks consists of a pushop with repo, remote, outgoing | |
3267 | methods, which are called before pushing changesets. |
|
3266 | methods, which are called before pushing changesets. | |
3268 | """ |
|
3267 | """ | |
3269 | return util.hooks() |
|
3268 | return util.hooks() | |
3270 |
|
3269 | |||
3271 | def pushkey(self, namespace, key, old, new): |
|
3270 | def pushkey(self, namespace, key, old, new): | |
3272 | try: |
|
3271 | try: | |
3273 | tr = self.currenttransaction() |
|
3272 | tr = self.currenttransaction() | |
3274 | hookargs = {} |
|
3273 | hookargs = {} | |
3275 | if tr is not None: |
|
3274 | if tr is not None: | |
3276 | hookargs.update(tr.hookargs) |
|
3275 | hookargs.update(tr.hookargs) | |
3277 | hookargs = pycompat.strkwargs(hookargs) |
|
3276 | hookargs = pycompat.strkwargs(hookargs) | |
3278 | hookargs['namespace'] = namespace |
|
3277 | hookargs['namespace'] = namespace | |
3279 | hookargs['key'] = key |
|
3278 | hookargs['key'] = key | |
3280 | hookargs['old'] = old |
|
3279 | hookargs['old'] = old | |
3281 | hookargs['new'] = new |
|
3280 | hookargs['new'] = new | |
3282 | self.hook(b'prepushkey', throw=True, **hookargs) |
|
3281 | self.hook(b'prepushkey', throw=True, **hookargs) | |
3283 | except error.HookAbort as exc: |
|
3282 | except error.HookAbort as exc: | |
3284 | self.ui.write_err(_(b"pushkey-abort: %s\n") % exc) |
|
3283 | self.ui.write_err(_(b"pushkey-abort: %s\n") % exc) | |
3285 | if exc.hint: |
|
3284 | if exc.hint: | |
3286 | self.ui.write_err(_(b"(%s)\n") % exc.hint) |
|
3285 | self.ui.write_err(_(b"(%s)\n") % exc.hint) | |
3287 | return False |
|
3286 | return False | |
3288 | self.ui.debug(b'pushing key for "%s:%s"\n' % (namespace, key)) |
|
3287 | self.ui.debug(b'pushing key for "%s:%s"\n' % (namespace, key)) | |
3289 | ret = pushkey.push(self, namespace, key, old, new) |
|
3288 | ret = pushkey.push(self, namespace, key, old, new) | |
3290 |
|
3289 | |||
3291 | def runhook(unused_success): |
|
3290 | def runhook(unused_success): | |
3292 | self.hook( |
|
3291 | self.hook( | |
3293 | b'pushkey', |
|
3292 | b'pushkey', | |
3294 | namespace=namespace, |
|
3293 | namespace=namespace, | |
3295 | key=key, |
|
3294 | key=key, | |
3296 | old=old, |
|
3295 | old=old, | |
3297 | new=new, |
|
3296 | new=new, | |
3298 | ret=ret, |
|
3297 | ret=ret, | |
3299 | ) |
|
3298 | ) | |
3300 |
|
3299 | |||
3301 | self._afterlock(runhook) |
|
3300 | self._afterlock(runhook) | |
3302 | return ret |
|
3301 | return ret | |
3303 |
|
3302 | |||
3304 | def listkeys(self, namespace): |
|
3303 | def listkeys(self, namespace): | |
3305 | self.hook(b'prelistkeys', throw=True, namespace=namespace) |
|
3304 | self.hook(b'prelistkeys', throw=True, namespace=namespace) | |
3306 | self.ui.debug(b'listing keys for "%s"\n' % namespace) |
|
3305 | self.ui.debug(b'listing keys for "%s"\n' % namespace) | |
3307 | values = pushkey.list(self, namespace) |
|
3306 | values = pushkey.list(self, namespace) | |
3308 | self.hook(b'listkeys', namespace=namespace, values=values) |
|
3307 | self.hook(b'listkeys', namespace=namespace, values=values) | |
3309 | return values |
|
3308 | return values | |
3310 |
|
3309 | |||
3311 | def debugwireargs(self, one, two, three=None, four=None, five=None): |
|
3310 | def debugwireargs(self, one, two, three=None, four=None, five=None): | |
3312 | '''used to test argument passing over the wire''' |
|
3311 | '''used to test argument passing over the wire''' | |
3313 | return b"%s %s %s %s %s" % ( |
|
3312 | return b"%s %s %s %s %s" % ( | |
3314 | one, |
|
3313 | one, | |
3315 | two, |
|
3314 | two, | |
3316 | pycompat.bytestr(three), |
|
3315 | pycompat.bytestr(three), | |
3317 | pycompat.bytestr(four), |
|
3316 | pycompat.bytestr(four), | |
3318 | pycompat.bytestr(five), |
|
3317 | pycompat.bytestr(five), | |
3319 | ) |
|
3318 | ) | |
3320 |
|
3319 | |||
3321 | def savecommitmessage(self, text): |
|
3320 | def savecommitmessage(self, text): | |
3322 | fp = self.vfs(b'last-message.txt', b'wb') |
|
3321 | fp = self.vfs(b'last-message.txt', b'wb') | |
3323 | try: |
|
3322 | try: | |
3324 | fp.write(text) |
|
3323 | fp.write(text) | |
3325 | finally: |
|
3324 | finally: | |
3326 | fp.close() |
|
3325 | fp.close() | |
3327 | return self.pathto(fp.name[len(self.root) + 1 :]) |
|
3326 | return self.pathto(fp.name[len(self.root) + 1 :]) | |
3328 |
|
3327 | |||
3329 |
|
3328 | |||
3330 | # used to avoid circular references so destructors work |
|
3329 | # used to avoid circular references so destructors work | |
3331 | def aftertrans(files): |
|
3330 | def aftertrans(files): | |
3332 | renamefiles = [tuple(t) for t in files] |
|
3331 | renamefiles = [tuple(t) for t in files] | |
3333 |
|
3332 | |||
3334 | def a(): |
|
3333 | def a(): | |
3335 | for vfs, src, dest in renamefiles: |
|
3334 | for vfs, src, dest in renamefiles: | |
3336 | # if src and dest refer to a same file, vfs.rename is a no-op, |
|
3335 | # if src and dest refer to a same file, vfs.rename is a no-op, | |
3337 | # leaving both src and dest on disk. delete dest to make sure |
|
3336 | # leaving both src and dest on disk. delete dest to make sure | |
3338 | # the rename couldn't be such a no-op. |
|
3337 | # the rename couldn't be such a no-op. | |
3339 | vfs.tryunlink(dest) |
|
3338 | vfs.tryunlink(dest) | |
3340 | try: |
|
3339 | try: | |
3341 | vfs.rename(src, dest) |
|
3340 | vfs.rename(src, dest) | |
3342 | except OSError: # journal file does not yet exist |
|
3341 | except OSError: # journal file does not yet exist | |
3343 | pass |
|
3342 | pass | |
3344 |
|
3343 | |||
3345 | return a |
|
3344 | return a | |
3346 |
|
3345 | |||
3347 |
|
3346 | |||
3348 | def undoname(fn): |
|
3347 | def undoname(fn): | |
3349 | base, name = os.path.split(fn) |
|
3348 | base, name = os.path.split(fn) | |
3350 | assert name.startswith(b'journal') |
|
3349 | assert name.startswith(b'journal') | |
3351 | return os.path.join(base, name.replace(b'journal', b'undo', 1)) |
|
3350 | return os.path.join(base, name.replace(b'journal', b'undo', 1)) | |
3352 |
|
3351 | |||
3353 |
|
3352 | |||
3354 | def instance(ui, path, create, intents=None, createopts=None): |
|
3353 | def instance(ui, path, create, intents=None, createopts=None): | |
3355 | localpath = util.urllocalpath(path) |
|
3354 | localpath = util.urllocalpath(path) | |
3356 | if create: |
|
3355 | if create: | |
3357 | createrepository(ui, localpath, createopts=createopts) |
|
3356 | createrepository(ui, localpath, createopts=createopts) | |
3358 |
|
3357 | |||
3359 | return makelocalrepository(ui, localpath, intents=intents) |
|
3358 | return makelocalrepository(ui, localpath, intents=intents) | |
3360 |
|
3359 | |||
3361 |
|
3360 | |||
3362 | def islocal(path): |
|
3361 | def islocal(path): | |
3363 | return True |
|
3362 | return True | |
3364 |
|
3363 | |||
3365 |
|
3364 | |||
3366 | def defaultcreateopts(ui, createopts=None): |
|
3365 | def defaultcreateopts(ui, createopts=None): | |
3367 | """Populate the default creation options for a repository. |
|
3366 | """Populate the default creation options for a repository. | |
3368 |
|
3367 | |||
3369 | A dictionary of explicitly requested creation options can be passed |
|
3368 | A dictionary of explicitly requested creation options can be passed | |
3370 | in. Missing keys will be populated. |
|
3369 | in. Missing keys will be populated. | |
3371 | """ |
|
3370 | """ | |
3372 | createopts = dict(createopts or {}) |
|
3371 | createopts = dict(createopts or {}) | |
3373 |
|
3372 | |||
3374 | if b'backend' not in createopts: |
|
3373 | if b'backend' not in createopts: | |
3375 | # experimental config: storage.new-repo-backend |
|
3374 | # experimental config: storage.new-repo-backend | |
3376 | createopts[b'backend'] = ui.config(b'storage', b'new-repo-backend') |
|
3375 | createopts[b'backend'] = ui.config(b'storage', b'new-repo-backend') | |
3377 |
|
3376 | |||
3378 | return createopts |
|
3377 | return createopts | |
3379 |
|
3378 | |||
3380 |
|
3379 | |||
3381 | def newreporequirements(ui, createopts): |
|
3380 | def newreporequirements(ui, createopts): | |
3382 | """Determine the set of requirements for a new local repository. |
|
3381 | """Determine the set of requirements for a new local repository. | |
3383 |
|
3382 | |||
3384 | Extensions can wrap this function to specify custom requirements for |
|
3383 | Extensions can wrap this function to specify custom requirements for | |
3385 | new repositories. |
|
3384 | new repositories. | |
3386 | """ |
|
3385 | """ | |
3387 | # If the repo is being created from a shared repository, we copy |
|
3386 | # If the repo is being created from a shared repository, we copy | |
3388 | # its requirements. |
|
3387 | # its requirements. | |
3389 | if b'sharedrepo' in createopts: |
|
3388 | if b'sharedrepo' in createopts: | |
3390 | requirements = set(createopts[b'sharedrepo'].requirements) |
|
3389 | requirements = set(createopts[b'sharedrepo'].requirements) | |
3391 | if createopts.get(b'sharedrelative'): |
|
3390 | if createopts.get(b'sharedrelative'): | |
3392 | requirements.add(requirementsmod.RELATIVE_SHARED_REQUIREMENT) |
|
3391 | requirements.add(requirementsmod.RELATIVE_SHARED_REQUIREMENT) | |
3393 | else: |
|
3392 | else: | |
3394 | requirements.add(requirementsmod.SHARED_REQUIREMENT) |
|
3393 | requirements.add(requirementsmod.SHARED_REQUIREMENT) | |
3395 |
|
3394 | |||
3396 | return requirements |
|
3395 | return requirements | |
3397 |
|
3396 | |||
3398 | if b'backend' not in createopts: |
|
3397 | if b'backend' not in createopts: | |
3399 | raise error.ProgrammingError( |
|
3398 | raise error.ProgrammingError( | |
3400 | b'backend key not present in createopts; ' |
|
3399 | b'backend key not present in createopts; ' | |
3401 | b'was defaultcreateopts() called?' |
|
3400 | b'was defaultcreateopts() called?' | |
3402 | ) |
|
3401 | ) | |
3403 |
|
3402 | |||
3404 | if createopts[b'backend'] != b'revlogv1': |
|
3403 | if createopts[b'backend'] != b'revlogv1': | |
3405 | raise error.Abort( |
|
3404 | raise error.Abort( | |
3406 | _( |
|
3405 | _( | |
3407 | b'unable to determine repository requirements for ' |
|
3406 | b'unable to determine repository requirements for ' | |
3408 | b'storage backend: %s' |
|
3407 | b'storage backend: %s' | |
3409 | ) |
|
3408 | ) | |
3410 | % createopts[b'backend'] |
|
3409 | % createopts[b'backend'] | |
3411 | ) |
|
3410 | ) | |
3412 |
|
3411 | |||
3413 | requirements = {requirementsmod.REVLOGV1_REQUIREMENT} |
|
3412 | requirements = {requirementsmod.REVLOGV1_REQUIREMENT} | |
3414 | if ui.configbool(b'format', b'usestore'): |
|
3413 | if ui.configbool(b'format', b'usestore'): | |
3415 | requirements.add(b'store') |
|
3414 | requirements.add(b'store') | |
3416 | if ui.configbool(b'format', b'usefncache'): |
|
3415 | if ui.configbool(b'format', b'usefncache'): | |
3417 | requirements.add(b'fncache') |
|
3416 | requirements.add(b'fncache') | |
3418 | if ui.configbool(b'format', b'dotencode'): |
|
3417 | if ui.configbool(b'format', b'dotencode'): | |
3419 |
requirements.add( |
|
3418 | requirements.add(requirementsmod.DOTENCODE_REQUIREMENT) | |
3420 |
|
3419 | |||
3421 | compengines = ui.configlist(b'format', b'revlog-compression') |
|
3420 | compengines = ui.configlist(b'format', b'revlog-compression') | |
3422 | for compengine in compengines: |
|
3421 | for compengine in compengines: | |
3423 | if compengine in util.compengines: |
|
3422 | if compengine in util.compengines: | |
3424 | break |
|
3423 | break | |
3425 | else: |
|
3424 | else: | |
3426 | raise error.Abort( |
|
3425 | raise error.Abort( | |
3427 | _( |
|
3426 | _( | |
3428 | b'compression engines %s defined by ' |
|
3427 | b'compression engines %s defined by ' | |
3429 | b'format.revlog-compression not available' |
|
3428 | b'format.revlog-compression not available' | |
3430 | ) |
|
3429 | ) | |
3431 | % b', '.join(b'"%s"' % e for e in compengines), |
|
3430 | % b', '.join(b'"%s"' % e for e in compengines), | |
3432 | hint=_( |
|
3431 | hint=_( | |
3433 | b'run "hg debuginstall" to list available ' |
|
3432 | b'run "hg debuginstall" to list available ' | |
3434 | b'compression engines' |
|
3433 | b'compression engines' | |
3435 | ), |
|
3434 | ), | |
3436 | ) |
|
3435 | ) | |
3437 |
|
3436 | |||
3438 | # zlib is the historical default and doesn't need an explicit requirement. |
|
3437 | # zlib is the historical default and doesn't need an explicit requirement. | |
3439 | if compengine == b'zstd': |
|
3438 | if compengine == b'zstd': | |
3440 | requirements.add(b'revlog-compression-zstd') |
|
3439 | requirements.add(b'revlog-compression-zstd') | |
3441 | elif compengine != b'zlib': |
|
3440 | elif compengine != b'zlib': | |
3442 | requirements.add(b'exp-compression-%s' % compengine) |
|
3441 | requirements.add(b'exp-compression-%s' % compengine) | |
3443 |
|
3442 | |||
3444 | if scmutil.gdinitconfig(ui): |
|
3443 | if scmutil.gdinitconfig(ui): | |
3445 | requirements.add(requirementsmod.GENERALDELTA_REQUIREMENT) |
|
3444 | requirements.add(requirementsmod.GENERALDELTA_REQUIREMENT) | |
3446 | if ui.configbool(b'format', b'sparse-revlog'): |
|
3445 | if ui.configbool(b'format', b'sparse-revlog'): | |
3447 | requirements.add(requirementsmod.SPARSEREVLOG_REQUIREMENT) |
|
3446 | requirements.add(requirementsmod.SPARSEREVLOG_REQUIREMENT) | |
3448 |
|
3447 | |||
3449 | # experimental config: format.exp-use-side-data |
|
3448 | # experimental config: format.exp-use-side-data | |
3450 | if ui.configbool(b'format', b'exp-use-side-data'): |
|
3449 | if ui.configbool(b'format', b'exp-use-side-data'): | |
3451 | requirements.add(requirementsmod.SIDEDATA_REQUIREMENT) |
|
3450 | requirements.add(requirementsmod.SIDEDATA_REQUIREMENT) | |
3452 | # experimental config: format.exp-use-copies-side-data-changeset |
|
3451 | # experimental config: format.exp-use-copies-side-data-changeset | |
3453 | if ui.configbool(b'format', b'exp-use-copies-side-data-changeset'): |
|
3452 | if ui.configbool(b'format', b'exp-use-copies-side-data-changeset'): | |
3454 | requirements.add(requirementsmod.SIDEDATA_REQUIREMENT) |
|
3453 | requirements.add(requirementsmod.SIDEDATA_REQUIREMENT) | |
3455 | requirements.add(requirementsmod.COPIESSDC_REQUIREMENT) |
|
3454 | requirements.add(requirementsmod.COPIESSDC_REQUIREMENT) | |
3456 | if ui.configbool(b'experimental', b'treemanifest'): |
|
3455 | if ui.configbool(b'experimental', b'treemanifest'): | |
3457 | requirements.add(requirementsmod.TREEMANIFEST_REQUIREMENT) |
|
3456 | requirements.add(requirementsmod.TREEMANIFEST_REQUIREMENT) | |
3458 |
|
3457 | |||
3459 | revlogv2 = ui.config(b'experimental', b'revlogv2') |
|
3458 | revlogv2 = ui.config(b'experimental', b'revlogv2') | |
3460 | if revlogv2 == b'enable-unstable-format-and-corrupt-my-data': |
|
3459 | if revlogv2 == b'enable-unstable-format-and-corrupt-my-data': | |
3461 | requirements.remove(requirementsmod.REVLOGV1_REQUIREMENT) |
|
3460 | requirements.remove(requirementsmod.REVLOGV1_REQUIREMENT) | |
3462 | # generaldelta is implied by revlogv2. |
|
3461 | # generaldelta is implied by revlogv2. | |
3463 | requirements.discard(requirementsmod.GENERALDELTA_REQUIREMENT) |
|
3462 | requirements.discard(requirementsmod.GENERALDELTA_REQUIREMENT) | |
3464 | requirements.add(requirementsmod.REVLOGV2_REQUIREMENT) |
|
3463 | requirements.add(requirementsmod.REVLOGV2_REQUIREMENT) | |
3465 | # experimental config: format.internal-phase |
|
3464 | # experimental config: format.internal-phase | |
3466 | if ui.configbool(b'format', b'internal-phase'): |
|
3465 | if ui.configbool(b'format', b'internal-phase'): | |
3467 | requirements.add(requirementsmod.INTERNAL_PHASE_REQUIREMENT) |
|
3466 | requirements.add(requirementsmod.INTERNAL_PHASE_REQUIREMENT) | |
3468 |
|
3467 | |||
3469 | if createopts.get(b'narrowfiles'): |
|
3468 | if createopts.get(b'narrowfiles'): | |
3470 | requirements.add(requirementsmod.NARROW_REQUIREMENT) |
|
3469 | requirements.add(requirementsmod.NARROW_REQUIREMENT) | |
3471 |
|
3470 | |||
3472 | if createopts.get(b'lfs'): |
|
3471 | if createopts.get(b'lfs'): | |
3473 | requirements.add(b'lfs') |
|
3472 | requirements.add(b'lfs') | |
3474 |
|
3473 | |||
3475 | if ui.configbool(b'format', b'bookmarks-in-store'): |
|
3474 | if ui.configbool(b'format', b'bookmarks-in-store'): | |
3476 | requirements.add(bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT) |
|
3475 | requirements.add(bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT) | |
3477 |
|
3476 | |||
3478 | if ui.configbool(b'format', b'use-persistent-nodemap'): |
|
3477 | if ui.configbool(b'format', b'use-persistent-nodemap'): | |
3479 | requirements.add(requirementsmod.NODEMAP_REQUIREMENT) |
|
3478 | requirements.add(requirementsmod.NODEMAP_REQUIREMENT) | |
3480 |
|
3479 | |||
3481 | # if share-safe is enabled, let's create the new repository with the new |
|
3480 | # if share-safe is enabled, let's create the new repository with the new | |
3482 | # requirement |
|
3481 | # requirement | |
3483 | if ui.configbool(b'format', b'use-share-safe'): |
|
3482 | if ui.configbool(b'format', b'use-share-safe'): | |
3484 | requirements.add(requirementsmod.SHARESAFE_REQUIREMENT) |
|
3483 | requirements.add(requirementsmod.SHARESAFE_REQUIREMENT) | |
3485 |
|
3484 | |||
3486 | return requirements |
|
3485 | return requirements | |
3487 |
|
3486 | |||
3488 |
|
3487 | |||
3489 | def checkrequirementscompat(ui, requirements): |
|
3488 | def checkrequirementscompat(ui, requirements): | |
3490 | """Checks compatibility of repository requirements enabled and disabled. |
|
3489 | """Checks compatibility of repository requirements enabled and disabled. | |
3491 |
|
3490 | |||
3492 | Returns a set of requirements which needs to be dropped because dependend |
|
3491 | Returns a set of requirements which needs to be dropped because dependend | |
3493 | requirements are not enabled. Also warns users about it""" |
|
3492 | requirements are not enabled. Also warns users about it""" | |
3494 |
|
3493 | |||
3495 | dropped = set() |
|
3494 | dropped = set() | |
3496 |
|
3495 | |||
3497 | if b'store' not in requirements: |
|
3496 | if b'store' not in requirements: | |
3498 | if bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT in requirements: |
|
3497 | if bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT in requirements: | |
3499 | ui.warn( |
|
3498 | ui.warn( | |
3500 | _( |
|
3499 | _( | |
3501 | b'ignoring enabled \'format.bookmarks-in-store\' config ' |
|
3500 | b'ignoring enabled \'format.bookmarks-in-store\' config ' | |
3502 | b'beacuse it is incompatible with disabled ' |
|
3501 | b'beacuse it is incompatible with disabled ' | |
3503 | b'\'format.usestore\' config\n' |
|
3502 | b'\'format.usestore\' config\n' | |
3504 | ) |
|
3503 | ) | |
3505 | ) |
|
3504 | ) | |
3506 | dropped.add(bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT) |
|
3505 | dropped.add(bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT) | |
3507 |
|
3506 | |||
3508 | if ( |
|
3507 | if ( | |
3509 | requirementsmod.SHARED_REQUIREMENT in requirements |
|
3508 | requirementsmod.SHARED_REQUIREMENT in requirements | |
3510 | or requirementsmod.RELATIVE_SHARED_REQUIREMENT in requirements |
|
3509 | or requirementsmod.RELATIVE_SHARED_REQUIREMENT in requirements | |
3511 | ): |
|
3510 | ): | |
3512 | raise error.Abort( |
|
3511 | raise error.Abort( | |
3513 | _( |
|
3512 | _( | |
3514 | b"cannot create shared repository as source was created" |
|
3513 | b"cannot create shared repository as source was created" | |
3515 | b" with 'format.usestore' config disabled" |
|
3514 | b" with 'format.usestore' config disabled" | |
3516 | ) |
|
3515 | ) | |
3517 | ) |
|
3516 | ) | |
3518 |
|
3517 | |||
3519 | if requirementsmod.SHARESAFE_REQUIREMENT in requirements: |
|
3518 | if requirementsmod.SHARESAFE_REQUIREMENT in requirements: | |
3520 | ui.warn( |
|
3519 | ui.warn( | |
3521 | _( |
|
3520 | _( | |
3522 | b"ignoring enabled 'format.use-share-safe' config because " |
|
3521 | b"ignoring enabled 'format.use-share-safe' config because " | |
3523 | b"it is incompatible with disabled 'format.usestore'" |
|
3522 | b"it is incompatible with disabled 'format.usestore'" | |
3524 | b" config\n" |
|
3523 | b" config\n" | |
3525 | ) |
|
3524 | ) | |
3526 | ) |
|
3525 | ) | |
3527 | dropped.add(requirementsmod.SHARESAFE_REQUIREMENT) |
|
3526 | dropped.add(requirementsmod.SHARESAFE_REQUIREMENT) | |
3528 |
|
3527 | |||
3529 | return dropped |
|
3528 | return dropped | |
3530 |
|
3529 | |||
3531 |
|
3530 | |||
3532 | def filterknowncreateopts(ui, createopts): |
|
3531 | def filterknowncreateopts(ui, createopts): | |
3533 | """Filters a dict of repo creation options against options that are known. |
|
3532 | """Filters a dict of repo creation options against options that are known. | |
3534 |
|
3533 | |||
3535 | Receives a dict of repo creation options and returns a dict of those |
|
3534 | Receives a dict of repo creation options and returns a dict of those | |
3536 | options that we don't know how to handle. |
|
3535 | options that we don't know how to handle. | |
3537 |
|
3536 | |||
3538 | This function is called as part of repository creation. If the |
|
3537 | This function is called as part of repository creation. If the | |
3539 | returned dict contains any items, repository creation will not |
|
3538 | returned dict contains any items, repository creation will not | |
3540 | be allowed, as it means there was a request to create a repository |
|
3539 | be allowed, as it means there was a request to create a repository | |
3541 | with options not recognized by loaded code. |
|
3540 | with options not recognized by loaded code. | |
3542 |
|
3541 | |||
3543 | Extensions can wrap this function to filter out creation options |
|
3542 | Extensions can wrap this function to filter out creation options | |
3544 | they know how to handle. |
|
3543 | they know how to handle. | |
3545 | """ |
|
3544 | """ | |
3546 | known = { |
|
3545 | known = { | |
3547 | b'backend', |
|
3546 | b'backend', | |
3548 | b'lfs', |
|
3547 | b'lfs', | |
3549 | b'narrowfiles', |
|
3548 | b'narrowfiles', | |
3550 | b'sharedrepo', |
|
3549 | b'sharedrepo', | |
3551 | b'sharedrelative', |
|
3550 | b'sharedrelative', | |
3552 | b'shareditems', |
|
3551 | b'shareditems', | |
3553 | b'shallowfilestore', |
|
3552 | b'shallowfilestore', | |
3554 | } |
|
3553 | } | |
3555 |
|
3554 | |||
3556 | return {k: v for k, v in createopts.items() if k not in known} |
|
3555 | return {k: v for k, v in createopts.items() if k not in known} | |
3557 |
|
3556 | |||
3558 |
|
3557 | |||
3559 | def createrepository(ui, path, createopts=None): |
|
3558 | def createrepository(ui, path, createopts=None): | |
3560 | """Create a new repository in a vfs. |
|
3559 | """Create a new repository in a vfs. | |
3561 |
|
3560 | |||
3562 | ``path`` path to the new repo's working directory. |
|
3561 | ``path`` path to the new repo's working directory. | |
3563 | ``createopts`` options for the new repository. |
|
3562 | ``createopts`` options for the new repository. | |
3564 |
|
3563 | |||
3565 | The following keys for ``createopts`` are recognized: |
|
3564 | The following keys for ``createopts`` are recognized: | |
3566 |
|
3565 | |||
3567 | backend |
|
3566 | backend | |
3568 | The storage backend to use. |
|
3567 | The storage backend to use. | |
3569 | lfs |
|
3568 | lfs | |
3570 | Repository will be created with ``lfs`` requirement. The lfs extension |
|
3569 | Repository will be created with ``lfs`` requirement. The lfs extension | |
3571 | will automatically be loaded when the repository is accessed. |
|
3570 | will automatically be loaded when the repository is accessed. | |
3572 | narrowfiles |
|
3571 | narrowfiles | |
3573 | Set up repository to support narrow file storage. |
|
3572 | Set up repository to support narrow file storage. | |
3574 | sharedrepo |
|
3573 | sharedrepo | |
3575 | Repository object from which storage should be shared. |
|
3574 | Repository object from which storage should be shared. | |
3576 | sharedrelative |
|
3575 | sharedrelative | |
3577 | Boolean indicating if the path to the shared repo should be |
|
3576 | Boolean indicating if the path to the shared repo should be | |
3578 | stored as relative. By default, the pointer to the "parent" repo |
|
3577 | stored as relative. By default, the pointer to the "parent" repo | |
3579 | is stored as an absolute path. |
|
3578 | is stored as an absolute path. | |
3580 | shareditems |
|
3579 | shareditems | |
3581 | Set of items to share to the new repository (in addition to storage). |
|
3580 | Set of items to share to the new repository (in addition to storage). | |
3582 | shallowfilestore |
|
3581 | shallowfilestore | |
3583 | Indicates that storage for files should be shallow (not all ancestor |
|
3582 | Indicates that storage for files should be shallow (not all ancestor | |
3584 | revisions are known). |
|
3583 | revisions are known). | |
3585 | """ |
|
3584 | """ | |
3586 | createopts = defaultcreateopts(ui, createopts=createopts) |
|
3585 | createopts = defaultcreateopts(ui, createopts=createopts) | |
3587 |
|
3586 | |||
3588 | unknownopts = filterknowncreateopts(ui, createopts) |
|
3587 | unknownopts = filterknowncreateopts(ui, createopts) | |
3589 |
|
3588 | |||
3590 | if not isinstance(unknownopts, dict): |
|
3589 | if not isinstance(unknownopts, dict): | |
3591 | raise error.ProgrammingError( |
|
3590 | raise error.ProgrammingError( | |
3592 | b'filterknowncreateopts() did not return a dict' |
|
3591 | b'filterknowncreateopts() did not return a dict' | |
3593 | ) |
|
3592 | ) | |
3594 |
|
3593 | |||
3595 | if unknownopts: |
|
3594 | if unknownopts: | |
3596 | raise error.Abort( |
|
3595 | raise error.Abort( | |
3597 | _( |
|
3596 | _( | |
3598 | b'unable to create repository because of unknown ' |
|
3597 | b'unable to create repository because of unknown ' | |
3599 | b'creation option: %s' |
|
3598 | b'creation option: %s' | |
3600 | ) |
|
3599 | ) | |
3601 | % b', '.join(sorted(unknownopts)), |
|
3600 | % b', '.join(sorted(unknownopts)), | |
3602 | hint=_(b'is a required extension not loaded?'), |
|
3601 | hint=_(b'is a required extension not loaded?'), | |
3603 | ) |
|
3602 | ) | |
3604 |
|
3603 | |||
3605 | requirements = newreporequirements(ui, createopts=createopts) |
|
3604 | requirements = newreporequirements(ui, createopts=createopts) | |
3606 | requirements -= checkrequirementscompat(ui, requirements) |
|
3605 | requirements -= checkrequirementscompat(ui, requirements) | |
3607 |
|
3606 | |||
3608 | wdirvfs = vfsmod.vfs(path, expandpath=True, realpath=True) |
|
3607 | wdirvfs = vfsmod.vfs(path, expandpath=True, realpath=True) | |
3609 |
|
3608 | |||
3610 | hgvfs = vfsmod.vfs(wdirvfs.join(b'.hg')) |
|
3609 | hgvfs = vfsmod.vfs(wdirvfs.join(b'.hg')) | |
3611 | if hgvfs.exists(): |
|
3610 | if hgvfs.exists(): | |
3612 | raise error.RepoError(_(b'repository %s already exists') % path) |
|
3611 | raise error.RepoError(_(b'repository %s already exists') % path) | |
3613 |
|
3612 | |||
3614 | if b'sharedrepo' in createopts: |
|
3613 | if b'sharedrepo' in createopts: | |
3615 | sharedpath = createopts[b'sharedrepo'].sharedpath |
|
3614 | sharedpath = createopts[b'sharedrepo'].sharedpath | |
3616 |
|
3615 | |||
3617 | if createopts.get(b'sharedrelative'): |
|
3616 | if createopts.get(b'sharedrelative'): | |
3618 | try: |
|
3617 | try: | |
3619 | sharedpath = os.path.relpath(sharedpath, hgvfs.base) |
|
3618 | sharedpath = os.path.relpath(sharedpath, hgvfs.base) | |
3620 | except (IOError, ValueError) as e: |
|
3619 | except (IOError, ValueError) as e: | |
3621 | # ValueError is raised on Windows if the drive letters differ |
|
3620 | # ValueError is raised on Windows if the drive letters differ | |
3622 | # on each path. |
|
3621 | # on each path. | |
3623 | raise error.Abort( |
|
3622 | raise error.Abort( | |
3624 | _(b'cannot calculate relative path'), |
|
3623 | _(b'cannot calculate relative path'), | |
3625 | hint=stringutil.forcebytestr(e), |
|
3624 | hint=stringutil.forcebytestr(e), | |
3626 | ) |
|
3625 | ) | |
3627 |
|
3626 | |||
3628 | if not wdirvfs.exists(): |
|
3627 | if not wdirvfs.exists(): | |
3629 | wdirvfs.makedirs() |
|
3628 | wdirvfs.makedirs() | |
3630 |
|
3629 | |||
3631 | hgvfs.makedir(notindexed=True) |
|
3630 | hgvfs.makedir(notindexed=True) | |
3632 | if b'sharedrepo' not in createopts: |
|
3631 | if b'sharedrepo' not in createopts: | |
3633 | hgvfs.mkdir(b'cache') |
|
3632 | hgvfs.mkdir(b'cache') | |
3634 | hgvfs.mkdir(b'wcache') |
|
3633 | hgvfs.mkdir(b'wcache') | |
3635 |
|
3634 | |||
3636 | if b'store' in requirements and b'sharedrepo' not in createopts: |
|
3635 | if b'store' in requirements and b'sharedrepo' not in createopts: | |
3637 | hgvfs.mkdir(b'store') |
|
3636 | hgvfs.mkdir(b'store') | |
3638 |
|
3637 | |||
3639 | # We create an invalid changelog outside the store so very old |
|
3638 | # We create an invalid changelog outside the store so very old | |
3640 | # Mercurial versions (which didn't know about the requirements |
|
3639 | # Mercurial versions (which didn't know about the requirements | |
3641 | # file) encounter an error on reading the changelog. This |
|
3640 | # file) encounter an error on reading the changelog. This | |
3642 | # effectively locks out old clients and prevents them from |
|
3641 | # effectively locks out old clients and prevents them from | |
3643 | # mucking with a repo in an unknown format. |
|
3642 | # mucking with a repo in an unknown format. | |
3644 | # |
|
3643 | # | |
3645 | # The revlog header has version 65535, which won't be recognized by |
|
3644 | # The revlog header has version 65535, which won't be recognized by | |
3646 | # such old clients. |
|
3645 | # such old clients. | |
3647 | hgvfs.append( |
|
3646 | hgvfs.append( | |
3648 | b'00changelog.i', |
|
3647 | b'00changelog.i', | |
3649 | b'\0\0\xFF\xFF dummy changelog to prevent using the old repo ' |
|
3648 | b'\0\0\xFF\xFF dummy changelog to prevent using the old repo ' | |
3650 | b'layout', |
|
3649 | b'layout', | |
3651 | ) |
|
3650 | ) | |
3652 |
|
3651 | |||
3653 | # Filter the requirements into working copy and store ones |
|
3652 | # Filter the requirements into working copy and store ones | |
3654 | wcreq, storereq = scmutil.filterrequirements(requirements) |
|
3653 | wcreq, storereq = scmutil.filterrequirements(requirements) | |
3655 | # write working copy ones |
|
3654 | # write working copy ones | |
3656 | scmutil.writerequires(hgvfs, wcreq) |
|
3655 | scmutil.writerequires(hgvfs, wcreq) | |
3657 | # If there are store requirements and the current repository |
|
3656 | # If there are store requirements and the current repository | |
3658 | # is not a shared one, write stored requirements |
|
3657 | # is not a shared one, write stored requirements | |
3659 | # For new shared repository, we don't need to write the store |
|
3658 | # For new shared repository, we don't need to write the store | |
3660 | # requirements as they are already present in store requires |
|
3659 | # requirements as they are already present in store requires | |
3661 | if storereq and b'sharedrepo' not in createopts: |
|
3660 | if storereq and b'sharedrepo' not in createopts: | |
3662 | storevfs = vfsmod.vfs(hgvfs.join(b'store'), cacheaudited=True) |
|
3661 | storevfs = vfsmod.vfs(hgvfs.join(b'store'), cacheaudited=True) | |
3663 | scmutil.writerequires(storevfs, storereq) |
|
3662 | scmutil.writerequires(storevfs, storereq) | |
3664 |
|
3663 | |||
3665 | # Write out file telling readers where to find the shared store. |
|
3664 | # Write out file telling readers where to find the shared store. | |
3666 | if b'sharedrepo' in createopts: |
|
3665 | if b'sharedrepo' in createopts: | |
3667 | hgvfs.write(b'sharedpath', sharedpath) |
|
3666 | hgvfs.write(b'sharedpath', sharedpath) | |
3668 |
|
3667 | |||
3669 | if createopts.get(b'shareditems'): |
|
3668 | if createopts.get(b'shareditems'): | |
3670 | shared = b'\n'.join(sorted(createopts[b'shareditems'])) + b'\n' |
|
3669 | shared = b'\n'.join(sorted(createopts[b'shareditems'])) + b'\n' | |
3671 | hgvfs.write(b'shared', shared) |
|
3670 | hgvfs.write(b'shared', shared) | |
3672 |
|
3671 | |||
3673 |
|
3672 | |||
3674 | def poisonrepository(repo): |
|
3673 | def poisonrepository(repo): | |
3675 | """Poison a repository instance so it can no longer be used.""" |
|
3674 | """Poison a repository instance so it can no longer be used.""" | |
3676 | # Perform any cleanup on the instance. |
|
3675 | # Perform any cleanup on the instance. | |
3677 | repo.close() |
|
3676 | repo.close() | |
3678 |
|
3677 | |||
3679 | # Our strategy is to replace the type of the object with one that |
|
3678 | # Our strategy is to replace the type of the object with one that | |
3680 | # has all attribute lookups result in error. |
|
3679 | # has all attribute lookups result in error. | |
3681 | # |
|
3680 | # | |
3682 | # But we have to allow the close() method because some constructors |
|
3681 | # But we have to allow the close() method because some constructors | |
3683 | # of repos call close() on repo references. |
|
3682 | # of repos call close() on repo references. | |
3684 | class poisonedrepository(object): |
|
3683 | class poisonedrepository(object): | |
3685 | def __getattribute__(self, item): |
|
3684 | def __getattribute__(self, item): | |
3686 | if item == 'close': |
|
3685 | if item == 'close': | |
3687 | return object.__getattribute__(self, item) |
|
3686 | return object.__getattribute__(self, item) | |
3688 |
|
3687 | |||
3689 | raise error.ProgrammingError( |
|
3688 | raise error.ProgrammingError( | |
3690 | b'repo instances should not be used after unshare' |
|
3689 | b'repo instances should not be used after unshare' | |
3691 | ) |
|
3690 | ) | |
3692 |
|
3691 | |||
3693 | def close(self): |
|
3692 | def close(self): | |
3694 | pass |
|
3693 | pass | |
3695 |
|
3694 | |||
3696 | # We may have a repoview, which intercepts __setattr__. So be sure |
|
3695 | # We may have a repoview, which intercepts __setattr__. So be sure | |
3697 | # we operate at the lowest level possible. |
|
3696 | # we operate at the lowest level possible. | |
3698 | object.__setattr__(repo, '__class__', poisonedrepository) |
|
3697 | object.__setattr__(repo, '__class__', poisonedrepository) |
@@ -1,79 +1,80 b'' | |||||
1 | # requirements.py - objects and functions related to repository requirements |
|
1 | # requirements.py - objects and functions related to repository requirements | |
2 | # |
|
2 | # | |
3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> |
|
3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> | |
4 | # |
|
4 | # | |
5 | # This software may be used and distributed according to the terms of the |
|
5 | # This software may be used and distributed according to the terms of the | |
6 | # GNU General Public License version 2 or any later version. |
|
6 | # GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | from __future__ import absolute_import |
|
8 | from __future__ import absolute_import | |
9 |
|
9 | |||
10 | GENERALDELTA_REQUIREMENT = b'generaldelta' |
|
10 | GENERALDELTA_REQUIREMENT = b'generaldelta' | |
|
11 | DOTENCODE_REQUIREMENT = b'dotencode' | |||
11 |
|
12 | |||
12 | # When narrowing is finalized and no longer subject to format changes, |
|
13 | # When narrowing is finalized and no longer subject to format changes, | |
13 | # we should move this to just "narrow" or similar. |
|
14 | # we should move this to just "narrow" or similar. | |
14 | NARROW_REQUIREMENT = b'narrowhg-experimental' |
|
15 | NARROW_REQUIREMENT = b'narrowhg-experimental' | |
15 |
|
16 | |||
16 | # Enables sparse working directory usage |
|
17 | # Enables sparse working directory usage | |
17 | SPARSE_REQUIREMENT = b'exp-sparse' |
|
18 | SPARSE_REQUIREMENT = b'exp-sparse' | |
18 |
|
19 | |||
19 | # Enables the internal phase which is used to hide changesets instead |
|
20 | # Enables the internal phase which is used to hide changesets instead | |
20 | # of stripping them |
|
21 | # of stripping them | |
21 | INTERNAL_PHASE_REQUIREMENT = b'internal-phase' |
|
22 | INTERNAL_PHASE_REQUIREMENT = b'internal-phase' | |
22 |
|
23 | |||
23 | # Stores manifest in Tree structure |
|
24 | # Stores manifest in Tree structure | |
24 | TREEMANIFEST_REQUIREMENT = b'treemanifest' |
|
25 | TREEMANIFEST_REQUIREMENT = b'treemanifest' | |
25 |
|
26 | |||
26 | REVLOGV1_REQUIREMENT = b'revlogv1' |
|
27 | REVLOGV1_REQUIREMENT = b'revlogv1' | |
27 |
|
28 | |||
28 | # Increment the sub-version when the revlog v2 format changes to lock out old |
|
29 | # Increment the sub-version when the revlog v2 format changes to lock out old | |
29 | # clients. |
|
30 | # clients. | |
30 | REVLOGV2_REQUIREMENT = b'exp-revlogv2.1' |
|
31 | REVLOGV2_REQUIREMENT = b'exp-revlogv2.1' | |
31 |
|
32 | |||
32 | # A repository with the sparserevlog feature will have delta chains that |
|
33 | # A repository with the sparserevlog feature will have delta chains that | |
33 | # can spread over a larger span. Sparse reading cuts these large spans into |
|
34 | # can spread over a larger span. Sparse reading cuts these large spans into | |
34 | # pieces, so that each piece isn't too big. |
|
35 | # pieces, so that each piece isn't too big. | |
35 | # Without the sparserevlog capability, reading from the repository could use |
|
36 | # Without the sparserevlog capability, reading from the repository could use | |
36 | # huge amounts of memory, because the whole span would be read at once, |
|
37 | # huge amounts of memory, because the whole span would be read at once, | |
37 | # including all the intermediate revisions that aren't pertinent for the chain. |
|
38 | # including all the intermediate revisions that aren't pertinent for the chain. | |
38 | # This is why once a repository has enabled sparse-read, it becomes required. |
|
39 | # This is why once a repository has enabled sparse-read, it becomes required. | |
39 | SPARSEREVLOG_REQUIREMENT = b'sparserevlog' |
|
40 | SPARSEREVLOG_REQUIREMENT = b'sparserevlog' | |
40 |
|
41 | |||
41 | # A repository with the sidedataflag requirement will allow to store extra |
|
42 | # A repository with the sidedataflag requirement will allow to store extra | |
42 | # information for revision without altering their original hashes. |
|
43 | # information for revision without altering their original hashes. | |
43 | SIDEDATA_REQUIREMENT = b'exp-sidedata-flag' |
|
44 | SIDEDATA_REQUIREMENT = b'exp-sidedata-flag' | |
44 |
|
45 | |||
45 | # A repository with the the copies-sidedata-changeset requirement will store |
|
46 | # A repository with the the copies-sidedata-changeset requirement will store | |
46 | # copies related information in changeset's sidedata. |
|
47 | # copies related information in changeset's sidedata. | |
47 | COPIESSDC_REQUIREMENT = b'exp-copies-sidedata-changeset' |
|
48 | COPIESSDC_REQUIREMENT = b'exp-copies-sidedata-changeset' | |
48 |
|
49 | |||
49 | # The repository use persistent nodemap for the changelog and the manifest. |
|
50 | # The repository use persistent nodemap for the changelog and the manifest. | |
50 | NODEMAP_REQUIREMENT = b'persistent-nodemap' |
|
51 | NODEMAP_REQUIREMENT = b'persistent-nodemap' | |
51 |
|
52 | |||
52 | # Denotes that the current repository is a share |
|
53 | # Denotes that the current repository is a share | |
53 | SHARED_REQUIREMENT = b'shared' |
|
54 | SHARED_REQUIREMENT = b'shared' | |
54 |
|
55 | |||
55 | # Denotes that current repository is a share and the shared source path is |
|
56 | # Denotes that current repository is a share and the shared source path is | |
56 | # relative to the current repository root path |
|
57 | # relative to the current repository root path | |
57 | RELATIVE_SHARED_REQUIREMENT = b'relshared' |
|
58 | RELATIVE_SHARED_REQUIREMENT = b'relshared' | |
58 |
|
59 | |||
59 | # A repository with share implemented safely. The repository has different |
|
60 | # A repository with share implemented safely. The repository has different | |
60 | # store and working copy requirements i.e. both `.hg/requires` and |
|
61 | # store and working copy requirements i.e. both `.hg/requires` and | |
61 | # `.hg/store/requires` are present. |
|
62 | # `.hg/store/requires` are present. | |
62 | SHARESAFE_REQUIREMENT = b'share-safe' |
|
63 | SHARESAFE_REQUIREMENT = b'share-safe' | |
63 |
|
64 | |||
64 | # List of requirements which are working directory specific |
|
65 | # List of requirements which are working directory specific | |
65 | # These requirements cannot be shared between repositories if they |
|
66 | # These requirements cannot be shared between repositories if they | |
66 | # share the same store |
|
67 | # share the same store | |
67 | # * sparse is a working directory specific functionality and hence working |
|
68 | # * sparse is a working directory specific functionality and hence working | |
68 | # directory specific requirement |
|
69 | # directory specific requirement | |
69 | # * SHARED_REQUIREMENT and RELATIVE_SHARED_REQUIREMENT are requirements which |
|
70 | # * SHARED_REQUIREMENT and RELATIVE_SHARED_REQUIREMENT are requirements which | |
70 | # represents that the current working copy/repository shares store of another |
|
71 | # represents that the current working copy/repository shares store of another | |
71 | # repo. Hence both of them should be stored in working copy |
|
72 | # repo. Hence both of them should be stored in working copy | |
72 | # * SHARESAFE_REQUIREMENT needs to be stored in working dir to mark that rest of |
|
73 | # * SHARESAFE_REQUIREMENT needs to be stored in working dir to mark that rest of | |
73 | # the requirements are stored in store's requires |
|
74 | # the requirements are stored in store's requires | |
74 | WORKING_DIR_REQUIREMENTS = { |
|
75 | WORKING_DIR_REQUIREMENTS = { | |
75 | SPARSE_REQUIREMENT, |
|
76 | SPARSE_REQUIREMENT, | |
76 | SHARED_REQUIREMENT, |
|
77 | SHARED_REQUIREMENT, | |
77 | RELATIVE_SHARED_REQUIREMENT, |
|
78 | RELATIVE_SHARED_REQUIREMENT, | |
78 | SHARESAFE_REQUIREMENT, |
|
79 | SHARESAFE_REQUIREMENT, | |
79 | } |
|
80 | } |
@@ -1,1011 +1,1011 b'' | |||||
1 | # upgrade.py - functions for in place upgrade of Mercurial repository |
|
1 | # upgrade.py - functions for in place upgrade of Mercurial repository | |
2 | # |
|
2 | # | |
3 | # Copyright (c) 2016-present, Gregory Szorc |
|
3 | # Copyright (c) 2016-present, Gregory Szorc | |
4 | # |
|
4 | # | |
5 | # This software may be used and distributed according to the terms of the |
|
5 | # This software may be used and distributed according to the terms of the | |
6 | # GNU General Public License version 2 or any later version. |
|
6 | # GNU General Public License version 2 or any later version. | |
7 |
|
7 | |||
8 | from __future__ import absolute_import |
|
8 | from __future__ import absolute_import | |
9 |
|
9 | |||
10 | from ..i18n import _ |
|
10 | from ..i18n import _ | |
11 | from .. import ( |
|
11 | from .. import ( | |
12 | error, |
|
12 | error, | |
13 | localrepo, |
|
13 | localrepo, | |
14 | requirements, |
|
14 | requirements, | |
15 | revlog, |
|
15 | revlog, | |
16 | util, |
|
16 | util, | |
17 | ) |
|
17 | ) | |
18 |
|
18 | |||
19 | from ..utils import compression |
|
19 | from ..utils import compression | |
20 |
|
20 | |||
21 | # list of requirements that request a clone of all revlog if added/removed |
|
21 | # list of requirements that request a clone of all revlog if added/removed | |
22 | RECLONES_REQUIREMENTS = { |
|
22 | RECLONES_REQUIREMENTS = { | |
23 | requirements.GENERALDELTA_REQUIREMENT, |
|
23 | requirements.GENERALDELTA_REQUIREMENT, | |
24 | requirements.SPARSEREVLOG_REQUIREMENT, |
|
24 | requirements.SPARSEREVLOG_REQUIREMENT, | |
25 | } |
|
25 | } | |
26 |
|
26 | |||
27 |
|
27 | |||
28 | def preservedrequirements(repo): |
|
28 | def preservedrequirements(repo): | |
29 | return set() |
|
29 | return set() | |
30 |
|
30 | |||
31 |
|
31 | |||
32 | FORMAT_VARIANT = b'deficiency' |
|
32 | FORMAT_VARIANT = b'deficiency' | |
33 | OPTIMISATION = b'optimization' |
|
33 | OPTIMISATION = b'optimization' | |
34 |
|
34 | |||
35 |
|
35 | |||
36 | class improvement(object): |
|
36 | class improvement(object): | |
37 | """Represents an improvement that can be made as part of an upgrade. |
|
37 | """Represents an improvement that can be made as part of an upgrade. | |
38 |
|
38 | |||
39 | The following attributes are defined on each instance: |
|
39 | The following attributes are defined on each instance: | |
40 |
|
40 | |||
41 | name |
|
41 | name | |
42 | Machine-readable string uniquely identifying this improvement. It |
|
42 | Machine-readable string uniquely identifying this improvement. It | |
43 | will be mapped to an action later in the upgrade process. |
|
43 | will be mapped to an action later in the upgrade process. | |
44 |
|
44 | |||
45 | type |
|
45 | type | |
46 | Either ``FORMAT_VARIANT`` or ``OPTIMISATION``. |
|
46 | Either ``FORMAT_VARIANT`` or ``OPTIMISATION``. | |
47 | A format variant is where we change the storage format. Not all format |
|
47 | A format variant is where we change the storage format. Not all format | |
48 | variant changes are an obvious problem. |
|
48 | variant changes are an obvious problem. | |
49 | An optimization is an action (sometimes optional) that |
|
49 | An optimization is an action (sometimes optional) that | |
50 | can be taken to further improve the state of the repository. |
|
50 | can be taken to further improve the state of the repository. | |
51 |
|
51 | |||
52 | description |
|
52 | description | |
53 | Message intended for humans explaining the improvement in more detail, |
|
53 | Message intended for humans explaining the improvement in more detail, | |
54 | including the implications of it. For ``FORMAT_VARIANT`` types, should be |
|
54 | including the implications of it. For ``FORMAT_VARIANT`` types, should be | |
55 | worded in the present tense. For ``OPTIMISATION`` types, should be |
|
55 | worded in the present tense. For ``OPTIMISATION`` types, should be | |
56 | worded in the future tense. |
|
56 | worded in the future tense. | |
57 |
|
57 | |||
58 | upgrademessage |
|
58 | upgrademessage | |
59 | Message intended for humans explaining what an upgrade addressing this |
|
59 | Message intended for humans explaining what an upgrade addressing this | |
60 | issue will do. Should be worded in the future tense. |
|
60 | issue will do. Should be worded in the future tense. | |
61 |
|
61 | |||
62 | postupgrademessage |
|
62 | postupgrademessage | |
63 | Message intended for humans which will be shown post an upgrade |
|
63 | Message intended for humans which will be shown post an upgrade | |
64 | operation when the improvement will be added |
|
64 | operation when the improvement will be added | |
65 |
|
65 | |||
66 | postdowngrademessage |
|
66 | postdowngrademessage | |
67 | Message intended for humans which will be shown post an upgrade |
|
67 | Message intended for humans which will be shown post an upgrade | |
68 | operation in which this improvement was removed |
|
68 | operation in which this improvement was removed | |
69 |
|
69 | |||
70 | touches_filelogs (bool) |
|
70 | touches_filelogs (bool) | |
71 | Whether this improvement touches filelogs |
|
71 | Whether this improvement touches filelogs | |
72 |
|
72 | |||
73 | touches_manifests (bool) |
|
73 | touches_manifests (bool) | |
74 | Whether this improvement touches manifests |
|
74 | Whether this improvement touches manifests | |
75 |
|
75 | |||
76 | touches_changelog (bool) |
|
76 | touches_changelog (bool) | |
77 | Whether this improvement touches changelog |
|
77 | Whether this improvement touches changelog | |
78 |
|
78 | |||
79 | touches_requirements (bool) |
|
79 | touches_requirements (bool) | |
80 | Whether this improvement changes repository requirements |
|
80 | Whether this improvement changes repository requirements | |
81 | """ |
|
81 | """ | |
82 |
|
82 | |||
83 | def __init__(self, name, type, description, upgrademessage): |
|
83 | def __init__(self, name, type, description, upgrademessage): | |
84 | self.name = name |
|
84 | self.name = name | |
85 | self.type = type |
|
85 | self.type = type | |
86 | self.description = description |
|
86 | self.description = description | |
87 | self.upgrademessage = upgrademessage |
|
87 | self.upgrademessage = upgrademessage | |
88 | self.postupgrademessage = None |
|
88 | self.postupgrademessage = None | |
89 | self.postdowngrademessage = None |
|
89 | self.postdowngrademessage = None | |
90 | # By default for now, we assume every improvement touches |
|
90 | # By default for now, we assume every improvement touches | |
91 | # all the things |
|
91 | # all the things | |
92 | self.touches_filelogs = True |
|
92 | self.touches_filelogs = True | |
93 | self.touches_manifests = True |
|
93 | self.touches_manifests = True | |
94 | self.touches_changelog = True |
|
94 | self.touches_changelog = True | |
95 | self.touches_requirements = True |
|
95 | self.touches_requirements = True | |
96 |
|
96 | |||
97 | def __eq__(self, other): |
|
97 | def __eq__(self, other): | |
98 | if not isinstance(other, improvement): |
|
98 | if not isinstance(other, improvement): | |
99 | # This is what python tell use to do |
|
99 | # This is what python tell use to do | |
100 | return NotImplemented |
|
100 | return NotImplemented | |
101 | return self.name == other.name |
|
101 | return self.name == other.name | |
102 |
|
102 | |||
103 | def __ne__(self, other): |
|
103 | def __ne__(self, other): | |
104 | return not (self == other) |
|
104 | return not (self == other) | |
105 |
|
105 | |||
106 | def __hash__(self): |
|
106 | def __hash__(self): | |
107 | return hash(self.name) |
|
107 | return hash(self.name) | |
108 |
|
108 | |||
109 |
|
109 | |||
110 | allformatvariant = [] |
|
110 | allformatvariant = [] | |
111 |
|
111 | |||
112 |
|
112 | |||
113 | def registerformatvariant(cls): |
|
113 | def registerformatvariant(cls): | |
114 | allformatvariant.append(cls) |
|
114 | allformatvariant.append(cls) | |
115 | return cls |
|
115 | return cls | |
116 |
|
116 | |||
117 |
|
117 | |||
118 | class formatvariant(improvement): |
|
118 | class formatvariant(improvement): | |
119 | """an improvement subclass dedicated to repository format""" |
|
119 | """an improvement subclass dedicated to repository format""" | |
120 |
|
120 | |||
121 | type = FORMAT_VARIANT |
|
121 | type = FORMAT_VARIANT | |
122 | ### The following attributes should be defined for each class: |
|
122 | ### The following attributes should be defined for each class: | |
123 |
|
123 | |||
124 | # machine-readable string uniquely identifying this improvement. it will be |
|
124 | # machine-readable string uniquely identifying this improvement. it will be | |
125 | # mapped to an action later in the upgrade process. |
|
125 | # mapped to an action later in the upgrade process. | |
126 | name = None |
|
126 | name = None | |
127 |
|
127 | |||
128 | # message intended for humans explaining the improvement in more detail, |
|
128 | # message intended for humans explaining the improvement in more detail, | |
129 | # including the implications of it ``FORMAT_VARIANT`` types, should be |
|
129 | # including the implications of it ``FORMAT_VARIANT`` types, should be | |
130 | # worded |
|
130 | # worded | |
131 | # in the present tense. |
|
131 | # in the present tense. | |
132 | description = None |
|
132 | description = None | |
133 |
|
133 | |||
134 | # message intended for humans explaining what an upgrade addressing this |
|
134 | # message intended for humans explaining what an upgrade addressing this | |
135 | # issue will do. should be worded in the future tense. |
|
135 | # issue will do. should be worded in the future tense. | |
136 | upgrademessage = None |
|
136 | upgrademessage = None | |
137 |
|
137 | |||
138 | # value of current Mercurial default for new repository |
|
138 | # value of current Mercurial default for new repository | |
139 | default = None |
|
139 | default = None | |
140 |
|
140 | |||
141 | # Message intended for humans which will be shown post an upgrade |
|
141 | # Message intended for humans which will be shown post an upgrade | |
142 | # operation when the improvement will be added |
|
142 | # operation when the improvement will be added | |
143 | postupgrademessage = None |
|
143 | postupgrademessage = None | |
144 |
|
144 | |||
145 | # Message intended for humans which will be shown post an upgrade |
|
145 | # Message intended for humans which will be shown post an upgrade | |
146 | # operation in which this improvement was removed |
|
146 | # operation in which this improvement was removed | |
147 | postdowngrademessage = None |
|
147 | postdowngrademessage = None | |
148 |
|
148 | |||
149 | # By default for now, we assume every improvement touches all the things |
|
149 | # By default for now, we assume every improvement touches all the things | |
150 | touches_filelogs = True |
|
150 | touches_filelogs = True | |
151 | touches_manifests = True |
|
151 | touches_manifests = True | |
152 | touches_changelog = True |
|
152 | touches_changelog = True | |
153 | touches_requirements = True |
|
153 | touches_requirements = True | |
154 |
|
154 | |||
155 | def __init__(self): |
|
155 | def __init__(self): | |
156 | raise NotImplementedError() |
|
156 | raise NotImplementedError() | |
157 |
|
157 | |||
158 | @staticmethod |
|
158 | @staticmethod | |
159 | def fromrepo(repo): |
|
159 | def fromrepo(repo): | |
160 | """current value of the variant in the repository""" |
|
160 | """current value of the variant in the repository""" | |
161 | raise NotImplementedError() |
|
161 | raise NotImplementedError() | |
162 |
|
162 | |||
163 | @staticmethod |
|
163 | @staticmethod | |
164 | def fromconfig(repo): |
|
164 | def fromconfig(repo): | |
165 | """current value of the variant in the configuration""" |
|
165 | """current value of the variant in the configuration""" | |
166 | raise NotImplementedError() |
|
166 | raise NotImplementedError() | |
167 |
|
167 | |||
168 |
|
168 | |||
169 | class requirementformatvariant(formatvariant): |
|
169 | class requirementformatvariant(formatvariant): | |
170 | """formatvariant based on a 'requirement' name. |
|
170 | """formatvariant based on a 'requirement' name. | |
171 |
|
171 | |||
172 | Many format variant are controlled by a 'requirement'. We define a small |
|
172 | Many format variant are controlled by a 'requirement'. We define a small | |
173 | subclass to factor the code. |
|
173 | subclass to factor the code. | |
174 | """ |
|
174 | """ | |
175 |
|
175 | |||
176 | # the requirement that control this format variant |
|
176 | # the requirement that control this format variant | |
177 | _requirement = None |
|
177 | _requirement = None | |
178 |
|
178 | |||
179 | @staticmethod |
|
179 | @staticmethod | |
180 | def _newreporequirements(ui): |
|
180 | def _newreporequirements(ui): | |
181 | return localrepo.newreporequirements( |
|
181 | return localrepo.newreporequirements( | |
182 | ui, localrepo.defaultcreateopts(ui) |
|
182 | ui, localrepo.defaultcreateopts(ui) | |
183 | ) |
|
183 | ) | |
184 |
|
184 | |||
185 | @classmethod |
|
185 | @classmethod | |
186 | def fromrepo(cls, repo): |
|
186 | def fromrepo(cls, repo): | |
187 | assert cls._requirement is not None |
|
187 | assert cls._requirement is not None | |
188 | return cls._requirement in repo.requirements |
|
188 | return cls._requirement in repo.requirements | |
189 |
|
189 | |||
190 | @classmethod |
|
190 | @classmethod | |
191 | def fromconfig(cls, repo): |
|
191 | def fromconfig(cls, repo): | |
192 | assert cls._requirement is not None |
|
192 | assert cls._requirement is not None | |
193 | return cls._requirement in cls._newreporequirements(repo.ui) |
|
193 | return cls._requirement in cls._newreporequirements(repo.ui) | |
194 |
|
194 | |||
195 |
|
195 | |||
196 | @registerformatvariant |
|
196 | @registerformatvariant | |
197 | class fncache(requirementformatvariant): |
|
197 | class fncache(requirementformatvariant): | |
198 | name = b'fncache' |
|
198 | name = b'fncache' | |
199 |
|
199 | |||
200 | _requirement = b'fncache' |
|
200 | _requirement = b'fncache' | |
201 |
|
201 | |||
202 | default = True |
|
202 | default = True | |
203 |
|
203 | |||
204 | description = _( |
|
204 | description = _( | |
205 | b'long and reserved filenames may not work correctly; ' |
|
205 | b'long and reserved filenames may not work correctly; ' | |
206 | b'repository performance is sub-optimal' |
|
206 | b'repository performance is sub-optimal' | |
207 | ) |
|
207 | ) | |
208 |
|
208 | |||
209 | upgrademessage = _( |
|
209 | upgrademessage = _( | |
210 | b'repository will be more resilient to storing ' |
|
210 | b'repository will be more resilient to storing ' | |
211 | b'certain paths and performance of certain ' |
|
211 | b'certain paths and performance of certain ' | |
212 | b'operations should be improved' |
|
212 | b'operations should be improved' | |
213 | ) |
|
213 | ) | |
214 |
|
214 | |||
215 |
|
215 | |||
216 | @registerformatvariant |
|
216 | @registerformatvariant | |
217 | class dotencode(requirementformatvariant): |
|
217 | class dotencode(requirementformatvariant): | |
218 | name = b'dotencode' |
|
218 | name = b'dotencode' | |
219 |
|
219 | |||
220 | _requirement = b'dotencode' |
|
220 | _requirement = requirements.DOTENCODE_REQUIREMENT | |
221 |
|
221 | |||
222 | default = True |
|
222 | default = True | |
223 |
|
223 | |||
224 | description = _( |
|
224 | description = _( | |
225 | b'storage of filenames beginning with a period or ' |
|
225 | b'storage of filenames beginning with a period or ' | |
226 | b'space may not work correctly' |
|
226 | b'space may not work correctly' | |
227 | ) |
|
227 | ) | |
228 |
|
228 | |||
229 | upgrademessage = _( |
|
229 | upgrademessage = _( | |
230 | b'repository will be better able to store files ' |
|
230 | b'repository will be better able to store files ' | |
231 | b'beginning with a space or period' |
|
231 | b'beginning with a space or period' | |
232 | ) |
|
232 | ) | |
233 |
|
233 | |||
234 |
|
234 | |||
235 | @registerformatvariant |
|
235 | @registerformatvariant | |
236 | class generaldelta(requirementformatvariant): |
|
236 | class generaldelta(requirementformatvariant): | |
237 | name = b'generaldelta' |
|
237 | name = b'generaldelta' | |
238 |
|
238 | |||
239 | _requirement = requirements.GENERALDELTA_REQUIREMENT |
|
239 | _requirement = requirements.GENERALDELTA_REQUIREMENT | |
240 |
|
240 | |||
241 | default = True |
|
241 | default = True | |
242 |
|
242 | |||
243 | description = _( |
|
243 | description = _( | |
244 | b'deltas within internal storage are unable to ' |
|
244 | b'deltas within internal storage are unable to ' | |
245 | b'choose optimal revisions; repository is larger and ' |
|
245 | b'choose optimal revisions; repository is larger and ' | |
246 | b'slower than it could be; interaction with other ' |
|
246 | b'slower than it could be; interaction with other ' | |
247 | b'repositories may require extra network and CPU ' |
|
247 | b'repositories may require extra network and CPU ' | |
248 | b'resources, making "hg push" and "hg pull" slower' |
|
248 | b'resources, making "hg push" and "hg pull" slower' | |
249 | ) |
|
249 | ) | |
250 |
|
250 | |||
251 | upgrademessage = _( |
|
251 | upgrademessage = _( | |
252 | b'repository storage will be able to create ' |
|
252 | b'repository storage will be able to create ' | |
253 | b'optimal deltas; new repository data will be ' |
|
253 | b'optimal deltas; new repository data will be ' | |
254 | b'smaller and read times should decrease; ' |
|
254 | b'smaller and read times should decrease; ' | |
255 | b'interacting with other repositories using this ' |
|
255 | b'interacting with other repositories using this ' | |
256 | b'storage model should require less network and ' |
|
256 | b'storage model should require less network and ' | |
257 | b'CPU resources, making "hg push" and "hg pull" ' |
|
257 | b'CPU resources, making "hg push" and "hg pull" ' | |
258 | b'faster' |
|
258 | b'faster' | |
259 | ) |
|
259 | ) | |
260 |
|
260 | |||
261 |
|
261 | |||
262 | @registerformatvariant |
|
262 | @registerformatvariant | |
263 | class sharesafe(requirementformatvariant): |
|
263 | class sharesafe(requirementformatvariant): | |
264 | name = b'share-safe' |
|
264 | name = b'share-safe' | |
265 | _requirement = requirements.SHARESAFE_REQUIREMENT |
|
265 | _requirement = requirements.SHARESAFE_REQUIREMENT | |
266 |
|
266 | |||
267 | default = False |
|
267 | default = False | |
268 |
|
268 | |||
269 | description = _( |
|
269 | description = _( | |
270 | b'old shared repositories do not share source repository ' |
|
270 | b'old shared repositories do not share source repository ' | |
271 | b'requirements and config. This leads to various problems ' |
|
271 | b'requirements and config. This leads to various problems ' | |
272 | b'when the source repository format is upgraded or some new ' |
|
272 | b'when the source repository format is upgraded or some new ' | |
273 | b'extensions are enabled.' |
|
273 | b'extensions are enabled.' | |
274 | ) |
|
274 | ) | |
275 |
|
275 | |||
276 | upgrademessage = _( |
|
276 | upgrademessage = _( | |
277 | b'Upgrades a repository to share-safe format so that future ' |
|
277 | b'Upgrades a repository to share-safe format so that future ' | |
278 | b'shares of this repository share its requirements and configs.' |
|
278 | b'shares of this repository share its requirements and configs.' | |
279 | ) |
|
279 | ) | |
280 |
|
280 | |||
281 | postdowngrademessage = _( |
|
281 | postdowngrademessage = _( | |
282 | b'repository downgraded to not use share safe mode, ' |
|
282 | b'repository downgraded to not use share safe mode, ' | |
283 | b'existing shares will not work and needs to' |
|
283 | b'existing shares will not work and needs to' | |
284 | b' be reshared.' |
|
284 | b' be reshared.' | |
285 | ) |
|
285 | ) | |
286 |
|
286 | |||
287 | postupgrademessage = _( |
|
287 | postupgrademessage = _( | |
288 | b'repository upgraded to share safe mode, existing' |
|
288 | b'repository upgraded to share safe mode, existing' | |
289 | b' shares will still work in old non-safe mode. ' |
|
289 | b' shares will still work in old non-safe mode. ' | |
290 | b'Re-share existing shares to use them in safe mode' |
|
290 | b'Re-share existing shares to use them in safe mode' | |
291 | b' New shares will be created in safe mode.' |
|
291 | b' New shares will be created in safe mode.' | |
292 | ) |
|
292 | ) | |
293 |
|
293 | |||
294 | # upgrade only needs to change the requirements |
|
294 | # upgrade only needs to change the requirements | |
295 | touches_filelogs = False |
|
295 | touches_filelogs = False | |
296 | touches_manifests = False |
|
296 | touches_manifests = False | |
297 | touches_changelog = False |
|
297 | touches_changelog = False | |
298 | touches_requirements = True |
|
298 | touches_requirements = True | |
299 |
|
299 | |||
300 |
|
300 | |||
301 | @registerformatvariant |
|
301 | @registerformatvariant | |
302 | class sparserevlog(requirementformatvariant): |
|
302 | class sparserevlog(requirementformatvariant): | |
303 | name = b'sparserevlog' |
|
303 | name = b'sparserevlog' | |
304 |
|
304 | |||
305 | _requirement = requirements.SPARSEREVLOG_REQUIREMENT |
|
305 | _requirement = requirements.SPARSEREVLOG_REQUIREMENT | |
306 |
|
306 | |||
307 | default = True |
|
307 | default = True | |
308 |
|
308 | |||
309 | description = _( |
|
309 | description = _( | |
310 | b'in order to limit disk reading and memory usage on older ' |
|
310 | b'in order to limit disk reading and memory usage on older ' | |
311 | b'version, the span of a delta chain from its root to its ' |
|
311 | b'version, the span of a delta chain from its root to its ' | |
312 | b'end is limited, whatever the relevant data in this span. ' |
|
312 | b'end is limited, whatever the relevant data in this span. ' | |
313 | b'This can severly limit Mercurial ability to build good ' |
|
313 | b'This can severly limit Mercurial ability to build good ' | |
314 | b'chain of delta resulting is much more storage space being ' |
|
314 | b'chain of delta resulting is much more storage space being ' | |
315 | b'taken and limit reusability of on disk delta during ' |
|
315 | b'taken and limit reusability of on disk delta during ' | |
316 | b'exchange.' |
|
316 | b'exchange.' | |
317 | ) |
|
317 | ) | |
318 |
|
318 | |||
319 | upgrademessage = _( |
|
319 | upgrademessage = _( | |
320 | b'Revlog supports delta chain with more unused data ' |
|
320 | b'Revlog supports delta chain with more unused data ' | |
321 | b'between payload. These gaps will be skipped at read ' |
|
321 | b'between payload. These gaps will be skipped at read ' | |
322 | b'time. This allows for better delta chains, making a ' |
|
322 | b'time. This allows for better delta chains, making a ' | |
323 | b'better compression and faster exchange with server.' |
|
323 | b'better compression and faster exchange with server.' | |
324 | ) |
|
324 | ) | |
325 |
|
325 | |||
326 |
|
326 | |||
327 | @registerformatvariant |
|
327 | @registerformatvariant | |
328 | class sidedata(requirementformatvariant): |
|
328 | class sidedata(requirementformatvariant): | |
329 | name = b'sidedata' |
|
329 | name = b'sidedata' | |
330 |
|
330 | |||
331 | _requirement = requirements.SIDEDATA_REQUIREMENT |
|
331 | _requirement = requirements.SIDEDATA_REQUIREMENT | |
332 |
|
332 | |||
333 | default = False |
|
333 | default = False | |
334 |
|
334 | |||
335 | description = _( |
|
335 | description = _( | |
336 | b'Allows storage of extra data alongside a revision, ' |
|
336 | b'Allows storage of extra data alongside a revision, ' | |
337 | b'unlocking various caching options.' |
|
337 | b'unlocking various caching options.' | |
338 | ) |
|
338 | ) | |
339 |
|
339 | |||
340 | upgrademessage = _(b'Allows storage of extra data alongside a revision.') |
|
340 | upgrademessage = _(b'Allows storage of extra data alongside a revision.') | |
341 |
|
341 | |||
342 |
|
342 | |||
343 | @registerformatvariant |
|
343 | @registerformatvariant | |
344 | class persistentnodemap(requirementformatvariant): |
|
344 | class persistentnodemap(requirementformatvariant): | |
345 | name = b'persistent-nodemap' |
|
345 | name = b'persistent-nodemap' | |
346 |
|
346 | |||
347 | _requirement = requirements.NODEMAP_REQUIREMENT |
|
347 | _requirement = requirements.NODEMAP_REQUIREMENT | |
348 |
|
348 | |||
349 | default = False |
|
349 | default = False | |
350 |
|
350 | |||
351 | description = _( |
|
351 | description = _( | |
352 | b'persist the node -> rev mapping on disk to speedup lookup' |
|
352 | b'persist the node -> rev mapping on disk to speedup lookup' | |
353 | ) |
|
353 | ) | |
354 |
|
354 | |||
355 | upgrademessage = _(b'Speedup revision lookup by node id.') |
|
355 | upgrademessage = _(b'Speedup revision lookup by node id.') | |
356 |
|
356 | |||
357 |
|
357 | |||
358 | @registerformatvariant |
|
358 | @registerformatvariant | |
359 | class copiessdc(requirementformatvariant): |
|
359 | class copiessdc(requirementformatvariant): | |
360 | name = b'copies-sdc' |
|
360 | name = b'copies-sdc' | |
361 |
|
361 | |||
362 | _requirement = requirements.COPIESSDC_REQUIREMENT |
|
362 | _requirement = requirements.COPIESSDC_REQUIREMENT | |
363 |
|
363 | |||
364 | default = False |
|
364 | default = False | |
365 |
|
365 | |||
366 | description = _(b'Stores copies information alongside changesets.') |
|
366 | description = _(b'Stores copies information alongside changesets.') | |
367 |
|
367 | |||
368 | upgrademessage = _( |
|
368 | upgrademessage = _( | |
369 | b'Allows to use more efficient algorithm to deal with ' b'copy tracing.' |
|
369 | b'Allows to use more efficient algorithm to deal with ' b'copy tracing.' | |
370 | ) |
|
370 | ) | |
371 |
|
371 | |||
372 |
|
372 | |||
373 | @registerformatvariant |
|
373 | @registerformatvariant | |
374 | class removecldeltachain(formatvariant): |
|
374 | class removecldeltachain(formatvariant): | |
375 | name = b'plain-cl-delta' |
|
375 | name = b'plain-cl-delta' | |
376 |
|
376 | |||
377 | default = True |
|
377 | default = True | |
378 |
|
378 | |||
379 | description = _( |
|
379 | description = _( | |
380 | b'changelog storage is using deltas instead of ' |
|
380 | b'changelog storage is using deltas instead of ' | |
381 | b'raw entries; changelog reading and any ' |
|
381 | b'raw entries; changelog reading and any ' | |
382 | b'operation relying on changelog data are slower ' |
|
382 | b'operation relying on changelog data are slower ' | |
383 | b'than they could be' |
|
383 | b'than they could be' | |
384 | ) |
|
384 | ) | |
385 |
|
385 | |||
386 | upgrademessage = _( |
|
386 | upgrademessage = _( | |
387 | b'changelog storage will be reformated to ' |
|
387 | b'changelog storage will be reformated to ' | |
388 | b'store raw entries; changelog reading will be ' |
|
388 | b'store raw entries; changelog reading will be ' | |
389 | b'faster; changelog size may be reduced' |
|
389 | b'faster; changelog size may be reduced' | |
390 | ) |
|
390 | ) | |
391 |
|
391 | |||
392 | @staticmethod |
|
392 | @staticmethod | |
393 | def fromrepo(repo): |
|
393 | def fromrepo(repo): | |
394 | # Mercurial 4.0 changed changelogs to not use delta chains. Search for |
|
394 | # Mercurial 4.0 changed changelogs to not use delta chains. Search for | |
395 | # changelogs with deltas. |
|
395 | # changelogs with deltas. | |
396 | cl = repo.changelog |
|
396 | cl = repo.changelog | |
397 | chainbase = cl.chainbase |
|
397 | chainbase = cl.chainbase | |
398 | return all(rev == chainbase(rev) for rev in cl) |
|
398 | return all(rev == chainbase(rev) for rev in cl) | |
399 |
|
399 | |||
400 | @staticmethod |
|
400 | @staticmethod | |
401 | def fromconfig(repo): |
|
401 | def fromconfig(repo): | |
402 | return True |
|
402 | return True | |
403 |
|
403 | |||
404 |
|
404 | |||
405 | @registerformatvariant |
|
405 | @registerformatvariant | |
406 | class compressionengine(formatvariant): |
|
406 | class compressionengine(formatvariant): | |
407 | name = b'compression' |
|
407 | name = b'compression' | |
408 | default = b'zlib' |
|
408 | default = b'zlib' | |
409 |
|
409 | |||
410 | description = _( |
|
410 | description = _( | |
411 | b'Compresion algorithm used to compress data. ' |
|
411 | b'Compresion algorithm used to compress data. ' | |
412 | b'Some engine are faster than other' |
|
412 | b'Some engine are faster than other' | |
413 | ) |
|
413 | ) | |
414 |
|
414 | |||
415 | upgrademessage = _( |
|
415 | upgrademessage = _( | |
416 | b'revlog content will be recompressed with the new algorithm.' |
|
416 | b'revlog content will be recompressed with the new algorithm.' | |
417 | ) |
|
417 | ) | |
418 |
|
418 | |||
419 | @classmethod |
|
419 | @classmethod | |
420 | def fromrepo(cls, repo): |
|
420 | def fromrepo(cls, repo): | |
421 | # we allow multiple compression engine requirement to co-exist because |
|
421 | # we allow multiple compression engine requirement to co-exist because | |
422 | # strickly speaking, revlog seems to support mixed compression style. |
|
422 | # strickly speaking, revlog seems to support mixed compression style. | |
423 | # |
|
423 | # | |
424 | # The compression used for new entries will be "the last one" |
|
424 | # The compression used for new entries will be "the last one" | |
425 | compression = b'zlib' |
|
425 | compression = b'zlib' | |
426 | for req in repo.requirements: |
|
426 | for req in repo.requirements: | |
427 | prefix = req.startswith |
|
427 | prefix = req.startswith | |
428 | if prefix(b'revlog-compression-') or prefix(b'exp-compression-'): |
|
428 | if prefix(b'revlog-compression-') or prefix(b'exp-compression-'): | |
429 | compression = req.split(b'-', 2)[2] |
|
429 | compression = req.split(b'-', 2)[2] | |
430 | return compression |
|
430 | return compression | |
431 |
|
431 | |||
432 | @classmethod |
|
432 | @classmethod | |
433 | def fromconfig(cls, repo): |
|
433 | def fromconfig(cls, repo): | |
434 | compengines = repo.ui.configlist(b'format', b'revlog-compression') |
|
434 | compengines = repo.ui.configlist(b'format', b'revlog-compression') | |
435 | # return the first valid value as the selection code would do |
|
435 | # return the first valid value as the selection code would do | |
436 | for comp in compengines: |
|
436 | for comp in compengines: | |
437 | if comp in util.compengines: |
|
437 | if comp in util.compengines: | |
438 | return comp |
|
438 | return comp | |
439 |
|
439 | |||
440 | # no valide compression found lets display it all for clarity |
|
440 | # no valide compression found lets display it all for clarity | |
441 | return b','.join(compengines) |
|
441 | return b','.join(compengines) | |
442 |
|
442 | |||
443 |
|
443 | |||
444 | @registerformatvariant |
|
444 | @registerformatvariant | |
445 | class compressionlevel(formatvariant): |
|
445 | class compressionlevel(formatvariant): | |
446 | name = b'compression-level' |
|
446 | name = b'compression-level' | |
447 | default = b'default' |
|
447 | default = b'default' | |
448 |
|
448 | |||
449 | description = _(b'compression level') |
|
449 | description = _(b'compression level') | |
450 |
|
450 | |||
451 | upgrademessage = _(b'revlog content will be recompressed') |
|
451 | upgrademessage = _(b'revlog content will be recompressed') | |
452 |
|
452 | |||
453 | @classmethod |
|
453 | @classmethod | |
454 | def fromrepo(cls, repo): |
|
454 | def fromrepo(cls, repo): | |
455 | comp = compressionengine.fromrepo(repo) |
|
455 | comp = compressionengine.fromrepo(repo) | |
456 | level = None |
|
456 | level = None | |
457 | if comp == b'zlib': |
|
457 | if comp == b'zlib': | |
458 | level = repo.ui.configint(b'storage', b'revlog.zlib.level') |
|
458 | level = repo.ui.configint(b'storage', b'revlog.zlib.level') | |
459 | elif comp == b'zstd': |
|
459 | elif comp == b'zstd': | |
460 | level = repo.ui.configint(b'storage', b'revlog.zstd.level') |
|
460 | level = repo.ui.configint(b'storage', b'revlog.zstd.level') | |
461 | if level is None: |
|
461 | if level is None: | |
462 | return b'default' |
|
462 | return b'default' | |
463 | return bytes(level) |
|
463 | return bytes(level) | |
464 |
|
464 | |||
465 | @classmethod |
|
465 | @classmethod | |
466 | def fromconfig(cls, repo): |
|
466 | def fromconfig(cls, repo): | |
467 | comp = compressionengine.fromconfig(repo) |
|
467 | comp = compressionengine.fromconfig(repo) | |
468 | level = None |
|
468 | level = None | |
469 | if comp == b'zlib': |
|
469 | if comp == b'zlib': | |
470 | level = repo.ui.configint(b'storage', b'revlog.zlib.level') |
|
470 | level = repo.ui.configint(b'storage', b'revlog.zlib.level') | |
471 | elif comp == b'zstd': |
|
471 | elif comp == b'zstd': | |
472 | level = repo.ui.configint(b'storage', b'revlog.zstd.level') |
|
472 | level = repo.ui.configint(b'storage', b'revlog.zstd.level') | |
473 | if level is None: |
|
473 | if level is None: | |
474 | return b'default' |
|
474 | return b'default' | |
475 | return bytes(level) |
|
475 | return bytes(level) | |
476 |
|
476 | |||
477 |
|
477 | |||
478 | def find_format_upgrades(repo): |
|
478 | def find_format_upgrades(repo): | |
479 | """returns a list of format upgrades which can be perform on the repo""" |
|
479 | """returns a list of format upgrades which can be perform on the repo""" | |
480 | upgrades = [] |
|
480 | upgrades = [] | |
481 |
|
481 | |||
482 | # We could detect lack of revlogv1 and store here, but they were added |
|
482 | # We could detect lack of revlogv1 and store here, but they were added | |
483 | # in 0.9.2 and we don't support upgrading repos without these |
|
483 | # in 0.9.2 and we don't support upgrading repos without these | |
484 | # requirements, so let's not bother. |
|
484 | # requirements, so let's not bother. | |
485 |
|
485 | |||
486 | for fv in allformatvariant: |
|
486 | for fv in allformatvariant: | |
487 | if not fv.fromrepo(repo): |
|
487 | if not fv.fromrepo(repo): | |
488 | upgrades.append(fv) |
|
488 | upgrades.append(fv) | |
489 |
|
489 | |||
490 | return upgrades |
|
490 | return upgrades | |
491 |
|
491 | |||
492 |
|
492 | |||
493 | def find_format_downgrades(repo): |
|
493 | def find_format_downgrades(repo): | |
494 | """returns a list of format downgrades which will be performed on the repo |
|
494 | """returns a list of format downgrades which will be performed on the repo | |
495 | because of disabled config option for them""" |
|
495 | because of disabled config option for them""" | |
496 |
|
496 | |||
497 | downgrades = [] |
|
497 | downgrades = [] | |
498 |
|
498 | |||
499 | for fv in allformatvariant: |
|
499 | for fv in allformatvariant: | |
500 | if fv.name == b'compression': |
|
500 | if fv.name == b'compression': | |
501 | # If there is a compression change between repository |
|
501 | # If there is a compression change between repository | |
502 | # and config, destination repository compression will change |
|
502 | # and config, destination repository compression will change | |
503 | # and current compression will be removed. |
|
503 | # and current compression will be removed. | |
504 | if fv.fromrepo(repo) != fv.fromconfig(repo): |
|
504 | if fv.fromrepo(repo) != fv.fromconfig(repo): | |
505 | downgrades.append(fv) |
|
505 | downgrades.append(fv) | |
506 | continue |
|
506 | continue | |
507 | # format variant exist in repo but does not exist in new repository |
|
507 | # format variant exist in repo but does not exist in new repository | |
508 | # config |
|
508 | # config | |
509 | if fv.fromrepo(repo) and not fv.fromconfig(repo): |
|
509 | if fv.fromrepo(repo) and not fv.fromconfig(repo): | |
510 | downgrades.append(fv) |
|
510 | downgrades.append(fv) | |
511 |
|
511 | |||
512 | return downgrades |
|
512 | return downgrades | |
513 |
|
513 | |||
514 |
|
514 | |||
515 | ALL_OPTIMISATIONS = [] |
|
515 | ALL_OPTIMISATIONS = [] | |
516 |
|
516 | |||
517 |
|
517 | |||
518 | def register_optimization(obj): |
|
518 | def register_optimization(obj): | |
519 | ALL_OPTIMISATIONS.append(obj) |
|
519 | ALL_OPTIMISATIONS.append(obj) | |
520 | return obj |
|
520 | return obj | |
521 |
|
521 | |||
522 |
|
522 | |||
523 | register_optimization( |
|
523 | register_optimization( | |
524 | improvement( |
|
524 | improvement( | |
525 | name=b're-delta-parent', |
|
525 | name=b're-delta-parent', | |
526 | type=OPTIMISATION, |
|
526 | type=OPTIMISATION, | |
527 | description=_( |
|
527 | description=_( | |
528 | b'deltas within internal storage will be recalculated to ' |
|
528 | b'deltas within internal storage will be recalculated to ' | |
529 | b'choose an optimal base revision where this was not ' |
|
529 | b'choose an optimal base revision where this was not ' | |
530 | b'already done; the size of the repository may shrink and ' |
|
530 | b'already done; the size of the repository may shrink and ' | |
531 | b'various operations may become faster; the first time ' |
|
531 | b'various operations may become faster; the first time ' | |
532 | b'this optimization is performed could slow down upgrade ' |
|
532 | b'this optimization is performed could slow down upgrade ' | |
533 | b'execution considerably; subsequent invocations should ' |
|
533 | b'execution considerably; subsequent invocations should ' | |
534 | b'not run noticeably slower' |
|
534 | b'not run noticeably slower' | |
535 | ), |
|
535 | ), | |
536 | upgrademessage=_( |
|
536 | upgrademessage=_( | |
537 | b'deltas within internal storage will choose a new ' |
|
537 | b'deltas within internal storage will choose a new ' | |
538 | b'base revision if needed' |
|
538 | b'base revision if needed' | |
539 | ), |
|
539 | ), | |
540 | ) |
|
540 | ) | |
541 | ) |
|
541 | ) | |
542 |
|
542 | |||
543 | register_optimization( |
|
543 | register_optimization( | |
544 | improvement( |
|
544 | improvement( | |
545 | name=b're-delta-multibase', |
|
545 | name=b're-delta-multibase', | |
546 | type=OPTIMISATION, |
|
546 | type=OPTIMISATION, | |
547 | description=_( |
|
547 | description=_( | |
548 | b'deltas within internal storage will be recalculated ' |
|
548 | b'deltas within internal storage will be recalculated ' | |
549 | b'against multiple base revision and the smallest ' |
|
549 | b'against multiple base revision and the smallest ' | |
550 | b'difference will be used; the size of the repository may ' |
|
550 | b'difference will be used; the size of the repository may ' | |
551 | b'shrink significantly when there are many merges; this ' |
|
551 | b'shrink significantly when there are many merges; this ' | |
552 | b'optimization will slow down execution in proportion to ' |
|
552 | b'optimization will slow down execution in proportion to ' | |
553 | b'the number of merges in the repository and the amount ' |
|
553 | b'the number of merges in the repository and the amount ' | |
554 | b'of files in the repository; this slow down should not ' |
|
554 | b'of files in the repository; this slow down should not ' | |
555 | b'be significant unless there are tens of thousands of ' |
|
555 | b'be significant unless there are tens of thousands of ' | |
556 | b'files and thousands of merges' |
|
556 | b'files and thousands of merges' | |
557 | ), |
|
557 | ), | |
558 | upgrademessage=_( |
|
558 | upgrademessage=_( | |
559 | b'deltas within internal storage will choose an ' |
|
559 | b'deltas within internal storage will choose an ' | |
560 | b'optimal delta by computing deltas against multiple ' |
|
560 | b'optimal delta by computing deltas against multiple ' | |
561 | b'parents; may slow down execution time ' |
|
561 | b'parents; may slow down execution time ' | |
562 | b'significantly' |
|
562 | b'significantly' | |
563 | ), |
|
563 | ), | |
564 | ) |
|
564 | ) | |
565 | ) |
|
565 | ) | |
566 |
|
566 | |||
567 | register_optimization( |
|
567 | register_optimization( | |
568 | improvement( |
|
568 | improvement( | |
569 | name=b're-delta-all', |
|
569 | name=b're-delta-all', | |
570 | type=OPTIMISATION, |
|
570 | type=OPTIMISATION, | |
571 | description=_( |
|
571 | description=_( | |
572 | b'deltas within internal storage will always be ' |
|
572 | b'deltas within internal storage will always be ' | |
573 | b'recalculated without reusing prior deltas; this will ' |
|
573 | b'recalculated without reusing prior deltas; this will ' | |
574 | b'likely make execution run several times slower; this ' |
|
574 | b'likely make execution run several times slower; this ' | |
575 | b'optimization is typically not needed' |
|
575 | b'optimization is typically not needed' | |
576 | ), |
|
576 | ), | |
577 | upgrademessage=_( |
|
577 | upgrademessage=_( | |
578 | b'deltas within internal storage will be fully ' |
|
578 | b'deltas within internal storage will be fully ' | |
579 | b'recomputed; this will likely drastically slow down ' |
|
579 | b'recomputed; this will likely drastically slow down ' | |
580 | b'execution time' |
|
580 | b'execution time' | |
581 | ), |
|
581 | ), | |
582 | ) |
|
582 | ) | |
583 | ) |
|
583 | ) | |
584 |
|
584 | |||
585 | register_optimization( |
|
585 | register_optimization( | |
586 | improvement( |
|
586 | improvement( | |
587 | name=b're-delta-fulladd', |
|
587 | name=b're-delta-fulladd', | |
588 | type=OPTIMISATION, |
|
588 | type=OPTIMISATION, | |
589 | description=_( |
|
589 | description=_( | |
590 | b'every revision will be re-added as if it was new ' |
|
590 | b'every revision will be re-added as if it was new ' | |
591 | b'content. It will go through the full storage ' |
|
591 | b'content. It will go through the full storage ' | |
592 | b'mechanism giving extensions a chance to process it ' |
|
592 | b'mechanism giving extensions a chance to process it ' | |
593 | b'(eg. lfs). This is similar to "re-delta-all" but even ' |
|
593 | b'(eg. lfs). This is similar to "re-delta-all" but even ' | |
594 | b'slower since more logic is involved.' |
|
594 | b'slower since more logic is involved.' | |
595 | ), |
|
595 | ), | |
596 | upgrademessage=_( |
|
596 | upgrademessage=_( | |
597 | b'each revision will be added as new content to the ' |
|
597 | b'each revision will be added as new content to the ' | |
598 | b'internal storage; this will likely drastically slow ' |
|
598 | b'internal storage; this will likely drastically slow ' | |
599 | b'down execution time, but some extensions might need ' |
|
599 | b'down execution time, but some extensions might need ' | |
600 | b'it' |
|
600 | b'it' | |
601 | ), |
|
601 | ), | |
602 | ) |
|
602 | ) | |
603 | ) |
|
603 | ) | |
604 |
|
604 | |||
605 |
|
605 | |||
606 | def findoptimizations(repo): |
|
606 | def findoptimizations(repo): | |
607 | """Determine optimisation that could be used during upgrade""" |
|
607 | """Determine optimisation that could be used during upgrade""" | |
608 | # These are unconditionally added. There is logic later that figures out |
|
608 | # These are unconditionally added. There is logic later that figures out | |
609 | # which ones to apply. |
|
609 | # which ones to apply. | |
610 | return list(ALL_OPTIMISATIONS) |
|
610 | return list(ALL_OPTIMISATIONS) | |
611 |
|
611 | |||
612 |
|
612 | |||
613 | def determine_upgrade_actions( |
|
613 | def determine_upgrade_actions( | |
614 | repo, format_upgrades, optimizations, sourcereqs, destreqs |
|
614 | repo, format_upgrades, optimizations, sourcereqs, destreqs | |
615 | ): |
|
615 | ): | |
616 | """Determine upgrade actions that will be performed. |
|
616 | """Determine upgrade actions that will be performed. | |
617 |
|
617 | |||
618 | Given a list of improvements as returned by ``find_format_upgrades`` and |
|
618 | Given a list of improvements as returned by ``find_format_upgrades`` and | |
619 | ``findoptimizations``, determine the list of upgrade actions that |
|
619 | ``findoptimizations``, determine the list of upgrade actions that | |
620 | will be performed. |
|
620 | will be performed. | |
621 |
|
621 | |||
622 | The role of this function is to filter improvements if needed, apply |
|
622 | The role of this function is to filter improvements if needed, apply | |
623 | recommended optimizations from the improvements list that make sense, |
|
623 | recommended optimizations from the improvements list that make sense, | |
624 | etc. |
|
624 | etc. | |
625 |
|
625 | |||
626 | Returns a list of action names. |
|
626 | Returns a list of action names. | |
627 | """ |
|
627 | """ | |
628 | newactions = [] |
|
628 | newactions = [] | |
629 |
|
629 | |||
630 | for d in format_upgrades: |
|
630 | for d in format_upgrades: | |
631 | name = d._requirement |
|
631 | name = d._requirement | |
632 |
|
632 | |||
633 | # If the action is a requirement that doesn't show up in the |
|
633 | # If the action is a requirement that doesn't show up in the | |
634 | # destination requirements, prune the action. |
|
634 | # destination requirements, prune the action. | |
635 | if name is not None and name not in destreqs: |
|
635 | if name is not None and name not in destreqs: | |
636 | continue |
|
636 | continue | |
637 |
|
637 | |||
638 | newactions.append(d) |
|
638 | newactions.append(d) | |
639 |
|
639 | |||
640 | newactions.extend(o for o in sorted(optimizations) if o not in newactions) |
|
640 | newactions.extend(o for o in sorted(optimizations) if o not in newactions) | |
641 |
|
641 | |||
642 | # FUTURE consider adding some optimizations here for certain transitions. |
|
642 | # FUTURE consider adding some optimizations here for certain transitions. | |
643 | # e.g. adding generaldelta could schedule parent redeltas. |
|
643 | # e.g. adding generaldelta could schedule parent redeltas. | |
644 |
|
644 | |||
645 | return newactions |
|
645 | return newactions | |
646 |
|
646 | |||
647 |
|
647 | |||
648 | class UpgradeOperation(object): |
|
648 | class UpgradeOperation(object): | |
649 | """represent the work to be done during an upgrade""" |
|
649 | """represent the work to be done during an upgrade""" | |
650 |
|
650 | |||
651 | def __init__( |
|
651 | def __init__( | |
652 | self, |
|
652 | self, | |
653 | ui, |
|
653 | ui, | |
654 | new_requirements, |
|
654 | new_requirements, | |
655 | current_requirements, |
|
655 | current_requirements, | |
656 | upgrade_actions, |
|
656 | upgrade_actions, | |
657 | removed_actions, |
|
657 | removed_actions, | |
658 | revlogs_to_process, |
|
658 | revlogs_to_process, | |
659 | backup_store, |
|
659 | backup_store, | |
660 | ): |
|
660 | ): | |
661 | self.ui = ui |
|
661 | self.ui = ui | |
662 | self.new_requirements = new_requirements |
|
662 | self.new_requirements = new_requirements | |
663 | self.current_requirements = current_requirements |
|
663 | self.current_requirements = current_requirements | |
664 | # list of upgrade actions the operation will perform |
|
664 | # list of upgrade actions the operation will perform | |
665 | self.upgrade_actions = upgrade_actions |
|
665 | self.upgrade_actions = upgrade_actions | |
666 | self._upgrade_actions_names = set([a.name for a in upgrade_actions]) |
|
666 | self._upgrade_actions_names = set([a.name for a in upgrade_actions]) | |
667 | self.removed_actions = removed_actions |
|
667 | self.removed_actions = removed_actions | |
668 | self.revlogs_to_process = revlogs_to_process |
|
668 | self.revlogs_to_process = revlogs_to_process | |
669 | # requirements which will be added by the operation |
|
669 | # requirements which will be added by the operation | |
670 | self._added_requirements = ( |
|
670 | self._added_requirements = ( | |
671 | self.new_requirements - self.current_requirements |
|
671 | self.new_requirements - self.current_requirements | |
672 | ) |
|
672 | ) | |
673 | # requirements which will be removed by the operation |
|
673 | # requirements which will be removed by the operation | |
674 | self._removed_requirements = ( |
|
674 | self._removed_requirements = ( | |
675 | self.current_requirements - self.new_requirements |
|
675 | self.current_requirements - self.new_requirements | |
676 | ) |
|
676 | ) | |
677 | # requirements which will be preserved by the operation |
|
677 | # requirements which will be preserved by the operation | |
678 | self._preserved_requirements = ( |
|
678 | self._preserved_requirements = ( | |
679 | self.current_requirements & self.new_requirements |
|
679 | self.current_requirements & self.new_requirements | |
680 | ) |
|
680 | ) | |
681 | # optimizations which are not used and it's recommended that they |
|
681 | # optimizations which are not used and it's recommended that they | |
682 | # should use them |
|
682 | # should use them | |
683 | all_optimizations = findoptimizations(None) |
|
683 | all_optimizations = findoptimizations(None) | |
684 | self.unused_optimizations = [ |
|
684 | self.unused_optimizations = [ | |
685 | i for i in all_optimizations if i not in self.upgrade_actions |
|
685 | i for i in all_optimizations if i not in self.upgrade_actions | |
686 | ] |
|
686 | ] | |
687 |
|
687 | |||
688 | # delta reuse mode of this upgrade operation |
|
688 | # delta reuse mode of this upgrade operation | |
689 | self.delta_reuse_mode = revlog.revlog.DELTAREUSEALWAYS |
|
689 | self.delta_reuse_mode = revlog.revlog.DELTAREUSEALWAYS | |
690 | if b're-delta-all' in self._upgrade_actions_names: |
|
690 | if b're-delta-all' in self._upgrade_actions_names: | |
691 | self.delta_reuse_mode = revlog.revlog.DELTAREUSENEVER |
|
691 | self.delta_reuse_mode = revlog.revlog.DELTAREUSENEVER | |
692 | elif b're-delta-parent' in self._upgrade_actions_names: |
|
692 | elif b're-delta-parent' in self._upgrade_actions_names: | |
693 | self.delta_reuse_mode = revlog.revlog.DELTAREUSESAMEREVS |
|
693 | self.delta_reuse_mode = revlog.revlog.DELTAREUSESAMEREVS | |
694 | elif b're-delta-multibase' in self._upgrade_actions_names: |
|
694 | elif b're-delta-multibase' in self._upgrade_actions_names: | |
695 | self.delta_reuse_mode = revlog.revlog.DELTAREUSESAMEREVS |
|
695 | self.delta_reuse_mode = revlog.revlog.DELTAREUSESAMEREVS | |
696 | elif b're-delta-fulladd' in self._upgrade_actions_names: |
|
696 | elif b're-delta-fulladd' in self._upgrade_actions_names: | |
697 | self.delta_reuse_mode = revlog.revlog.DELTAREUSEFULLADD |
|
697 | self.delta_reuse_mode = revlog.revlog.DELTAREUSEFULLADD | |
698 |
|
698 | |||
699 | # should this operation force re-delta of both parents |
|
699 | # should this operation force re-delta of both parents | |
700 | self.force_re_delta_both_parents = ( |
|
700 | self.force_re_delta_both_parents = ( | |
701 | b're-delta-multibase' in self._upgrade_actions_names |
|
701 | b're-delta-multibase' in self._upgrade_actions_names | |
702 | ) |
|
702 | ) | |
703 |
|
703 | |||
704 | # should this operation create a backup of the store |
|
704 | # should this operation create a backup of the store | |
705 | self.backup_store = backup_store |
|
705 | self.backup_store = backup_store | |
706 |
|
706 | |||
707 | # whether the operation touches different revlogs at all or not |
|
707 | # whether the operation touches different revlogs at all or not | |
708 | self.touches_filelogs = self._touches_filelogs() |
|
708 | self.touches_filelogs = self._touches_filelogs() | |
709 | self.touches_manifests = self._touches_manifests() |
|
709 | self.touches_manifests = self._touches_manifests() | |
710 | self.touches_changelog = self._touches_changelog() |
|
710 | self.touches_changelog = self._touches_changelog() | |
711 | # whether the operation touches requirements file or not |
|
711 | # whether the operation touches requirements file or not | |
712 | self.touches_requirements = self._touches_requirements() |
|
712 | self.touches_requirements = self._touches_requirements() | |
713 | self.touches_store = ( |
|
713 | self.touches_store = ( | |
714 | self.touches_filelogs |
|
714 | self.touches_filelogs | |
715 | or self.touches_manifests |
|
715 | or self.touches_manifests | |
716 | or self.touches_changelog |
|
716 | or self.touches_changelog | |
717 | ) |
|
717 | ) | |
718 | # does the operation only touches repository requirement |
|
718 | # does the operation only touches repository requirement | |
719 | self.requirements_only = ( |
|
719 | self.requirements_only = ( | |
720 | self.touches_requirements and not self.touches_store |
|
720 | self.touches_requirements and not self.touches_store | |
721 | ) |
|
721 | ) | |
722 |
|
722 | |||
723 | def _touches_filelogs(self): |
|
723 | def _touches_filelogs(self): | |
724 | for a in self.upgrade_actions: |
|
724 | for a in self.upgrade_actions: | |
725 | # in optimisations, we re-process the revlogs again |
|
725 | # in optimisations, we re-process the revlogs again | |
726 | if a.type == OPTIMISATION: |
|
726 | if a.type == OPTIMISATION: | |
727 | return True |
|
727 | return True | |
728 | elif a.touches_filelogs: |
|
728 | elif a.touches_filelogs: | |
729 | return True |
|
729 | return True | |
730 | for a in self.removed_actions: |
|
730 | for a in self.removed_actions: | |
731 | if a.touches_filelogs: |
|
731 | if a.touches_filelogs: | |
732 | return True |
|
732 | return True | |
733 | return False |
|
733 | return False | |
734 |
|
734 | |||
735 | def _touches_manifests(self): |
|
735 | def _touches_manifests(self): | |
736 | for a in self.upgrade_actions: |
|
736 | for a in self.upgrade_actions: | |
737 | # in optimisations, we re-process the revlogs again |
|
737 | # in optimisations, we re-process the revlogs again | |
738 | if a.type == OPTIMISATION: |
|
738 | if a.type == OPTIMISATION: | |
739 | return True |
|
739 | return True | |
740 | elif a.touches_manifests: |
|
740 | elif a.touches_manifests: | |
741 | return True |
|
741 | return True | |
742 | for a in self.removed_actions: |
|
742 | for a in self.removed_actions: | |
743 | if a.touches_manifests: |
|
743 | if a.touches_manifests: | |
744 | return True |
|
744 | return True | |
745 | return False |
|
745 | return False | |
746 |
|
746 | |||
747 | def _touches_changelog(self): |
|
747 | def _touches_changelog(self): | |
748 | for a in self.upgrade_actions: |
|
748 | for a in self.upgrade_actions: | |
749 | # in optimisations, we re-process the revlogs again |
|
749 | # in optimisations, we re-process the revlogs again | |
750 | if a.type == OPTIMISATION: |
|
750 | if a.type == OPTIMISATION: | |
751 | return True |
|
751 | return True | |
752 | elif a.touches_changelog: |
|
752 | elif a.touches_changelog: | |
753 | return True |
|
753 | return True | |
754 | for a in self.removed_actions: |
|
754 | for a in self.removed_actions: | |
755 | if a.touches_changelog: |
|
755 | if a.touches_changelog: | |
756 | return True |
|
756 | return True | |
757 | return False |
|
757 | return False | |
758 |
|
758 | |||
759 | def _touches_requirements(self): |
|
759 | def _touches_requirements(self): | |
760 | for a in self.upgrade_actions: |
|
760 | for a in self.upgrade_actions: | |
761 | # optimisations are used to re-process revlogs and does not result |
|
761 | # optimisations are used to re-process revlogs and does not result | |
762 | # in a requirement being added or removed |
|
762 | # in a requirement being added or removed | |
763 | if a.type == OPTIMISATION: |
|
763 | if a.type == OPTIMISATION: | |
764 | pass |
|
764 | pass | |
765 | elif a.touches_requirements: |
|
765 | elif a.touches_requirements: | |
766 | return True |
|
766 | return True | |
767 | for a in self.removed_actions: |
|
767 | for a in self.removed_actions: | |
768 | if a.touches_requirements: |
|
768 | if a.touches_requirements: | |
769 | return True |
|
769 | return True | |
770 |
|
770 | |||
771 | return False |
|
771 | return False | |
772 |
|
772 | |||
773 | def _write_labeled(self, l, label): |
|
773 | def _write_labeled(self, l, label): | |
774 | """ |
|
774 | """ | |
775 | Utility function to aid writing of a list under one label |
|
775 | Utility function to aid writing of a list under one label | |
776 | """ |
|
776 | """ | |
777 | first = True |
|
777 | first = True | |
778 | for r in sorted(l): |
|
778 | for r in sorted(l): | |
779 | if not first: |
|
779 | if not first: | |
780 | self.ui.write(b', ') |
|
780 | self.ui.write(b', ') | |
781 | self.ui.write(r, label=label) |
|
781 | self.ui.write(r, label=label) | |
782 | first = False |
|
782 | first = False | |
783 |
|
783 | |||
784 | def print_requirements(self): |
|
784 | def print_requirements(self): | |
785 | self.ui.write(_(b'requirements\n')) |
|
785 | self.ui.write(_(b'requirements\n')) | |
786 | self.ui.write(_(b' preserved: ')) |
|
786 | self.ui.write(_(b' preserved: ')) | |
787 | self._write_labeled( |
|
787 | self._write_labeled( | |
788 | self._preserved_requirements, "upgrade-repo.requirement.preserved" |
|
788 | self._preserved_requirements, "upgrade-repo.requirement.preserved" | |
789 | ) |
|
789 | ) | |
790 | self.ui.write((b'\n')) |
|
790 | self.ui.write((b'\n')) | |
791 | if self._removed_requirements: |
|
791 | if self._removed_requirements: | |
792 | self.ui.write(_(b' removed: ')) |
|
792 | self.ui.write(_(b' removed: ')) | |
793 | self._write_labeled( |
|
793 | self._write_labeled( | |
794 | self._removed_requirements, "upgrade-repo.requirement.removed" |
|
794 | self._removed_requirements, "upgrade-repo.requirement.removed" | |
795 | ) |
|
795 | ) | |
796 | self.ui.write((b'\n')) |
|
796 | self.ui.write((b'\n')) | |
797 | if self._added_requirements: |
|
797 | if self._added_requirements: | |
798 | self.ui.write(_(b' added: ')) |
|
798 | self.ui.write(_(b' added: ')) | |
799 | self._write_labeled( |
|
799 | self._write_labeled( | |
800 | self._added_requirements, "upgrade-repo.requirement.added" |
|
800 | self._added_requirements, "upgrade-repo.requirement.added" | |
801 | ) |
|
801 | ) | |
802 | self.ui.write((b'\n')) |
|
802 | self.ui.write((b'\n')) | |
803 | self.ui.write(b'\n') |
|
803 | self.ui.write(b'\n') | |
804 |
|
804 | |||
805 | def print_optimisations(self): |
|
805 | def print_optimisations(self): | |
806 | optimisations = [ |
|
806 | optimisations = [ | |
807 | a for a in self.upgrade_actions if a.type == OPTIMISATION |
|
807 | a for a in self.upgrade_actions if a.type == OPTIMISATION | |
808 | ] |
|
808 | ] | |
809 | optimisations.sort(key=lambda a: a.name) |
|
809 | optimisations.sort(key=lambda a: a.name) | |
810 | if optimisations: |
|
810 | if optimisations: | |
811 | self.ui.write(_(b'optimisations: ')) |
|
811 | self.ui.write(_(b'optimisations: ')) | |
812 | self._write_labeled( |
|
812 | self._write_labeled( | |
813 | [a.name for a in optimisations], |
|
813 | [a.name for a in optimisations], | |
814 | "upgrade-repo.optimisation.performed", |
|
814 | "upgrade-repo.optimisation.performed", | |
815 | ) |
|
815 | ) | |
816 | self.ui.write(b'\n\n') |
|
816 | self.ui.write(b'\n\n') | |
817 |
|
817 | |||
818 | def print_upgrade_actions(self): |
|
818 | def print_upgrade_actions(self): | |
819 | for a in self.upgrade_actions: |
|
819 | for a in self.upgrade_actions: | |
820 | self.ui.status(b'%s\n %s\n\n' % (a.name, a.upgrademessage)) |
|
820 | self.ui.status(b'%s\n %s\n\n' % (a.name, a.upgrademessage)) | |
821 |
|
821 | |||
822 | def print_affected_revlogs(self): |
|
822 | def print_affected_revlogs(self): | |
823 | if not self.revlogs_to_process: |
|
823 | if not self.revlogs_to_process: | |
824 | self.ui.write((b'no revlogs to process\n')) |
|
824 | self.ui.write((b'no revlogs to process\n')) | |
825 | else: |
|
825 | else: | |
826 | self.ui.write((b'processed revlogs:\n')) |
|
826 | self.ui.write((b'processed revlogs:\n')) | |
827 | for r in sorted(self.revlogs_to_process): |
|
827 | for r in sorted(self.revlogs_to_process): | |
828 | self.ui.write((b' - %s\n' % r)) |
|
828 | self.ui.write((b' - %s\n' % r)) | |
829 | self.ui.write((b'\n')) |
|
829 | self.ui.write((b'\n')) | |
830 |
|
830 | |||
831 | def print_unused_optimizations(self): |
|
831 | def print_unused_optimizations(self): | |
832 | for i in self.unused_optimizations: |
|
832 | for i in self.unused_optimizations: | |
833 | self.ui.status(_(b'%s\n %s\n\n') % (i.name, i.description)) |
|
833 | self.ui.status(_(b'%s\n %s\n\n') % (i.name, i.description)) | |
834 |
|
834 | |||
835 | def has_upgrade_action(self, name): |
|
835 | def has_upgrade_action(self, name): | |
836 | """ Check whether the upgrade operation will perform this action """ |
|
836 | """ Check whether the upgrade operation will perform this action """ | |
837 | return name in self._upgrade_actions_names |
|
837 | return name in self._upgrade_actions_names | |
838 |
|
838 | |||
839 | def print_post_op_messages(self): |
|
839 | def print_post_op_messages(self): | |
840 | """ print post upgrade operation warning messages """ |
|
840 | """ print post upgrade operation warning messages """ | |
841 | for a in self.upgrade_actions: |
|
841 | for a in self.upgrade_actions: | |
842 | if a.postupgrademessage is not None: |
|
842 | if a.postupgrademessage is not None: | |
843 | self.ui.warn(b'%s\n' % a.postupgrademessage) |
|
843 | self.ui.warn(b'%s\n' % a.postupgrademessage) | |
844 | for a in self.removed_actions: |
|
844 | for a in self.removed_actions: | |
845 | if a.postdowngrademessage is not None: |
|
845 | if a.postdowngrademessage is not None: | |
846 | self.ui.warn(b'%s\n' % a.postdowngrademessage) |
|
846 | self.ui.warn(b'%s\n' % a.postdowngrademessage) | |
847 |
|
847 | |||
848 |
|
848 | |||
849 | ### Code checking if a repository can got through the upgrade process at all. # |
|
849 | ### Code checking if a repository can got through the upgrade process at all. # | |
850 |
|
850 | |||
851 |
|
851 | |||
852 | def requiredsourcerequirements(repo): |
|
852 | def requiredsourcerequirements(repo): | |
853 | """Obtain requirements required to be present to upgrade a repo. |
|
853 | """Obtain requirements required to be present to upgrade a repo. | |
854 |
|
854 | |||
855 | An upgrade will not be allowed if the repository doesn't have the |
|
855 | An upgrade will not be allowed if the repository doesn't have the | |
856 | requirements returned by this function. |
|
856 | requirements returned by this function. | |
857 | """ |
|
857 | """ | |
858 | return { |
|
858 | return { | |
859 | # Introduced in Mercurial 0.9.2. |
|
859 | # Introduced in Mercurial 0.9.2. | |
860 | requirements.REVLOGV1_REQUIREMENT, |
|
860 | requirements.REVLOGV1_REQUIREMENT, | |
861 | # Introduced in Mercurial 0.9.2. |
|
861 | # Introduced in Mercurial 0.9.2. | |
862 | b'store', |
|
862 | b'store', | |
863 | } |
|
863 | } | |
864 |
|
864 | |||
865 |
|
865 | |||
866 | def blocksourcerequirements(repo): |
|
866 | def blocksourcerequirements(repo): | |
867 | """Obtain requirements that will prevent an upgrade from occurring. |
|
867 | """Obtain requirements that will prevent an upgrade from occurring. | |
868 |
|
868 | |||
869 | An upgrade cannot be performed if the source repository contains a |
|
869 | An upgrade cannot be performed if the source repository contains a | |
870 | requirements in the returned set. |
|
870 | requirements in the returned set. | |
871 | """ |
|
871 | """ | |
872 | return { |
|
872 | return { | |
873 | # The upgrade code does not yet support these experimental features. |
|
873 | # The upgrade code does not yet support these experimental features. | |
874 | # This is an artificial limitation. |
|
874 | # This is an artificial limitation. | |
875 | requirements.TREEMANIFEST_REQUIREMENT, |
|
875 | requirements.TREEMANIFEST_REQUIREMENT, | |
876 | # This was a precursor to generaldelta and was never enabled by default. |
|
876 | # This was a precursor to generaldelta and was never enabled by default. | |
877 | # It should (hopefully) not exist in the wild. |
|
877 | # It should (hopefully) not exist in the wild. | |
878 | b'parentdelta', |
|
878 | b'parentdelta', | |
879 | # Upgrade should operate on the actual store, not the shared link. |
|
879 | # Upgrade should operate on the actual store, not the shared link. | |
880 | requirements.SHARED_REQUIREMENT, |
|
880 | requirements.SHARED_REQUIREMENT, | |
881 | } |
|
881 | } | |
882 |
|
882 | |||
883 |
|
883 | |||
884 | def check_source_requirements(repo): |
|
884 | def check_source_requirements(repo): | |
885 | """Ensure that no existing requirements prevent the repository upgrade""" |
|
885 | """Ensure that no existing requirements prevent the repository upgrade""" | |
886 |
|
886 | |||
887 | required = requiredsourcerequirements(repo) |
|
887 | required = requiredsourcerequirements(repo) | |
888 | missingreqs = required - repo.requirements |
|
888 | missingreqs = required - repo.requirements | |
889 | if missingreqs: |
|
889 | if missingreqs: | |
890 | msg = _(b'cannot upgrade repository; requirement missing: %s') |
|
890 | msg = _(b'cannot upgrade repository; requirement missing: %s') | |
891 | missingreqs = b', '.join(sorted(missingreqs)) |
|
891 | missingreqs = b', '.join(sorted(missingreqs)) | |
892 | raise error.Abort(msg % missingreqs) |
|
892 | raise error.Abort(msg % missingreqs) | |
893 |
|
893 | |||
894 | blocking = blocksourcerequirements(repo) |
|
894 | blocking = blocksourcerequirements(repo) | |
895 | blockingreqs = blocking & repo.requirements |
|
895 | blockingreqs = blocking & repo.requirements | |
896 | if blockingreqs: |
|
896 | if blockingreqs: | |
897 | m = _(b'cannot upgrade repository; unsupported source requirement: %s') |
|
897 | m = _(b'cannot upgrade repository; unsupported source requirement: %s') | |
898 | blockingreqs = b', '.join(sorted(blockingreqs)) |
|
898 | blockingreqs = b', '.join(sorted(blockingreqs)) | |
899 | raise error.Abort(m % blockingreqs) |
|
899 | raise error.Abort(m % blockingreqs) | |
900 |
|
900 | |||
901 |
|
901 | |||
902 | ### Verify the validity of the planned requirement changes #################### |
|
902 | ### Verify the validity of the planned requirement changes #################### | |
903 |
|
903 | |||
904 |
|
904 | |||
905 | def supportremovedrequirements(repo): |
|
905 | def supportremovedrequirements(repo): | |
906 | """Obtain requirements that can be removed during an upgrade. |
|
906 | """Obtain requirements that can be removed during an upgrade. | |
907 |
|
907 | |||
908 | If an upgrade were to create a repository that dropped a requirement, |
|
908 | If an upgrade were to create a repository that dropped a requirement, | |
909 | the dropped requirement must appear in the returned set for the upgrade |
|
909 | the dropped requirement must appear in the returned set for the upgrade | |
910 | to be allowed. |
|
910 | to be allowed. | |
911 | """ |
|
911 | """ | |
912 | supported = { |
|
912 | supported = { | |
913 | requirements.SPARSEREVLOG_REQUIREMENT, |
|
913 | requirements.SPARSEREVLOG_REQUIREMENT, | |
914 | requirements.SIDEDATA_REQUIREMENT, |
|
914 | requirements.SIDEDATA_REQUIREMENT, | |
915 | requirements.COPIESSDC_REQUIREMENT, |
|
915 | requirements.COPIESSDC_REQUIREMENT, | |
916 | requirements.NODEMAP_REQUIREMENT, |
|
916 | requirements.NODEMAP_REQUIREMENT, | |
917 | requirements.SHARESAFE_REQUIREMENT, |
|
917 | requirements.SHARESAFE_REQUIREMENT, | |
918 | } |
|
918 | } | |
919 | for name in compression.compengines: |
|
919 | for name in compression.compengines: | |
920 | engine = compression.compengines[name] |
|
920 | engine = compression.compengines[name] | |
921 | if engine.available() and engine.revlogheader(): |
|
921 | if engine.available() and engine.revlogheader(): | |
922 | supported.add(b'exp-compression-%s' % name) |
|
922 | supported.add(b'exp-compression-%s' % name) | |
923 | if engine.name() == b'zstd': |
|
923 | if engine.name() == b'zstd': | |
924 | supported.add(b'revlog-compression-zstd') |
|
924 | supported.add(b'revlog-compression-zstd') | |
925 | return supported |
|
925 | return supported | |
926 |
|
926 | |||
927 |
|
927 | |||
928 | def supporteddestrequirements(repo): |
|
928 | def supporteddestrequirements(repo): | |
929 | """Obtain requirements that upgrade supports in the destination. |
|
929 | """Obtain requirements that upgrade supports in the destination. | |
930 |
|
930 | |||
931 | If the result of the upgrade would create requirements not in this set, |
|
931 | If the result of the upgrade would create requirements not in this set, | |
932 | the upgrade is disallowed. |
|
932 | the upgrade is disallowed. | |
933 |
|
933 | |||
934 | Extensions should monkeypatch this to add their custom requirements. |
|
934 | Extensions should monkeypatch this to add their custom requirements. | |
935 | """ |
|
935 | """ | |
936 | supported = { |
|
936 | supported = { | |
937 | b'dotencode', |
|
937 | requirements.DOTENCODE_REQUIREMENT, | |
938 | b'fncache', |
|
938 | b'fncache', | |
939 | requirements.GENERALDELTA_REQUIREMENT, |
|
939 | requirements.GENERALDELTA_REQUIREMENT, | |
940 | requirements.REVLOGV1_REQUIREMENT, |
|
940 | requirements.REVLOGV1_REQUIREMENT, | |
941 | b'store', |
|
941 | b'store', | |
942 | requirements.SPARSEREVLOG_REQUIREMENT, |
|
942 | requirements.SPARSEREVLOG_REQUIREMENT, | |
943 | requirements.SIDEDATA_REQUIREMENT, |
|
943 | requirements.SIDEDATA_REQUIREMENT, | |
944 | requirements.COPIESSDC_REQUIREMENT, |
|
944 | requirements.COPIESSDC_REQUIREMENT, | |
945 | requirements.NODEMAP_REQUIREMENT, |
|
945 | requirements.NODEMAP_REQUIREMENT, | |
946 | requirements.SHARESAFE_REQUIREMENT, |
|
946 | requirements.SHARESAFE_REQUIREMENT, | |
947 | } |
|
947 | } | |
948 | for name in compression.compengines: |
|
948 | for name in compression.compengines: | |
949 | engine = compression.compengines[name] |
|
949 | engine = compression.compengines[name] | |
950 | if engine.available() and engine.revlogheader(): |
|
950 | if engine.available() and engine.revlogheader(): | |
951 | supported.add(b'exp-compression-%s' % name) |
|
951 | supported.add(b'exp-compression-%s' % name) | |
952 | if engine.name() == b'zstd': |
|
952 | if engine.name() == b'zstd': | |
953 | supported.add(b'revlog-compression-zstd') |
|
953 | supported.add(b'revlog-compression-zstd') | |
954 | return supported |
|
954 | return supported | |
955 |
|
955 | |||
956 |
|
956 | |||
957 | def allowednewrequirements(repo): |
|
957 | def allowednewrequirements(repo): | |
958 | """Obtain requirements that can be added to a repository during upgrade. |
|
958 | """Obtain requirements that can be added to a repository during upgrade. | |
959 |
|
959 | |||
960 | This is used to disallow proposed requirements from being added when |
|
960 | This is used to disallow proposed requirements from being added when | |
961 | they weren't present before. |
|
961 | they weren't present before. | |
962 |
|
962 | |||
963 | We use a list of allowed requirement additions instead of a list of known |
|
963 | We use a list of allowed requirement additions instead of a list of known | |
964 | bad additions because the whitelist approach is safer and will prevent |
|
964 | bad additions because the whitelist approach is safer and will prevent | |
965 | future, unknown requirements from accidentally being added. |
|
965 | future, unknown requirements from accidentally being added. | |
966 | """ |
|
966 | """ | |
967 | supported = { |
|
967 | supported = { | |
968 | b'dotencode', |
|
968 | requirements.DOTENCODE_REQUIREMENT, | |
969 | b'fncache', |
|
969 | b'fncache', | |
970 | requirements.GENERALDELTA_REQUIREMENT, |
|
970 | requirements.GENERALDELTA_REQUIREMENT, | |
971 | requirements.SPARSEREVLOG_REQUIREMENT, |
|
971 | requirements.SPARSEREVLOG_REQUIREMENT, | |
972 | requirements.SIDEDATA_REQUIREMENT, |
|
972 | requirements.SIDEDATA_REQUIREMENT, | |
973 | requirements.COPIESSDC_REQUIREMENT, |
|
973 | requirements.COPIESSDC_REQUIREMENT, | |
974 | requirements.NODEMAP_REQUIREMENT, |
|
974 | requirements.NODEMAP_REQUIREMENT, | |
975 | requirements.SHARESAFE_REQUIREMENT, |
|
975 | requirements.SHARESAFE_REQUIREMENT, | |
976 | } |
|
976 | } | |
977 | for name in compression.compengines: |
|
977 | for name in compression.compengines: | |
978 | engine = compression.compengines[name] |
|
978 | engine = compression.compengines[name] | |
979 | if engine.available() and engine.revlogheader(): |
|
979 | if engine.available() and engine.revlogheader(): | |
980 | supported.add(b'exp-compression-%s' % name) |
|
980 | supported.add(b'exp-compression-%s' % name) | |
981 | if engine.name() == b'zstd': |
|
981 | if engine.name() == b'zstd': | |
982 | supported.add(b'revlog-compression-zstd') |
|
982 | supported.add(b'revlog-compression-zstd') | |
983 | return supported |
|
983 | return supported | |
984 |
|
984 | |||
985 |
|
985 | |||
986 | def check_requirements_changes(repo, new_reqs): |
|
986 | def check_requirements_changes(repo, new_reqs): | |
987 | old_reqs = repo.requirements |
|
987 | old_reqs = repo.requirements | |
988 |
|
988 | |||
989 | support_removal = supportremovedrequirements(repo) |
|
989 | support_removal = supportremovedrequirements(repo) | |
990 | no_remove_reqs = old_reqs - new_reqs - support_removal |
|
990 | no_remove_reqs = old_reqs - new_reqs - support_removal | |
991 | if no_remove_reqs: |
|
991 | if no_remove_reqs: | |
992 | msg = _(b'cannot upgrade repository; requirement would be removed: %s') |
|
992 | msg = _(b'cannot upgrade repository; requirement would be removed: %s') | |
993 | no_remove_reqs = b', '.join(sorted(no_remove_reqs)) |
|
993 | no_remove_reqs = b', '.join(sorted(no_remove_reqs)) | |
994 | raise error.Abort(msg % no_remove_reqs) |
|
994 | raise error.Abort(msg % no_remove_reqs) | |
995 |
|
995 | |||
996 | support_addition = allowednewrequirements(repo) |
|
996 | support_addition = allowednewrequirements(repo) | |
997 | no_add_reqs = new_reqs - old_reqs - support_addition |
|
997 | no_add_reqs = new_reqs - old_reqs - support_addition | |
998 | if no_add_reqs: |
|
998 | if no_add_reqs: | |
999 | m = _(b'cannot upgrade repository; do not support adding requirement: ') |
|
999 | m = _(b'cannot upgrade repository; do not support adding requirement: ') | |
1000 | no_add_reqs = b', '.join(sorted(no_add_reqs)) |
|
1000 | no_add_reqs = b', '.join(sorted(no_add_reqs)) | |
1001 | raise error.Abort(m + no_add_reqs) |
|
1001 | raise error.Abort(m + no_add_reqs) | |
1002 |
|
1002 | |||
1003 | supported = supporteddestrequirements(repo) |
|
1003 | supported = supporteddestrequirements(repo) | |
1004 | unsupported_reqs = new_reqs - supported |
|
1004 | unsupported_reqs = new_reqs - supported | |
1005 | if unsupported_reqs: |
|
1005 | if unsupported_reqs: | |
1006 | msg = _( |
|
1006 | msg = _( | |
1007 | b'cannot upgrade repository; do not support destination ' |
|
1007 | b'cannot upgrade repository; do not support destination ' | |
1008 | b'requirement: %s' |
|
1008 | b'requirement: %s' | |
1009 | ) |
|
1009 | ) | |
1010 | unsupported_reqs = b', '.join(sorted(unsupported_reqs)) |
|
1010 | unsupported_reqs = b', '.join(sorted(unsupported_reqs)) | |
1011 | raise error.Abort(msg % unsupported_reqs) |
|
1011 | raise error.Abort(msg % unsupported_reqs) |
General Comments 0
You need to be logged in to leave comments.
Login now