Show More
@@ -1,2176 +1,2177 b'' | |||
|
1 | 1 | # localrepo.py - read/write repository class for mercurial |
|
2 | 2 | # |
|
3 | 3 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> |
|
4 | 4 | # |
|
5 | 5 | # This software may be used and distributed according to the terms of the |
|
6 | 6 | # GNU General Public License version 2 or any later version. |
|
7 | 7 | from node import hex, nullid, short |
|
8 | 8 | from i18n import _ |
|
9 | 9 | import peer, changegroup, subrepo, discovery, pushkey, obsolete, repoview |
|
10 | 10 | import changelog, dirstate, filelog, manifest, context, bookmarks, phases |
|
11 | 11 | import lock as lockmod |
|
12 | 12 | import transaction, store, encoding, exchange |
|
13 | 13 | import scmutil, util, extensions, hook, error, revset |
|
14 | 14 | import match as matchmod |
|
15 | 15 | import merge as mergemod |
|
16 | 16 | import tags as tagsmod |
|
17 | 17 | from lock import release |
|
18 | 18 | import weakref, errno, os, time, inspect |
|
19 | 19 | import branchmap, pathutil |
|
20 | 20 | propertycache = util.propertycache |
|
21 | 21 | filecache = scmutil.filecache |
|
22 | 22 | |
|
23 | 23 | class repofilecache(filecache): |
|
24 | 24 | """All filecache usage on repo are done for logic that should be unfiltered |
|
25 | 25 | """ |
|
26 | 26 | |
|
27 | 27 | def __get__(self, repo, type=None): |
|
28 | 28 | return super(repofilecache, self).__get__(repo.unfiltered(), type) |
|
29 | 29 | def __set__(self, repo, value): |
|
30 | 30 | return super(repofilecache, self).__set__(repo.unfiltered(), value) |
|
31 | 31 | def __delete__(self, repo): |
|
32 | 32 | return super(repofilecache, self).__delete__(repo.unfiltered()) |
|
33 | 33 | |
|
34 | 34 | class storecache(repofilecache): |
|
35 | 35 | """filecache for files in the store""" |
|
36 | 36 | def join(self, obj, fname): |
|
37 | 37 | return obj.sjoin(fname) |
|
38 | 38 | |
|
39 | 39 | class unfilteredpropertycache(propertycache): |
|
40 | 40 | """propertycache that apply to unfiltered repo only""" |
|
41 | 41 | |
|
42 | 42 | def __get__(self, repo, type=None): |
|
43 | 43 | unfi = repo.unfiltered() |
|
44 | 44 | if unfi is repo: |
|
45 | 45 | return super(unfilteredpropertycache, self).__get__(unfi) |
|
46 | 46 | return getattr(unfi, self.name) |
|
47 | 47 | |
|
48 | 48 | class filteredpropertycache(propertycache): |
|
49 | 49 | """propertycache that must take filtering in account""" |
|
50 | 50 | |
|
51 | 51 | def cachevalue(self, obj, value): |
|
52 | 52 | object.__setattr__(obj, self.name, value) |
|
53 | 53 | |
|
54 | 54 | |
|
55 | 55 | def hasunfilteredcache(repo, name): |
|
56 | 56 | """check if a repo has an unfilteredpropertycache value for <name>""" |
|
57 | 57 | return name in vars(repo.unfiltered()) |
|
58 | 58 | |
|
59 | 59 | def unfilteredmethod(orig): |
|
60 | 60 | """decorate method that always need to be run on unfiltered version""" |
|
61 | 61 | def wrapper(repo, *args, **kwargs): |
|
62 | 62 | return orig(repo.unfiltered(), *args, **kwargs) |
|
63 | 63 | return wrapper |
|
64 | 64 | |
|
65 | 65 | moderncaps = set(('lookup', 'branchmap', 'pushkey', 'known', 'getbundle')) |
|
66 | 66 | legacycaps = moderncaps.union(set(['changegroupsubset'])) |
|
67 | 67 | |
|
68 | 68 | class localpeer(peer.peerrepository): |
|
69 | 69 | '''peer for a local repo; reflects only the most recent API''' |
|
70 | 70 | |
|
71 | 71 | def __init__(self, repo, caps=moderncaps): |
|
72 | 72 | peer.peerrepository.__init__(self) |
|
73 | 73 | self._repo = repo.filtered('served') |
|
74 | 74 | self.ui = repo.ui |
|
75 | 75 | self._caps = repo._restrictcapabilities(caps) |
|
76 | 76 | self.requirements = repo.requirements |
|
77 | 77 | self.supportedformats = repo.supportedformats |
|
78 | 78 | |
|
79 | 79 | def close(self): |
|
80 | 80 | self._repo.close() |
|
81 | 81 | |
|
82 | 82 | def _capabilities(self): |
|
83 | 83 | return self._caps |
|
84 | 84 | |
|
85 | 85 | def local(self): |
|
86 | 86 | return self._repo |
|
87 | 87 | |
|
88 | 88 | def canpush(self): |
|
89 | 89 | return True |
|
90 | 90 | |
|
91 | 91 | def url(self): |
|
92 | 92 | return self._repo.url() |
|
93 | 93 | |
|
94 | 94 | def lookup(self, key): |
|
95 | 95 | return self._repo.lookup(key) |
|
96 | 96 | |
|
97 | 97 | def branchmap(self): |
|
98 | 98 | return self._repo.branchmap() |
|
99 | 99 | |
|
100 | 100 | def heads(self): |
|
101 | 101 | return self._repo.heads() |
|
102 | 102 | |
|
103 | 103 | def known(self, nodes): |
|
104 | 104 | return self._repo.known(nodes) |
|
105 | 105 | |
|
106 | 106 | def getbundle(self, source, heads=None, common=None, bundlecaps=None): |
|
107 | 107 | return self._repo.getbundle(source, heads=heads, common=common, |
|
108 | 108 | bundlecaps=None) |
|
109 | 109 | |
|
110 | 110 | # TODO We might want to move the next two calls into legacypeer and add |
|
111 | 111 | # unbundle instead. |
|
112 | 112 | |
|
113 | 113 | def lock(self): |
|
114 | 114 | return self._repo.lock() |
|
115 | 115 | |
|
116 | 116 | def addchangegroup(self, cg, source, url): |
|
117 | 117 | return self._repo.addchangegroup(cg, source, url) |
|
118 | 118 | |
|
119 | 119 | def pushkey(self, namespace, key, old, new): |
|
120 | 120 | return self._repo.pushkey(namespace, key, old, new) |
|
121 | 121 | |
|
122 | 122 | def listkeys(self, namespace): |
|
123 | 123 | return self._repo.listkeys(namespace) |
|
124 | 124 | |
|
125 | 125 | def debugwireargs(self, one, two, three=None, four=None, five=None): |
|
126 | 126 | '''used to test argument passing over the wire''' |
|
127 | 127 | return "%s %s %s %s %s" % (one, two, three, four, five) |
|
128 | 128 | |
|
129 | 129 | class locallegacypeer(localpeer): |
|
130 | 130 | '''peer extension which implements legacy methods too; used for tests with |
|
131 | 131 | restricted capabilities''' |
|
132 | 132 | |
|
133 | 133 | def __init__(self, repo): |
|
134 | 134 | localpeer.__init__(self, repo, caps=legacycaps) |
|
135 | 135 | |
|
136 | 136 | def branches(self, nodes): |
|
137 | 137 | return self._repo.branches(nodes) |
|
138 | 138 | |
|
139 | 139 | def between(self, pairs): |
|
140 | 140 | return self._repo.between(pairs) |
|
141 | 141 | |
|
142 | 142 | def changegroup(self, basenodes, source): |
|
143 | 143 | return self._repo.changegroup(basenodes, source) |
|
144 | 144 | |
|
145 | 145 | def changegroupsubset(self, bases, heads, source): |
|
146 | 146 | return self._repo.changegroupsubset(bases, heads, source) |
|
147 | 147 | |
|
148 | 148 | class localrepository(object): |
|
149 | 149 | |
|
150 | 150 | supportedformats = set(('revlogv1', 'generaldelta')) |
|
151 | 151 | _basesupported = supportedformats | set(('store', 'fncache', 'shared', |
|
152 | 152 | 'dotencode')) |
|
153 | 153 | openerreqs = set(('revlogv1', 'generaldelta')) |
|
154 | 154 | requirements = ['revlogv1'] |
|
155 | 155 | filtername = None |
|
156 | 156 | |
|
157 | 157 | # a list of (ui, featureset) functions. |
|
158 | 158 | # only functions defined in module of enabled extensions are invoked |
|
159 | 159 | featuresetupfuncs = set() |
|
160 | 160 | |
|
161 | 161 | def _baserequirements(self, create): |
|
162 | 162 | return self.requirements[:] |
|
163 | 163 | |
|
164 | 164 | def __init__(self, baseui, path=None, create=False): |
|
165 | 165 | self.wvfs = scmutil.vfs(path, expandpath=True, realpath=True) |
|
166 | 166 | self.wopener = self.wvfs |
|
167 | 167 | self.root = self.wvfs.base |
|
168 | 168 | self.path = self.wvfs.join(".hg") |
|
169 | 169 | self.origroot = path |
|
170 | 170 | self.auditor = pathutil.pathauditor(self.root, self._checknested) |
|
171 | 171 | self.vfs = scmutil.vfs(self.path) |
|
172 | 172 | self.opener = self.vfs |
|
173 | 173 | self.baseui = baseui |
|
174 | 174 | self.ui = baseui.copy() |
|
175 | 175 | self.ui.copy = baseui.copy # prevent copying repo configuration |
|
176 | 176 | # A list of callback to shape the phase if no data were found. |
|
177 | 177 | # Callback are in the form: func(repo, roots) --> processed root. |
|
178 | 178 | # This list it to be filled by extension during repo setup |
|
179 | 179 | self._phasedefaults = [] |
|
180 | 180 | try: |
|
181 | 181 | self.ui.readconfig(self.join("hgrc"), self.root) |
|
182 | 182 | extensions.loadall(self.ui) |
|
183 | 183 | except IOError: |
|
184 | 184 | pass |
|
185 | 185 | |
|
186 | 186 | if self.featuresetupfuncs: |
|
187 | 187 | self.supported = set(self._basesupported) # use private copy |
|
188 | 188 | extmods = set(m.__name__ for n, m |
|
189 | 189 | in extensions.extensions(self.ui)) |
|
190 | 190 | for setupfunc in self.featuresetupfuncs: |
|
191 | 191 | if setupfunc.__module__ in extmods: |
|
192 | 192 | setupfunc(self.ui, self.supported) |
|
193 | 193 | else: |
|
194 | 194 | self.supported = self._basesupported |
|
195 | 195 | |
|
196 | 196 | if not self.vfs.isdir(): |
|
197 | 197 | if create: |
|
198 | 198 | if not self.wvfs.exists(): |
|
199 | 199 | self.wvfs.makedirs() |
|
200 | 200 | self.vfs.makedir(notindexed=True) |
|
201 | 201 | requirements = self._baserequirements(create) |
|
202 | 202 | if self.ui.configbool('format', 'usestore', True): |
|
203 | 203 | self.vfs.mkdir("store") |
|
204 | 204 | requirements.append("store") |
|
205 | 205 | if self.ui.configbool('format', 'usefncache', True): |
|
206 | 206 | requirements.append("fncache") |
|
207 | 207 | if self.ui.configbool('format', 'dotencode', True): |
|
208 | 208 | requirements.append('dotencode') |
|
209 | 209 | # create an invalid changelog |
|
210 | 210 | self.vfs.append( |
|
211 | 211 | "00changelog.i", |
|
212 | 212 | '\0\0\0\2' # represents revlogv2 |
|
213 | 213 | ' dummy changelog to prevent using the old repo layout' |
|
214 | 214 | ) |
|
215 | 215 | if self.ui.configbool('format', 'generaldelta', False): |
|
216 | 216 | requirements.append("generaldelta") |
|
217 | 217 | requirements = set(requirements) |
|
218 | 218 | else: |
|
219 | 219 | raise error.RepoError(_("repository %s not found") % path) |
|
220 | 220 | elif create: |
|
221 | 221 | raise error.RepoError(_("repository %s already exists") % path) |
|
222 | 222 | else: |
|
223 | 223 | try: |
|
224 | 224 | requirements = scmutil.readrequires(self.vfs, self.supported) |
|
225 | 225 | except IOError, inst: |
|
226 | 226 | if inst.errno != errno.ENOENT: |
|
227 | 227 | raise |
|
228 | 228 | requirements = set() |
|
229 | 229 | |
|
230 | 230 | self.sharedpath = self.path |
|
231 | 231 | try: |
|
232 | 232 | vfs = scmutil.vfs(self.vfs.read("sharedpath").rstrip('\n'), |
|
233 | 233 | realpath=True) |
|
234 | 234 | s = vfs.base |
|
235 | 235 | if not vfs.exists(): |
|
236 | 236 | raise error.RepoError( |
|
237 | 237 | _('.hg/sharedpath points to nonexistent directory %s') % s) |
|
238 | 238 | self.sharedpath = s |
|
239 | 239 | except IOError, inst: |
|
240 | 240 | if inst.errno != errno.ENOENT: |
|
241 | 241 | raise |
|
242 | 242 | |
|
243 | 243 | self.store = store.store(requirements, self.sharedpath, scmutil.vfs) |
|
244 | 244 | self.spath = self.store.path |
|
245 | 245 | self.svfs = self.store.vfs |
|
246 | 246 | self.sopener = self.svfs |
|
247 | 247 | self.sjoin = self.store.join |
|
248 | 248 | self.vfs.createmode = self.store.createmode |
|
249 | 249 | self._applyrequirements(requirements) |
|
250 | 250 | if create: |
|
251 | 251 | self._writerequirements() |
|
252 | 252 | |
|
253 | 253 | |
|
254 | 254 | self._branchcaches = {} |
|
255 | 255 | self.filterpats = {} |
|
256 | 256 | self._datafilters = {} |
|
257 | 257 | self._transref = self._lockref = self._wlockref = None |
|
258 | 258 | |
|
259 | 259 | # A cache for various files under .hg/ that tracks file changes, |
|
260 | 260 | # (used by the filecache decorator) |
|
261 | 261 | # |
|
262 | 262 | # Maps a property name to its util.filecacheentry |
|
263 | 263 | self._filecache = {} |
|
264 | 264 | |
|
265 | 265 | # hold sets of revision to be filtered |
|
266 | 266 | # should be cleared when something might have changed the filter value: |
|
267 | 267 | # - new changesets, |
|
268 | 268 | # - phase change, |
|
269 | 269 | # - new obsolescence marker, |
|
270 | 270 | # - working directory parent change, |
|
271 | 271 | # - bookmark changes |
|
272 | 272 | self.filteredrevcache = {} |
|
273 | 273 | |
|
274 | 274 | def close(self): |
|
275 | 275 | pass |
|
276 | 276 | |
|
277 | 277 | def _restrictcapabilities(self, caps): |
|
278 | 278 | return caps |
|
279 | 279 | |
|
280 | 280 | def _applyrequirements(self, requirements): |
|
281 | 281 | self.requirements = requirements |
|
282 | 282 | self.sopener.options = dict((r, 1) for r in requirements |
|
283 | 283 | if r in self.openerreqs) |
|
284 | 284 | chunkcachesize = self.ui.configint('format', 'chunkcachesize') |
|
285 | 285 | if chunkcachesize is not None: |
|
286 | 286 | self.sopener.options['chunkcachesize'] = chunkcachesize |
|
287 | 287 | |
|
288 | 288 | def _writerequirements(self): |
|
289 | 289 | reqfile = self.opener("requires", "w") |
|
290 | 290 | for r in sorted(self.requirements): |
|
291 | 291 | reqfile.write("%s\n" % r) |
|
292 | 292 | reqfile.close() |
|
293 | 293 | |
|
294 | 294 | def _checknested(self, path): |
|
295 | 295 | """Determine if path is a legal nested repository.""" |
|
296 | 296 | if not path.startswith(self.root): |
|
297 | 297 | return False |
|
298 | 298 | subpath = path[len(self.root) + 1:] |
|
299 | 299 | normsubpath = util.pconvert(subpath) |
|
300 | 300 | |
|
301 | 301 | # XXX: Checking against the current working copy is wrong in |
|
302 | 302 | # the sense that it can reject things like |
|
303 | 303 | # |
|
304 | 304 | # $ hg cat -r 10 sub/x.txt |
|
305 | 305 | # |
|
306 | 306 | # if sub/ is no longer a subrepository in the working copy |
|
307 | 307 | # parent revision. |
|
308 | 308 | # |
|
309 | 309 | # However, it can of course also allow things that would have |
|
310 | 310 | # been rejected before, such as the above cat command if sub/ |
|
311 | 311 | # is a subrepository now, but was a normal directory before. |
|
312 | 312 | # The old path auditor would have rejected by mistake since it |
|
313 | 313 | # panics when it sees sub/.hg/. |
|
314 | 314 | # |
|
315 | 315 | # All in all, checking against the working copy seems sensible |
|
316 | 316 | # since we want to prevent access to nested repositories on |
|
317 | 317 | # the filesystem *now*. |
|
318 | 318 | ctx = self[None] |
|
319 | 319 | parts = util.splitpath(subpath) |
|
320 | 320 | while parts: |
|
321 | 321 | prefix = '/'.join(parts) |
|
322 | 322 | if prefix in ctx.substate: |
|
323 | 323 | if prefix == normsubpath: |
|
324 | 324 | return True |
|
325 | 325 | else: |
|
326 | 326 | sub = ctx.sub(prefix) |
|
327 | 327 | return sub.checknested(subpath[len(prefix) + 1:]) |
|
328 | 328 | else: |
|
329 | 329 | parts.pop() |
|
330 | 330 | return False |
|
331 | 331 | |
|
332 | 332 | def peer(self): |
|
333 | 333 | return localpeer(self) # not cached to avoid reference cycle |
|
334 | 334 | |
|
335 | 335 | def unfiltered(self): |
|
336 | 336 | """Return unfiltered version of the repository |
|
337 | 337 | |
|
338 | 338 | Intended to be overwritten by filtered repo.""" |
|
339 | 339 | return self |
|
340 | 340 | |
|
341 | 341 | def filtered(self, name): |
|
342 | 342 | """Return a filtered version of a repository""" |
|
343 | 343 | # build a new class with the mixin and the current class |
|
344 | 344 | # (possibly subclass of the repo) |
|
345 | 345 | class proxycls(repoview.repoview, self.unfiltered().__class__): |
|
346 | 346 | pass |
|
347 | 347 | return proxycls(self, name) |
|
348 | 348 | |
|
349 | 349 | @repofilecache('bookmarks') |
|
350 | 350 | def _bookmarks(self): |
|
351 | 351 | return bookmarks.bmstore(self) |
|
352 | 352 | |
|
353 | 353 | @repofilecache('bookmarks.current') |
|
354 | 354 | def _bookmarkcurrent(self): |
|
355 | 355 | return bookmarks.readcurrent(self) |
|
356 | 356 | |
|
357 | 357 | def bookmarkheads(self, bookmark): |
|
358 | 358 | name = bookmark.split('@', 1)[0] |
|
359 | 359 | heads = [] |
|
360 | 360 | for mark, n in self._bookmarks.iteritems(): |
|
361 | 361 | if mark.split('@', 1)[0] == name: |
|
362 | 362 | heads.append(n) |
|
363 | 363 | return heads |
|
364 | 364 | |
|
365 | 365 | @storecache('phaseroots') |
|
366 | 366 | def _phasecache(self): |
|
367 | 367 | return phases.phasecache(self, self._phasedefaults) |
|
368 | 368 | |
|
369 | 369 | @storecache('obsstore') |
|
370 | 370 | def obsstore(self): |
|
371 | 371 | store = obsolete.obsstore(self.sopener) |
|
372 | 372 | if store and not obsolete._enabled: |
|
373 | 373 | # message is rare enough to not be translated |
|
374 | 374 | msg = 'obsolete feature not enabled but %i markers found!\n' |
|
375 | 375 | self.ui.warn(msg % len(list(store))) |
|
376 | 376 | return store |
|
377 | 377 | |
|
378 | 378 | @storecache('00changelog.i') |
|
379 | 379 | def changelog(self): |
|
380 | 380 | c = changelog.changelog(self.sopener) |
|
381 | 381 | if 'HG_PENDING' in os.environ: |
|
382 | 382 | p = os.environ['HG_PENDING'] |
|
383 | 383 | if p.startswith(self.root): |
|
384 | 384 | c.readpending('00changelog.i.a') |
|
385 | 385 | return c |
|
386 | 386 | |
|
387 | 387 | @storecache('00manifest.i') |
|
388 | 388 | def manifest(self): |
|
389 | 389 | return manifest.manifest(self.sopener) |
|
390 | 390 | |
|
391 | 391 | @repofilecache('dirstate') |
|
392 | 392 | def dirstate(self): |
|
393 | 393 | warned = [0] |
|
394 | 394 | def validate(node): |
|
395 | 395 | try: |
|
396 | 396 | self.changelog.rev(node) |
|
397 | 397 | return node |
|
398 | 398 | except error.LookupError: |
|
399 | 399 | if not warned[0]: |
|
400 | 400 | warned[0] = True |
|
401 | 401 | self.ui.warn(_("warning: ignoring unknown" |
|
402 | 402 | " working parent %s!\n") % short(node)) |
|
403 | 403 | return nullid |
|
404 | 404 | |
|
405 | 405 | return dirstate.dirstate(self.opener, self.ui, self.root, validate) |
|
406 | 406 | |
|
407 | 407 | def __getitem__(self, changeid): |
|
408 | 408 | if changeid is None: |
|
409 | 409 | return context.workingctx(self) |
|
410 | 410 | return context.changectx(self, changeid) |
|
411 | 411 | |
|
412 | 412 | def __contains__(self, changeid): |
|
413 | 413 | try: |
|
414 | 414 | return bool(self.lookup(changeid)) |
|
415 | 415 | except error.RepoLookupError: |
|
416 | 416 | return False |
|
417 | 417 | |
|
418 | 418 | def __nonzero__(self): |
|
419 | 419 | return True |
|
420 | 420 | |
|
421 | 421 | def __len__(self): |
|
422 | 422 | return len(self.changelog) |
|
423 | 423 | |
|
424 | 424 | def __iter__(self): |
|
425 | 425 | return iter(self.changelog) |
|
426 | 426 | |
|
427 | 427 | def revs(self, expr, *args): |
|
428 | 428 | '''Return a list of revisions matching the given revset''' |
|
429 | 429 | expr = revset.formatspec(expr, *args) |
|
430 | 430 | m = revset.match(None, expr) |
|
431 | 431 | return m(self, revset.spanset(self)) |
|
432 | 432 | |
|
433 | 433 | def set(self, expr, *args): |
|
434 | 434 | ''' |
|
435 | 435 | Yield a context for each matching revision, after doing arg |
|
436 | 436 | replacement via revset.formatspec |
|
437 | 437 | ''' |
|
438 | 438 | for r in self.revs(expr, *args): |
|
439 | 439 | yield self[r] |
|
440 | 440 | |
|
441 | 441 | def url(self): |
|
442 | 442 | return 'file:' + self.root |
|
443 | 443 | |
|
444 | 444 | def hook(self, name, throw=False, **args): |
|
445 | 445 | return hook.hook(self.ui, self, name, throw, **args) |
|
446 | 446 | |
|
447 | 447 | @unfilteredmethod |
|
448 | 448 | def _tag(self, names, node, message, local, user, date, extra={}): |
|
449 | 449 | if isinstance(names, str): |
|
450 | 450 | names = (names,) |
|
451 | 451 | |
|
452 | 452 | branches = self.branchmap() |
|
453 | 453 | for name in names: |
|
454 | 454 | self.hook('pretag', throw=True, node=hex(node), tag=name, |
|
455 | 455 | local=local) |
|
456 | 456 | if name in branches: |
|
457 | 457 | self.ui.warn(_("warning: tag %s conflicts with existing" |
|
458 | 458 | " branch name\n") % name) |
|
459 | 459 | |
|
460 | 460 | def writetags(fp, names, munge, prevtags): |
|
461 | 461 | fp.seek(0, 2) |
|
462 | 462 | if prevtags and prevtags[-1] != '\n': |
|
463 | 463 | fp.write('\n') |
|
464 | 464 | for name in names: |
|
465 | 465 | m = munge and munge(name) or name |
|
466 | 466 | if (self._tagscache.tagtypes and |
|
467 | 467 | name in self._tagscache.tagtypes): |
|
468 | 468 | old = self.tags().get(name, nullid) |
|
469 | 469 | fp.write('%s %s\n' % (hex(old), m)) |
|
470 | 470 | fp.write('%s %s\n' % (hex(node), m)) |
|
471 | 471 | fp.close() |
|
472 | 472 | |
|
473 | 473 | prevtags = '' |
|
474 | 474 | if local: |
|
475 | 475 | try: |
|
476 | 476 | fp = self.opener('localtags', 'r+') |
|
477 | 477 | except IOError: |
|
478 | 478 | fp = self.opener('localtags', 'a') |
|
479 | 479 | else: |
|
480 | 480 | prevtags = fp.read() |
|
481 | 481 | |
|
482 | 482 | # local tags are stored in the current charset |
|
483 | 483 | writetags(fp, names, None, prevtags) |
|
484 | 484 | for name in names: |
|
485 | 485 | self.hook('tag', node=hex(node), tag=name, local=local) |
|
486 | 486 | return |
|
487 | 487 | |
|
488 | 488 | try: |
|
489 | 489 | fp = self.wfile('.hgtags', 'rb+') |
|
490 | 490 | except IOError, e: |
|
491 | 491 | if e.errno != errno.ENOENT: |
|
492 | 492 | raise |
|
493 | 493 | fp = self.wfile('.hgtags', 'ab') |
|
494 | 494 | else: |
|
495 | 495 | prevtags = fp.read() |
|
496 | 496 | |
|
497 | 497 | # committed tags are stored in UTF-8 |
|
498 | 498 | writetags(fp, names, encoding.fromlocal, prevtags) |
|
499 | 499 | |
|
500 | 500 | fp.close() |
|
501 | 501 | |
|
502 | 502 | self.invalidatecaches() |
|
503 | 503 | |
|
504 | 504 | if '.hgtags' not in self.dirstate: |
|
505 | 505 | self[None].add(['.hgtags']) |
|
506 | 506 | |
|
507 | 507 | m = matchmod.exact(self.root, '', ['.hgtags']) |
|
508 | 508 | tagnode = self.commit(message, user, date, extra=extra, match=m) |
|
509 | 509 | |
|
510 | 510 | for name in names: |
|
511 | 511 | self.hook('tag', node=hex(node), tag=name, local=local) |
|
512 | 512 | |
|
513 | 513 | return tagnode |
|
514 | 514 | |
|
515 | 515 | def tag(self, names, node, message, local, user, date): |
|
516 | 516 | '''tag a revision with one or more symbolic names. |
|
517 | 517 | |
|
518 | 518 | names is a list of strings or, when adding a single tag, names may be a |
|
519 | 519 | string. |
|
520 | 520 | |
|
521 | 521 | if local is True, the tags are stored in a per-repository file. |
|
522 | 522 | otherwise, they are stored in the .hgtags file, and a new |
|
523 | 523 | changeset is committed with the change. |
|
524 | 524 | |
|
525 | 525 | keyword arguments: |
|
526 | 526 | |
|
527 | 527 | local: whether to store tags in non-version-controlled file |
|
528 | 528 | (default False) |
|
529 | 529 | |
|
530 | 530 | message: commit message to use if committing |
|
531 | 531 | |
|
532 | 532 | user: name of user to use if committing |
|
533 | 533 | |
|
534 | 534 | date: date tuple to use if committing''' |
|
535 | 535 | |
|
536 | 536 | if not local: |
|
537 | 537 | for x in self.status()[:5]: |
|
538 | 538 | if '.hgtags' in x: |
|
539 | 539 | raise util.Abort(_('working copy of .hgtags is changed ' |
|
540 | 540 | '(please commit .hgtags manually)')) |
|
541 | 541 | |
|
542 | 542 | self.tags() # instantiate the cache |
|
543 | 543 | self._tag(names, node, message, local, user, date) |
|
544 | 544 | |
|
545 | 545 | @filteredpropertycache |
|
546 | 546 | def _tagscache(self): |
|
547 | 547 | '''Returns a tagscache object that contains various tags related |
|
548 | 548 | caches.''' |
|
549 | 549 | |
|
550 | 550 | # This simplifies its cache management by having one decorated |
|
551 | 551 | # function (this one) and the rest simply fetch things from it. |
|
552 | 552 | class tagscache(object): |
|
553 | 553 | def __init__(self): |
|
554 | 554 | # These two define the set of tags for this repository. tags |
|
555 | 555 | # maps tag name to node; tagtypes maps tag name to 'global' or |
|
556 | 556 | # 'local'. (Global tags are defined by .hgtags across all |
|
557 | 557 | # heads, and local tags are defined in .hg/localtags.) |
|
558 | 558 | # They constitute the in-memory cache of tags. |
|
559 | 559 | self.tags = self.tagtypes = None |
|
560 | 560 | |
|
561 | 561 | self.nodetagscache = self.tagslist = None |
|
562 | 562 | |
|
563 | 563 | cache = tagscache() |
|
564 | 564 | cache.tags, cache.tagtypes = self._findtags() |
|
565 | 565 | |
|
566 | 566 | return cache |
|
567 | 567 | |
|
568 | 568 | def tags(self): |
|
569 | 569 | '''return a mapping of tag to node''' |
|
570 | 570 | t = {} |
|
571 | 571 | if self.changelog.filteredrevs: |
|
572 | 572 | tags, tt = self._findtags() |
|
573 | 573 | else: |
|
574 | 574 | tags = self._tagscache.tags |
|
575 | 575 | for k, v in tags.iteritems(): |
|
576 | 576 | try: |
|
577 | 577 | # ignore tags to unknown nodes |
|
578 | 578 | self.changelog.rev(v) |
|
579 | 579 | t[k] = v |
|
580 | 580 | except (error.LookupError, ValueError): |
|
581 | 581 | pass |
|
582 | 582 | return t |
|
583 | 583 | |
|
584 | 584 | def _findtags(self): |
|
585 | 585 | '''Do the hard work of finding tags. Return a pair of dicts |
|
586 | 586 | (tags, tagtypes) where tags maps tag name to node, and tagtypes |
|
587 | 587 | maps tag name to a string like \'global\' or \'local\'. |
|
588 | 588 | Subclasses or extensions are free to add their own tags, but |
|
589 | 589 | should be aware that the returned dicts will be retained for the |
|
590 | 590 | duration of the localrepo object.''' |
|
591 | 591 | |
|
592 | 592 | # XXX what tagtype should subclasses/extensions use? Currently |
|
593 | 593 | # mq and bookmarks add tags, but do not set the tagtype at all. |
|
594 | 594 | # Should each extension invent its own tag type? Should there |
|
595 | 595 | # be one tagtype for all such "virtual" tags? Or is the status |
|
596 | 596 | # quo fine? |
|
597 | 597 | |
|
598 | 598 | alltags = {} # map tag name to (node, hist) |
|
599 | 599 | tagtypes = {} |
|
600 | 600 | |
|
601 | 601 | tagsmod.findglobaltags(self.ui, self, alltags, tagtypes) |
|
602 | 602 | tagsmod.readlocaltags(self.ui, self, alltags, tagtypes) |
|
603 | 603 | |
|
604 | 604 | # Build the return dicts. Have to re-encode tag names because |
|
605 | 605 | # the tags module always uses UTF-8 (in order not to lose info |
|
606 | 606 | # writing to the cache), but the rest of Mercurial wants them in |
|
607 | 607 | # local encoding. |
|
608 | 608 | tags = {} |
|
609 | 609 | for (name, (node, hist)) in alltags.iteritems(): |
|
610 | 610 | if node != nullid: |
|
611 | 611 | tags[encoding.tolocal(name)] = node |
|
612 | 612 | tags['tip'] = self.changelog.tip() |
|
613 | 613 | tagtypes = dict([(encoding.tolocal(name), value) |
|
614 | 614 | for (name, value) in tagtypes.iteritems()]) |
|
615 | 615 | return (tags, tagtypes) |
|
616 | 616 | |
|
617 | 617 | def tagtype(self, tagname): |
|
618 | 618 | ''' |
|
619 | 619 | return the type of the given tag. result can be: |
|
620 | 620 | |
|
621 | 621 | 'local' : a local tag |
|
622 | 622 | 'global' : a global tag |
|
623 | 623 | None : tag does not exist |
|
624 | 624 | ''' |
|
625 | 625 | |
|
626 | 626 | return self._tagscache.tagtypes.get(tagname) |
|
627 | 627 | |
|
628 | 628 | def tagslist(self): |
|
629 | 629 | '''return a list of tags ordered by revision''' |
|
630 | 630 | if not self._tagscache.tagslist: |
|
631 | 631 | l = [] |
|
632 | 632 | for t, n in self.tags().iteritems(): |
|
633 | 633 | r = self.changelog.rev(n) |
|
634 | 634 | l.append((r, t, n)) |
|
635 | 635 | self._tagscache.tagslist = [(t, n) for r, t, n in sorted(l)] |
|
636 | 636 | |
|
637 | 637 | return self._tagscache.tagslist |
|
638 | 638 | |
|
639 | 639 | def nodetags(self, node): |
|
640 | 640 | '''return the tags associated with a node''' |
|
641 | 641 | if not self._tagscache.nodetagscache: |
|
642 | 642 | nodetagscache = {} |
|
643 | 643 | for t, n in self._tagscache.tags.iteritems(): |
|
644 | 644 | nodetagscache.setdefault(n, []).append(t) |
|
645 | 645 | for tags in nodetagscache.itervalues(): |
|
646 | 646 | tags.sort() |
|
647 | 647 | self._tagscache.nodetagscache = nodetagscache |
|
648 | 648 | return self._tagscache.nodetagscache.get(node, []) |
|
649 | 649 | |
|
650 | 650 | def nodebookmarks(self, node): |
|
651 | 651 | marks = [] |
|
652 | 652 | for bookmark, n in self._bookmarks.iteritems(): |
|
653 | 653 | if n == node: |
|
654 | 654 | marks.append(bookmark) |
|
655 | 655 | return sorted(marks) |
|
656 | 656 | |
|
657 | 657 | def branchmap(self): |
|
658 | 658 | '''returns a dictionary {branch: [branchheads]} with branchheads |
|
659 | 659 | ordered by increasing revision number''' |
|
660 | 660 | branchmap.updatecache(self) |
|
661 | 661 | return self._branchcaches[self.filtername] |
|
662 | 662 | |
|
663 | 663 | def branchtip(self, branch): |
|
664 | 664 | '''return the tip node for a given branch''' |
|
665 | 665 | try: |
|
666 | 666 | return self.branchmap().branchtip(branch) |
|
667 | 667 | except KeyError: |
|
668 | 668 | raise error.RepoLookupError(_("unknown branch '%s'") % branch) |
|
669 | 669 | |
|
670 | 670 | def lookup(self, key): |
|
671 | 671 | return self[key].node() |
|
672 | 672 | |
|
673 | 673 | def lookupbranch(self, key, remote=None): |
|
674 | 674 | repo = remote or self |
|
675 | 675 | if key in repo.branchmap(): |
|
676 | 676 | return key |
|
677 | 677 | |
|
678 | 678 | repo = (remote and remote.local()) and remote or self |
|
679 | 679 | return repo[key].branch() |
|
680 | 680 | |
|
681 | 681 | def known(self, nodes): |
|
682 | 682 | nm = self.changelog.nodemap |
|
683 | 683 | pc = self._phasecache |
|
684 | 684 | result = [] |
|
685 | 685 | for n in nodes: |
|
686 | 686 | r = nm.get(n) |
|
687 | 687 | resp = not (r is None or pc.phase(self, r) >= phases.secret) |
|
688 | 688 | result.append(resp) |
|
689 | 689 | return result |
|
690 | 690 | |
|
691 | 691 | def local(self): |
|
692 | 692 | return self |
|
693 | 693 | |
|
694 | 694 | def cancopy(self): |
|
695 | 695 | # so statichttprepo's override of local() works |
|
696 | 696 | if not self.local(): |
|
697 | 697 | return False |
|
698 | 698 | if not self.ui.configbool('phases', 'publish', True): |
|
699 | 699 | return True |
|
700 | 700 | # if publishing we can't copy if there is filtered content |
|
701 | 701 | return not self.filtered('visible').changelog.filteredrevs |
|
702 | 702 | |
|
703 | 703 | def join(self, f): |
|
704 | 704 | return os.path.join(self.path, f) |
|
705 | 705 | |
|
706 | 706 | def wjoin(self, f): |
|
707 | 707 | return os.path.join(self.root, f) |
|
708 | 708 | |
|
709 | 709 | def file(self, f): |
|
710 | 710 | if f[0] == '/': |
|
711 | 711 | f = f[1:] |
|
712 | 712 | return filelog.filelog(self.sopener, f) |
|
713 | 713 | |
|
714 | 714 | def changectx(self, changeid): |
|
715 | 715 | return self[changeid] |
|
716 | 716 | |
|
717 | 717 | def parents(self, changeid=None): |
|
718 | 718 | '''get list of changectxs for parents of changeid''' |
|
719 | 719 | return self[changeid].parents() |
|
720 | 720 | |
|
721 | 721 | def setparents(self, p1, p2=nullid): |
|
722 | 722 | copies = self.dirstate.setparents(p1, p2) |
|
723 | 723 | pctx = self[p1] |
|
724 | 724 | if copies: |
|
725 | 725 | # Adjust copy records, the dirstate cannot do it, it |
|
726 | 726 | # requires access to parents manifests. Preserve them |
|
727 | 727 | # only for entries added to first parent. |
|
728 | 728 | for f in copies: |
|
729 | 729 | if f not in pctx and copies[f] in pctx: |
|
730 | 730 | self.dirstate.copy(copies[f], f) |
|
731 | 731 | if p2 == nullid: |
|
732 | 732 | for f, s in sorted(self.dirstate.copies().items()): |
|
733 | 733 | if f not in pctx and s not in pctx: |
|
734 | 734 | self.dirstate.copy(None, f) |
|
735 | 735 | |
|
736 | 736 | def filectx(self, path, changeid=None, fileid=None): |
|
737 | 737 | """changeid can be a changeset revision, node, or tag. |
|
738 | 738 | fileid can be a file revision or node.""" |
|
739 | 739 | return context.filectx(self, path, changeid, fileid) |
|
740 | 740 | |
|
741 | 741 | def getcwd(self): |
|
742 | 742 | return self.dirstate.getcwd() |
|
743 | 743 | |
|
744 | 744 | def pathto(self, f, cwd=None): |
|
745 | 745 | return self.dirstate.pathto(f, cwd) |
|
746 | 746 | |
|
747 | 747 | def wfile(self, f, mode='r'): |
|
748 | 748 | return self.wopener(f, mode) |
|
749 | 749 | |
|
750 | 750 | def _link(self, f): |
|
751 | 751 | return self.wvfs.islink(f) |
|
752 | 752 | |
|
753 | 753 | def _loadfilter(self, filter): |
|
754 | 754 | if filter not in self.filterpats: |
|
755 | 755 | l = [] |
|
756 | 756 | for pat, cmd in self.ui.configitems(filter): |
|
757 | 757 | if cmd == '!': |
|
758 | 758 | continue |
|
759 | 759 | mf = matchmod.match(self.root, '', [pat]) |
|
760 | 760 | fn = None |
|
761 | 761 | params = cmd |
|
762 | 762 | for name, filterfn in self._datafilters.iteritems(): |
|
763 | 763 | if cmd.startswith(name): |
|
764 | 764 | fn = filterfn |
|
765 | 765 | params = cmd[len(name):].lstrip() |
|
766 | 766 | break |
|
767 | 767 | if not fn: |
|
768 | 768 | fn = lambda s, c, **kwargs: util.filter(s, c) |
|
769 | 769 | # Wrap old filters not supporting keyword arguments |
|
770 | 770 | if not inspect.getargspec(fn)[2]: |
|
771 | 771 | oldfn = fn |
|
772 | 772 | fn = lambda s, c, **kwargs: oldfn(s, c) |
|
773 | 773 | l.append((mf, fn, params)) |
|
774 | 774 | self.filterpats[filter] = l |
|
775 | 775 | return self.filterpats[filter] |
|
776 | 776 | |
|
777 | 777 | def _filter(self, filterpats, filename, data): |
|
778 | 778 | for mf, fn, cmd in filterpats: |
|
779 | 779 | if mf(filename): |
|
780 | 780 | self.ui.debug("filtering %s through %s\n" % (filename, cmd)) |
|
781 | 781 | data = fn(data, cmd, ui=self.ui, repo=self, filename=filename) |
|
782 | 782 | break |
|
783 | 783 | |
|
784 | 784 | return data |
|
785 | 785 | |
|
786 | 786 | @unfilteredpropertycache |
|
787 | 787 | def _encodefilterpats(self): |
|
788 | 788 | return self._loadfilter('encode') |
|
789 | 789 | |
|
790 | 790 | @unfilteredpropertycache |
|
791 | 791 | def _decodefilterpats(self): |
|
792 | 792 | return self._loadfilter('decode') |
|
793 | 793 | |
|
794 | 794 | def adddatafilter(self, name, filter): |
|
795 | 795 | self._datafilters[name] = filter |
|
796 | 796 | |
|
797 | 797 | def wread(self, filename): |
|
798 | 798 | if self._link(filename): |
|
799 | 799 | data = self.wvfs.readlink(filename) |
|
800 | 800 | else: |
|
801 | 801 | data = self.wopener.read(filename) |
|
802 | 802 | return self._filter(self._encodefilterpats, filename, data) |
|
803 | 803 | |
|
804 | 804 | def wwrite(self, filename, data, flags): |
|
805 | 805 | data = self._filter(self._decodefilterpats, filename, data) |
|
806 | 806 | if 'l' in flags: |
|
807 | 807 | self.wopener.symlink(data, filename) |
|
808 | 808 | else: |
|
809 | 809 | self.wopener.write(filename, data) |
|
810 | 810 | if 'x' in flags: |
|
811 | 811 | self.wvfs.setflags(filename, False, True) |
|
812 | 812 | |
|
813 | 813 | def wwritedata(self, filename, data): |
|
814 | 814 | return self._filter(self._decodefilterpats, filename, data) |
|
815 | 815 | |
|
816 | 816 | def transaction(self, desc, report=None): |
|
817 | 817 | tr = self._transref and self._transref() or None |
|
818 | 818 | if tr and tr.running(): |
|
819 | 819 | return tr.nest() |
|
820 | 820 | |
|
821 | 821 | # abort here if the journal already exists |
|
822 | 822 | if self.svfs.exists("journal"): |
|
823 | 823 | raise error.RepoError( |
|
824 | 824 | _("abandoned transaction found - run hg recover")) |
|
825 | 825 | |
|
826 | 826 | def onclose(): |
|
827 | 827 | self.store.write(tr) |
|
828 | 828 | |
|
829 | 829 | self._writejournal(desc) |
|
830 | 830 | renames = [(vfs, x, undoname(x)) for vfs, x in self._journalfiles()] |
|
831 | 831 | rp = report and report or self.ui.warn |
|
832 | 832 | tr = transaction.transaction(rp, self.sopener, |
|
833 | 833 | "journal", |
|
834 | 834 | aftertrans(renames), |
|
835 | 835 | self.store.createmode, |
|
836 | 836 | onclose) |
|
837 | 837 | self._transref = weakref.ref(tr) |
|
838 | 838 | return tr |
|
839 | 839 | |
|
840 | 840 | def _journalfiles(self): |
|
841 | 841 | return ((self.svfs, 'journal'), |
|
842 | 842 | (self.vfs, 'journal.dirstate'), |
|
843 | 843 | (self.vfs, 'journal.branch'), |
|
844 | 844 | (self.vfs, 'journal.desc'), |
|
845 | 845 | (self.vfs, 'journal.bookmarks'), |
|
846 | 846 | (self.svfs, 'journal.phaseroots')) |
|
847 | 847 | |
|
848 | 848 | def undofiles(self): |
|
849 | 849 | return [vfs.join(undoname(x)) for vfs, x in self._journalfiles()] |
|
850 | 850 | |
|
851 | 851 | def _writejournal(self, desc): |
|
852 | 852 | self.opener.write("journal.dirstate", |
|
853 | 853 | self.opener.tryread("dirstate")) |
|
854 | 854 | self.opener.write("journal.branch", |
|
855 | 855 | encoding.fromlocal(self.dirstate.branch())) |
|
856 | 856 | self.opener.write("journal.desc", |
|
857 | 857 | "%d\n%s\n" % (len(self), desc)) |
|
858 | 858 | self.opener.write("journal.bookmarks", |
|
859 | 859 | self.opener.tryread("bookmarks")) |
|
860 | 860 | self.sopener.write("journal.phaseroots", |
|
861 | 861 | self.sopener.tryread("phaseroots")) |
|
862 | 862 | |
|
863 | 863 | def recover(self): |
|
864 | 864 | lock = self.lock() |
|
865 | 865 | try: |
|
866 | 866 | if self.svfs.exists("journal"): |
|
867 | 867 | self.ui.status(_("rolling back interrupted transaction\n")) |
|
868 | 868 | transaction.rollback(self.sopener, "journal", |
|
869 | 869 | self.ui.warn) |
|
870 | 870 | self.invalidate() |
|
871 | 871 | return True |
|
872 | 872 | else: |
|
873 | 873 | self.ui.warn(_("no interrupted transaction available\n")) |
|
874 | 874 | return False |
|
875 | 875 | finally: |
|
876 | 876 | lock.release() |
|
877 | 877 | |
|
878 | 878 | def rollback(self, dryrun=False, force=False): |
|
879 | 879 | wlock = lock = None |
|
880 | 880 | try: |
|
881 | 881 | wlock = self.wlock() |
|
882 | 882 | lock = self.lock() |
|
883 | 883 | if self.svfs.exists("undo"): |
|
884 | 884 | return self._rollback(dryrun, force) |
|
885 | 885 | else: |
|
886 | 886 | self.ui.warn(_("no rollback information available\n")) |
|
887 | 887 | return 1 |
|
888 | 888 | finally: |
|
889 | 889 | release(lock, wlock) |
|
890 | 890 | |
|
891 | 891 | @unfilteredmethod # Until we get smarter cache management |
|
892 | 892 | def _rollback(self, dryrun, force): |
|
893 | 893 | ui = self.ui |
|
894 | 894 | try: |
|
895 | 895 | args = self.opener.read('undo.desc').splitlines() |
|
896 | 896 | (oldlen, desc, detail) = (int(args[0]), args[1], None) |
|
897 | 897 | if len(args) >= 3: |
|
898 | 898 | detail = args[2] |
|
899 | 899 | oldtip = oldlen - 1 |
|
900 | 900 | |
|
901 | 901 | if detail and ui.verbose: |
|
902 | 902 | msg = (_('repository tip rolled back to revision %s' |
|
903 | 903 | ' (undo %s: %s)\n') |
|
904 | 904 | % (oldtip, desc, detail)) |
|
905 | 905 | else: |
|
906 | 906 | msg = (_('repository tip rolled back to revision %s' |
|
907 | 907 | ' (undo %s)\n') |
|
908 | 908 | % (oldtip, desc)) |
|
909 | 909 | except IOError: |
|
910 | 910 | msg = _('rolling back unknown transaction\n') |
|
911 | 911 | desc = None |
|
912 | 912 | |
|
913 | 913 | if not force and self['.'] != self['tip'] and desc == 'commit': |
|
914 | 914 | raise util.Abort( |
|
915 | 915 | _('rollback of last commit while not checked out ' |
|
916 | 916 | 'may lose data'), hint=_('use -f to force')) |
|
917 | 917 | |
|
918 | 918 | ui.status(msg) |
|
919 | 919 | if dryrun: |
|
920 | 920 | return 0 |
|
921 | 921 | |
|
922 | 922 | parents = self.dirstate.parents() |
|
923 | 923 | self.destroying() |
|
924 | 924 | transaction.rollback(self.sopener, 'undo', ui.warn) |
|
925 | 925 | if self.vfs.exists('undo.bookmarks'): |
|
926 | 926 | self.vfs.rename('undo.bookmarks', 'bookmarks') |
|
927 | 927 | if self.svfs.exists('undo.phaseroots'): |
|
928 | 928 | self.svfs.rename('undo.phaseroots', 'phaseroots') |
|
929 | 929 | self.invalidate() |
|
930 | 930 | |
|
931 | 931 | parentgone = (parents[0] not in self.changelog.nodemap or |
|
932 | 932 | parents[1] not in self.changelog.nodemap) |
|
933 | 933 | if parentgone: |
|
934 | 934 | self.vfs.rename('undo.dirstate', 'dirstate') |
|
935 | 935 | try: |
|
936 | 936 | branch = self.opener.read('undo.branch') |
|
937 | 937 | self.dirstate.setbranch(encoding.tolocal(branch)) |
|
938 | 938 | except IOError: |
|
939 | 939 | ui.warn(_('named branch could not be reset: ' |
|
940 | 940 | 'current branch is still \'%s\'\n') |
|
941 | 941 | % self.dirstate.branch()) |
|
942 | 942 | |
|
943 | 943 | self.dirstate.invalidate() |
|
944 | 944 | parents = tuple([p.rev() for p in self.parents()]) |
|
945 | 945 | if len(parents) > 1: |
|
946 | 946 | ui.status(_('working directory now based on ' |
|
947 | 947 | 'revisions %d and %d\n') % parents) |
|
948 | 948 | else: |
|
949 | 949 | ui.status(_('working directory now based on ' |
|
950 | 950 | 'revision %d\n') % parents) |
|
951 | 951 | # TODO: if we know which new heads may result from this rollback, pass |
|
952 | 952 | # them to destroy(), which will prevent the branchhead cache from being |
|
953 | 953 | # invalidated. |
|
954 | 954 | self.destroyed() |
|
955 | 955 | return 0 |
|
956 | 956 | |
|
957 | 957 | def invalidatecaches(self): |
|
958 | 958 | |
|
959 | 959 | if '_tagscache' in vars(self): |
|
960 | 960 | # can't use delattr on proxy |
|
961 | 961 | del self.__dict__['_tagscache'] |
|
962 | 962 | |
|
963 | 963 | self.unfiltered()._branchcaches.clear() |
|
964 | 964 | self.invalidatevolatilesets() |
|
965 | 965 | |
|
966 | 966 | def invalidatevolatilesets(self): |
|
967 | 967 | self.filteredrevcache.clear() |
|
968 | 968 | obsolete.clearobscaches(self) |
|
969 | 969 | |
|
970 | 970 | def invalidatedirstate(self): |
|
971 | 971 | '''Invalidates the dirstate, causing the next call to dirstate |
|
972 | 972 | to check if it was modified since the last time it was read, |
|
973 | 973 | rereading it if it has. |
|
974 | 974 | |
|
975 | 975 | This is different to dirstate.invalidate() that it doesn't always |
|
976 | 976 | rereads the dirstate. Use dirstate.invalidate() if you want to |
|
977 | 977 | explicitly read the dirstate again (i.e. restoring it to a previous |
|
978 | 978 | known good state).''' |
|
979 | 979 | if hasunfilteredcache(self, 'dirstate'): |
|
980 | 980 | for k in self.dirstate._filecache: |
|
981 | 981 | try: |
|
982 | 982 | delattr(self.dirstate, k) |
|
983 | 983 | except AttributeError: |
|
984 | 984 | pass |
|
985 | 985 | delattr(self.unfiltered(), 'dirstate') |
|
986 | 986 | |
|
987 | 987 | def invalidate(self): |
|
988 | 988 | unfiltered = self.unfiltered() # all file caches are stored unfiltered |
|
989 | 989 | for k in self._filecache: |
|
990 | 990 | # dirstate is invalidated separately in invalidatedirstate() |
|
991 | 991 | if k == 'dirstate': |
|
992 | 992 | continue |
|
993 | 993 | |
|
994 | 994 | try: |
|
995 | 995 | delattr(unfiltered, k) |
|
996 | 996 | except AttributeError: |
|
997 | 997 | pass |
|
998 | 998 | self.invalidatecaches() |
|
999 | self.store.invalidatecaches() | |
|
999 | 1000 | |
|
1000 | 1001 | def invalidateall(self): |
|
1001 | 1002 | '''Fully invalidates both store and non-store parts, causing the |
|
1002 | 1003 | subsequent operation to reread any outside changes.''' |
|
1003 | 1004 | # extension should hook this to invalidate its caches |
|
1004 | 1005 | self.invalidate() |
|
1005 | 1006 | self.invalidatedirstate() |
|
1006 | 1007 | |
|
1007 | 1008 | def _lock(self, vfs, lockname, wait, releasefn, acquirefn, desc): |
|
1008 | 1009 | try: |
|
1009 | 1010 | l = lockmod.lock(vfs, lockname, 0, releasefn, desc=desc) |
|
1010 | 1011 | except error.LockHeld, inst: |
|
1011 | 1012 | if not wait: |
|
1012 | 1013 | raise |
|
1013 | 1014 | self.ui.warn(_("waiting for lock on %s held by %r\n") % |
|
1014 | 1015 | (desc, inst.locker)) |
|
1015 | 1016 | # default to 600 seconds timeout |
|
1016 | 1017 | l = lockmod.lock(vfs, lockname, |
|
1017 | 1018 | int(self.ui.config("ui", "timeout", "600")), |
|
1018 | 1019 | releasefn, desc=desc) |
|
1019 | 1020 | self.ui.warn(_("got lock after %s seconds\n") % l.delay) |
|
1020 | 1021 | if acquirefn: |
|
1021 | 1022 | acquirefn() |
|
1022 | 1023 | return l |
|
1023 | 1024 | |
|
1024 | 1025 | def _afterlock(self, callback): |
|
1025 | 1026 | """add a callback to the current repository lock. |
|
1026 | 1027 | |
|
1027 | 1028 | The callback will be executed on lock release.""" |
|
1028 | 1029 | l = self._lockref and self._lockref() |
|
1029 | 1030 | if l: |
|
1030 | 1031 | l.postrelease.append(callback) |
|
1031 | 1032 | else: |
|
1032 | 1033 | callback() |
|
1033 | 1034 | |
|
1034 | 1035 | def lock(self, wait=True): |
|
1035 | 1036 | '''Lock the repository store (.hg/store) and return a weak reference |
|
1036 | 1037 | to the lock. Use this before modifying the store (e.g. committing or |
|
1037 | 1038 | stripping). If you are opening a transaction, get a lock as well.)''' |
|
1038 | 1039 | l = self._lockref and self._lockref() |
|
1039 | 1040 | if l is not None and l.held: |
|
1040 | 1041 | l.lock() |
|
1041 | 1042 | return l |
|
1042 | 1043 | |
|
1043 | 1044 | def unlock(): |
|
1044 | 1045 | if hasunfilteredcache(self, '_phasecache'): |
|
1045 | 1046 | self._phasecache.write() |
|
1046 | 1047 | for k, ce in self._filecache.items(): |
|
1047 | 1048 | if k == 'dirstate' or k not in self.__dict__: |
|
1048 | 1049 | continue |
|
1049 | 1050 | ce.refresh() |
|
1050 | 1051 | |
|
1051 | 1052 | l = self._lock(self.svfs, "lock", wait, unlock, |
|
1052 | 1053 | self.invalidate, _('repository %s') % self.origroot) |
|
1053 | 1054 | self._lockref = weakref.ref(l) |
|
1054 | 1055 | return l |
|
1055 | 1056 | |
|
1056 | 1057 | def wlock(self, wait=True): |
|
1057 | 1058 | '''Lock the non-store parts of the repository (everything under |
|
1058 | 1059 | .hg except .hg/store) and return a weak reference to the lock. |
|
1059 | 1060 | Use this before modifying files in .hg.''' |
|
1060 | 1061 | l = self._wlockref and self._wlockref() |
|
1061 | 1062 | if l is not None and l.held: |
|
1062 | 1063 | l.lock() |
|
1063 | 1064 | return l |
|
1064 | 1065 | |
|
1065 | 1066 | def unlock(): |
|
1066 | 1067 | self.dirstate.write() |
|
1067 | 1068 | self._filecache['dirstate'].refresh() |
|
1068 | 1069 | |
|
1069 | 1070 | l = self._lock(self.vfs, "wlock", wait, unlock, |
|
1070 | 1071 | self.invalidatedirstate, _('working directory of %s') % |
|
1071 | 1072 | self.origroot) |
|
1072 | 1073 | self._wlockref = weakref.ref(l) |
|
1073 | 1074 | return l |
|
1074 | 1075 | |
|
1075 | 1076 | def _filecommit(self, fctx, manifest1, manifest2, linkrev, tr, changelist): |
|
1076 | 1077 | """ |
|
1077 | 1078 | commit an individual file as part of a larger transaction |
|
1078 | 1079 | """ |
|
1079 | 1080 | |
|
1080 | 1081 | fname = fctx.path() |
|
1081 | 1082 | text = fctx.data() |
|
1082 | 1083 | flog = self.file(fname) |
|
1083 | 1084 | fparent1 = manifest1.get(fname, nullid) |
|
1084 | 1085 | fparent2 = fparent2o = manifest2.get(fname, nullid) |
|
1085 | 1086 | |
|
1086 | 1087 | meta = {} |
|
1087 | 1088 | copy = fctx.renamed() |
|
1088 | 1089 | if copy and copy[0] != fname: |
|
1089 | 1090 | # Mark the new revision of this file as a copy of another |
|
1090 | 1091 | # file. This copy data will effectively act as a parent |
|
1091 | 1092 | # of this new revision. If this is a merge, the first |
|
1092 | 1093 | # parent will be the nullid (meaning "look up the copy data") |
|
1093 | 1094 | # and the second one will be the other parent. For example: |
|
1094 | 1095 | # |
|
1095 | 1096 | # 0 --- 1 --- 3 rev1 changes file foo |
|
1096 | 1097 | # \ / rev2 renames foo to bar and changes it |
|
1097 | 1098 | # \- 2 -/ rev3 should have bar with all changes and |
|
1098 | 1099 | # should record that bar descends from |
|
1099 | 1100 | # bar in rev2 and foo in rev1 |
|
1100 | 1101 | # |
|
1101 | 1102 | # this allows this merge to succeed: |
|
1102 | 1103 | # |
|
1103 | 1104 | # 0 --- 1 --- 3 rev4 reverts the content change from rev2 |
|
1104 | 1105 | # \ / merging rev3 and rev4 should use bar@rev2 |
|
1105 | 1106 | # \- 2 --- 4 as the merge base |
|
1106 | 1107 | # |
|
1107 | 1108 | |
|
1108 | 1109 | cfname = copy[0] |
|
1109 | 1110 | crev = manifest1.get(cfname) |
|
1110 | 1111 | newfparent = fparent2 |
|
1111 | 1112 | |
|
1112 | 1113 | if manifest2: # branch merge |
|
1113 | 1114 | if fparent2 == nullid or crev is None: # copied on remote side |
|
1114 | 1115 | if cfname in manifest2: |
|
1115 | 1116 | crev = manifest2[cfname] |
|
1116 | 1117 | newfparent = fparent1 |
|
1117 | 1118 | |
|
1118 | 1119 | # find source in nearest ancestor if we've lost track |
|
1119 | 1120 | if not crev: |
|
1120 | 1121 | self.ui.debug(" %s: searching for copy revision for %s\n" % |
|
1121 | 1122 | (fname, cfname)) |
|
1122 | 1123 | for ancestor in self[None].ancestors(): |
|
1123 | 1124 | if cfname in ancestor: |
|
1124 | 1125 | crev = ancestor[cfname].filenode() |
|
1125 | 1126 | break |
|
1126 | 1127 | |
|
1127 | 1128 | if crev: |
|
1128 | 1129 | self.ui.debug(" %s: copy %s:%s\n" % (fname, cfname, hex(crev))) |
|
1129 | 1130 | meta["copy"] = cfname |
|
1130 | 1131 | meta["copyrev"] = hex(crev) |
|
1131 | 1132 | fparent1, fparent2 = nullid, newfparent |
|
1132 | 1133 | else: |
|
1133 | 1134 | self.ui.warn(_("warning: can't find ancestor for '%s' " |
|
1134 | 1135 | "copied from '%s'!\n") % (fname, cfname)) |
|
1135 | 1136 | |
|
1136 | 1137 | elif fparent1 == nullid: |
|
1137 | 1138 | fparent1, fparent2 = fparent2, nullid |
|
1138 | 1139 | elif fparent2 != nullid: |
|
1139 | 1140 | # is one parent an ancestor of the other? |
|
1140 | 1141 | fparentancestor = flog.ancestor(fparent1, fparent2) |
|
1141 | 1142 | if fparentancestor == fparent1: |
|
1142 | 1143 | fparent1, fparent2 = fparent2, nullid |
|
1143 | 1144 | elif fparentancestor == fparent2: |
|
1144 | 1145 | fparent2 = nullid |
|
1145 | 1146 | |
|
1146 | 1147 | # is the file changed? |
|
1147 | 1148 | if fparent2 != nullid or flog.cmp(fparent1, text) or meta: |
|
1148 | 1149 | changelist.append(fname) |
|
1149 | 1150 | return flog.add(text, meta, tr, linkrev, fparent1, fparent2) |
|
1150 | 1151 | |
|
1151 | 1152 | # are just the flags changed during merge? |
|
1152 | 1153 | if fparent1 != fparent2o and manifest1.flags(fname) != fctx.flags(): |
|
1153 | 1154 | changelist.append(fname) |
|
1154 | 1155 | |
|
1155 | 1156 | return fparent1 |
|
1156 | 1157 | |
|
1157 | 1158 | @unfilteredmethod |
|
1158 | 1159 | def commit(self, text="", user=None, date=None, match=None, force=False, |
|
1159 | 1160 | editor=False, extra={}): |
|
1160 | 1161 | """Add a new revision to current repository. |
|
1161 | 1162 | |
|
1162 | 1163 | Revision information is gathered from the working directory, |
|
1163 | 1164 | match can be used to filter the committed files. If editor is |
|
1164 | 1165 | supplied, it is called to get a commit message. |
|
1165 | 1166 | """ |
|
1166 | 1167 | |
|
1167 | 1168 | def fail(f, msg): |
|
1168 | 1169 | raise util.Abort('%s: %s' % (f, msg)) |
|
1169 | 1170 | |
|
1170 | 1171 | if not match: |
|
1171 | 1172 | match = matchmod.always(self.root, '') |
|
1172 | 1173 | |
|
1173 | 1174 | if not force: |
|
1174 | 1175 | vdirs = [] |
|
1175 | 1176 | match.explicitdir = vdirs.append |
|
1176 | 1177 | match.bad = fail |
|
1177 | 1178 | |
|
1178 | 1179 | wlock = self.wlock() |
|
1179 | 1180 | try: |
|
1180 | 1181 | wctx = self[None] |
|
1181 | 1182 | merge = len(wctx.parents()) > 1 |
|
1182 | 1183 | |
|
1183 | 1184 | if (not force and merge and match and |
|
1184 | 1185 | (match.files() or match.anypats())): |
|
1185 | 1186 | raise util.Abort(_('cannot partially commit a merge ' |
|
1186 | 1187 | '(do not specify files or patterns)')) |
|
1187 | 1188 | |
|
1188 | 1189 | changes = self.status(match=match, clean=force) |
|
1189 | 1190 | if force: |
|
1190 | 1191 | changes[0].extend(changes[6]) # mq may commit unchanged files |
|
1191 | 1192 | |
|
1192 | 1193 | # check subrepos |
|
1193 | 1194 | subs = [] |
|
1194 | 1195 | commitsubs = set() |
|
1195 | 1196 | newstate = wctx.substate.copy() |
|
1196 | 1197 | # only manage subrepos and .hgsubstate if .hgsub is present |
|
1197 | 1198 | if '.hgsub' in wctx: |
|
1198 | 1199 | # we'll decide whether to track this ourselves, thanks |
|
1199 | 1200 | for c in changes[:3]: |
|
1200 | 1201 | if '.hgsubstate' in c: |
|
1201 | 1202 | c.remove('.hgsubstate') |
|
1202 | 1203 | |
|
1203 | 1204 | # compare current state to last committed state |
|
1204 | 1205 | # build new substate based on last committed state |
|
1205 | 1206 | oldstate = wctx.p1().substate |
|
1206 | 1207 | for s in sorted(newstate.keys()): |
|
1207 | 1208 | if not match(s): |
|
1208 | 1209 | # ignore working copy, use old state if present |
|
1209 | 1210 | if s in oldstate: |
|
1210 | 1211 | newstate[s] = oldstate[s] |
|
1211 | 1212 | continue |
|
1212 | 1213 | if not force: |
|
1213 | 1214 | raise util.Abort( |
|
1214 | 1215 | _("commit with new subrepo %s excluded") % s) |
|
1215 | 1216 | if wctx.sub(s).dirty(True): |
|
1216 | 1217 | if not self.ui.configbool('ui', 'commitsubrepos'): |
|
1217 | 1218 | raise util.Abort( |
|
1218 | 1219 | _("uncommitted changes in subrepo %s") % s, |
|
1219 | 1220 | hint=_("use --subrepos for recursive commit")) |
|
1220 | 1221 | subs.append(s) |
|
1221 | 1222 | commitsubs.add(s) |
|
1222 | 1223 | else: |
|
1223 | 1224 | bs = wctx.sub(s).basestate() |
|
1224 | 1225 | newstate[s] = (newstate[s][0], bs, newstate[s][2]) |
|
1225 | 1226 | if oldstate.get(s, (None, None, None))[1] != bs: |
|
1226 | 1227 | subs.append(s) |
|
1227 | 1228 | |
|
1228 | 1229 | # check for removed subrepos |
|
1229 | 1230 | for p in wctx.parents(): |
|
1230 | 1231 | r = [s for s in p.substate if s not in newstate] |
|
1231 | 1232 | subs += [s for s in r if match(s)] |
|
1232 | 1233 | if subs: |
|
1233 | 1234 | if (not match('.hgsub') and |
|
1234 | 1235 | '.hgsub' in (wctx.modified() + wctx.added())): |
|
1235 | 1236 | raise util.Abort( |
|
1236 | 1237 | _("can't commit subrepos without .hgsub")) |
|
1237 | 1238 | changes[0].insert(0, '.hgsubstate') |
|
1238 | 1239 | |
|
1239 | 1240 | elif '.hgsub' in changes[2]: |
|
1240 | 1241 | # clean up .hgsubstate when .hgsub is removed |
|
1241 | 1242 | if ('.hgsubstate' in wctx and |
|
1242 | 1243 | '.hgsubstate' not in changes[0] + changes[1] + changes[2]): |
|
1243 | 1244 | changes[2].insert(0, '.hgsubstate') |
|
1244 | 1245 | |
|
1245 | 1246 | # make sure all explicit patterns are matched |
|
1246 | 1247 | if not force and match.files(): |
|
1247 | 1248 | matched = set(changes[0] + changes[1] + changes[2]) |
|
1248 | 1249 | |
|
1249 | 1250 | for f in match.files(): |
|
1250 | 1251 | f = self.dirstate.normalize(f) |
|
1251 | 1252 | if f == '.' or f in matched or f in wctx.substate: |
|
1252 | 1253 | continue |
|
1253 | 1254 | if f in changes[3]: # missing |
|
1254 | 1255 | fail(f, _('file not found!')) |
|
1255 | 1256 | if f in vdirs: # visited directory |
|
1256 | 1257 | d = f + '/' |
|
1257 | 1258 | for mf in matched: |
|
1258 | 1259 | if mf.startswith(d): |
|
1259 | 1260 | break |
|
1260 | 1261 | else: |
|
1261 | 1262 | fail(f, _("no match under directory!")) |
|
1262 | 1263 | elif f not in self.dirstate: |
|
1263 | 1264 | fail(f, _("file not tracked!")) |
|
1264 | 1265 | |
|
1265 | 1266 | cctx = context.workingctx(self, text, user, date, extra, changes) |
|
1266 | 1267 | |
|
1267 | 1268 | if (not force and not extra.get("close") and not merge |
|
1268 | 1269 | and not cctx.files() |
|
1269 | 1270 | and wctx.branch() == wctx.p1().branch()): |
|
1270 | 1271 | return None |
|
1271 | 1272 | |
|
1272 | 1273 | if merge and cctx.deleted(): |
|
1273 | 1274 | raise util.Abort(_("cannot commit merge with missing files")) |
|
1274 | 1275 | |
|
1275 | 1276 | ms = mergemod.mergestate(self) |
|
1276 | 1277 | for f in changes[0]: |
|
1277 | 1278 | if f in ms and ms[f] == 'u': |
|
1278 | 1279 | raise util.Abort(_("unresolved merge conflicts " |
|
1279 | 1280 | "(see hg help resolve)")) |
|
1280 | 1281 | |
|
1281 | 1282 | if editor: |
|
1282 | 1283 | cctx._text = editor(self, cctx, subs) |
|
1283 | 1284 | edited = (text != cctx._text) |
|
1284 | 1285 | |
|
1285 | 1286 | # Save commit message in case this transaction gets rolled back |
|
1286 | 1287 | # (e.g. by a pretxncommit hook). Leave the content alone on |
|
1287 | 1288 | # the assumption that the user will use the same editor again. |
|
1288 | 1289 | msgfn = self.savecommitmessage(cctx._text) |
|
1289 | 1290 | |
|
1290 | 1291 | # commit subs and write new state |
|
1291 | 1292 | if subs: |
|
1292 | 1293 | for s in sorted(commitsubs): |
|
1293 | 1294 | sub = wctx.sub(s) |
|
1294 | 1295 | self.ui.status(_('committing subrepository %s\n') % |
|
1295 | 1296 | subrepo.subrelpath(sub)) |
|
1296 | 1297 | sr = sub.commit(cctx._text, user, date) |
|
1297 | 1298 | newstate[s] = (newstate[s][0], sr) |
|
1298 | 1299 | subrepo.writestate(self, newstate) |
|
1299 | 1300 | |
|
1300 | 1301 | p1, p2 = self.dirstate.parents() |
|
1301 | 1302 | hookp1, hookp2 = hex(p1), (p2 != nullid and hex(p2) or '') |
|
1302 | 1303 | try: |
|
1303 | 1304 | self.hook("precommit", throw=True, parent1=hookp1, |
|
1304 | 1305 | parent2=hookp2) |
|
1305 | 1306 | ret = self.commitctx(cctx, True) |
|
1306 | 1307 | except: # re-raises |
|
1307 | 1308 | if edited: |
|
1308 | 1309 | self.ui.write( |
|
1309 | 1310 | _('note: commit message saved in %s\n') % msgfn) |
|
1310 | 1311 | raise |
|
1311 | 1312 | |
|
1312 | 1313 | # update bookmarks, dirstate and mergestate |
|
1313 | 1314 | bookmarks.update(self, [p1, p2], ret) |
|
1314 | 1315 | cctx.markcommitted(ret) |
|
1315 | 1316 | ms.reset() |
|
1316 | 1317 | finally: |
|
1317 | 1318 | wlock.release() |
|
1318 | 1319 | |
|
1319 | 1320 | def commithook(node=hex(ret), parent1=hookp1, parent2=hookp2): |
|
1320 | 1321 | self.hook("commit", node=node, parent1=parent1, parent2=parent2) |
|
1321 | 1322 | self._afterlock(commithook) |
|
1322 | 1323 | return ret |
|
1323 | 1324 | |
|
1324 | 1325 | @unfilteredmethod |
|
1325 | 1326 | def commitctx(self, ctx, error=False): |
|
1326 | 1327 | """Add a new revision to current repository. |
|
1327 | 1328 | Revision information is passed via the context argument. |
|
1328 | 1329 | """ |
|
1329 | 1330 | |
|
1330 | 1331 | tr = lock = None |
|
1331 | 1332 | removed = list(ctx.removed()) |
|
1332 | 1333 | p1, p2 = ctx.p1(), ctx.p2() |
|
1333 | 1334 | user = ctx.user() |
|
1334 | 1335 | |
|
1335 | 1336 | lock = self.lock() |
|
1336 | 1337 | try: |
|
1337 | 1338 | tr = self.transaction("commit") |
|
1338 | 1339 | trp = weakref.proxy(tr) |
|
1339 | 1340 | |
|
1340 | 1341 | if ctx.files(): |
|
1341 | 1342 | m1 = p1.manifest().copy() |
|
1342 | 1343 | m2 = p2.manifest() |
|
1343 | 1344 | |
|
1344 | 1345 | # check in files |
|
1345 | 1346 | new = {} |
|
1346 | 1347 | changed = [] |
|
1347 | 1348 | linkrev = len(self) |
|
1348 | 1349 | for f in sorted(ctx.modified() + ctx.added()): |
|
1349 | 1350 | self.ui.note(f + "\n") |
|
1350 | 1351 | try: |
|
1351 | 1352 | fctx = ctx[f] |
|
1352 | 1353 | new[f] = self._filecommit(fctx, m1, m2, linkrev, trp, |
|
1353 | 1354 | changed) |
|
1354 | 1355 | m1.set(f, fctx.flags()) |
|
1355 | 1356 | except OSError, inst: |
|
1356 | 1357 | self.ui.warn(_("trouble committing %s!\n") % f) |
|
1357 | 1358 | raise |
|
1358 | 1359 | except IOError, inst: |
|
1359 | 1360 | errcode = getattr(inst, 'errno', errno.ENOENT) |
|
1360 | 1361 | if error or errcode and errcode != errno.ENOENT: |
|
1361 | 1362 | self.ui.warn(_("trouble committing %s!\n") % f) |
|
1362 | 1363 | raise |
|
1363 | 1364 | else: |
|
1364 | 1365 | removed.append(f) |
|
1365 | 1366 | |
|
1366 | 1367 | # update manifest |
|
1367 | 1368 | m1.update(new) |
|
1368 | 1369 | removed = [f for f in sorted(removed) if f in m1 or f in m2] |
|
1369 | 1370 | drop = [f for f in removed if f in m1] |
|
1370 | 1371 | for f in drop: |
|
1371 | 1372 | del m1[f] |
|
1372 | 1373 | mn = self.manifest.add(m1, trp, linkrev, p1.manifestnode(), |
|
1373 | 1374 | p2.manifestnode(), (new, drop)) |
|
1374 | 1375 | files = changed + removed |
|
1375 | 1376 | else: |
|
1376 | 1377 | mn = p1.manifestnode() |
|
1377 | 1378 | files = [] |
|
1378 | 1379 | |
|
1379 | 1380 | # update changelog |
|
1380 | 1381 | self.changelog.delayupdate() |
|
1381 | 1382 | n = self.changelog.add(mn, files, ctx.description(), |
|
1382 | 1383 | trp, p1.node(), p2.node(), |
|
1383 | 1384 | user, ctx.date(), ctx.extra().copy()) |
|
1384 | 1385 | p = lambda: self.changelog.writepending() and self.root or "" |
|
1385 | 1386 | xp1, xp2 = p1.hex(), p2 and p2.hex() or '' |
|
1386 | 1387 | self.hook('pretxncommit', throw=True, node=hex(n), parent1=xp1, |
|
1387 | 1388 | parent2=xp2, pending=p) |
|
1388 | 1389 | self.changelog.finalize(trp) |
|
1389 | 1390 | # set the new commit is proper phase |
|
1390 | 1391 | targetphase = subrepo.newcommitphase(self.ui, ctx) |
|
1391 | 1392 | if targetphase: |
|
1392 | 1393 | # retract boundary do not alter parent changeset. |
|
1393 | 1394 | # if a parent have higher the resulting phase will |
|
1394 | 1395 | # be compliant anyway |
|
1395 | 1396 | # |
|
1396 | 1397 | # if minimal phase was 0 we don't need to retract anything |
|
1397 | 1398 | phases.retractboundary(self, targetphase, [n]) |
|
1398 | 1399 | tr.close() |
|
1399 | 1400 | branchmap.updatecache(self.filtered('served')) |
|
1400 | 1401 | return n |
|
1401 | 1402 | finally: |
|
1402 | 1403 | if tr: |
|
1403 | 1404 | tr.release() |
|
1404 | 1405 | lock.release() |
|
1405 | 1406 | |
|
1406 | 1407 | @unfilteredmethod |
|
1407 | 1408 | def destroying(self): |
|
1408 | 1409 | '''Inform the repository that nodes are about to be destroyed. |
|
1409 | 1410 | Intended for use by strip and rollback, so there's a common |
|
1410 | 1411 | place for anything that has to be done before destroying history. |
|
1411 | 1412 | |
|
1412 | 1413 | This is mostly useful for saving state that is in memory and waiting |
|
1413 | 1414 | to be flushed when the current lock is released. Because a call to |
|
1414 | 1415 | destroyed is imminent, the repo will be invalidated causing those |
|
1415 | 1416 | changes to stay in memory (waiting for the next unlock), or vanish |
|
1416 | 1417 | completely. |
|
1417 | 1418 | ''' |
|
1418 | 1419 | # When using the same lock to commit and strip, the phasecache is left |
|
1419 | 1420 | # dirty after committing. Then when we strip, the repo is invalidated, |
|
1420 | 1421 | # causing those changes to disappear. |
|
1421 | 1422 | if '_phasecache' in vars(self): |
|
1422 | 1423 | self._phasecache.write() |
|
1423 | 1424 | |
|
1424 | 1425 | @unfilteredmethod |
|
1425 | 1426 | def destroyed(self): |
|
1426 | 1427 | '''Inform the repository that nodes have been destroyed. |
|
1427 | 1428 | Intended for use by strip and rollback, so there's a common |
|
1428 | 1429 | place for anything that has to be done after destroying history. |
|
1429 | 1430 | ''' |
|
1430 | 1431 | # When one tries to: |
|
1431 | 1432 | # 1) destroy nodes thus calling this method (e.g. strip) |
|
1432 | 1433 | # 2) use phasecache somewhere (e.g. commit) |
|
1433 | 1434 | # |
|
1434 | 1435 | # then 2) will fail because the phasecache contains nodes that were |
|
1435 | 1436 | # removed. We can either remove phasecache from the filecache, |
|
1436 | 1437 | # causing it to reload next time it is accessed, or simply filter |
|
1437 | 1438 | # the removed nodes now and write the updated cache. |
|
1438 | 1439 | self._phasecache.filterunknown(self) |
|
1439 | 1440 | self._phasecache.write() |
|
1440 | 1441 | |
|
1441 | 1442 | # update the 'served' branch cache to help read only server process |
|
1442 | 1443 | # Thanks to branchcache collaboration this is done from the nearest |
|
1443 | 1444 | # filtered subset and it is expected to be fast. |
|
1444 | 1445 | branchmap.updatecache(self.filtered('served')) |
|
1445 | 1446 | |
|
1446 | 1447 | # Ensure the persistent tag cache is updated. Doing it now |
|
1447 | 1448 | # means that the tag cache only has to worry about destroyed |
|
1448 | 1449 | # heads immediately after a strip/rollback. That in turn |
|
1449 | 1450 | # guarantees that "cachetip == currenttip" (comparing both rev |
|
1450 | 1451 | # and node) always means no nodes have been added or destroyed. |
|
1451 | 1452 | |
|
1452 | 1453 | # XXX this is suboptimal when qrefresh'ing: we strip the current |
|
1453 | 1454 | # head, refresh the tag cache, then immediately add a new head. |
|
1454 | 1455 | # But I think doing it this way is necessary for the "instant |
|
1455 | 1456 | # tag cache retrieval" case to work. |
|
1456 | 1457 | self.invalidate() |
|
1457 | 1458 | |
|
1458 | 1459 | def walk(self, match, node=None): |
|
1459 | 1460 | ''' |
|
1460 | 1461 | walk recursively through the directory tree or a given |
|
1461 | 1462 | changeset, finding all files matched by the match |
|
1462 | 1463 | function |
|
1463 | 1464 | ''' |
|
1464 | 1465 | return self[node].walk(match) |
|
1465 | 1466 | |
|
1466 | 1467 | def status(self, node1='.', node2=None, match=None, |
|
1467 | 1468 | ignored=False, clean=False, unknown=False, |
|
1468 | 1469 | listsubrepos=False): |
|
1469 | 1470 | """return status of files between two nodes or node and working |
|
1470 | 1471 | directory. |
|
1471 | 1472 | |
|
1472 | 1473 | If node1 is None, use the first dirstate parent instead. |
|
1473 | 1474 | If node2 is None, compare node1 with working directory. |
|
1474 | 1475 | """ |
|
1475 | 1476 | |
|
1476 | 1477 | def mfmatches(ctx): |
|
1477 | 1478 | mf = ctx.manifest().copy() |
|
1478 | 1479 | if match.always(): |
|
1479 | 1480 | return mf |
|
1480 | 1481 | for fn in mf.keys(): |
|
1481 | 1482 | if not match(fn): |
|
1482 | 1483 | del mf[fn] |
|
1483 | 1484 | return mf |
|
1484 | 1485 | |
|
1485 | 1486 | ctx1 = self[node1] |
|
1486 | 1487 | ctx2 = self[node2] |
|
1487 | 1488 | |
|
1488 | 1489 | working = ctx2.rev() is None |
|
1489 | 1490 | parentworking = working and ctx1 == self['.'] |
|
1490 | 1491 | match = match or matchmod.always(self.root, self.getcwd()) |
|
1491 | 1492 | listignored, listclean, listunknown = ignored, clean, unknown |
|
1492 | 1493 | |
|
1493 | 1494 | # load earliest manifest first for caching reasons |
|
1494 | 1495 | if not working and ctx2.rev() < ctx1.rev(): |
|
1495 | 1496 | ctx2.manifest() |
|
1496 | 1497 | |
|
1497 | 1498 | if not parentworking: |
|
1498 | 1499 | def bad(f, msg): |
|
1499 | 1500 | # 'f' may be a directory pattern from 'match.files()', |
|
1500 | 1501 | # so 'f not in ctx1' is not enough |
|
1501 | 1502 | if f not in ctx1 and f not in ctx1.dirs(): |
|
1502 | 1503 | self.ui.warn('%s: %s\n' % (self.dirstate.pathto(f), msg)) |
|
1503 | 1504 | match.bad = bad |
|
1504 | 1505 | |
|
1505 | 1506 | if working: # we need to scan the working dir |
|
1506 | 1507 | subrepos = [] |
|
1507 | 1508 | if '.hgsub' in self.dirstate: |
|
1508 | 1509 | subrepos = sorted(ctx2.substate) |
|
1509 | 1510 | s = self.dirstate.status(match, subrepos, listignored, |
|
1510 | 1511 | listclean, listunknown) |
|
1511 | 1512 | cmp, modified, added, removed, deleted, unknown, ignored, clean = s |
|
1512 | 1513 | |
|
1513 | 1514 | # check for any possibly clean files |
|
1514 | 1515 | if parentworking and cmp: |
|
1515 | 1516 | fixup = [] |
|
1516 | 1517 | # do a full compare of any files that might have changed |
|
1517 | 1518 | for f in sorted(cmp): |
|
1518 | 1519 | if (f not in ctx1 or ctx2.flags(f) != ctx1.flags(f) |
|
1519 | 1520 | or ctx1[f].cmp(ctx2[f])): |
|
1520 | 1521 | modified.append(f) |
|
1521 | 1522 | else: |
|
1522 | 1523 | fixup.append(f) |
|
1523 | 1524 | |
|
1524 | 1525 | # update dirstate for files that are actually clean |
|
1525 | 1526 | if fixup: |
|
1526 | 1527 | if listclean: |
|
1527 | 1528 | clean += fixup |
|
1528 | 1529 | |
|
1529 | 1530 | try: |
|
1530 | 1531 | # updating the dirstate is optional |
|
1531 | 1532 | # so we don't wait on the lock |
|
1532 | 1533 | wlock = self.wlock(False) |
|
1533 | 1534 | try: |
|
1534 | 1535 | for f in fixup: |
|
1535 | 1536 | self.dirstate.normal(f) |
|
1536 | 1537 | finally: |
|
1537 | 1538 | wlock.release() |
|
1538 | 1539 | except error.LockError: |
|
1539 | 1540 | pass |
|
1540 | 1541 | |
|
1541 | 1542 | if not parentworking: |
|
1542 | 1543 | mf1 = mfmatches(ctx1) |
|
1543 | 1544 | if working: |
|
1544 | 1545 | # we are comparing working dir against non-parent |
|
1545 | 1546 | # generate a pseudo-manifest for the working dir |
|
1546 | 1547 | mf2 = mfmatches(self['.']) |
|
1547 | 1548 | for f in cmp + modified + added: |
|
1548 | 1549 | mf2[f] = None |
|
1549 | 1550 | mf2.set(f, ctx2.flags(f)) |
|
1550 | 1551 | for f in removed: |
|
1551 | 1552 | if f in mf2: |
|
1552 | 1553 | del mf2[f] |
|
1553 | 1554 | else: |
|
1554 | 1555 | # we are comparing two revisions |
|
1555 | 1556 | deleted, unknown, ignored = [], [], [] |
|
1556 | 1557 | mf2 = mfmatches(ctx2) |
|
1557 | 1558 | |
|
1558 | 1559 | modified, added, clean = [], [], [] |
|
1559 | 1560 | withflags = mf1.withflags() | mf2.withflags() |
|
1560 | 1561 | for fn, mf2node in mf2.iteritems(): |
|
1561 | 1562 | if fn in mf1: |
|
1562 | 1563 | if (fn not in deleted and |
|
1563 | 1564 | ((fn in withflags and mf1.flags(fn) != mf2.flags(fn)) or |
|
1564 | 1565 | (mf1[fn] != mf2node and |
|
1565 | 1566 | (mf2node or ctx1[fn].cmp(ctx2[fn]))))): |
|
1566 | 1567 | modified.append(fn) |
|
1567 | 1568 | elif listclean: |
|
1568 | 1569 | clean.append(fn) |
|
1569 | 1570 | del mf1[fn] |
|
1570 | 1571 | elif fn not in deleted: |
|
1571 | 1572 | added.append(fn) |
|
1572 | 1573 | removed = mf1.keys() |
|
1573 | 1574 | |
|
1574 | 1575 | if working and modified and not self.dirstate._checklink: |
|
1575 | 1576 | # Symlink placeholders may get non-symlink-like contents |
|
1576 | 1577 | # via user error or dereferencing by NFS or Samba servers, |
|
1577 | 1578 | # so we filter out any placeholders that don't look like a |
|
1578 | 1579 | # symlink |
|
1579 | 1580 | sane = [] |
|
1580 | 1581 | for f in modified: |
|
1581 | 1582 | if ctx2.flags(f) == 'l': |
|
1582 | 1583 | d = ctx2[f].data() |
|
1583 | 1584 | if d == '' or len(d) >= 1024 or '\n' in d or util.binary(d): |
|
1584 | 1585 | self.ui.debug('ignoring suspect symlink placeholder' |
|
1585 | 1586 | ' "%s"\n' % f) |
|
1586 | 1587 | continue |
|
1587 | 1588 | sane.append(f) |
|
1588 | 1589 | modified = sane |
|
1589 | 1590 | |
|
1590 | 1591 | r = modified, added, removed, deleted, unknown, ignored, clean |
|
1591 | 1592 | |
|
1592 | 1593 | if listsubrepos: |
|
1593 | 1594 | for subpath, sub in scmutil.itersubrepos(ctx1, ctx2): |
|
1594 | 1595 | if working: |
|
1595 | 1596 | rev2 = None |
|
1596 | 1597 | else: |
|
1597 | 1598 | rev2 = ctx2.substate[subpath][1] |
|
1598 | 1599 | try: |
|
1599 | 1600 | submatch = matchmod.narrowmatcher(subpath, match) |
|
1600 | 1601 | s = sub.status(rev2, match=submatch, ignored=listignored, |
|
1601 | 1602 | clean=listclean, unknown=listunknown, |
|
1602 | 1603 | listsubrepos=True) |
|
1603 | 1604 | for rfiles, sfiles in zip(r, s): |
|
1604 | 1605 | rfiles.extend("%s/%s" % (subpath, f) for f in sfiles) |
|
1605 | 1606 | except error.LookupError: |
|
1606 | 1607 | self.ui.status(_("skipping missing subrepository: %s\n") |
|
1607 | 1608 | % subpath) |
|
1608 | 1609 | |
|
1609 | 1610 | for l in r: |
|
1610 | 1611 | l.sort() |
|
1611 | 1612 | return r |
|
1612 | 1613 | |
|
1613 | 1614 | def heads(self, start=None): |
|
1614 | 1615 | heads = self.changelog.heads(start) |
|
1615 | 1616 | # sort the output in rev descending order |
|
1616 | 1617 | return sorted(heads, key=self.changelog.rev, reverse=True) |
|
1617 | 1618 | |
|
1618 | 1619 | def branchheads(self, branch=None, start=None, closed=False): |
|
1619 | 1620 | '''return a (possibly filtered) list of heads for the given branch |
|
1620 | 1621 | |
|
1621 | 1622 | Heads are returned in topological order, from newest to oldest. |
|
1622 | 1623 | If branch is None, use the dirstate branch. |
|
1623 | 1624 | If start is not None, return only heads reachable from start. |
|
1624 | 1625 | If closed is True, return heads that are marked as closed as well. |
|
1625 | 1626 | ''' |
|
1626 | 1627 | if branch is None: |
|
1627 | 1628 | branch = self[None].branch() |
|
1628 | 1629 | branches = self.branchmap() |
|
1629 | 1630 | if branch not in branches: |
|
1630 | 1631 | return [] |
|
1631 | 1632 | # the cache returns heads ordered lowest to highest |
|
1632 | 1633 | bheads = list(reversed(branches.branchheads(branch, closed=closed))) |
|
1633 | 1634 | if start is not None: |
|
1634 | 1635 | # filter out the heads that cannot be reached from startrev |
|
1635 | 1636 | fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) |
|
1636 | 1637 | bheads = [h for h in bheads if h in fbheads] |
|
1637 | 1638 | return bheads |
|
1638 | 1639 | |
|
1639 | 1640 | def branches(self, nodes): |
|
1640 | 1641 | if not nodes: |
|
1641 | 1642 | nodes = [self.changelog.tip()] |
|
1642 | 1643 | b = [] |
|
1643 | 1644 | for n in nodes: |
|
1644 | 1645 | t = n |
|
1645 | 1646 | while True: |
|
1646 | 1647 | p = self.changelog.parents(n) |
|
1647 | 1648 | if p[1] != nullid or p[0] == nullid: |
|
1648 | 1649 | b.append((t, n, p[0], p[1])) |
|
1649 | 1650 | break |
|
1650 | 1651 | n = p[0] |
|
1651 | 1652 | return b |
|
1652 | 1653 | |
|
1653 | 1654 | def between(self, pairs): |
|
1654 | 1655 | r = [] |
|
1655 | 1656 | |
|
1656 | 1657 | for top, bottom in pairs: |
|
1657 | 1658 | n, l, i = top, [], 0 |
|
1658 | 1659 | f = 1 |
|
1659 | 1660 | |
|
1660 | 1661 | while n != bottom and n != nullid: |
|
1661 | 1662 | p = self.changelog.parents(n)[0] |
|
1662 | 1663 | if i == f: |
|
1663 | 1664 | l.append(n) |
|
1664 | 1665 | f = f * 2 |
|
1665 | 1666 | n = p |
|
1666 | 1667 | i += 1 |
|
1667 | 1668 | |
|
1668 | 1669 | r.append(l) |
|
1669 | 1670 | |
|
1670 | 1671 | return r |
|
1671 | 1672 | |
|
1672 | 1673 | def pull(self, remote, heads=None, force=False): |
|
1673 | 1674 | return exchange.pull (self, remote, heads, force) |
|
1674 | 1675 | |
|
1675 | 1676 | def checkpush(self, force, revs): |
|
1676 | 1677 | """Extensions can override this function if additional checks have |
|
1677 | 1678 | to be performed before pushing, or call it if they override push |
|
1678 | 1679 | command. |
|
1679 | 1680 | """ |
|
1680 | 1681 | pass |
|
1681 | 1682 | |
|
1682 | 1683 | def push(self, remote, force=False, revs=None, newbranch=False): |
|
1683 | 1684 | return exchange.push(self, remote, force, revs, newbranch) |
|
1684 | 1685 | |
|
1685 | 1686 | def changegroupinfo(self, nodes, source): |
|
1686 | 1687 | if self.ui.verbose or source == 'bundle': |
|
1687 | 1688 | self.ui.status(_("%d changesets found\n") % len(nodes)) |
|
1688 | 1689 | if self.ui.debugflag: |
|
1689 | 1690 | self.ui.debug("list of changesets:\n") |
|
1690 | 1691 | for node in nodes: |
|
1691 | 1692 | self.ui.debug("%s\n" % hex(node)) |
|
1692 | 1693 | |
|
1693 | 1694 | def changegroupsubset(self, roots, heads, source): |
|
1694 | 1695 | """Compute a changegroup consisting of all the nodes that are |
|
1695 | 1696 | descendants of any of the roots and ancestors of any of the heads. |
|
1696 | 1697 | Return a chunkbuffer object whose read() method will return |
|
1697 | 1698 | successive changegroup chunks. |
|
1698 | 1699 | |
|
1699 | 1700 | It is fairly complex as determining which filenodes and which |
|
1700 | 1701 | manifest nodes need to be included for the changeset to be complete |
|
1701 | 1702 | is non-trivial. |
|
1702 | 1703 | |
|
1703 | 1704 | Another wrinkle is doing the reverse, figuring out which changeset in |
|
1704 | 1705 | the changegroup a particular filenode or manifestnode belongs to. |
|
1705 | 1706 | """ |
|
1706 | 1707 | cl = self.changelog |
|
1707 | 1708 | if not roots: |
|
1708 | 1709 | roots = [nullid] |
|
1709 | 1710 | # TODO: remove call to nodesbetween. |
|
1710 | 1711 | csets, roots, heads = cl.nodesbetween(roots, heads) |
|
1711 | 1712 | discbases = [] |
|
1712 | 1713 | for n in roots: |
|
1713 | 1714 | discbases.extend([p for p in cl.parents(n) if p != nullid]) |
|
1714 | 1715 | outgoing = discovery.outgoing(cl, discbases, heads) |
|
1715 | 1716 | bundler = changegroup.bundle10(self) |
|
1716 | 1717 | return self._changegroupsubset(outgoing, bundler, source) |
|
1717 | 1718 | |
|
1718 | 1719 | def getlocalbundle(self, source, outgoing, bundlecaps=None): |
|
1719 | 1720 | """Like getbundle, but taking a discovery.outgoing as an argument. |
|
1720 | 1721 | |
|
1721 | 1722 | This is only implemented for local repos and reuses potentially |
|
1722 | 1723 | precomputed sets in outgoing.""" |
|
1723 | 1724 | if not outgoing.missing: |
|
1724 | 1725 | return None |
|
1725 | 1726 | bundler = changegroup.bundle10(self, bundlecaps) |
|
1726 | 1727 | return self._changegroupsubset(outgoing, bundler, source) |
|
1727 | 1728 | |
|
1728 | 1729 | def getbundle(self, source, heads=None, common=None, bundlecaps=None): |
|
1729 | 1730 | """Like changegroupsubset, but returns the set difference between the |
|
1730 | 1731 | ancestors of heads and the ancestors common. |
|
1731 | 1732 | |
|
1732 | 1733 | If heads is None, use the local heads. If common is None, use [nullid]. |
|
1733 | 1734 | |
|
1734 | 1735 | The nodes in common might not all be known locally due to the way the |
|
1735 | 1736 | current discovery protocol works. |
|
1736 | 1737 | """ |
|
1737 | 1738 | cl = self.changelog |
|
1738 | 1739 | if common: |
|
1739 | 1740 | hasnode = cl.hasnode |
|
1740 | 1741 | common = [n for n in common if hasnode(n)] |
|
1741 | 1742 | else: |
|
1742 | 1743 | common = [nullid] |
|
1743 | 1744 | if not heads: |
|
1744 | 1745 | heads = cl.heads() |
|
1745 | 1746 | return self.getlocalbundle(source, |
|
1746 | 1747 | discovery.outgoing(cl, common, heads), |
|
1747 | 1748 | bundlecaps=bundlecaps) |
|
1748 | 1749 | |
|
1749 | 1750 | @unfilteredmethod |
|
1750 | 1751 | def _changegroupsubset(self, outgoing, bundler, source, |
|
1751 | 1752 | fastpath=False): |
|
1752 | 1753 | commonrevs = outgoing.common |
|
1753 | 1754 | csets = outgoing.missing |
|
1754 | 1755 | heads = outgoing.missingheads |
|
1755 | 1756 | # We go through the fast path if we get told to, or if all (unfiltered |
|
1756 | 1757 | # heads have been requested (since we then know there all linkrevs will |
|
1757 | 1758 | # be pulled by the client). |
|
1758 | 1759 | heads.sort() |
|
1759 | 1760 | fastpathlinkrev = fastpath or ( |
|
1760 | 1761 | self.filtername is None and heads == sorted(self.heads())) |
|
1761 | 1762 | |
|
1762 | 1763 | self.hook('preoutgoing', throw=True, source=source) |
|
1763 | 1764 | self.changegroupinfo(csets, source) |
|
1764 | 1765 | gengroup = bundler.generate(commonrevs, csets, fastpathlinkrev, source) |
|
1765 | 1766 | return changegroup.unbundle10(util.chunkbuffer(gengroup), 'UN') |
|
1766 | 1767 | |
|
1767 | 1768 | def changegroup(self, basenodes, source): |
|
1768 | 1769 | # to avoid a race we use changegroupsubset() (issue1320) |
|
1769 | 1770 | return self.changegroupsubset(basenodes, self.heads(), source) |
|
1770 | 1771 | |
|
1771 | 1772 | @unfilteredmethod |
|
1772 | 1773 | def addchangegroup(self, source, srctype, url, emptyok=False): |
|
1773 | 1774 | """Add the changegroup returned by source.read() to this repo. |
|
1774 | 1775 | srctype is a string like 'push', 'pull', or 'unbundle'. url is |
|
1775 | 1776 | the URL of the repo where this changegroup is coming from. |
|
1776 | 1777 | |
|
1777 | 1778 | Return an integer summarizing the change to this repo: |
|
1778 | 1779 | - nothing changed or no source: 0 |
|
1779 | 1780 | - more heads than before: 1+added heads (2..n) |
|
1780 | 1781 | - fewer heads than before: -1-removed heads (-2..-n) |
|
1781 | 1782 | - number of heads stays the same: 1 |
|
1782 | 1783 | """ |
|
1783 | 1784 | def csmap(x): |
|
1784 | 1785 | self.ui.debug("add changeset %s\n" % short(x)) |
|
1785 | 1786 | return len(cl) |
|
1786 | 1787 | |
|
1787 | 1788 | def revmap(x): |
|
1788 | 1789 | return cl.rev(x) |
|
1789 | 1790 | |
|
1790 | 1791 | if not source: |
|
1791 | 1792 | return 0 |
|
1792 | 1793 | |
|
1793 | 1794 | self.hook('prechangegroup', throw=True, source=srctype, url=url) |
|
1794 | 1795 | |
|
1795 | 1796 | changesets = files = revisions = 0 |
|
1796 | 1797 | efiles = set() |
|
1797 | 1798 | |
|
1798 | 1799 | # write changelog data to temp files so concurrent readers will not see |
|
1799 | 1800 | # inconsistent view |
|
1800 | 1801 | cl = self.changelog |
|
1801 | 1802 | cl.delayupdate() |
|
1802 | 1803 | oldheads = cl.heads() |
|
1803 | 1804 | |
|
1804 | 1805 | tr = self.transaction("\n".join([srctype, util.hidepassword(url)])) |
|
1805 | 1806 | try: |
|
1806 | 1807 | trp = weakref.proxy(tr) |
|
1807 | 1808 | # pull off the changeset group |
|
1808 | 1809 | self.ui.status(_("adding changesets\n")) |
|
1809 | 1810 | clstart = len(cl) |
|
1810 | 1811 | class prog(object): |
|
1811 | 1812 | step = _('changesets') |
|
1812 | 1813 | count = 1 |
|
1813 | 1814 | ui = self.ui |
|
1814 | 1815 | total = None |
|
1815 | 1816 | def __call__(self): |
|
1816 | 1817 | self.ui.progress(self.step, self.count, unit=_('chunks'), |
|
1817 | 1818 | total=self.total) |
|
1818 | 1819 | self.count += 1 |
|
1819 | 1820 | pr = prog() |
|
1820 | 1821 | source.callback = pr |
|
1821 | 1822 | |
|
1822 | 1823 | source.changelogheader() |
|
1823 | 1824 | srccontent = cl.addgroup(source, csmap, trp) |
|
1824 | 1825 | if not (srccontent or emptyok): |
|
1825 | 1826 | raise util.Abort(_("received changelog group is empty")) |
|
1826 | 1827 | clend = len(cl) |
|
1827 | 1828 | changesets = clend - clstart |
|
1828 | 1829 | for c in xrange(clstart, clend): |
|
1829 | 1830 | efiles.update(self[c].files()) |
|
1830 | 1831 | efiles = len(efiles) |
|
1831 | 1832 | self.ui.progress(_('changesets'), None) |
|
1832 | 1833 | |
|
1833 | 1834 | # pull off the manifest group |
|
1834 | 1835 | self.ui.status(_("adding manifests\n")) |
|
1835 | 1836 | pr.step = _('manifests') |
|
1836 | 1837 | pr.count = 1 |
|
1837 | 1838 | pr.total = changesets # manifests <= changesets |
|
1838 | 1839 | # no need to check for empty manifest group here: |
|
1839 | 1840 | # if the result of the merge of 1 and 2 is the same in 3 and 4, |
|
1840 | 1841 | # no new manifest will be created and the manifest group will |
|
1841 | 1842 | # be empty during the pull |
|
1842 | 1843 | source.manifestheader() |
|
1843 | 1844 | self.manifest.addgroup(source, revmap, trp) |
|
1844 | 1845 | self.ui.progress(_('manifests'), None) |
|
1845 | 1846 | |
|
1846 | 1847 | needfiles = {} |
|
1847 | 1848 | if self.ui.configbool('server', 'validate', default=False): |
|
1848 | 1849 | # validate incoming csets have their manifests |
|
1849 | 1850 | for cset in xrange(clstart, clend): |
|
1850 | 1851 | mfest = self.changelog.read(self.changelog.node(cset))[0] |
|
1851 | 1852 | mfest = self.manifest.readdelta(mfest) |
|
1852 | 1853 | # store file nodes we must see |
|
1853 | 1854 | for f, n in mfest.iteritems(): |
|
1854 | 1855 | needfiles.setdefault(f, set()).add(n) |
|
1855 | 1856 | |
|
1856 | 1857 | # process the files |
|
1857 | 1858 | self.ui.status(_("adding file changes\n")) |
|
1858 | 1859 | pr.step = _('files') |
|
1859 | 1860 | pr.count = 1 |
|
1860 | 1861 | pr.total = efiles |
|
1861 | 1862 | source.callback = None |
|
1862 | 1863 | |
|
1863 | 1864 | newrevs, newfiles = self.addchangegroupfiles(source, revmap, trp, |
|
1864 | 1865 | pr, needfiles) |
|
1865 | 1866 | revisions += newrevs |
|
1866 | 1867 | files += newfiles |
|
1867 | 1868 | |
|
1868 | 1869 | dh = 0 |
|
1869 | 1870 | if oldheads: |
|
1870 | 1871 | heads = cl.heads() |
|
1871 | 1872 | dh = len(heads) - len(oldheads) |
|
1872 | 1873 | for h in heads: |
|
1873 | 1874 | if h not in oldheads and self[h].closesbranch(): |
|
1874 | 1875 | dh -= 1 |
|
1875 | 1876 | htext = "" |
|
1876 | 1877 | if dh: |
|
1877 | 1878 | htext = _(" (%+d heads)") % dh |
|
1878 | 1879 | |
|
1879 | 1880 | self.ui.status(_("added %d changesets" |
|
1880 | 1881 | " with %d changes to %d files%s\n") |
|
1881 | 1882 | % (changesets, revisions, files, htext)) |
|
1882 | 1883 | self.invalidatevolatilesets() |
|
1883 | 1884 | |
|
1884 | 1885 | if changesets > 0: |
|
1885 | 1886 | p = lambda: cl.writepending() and self.root or "" |
|
1886 | 1887 | self.hook('pretxnchangegroup', throw=True, |
|
1887 | 1888 | node=hex(cl.node(clstart)), source=srctype, |
|
1888 | 1889 | url=url, pending=p) |
|
1889 | 1890 | |
|
1890 | 1891 | added = [cl.node(r) for r in xrange(clstart, clend)] |
|
1891 | 1892 | publishing = self.ui.configbool('phases', 'publish', True) |
|
1892 | 1893 | if srctype == 'push': |
|
1893 | 1894 | # Old servers can not push the boundary themselves. |
|
1894 | 1895 | # New servers won't push the boundary if changeset already |
|
1895 | 1896 | # exists locally as secret |
|
1896 | 1897 | # |
|
1897 | 1898 | # We should not use added here but the list of all change in |
|
1898 | 1899 | # the bundle |
|
1899 | 1900 | if publishing: |
|
1900 | 1901 | phases.advanceboundary(self, phases.public, srccontent) |
|
1901 | 1902 | else: |
|
1902 | 1903 | phases.advanceboundary(self, phases.draft, srccontent) |
|
1903 | 1904 | phases.retractboundary(self, phases.draft, added) |
|
1904 | 1905 | elif srctype != 'strip': |
|
1905 | 1906 | # publishing only alter behavior during push |
|
1906 | 1907 | # |
|
1907 | 1908 | # strip should not touch boundary at all |
|
1908 | 1909 | phases.retractboundary(self, phases.draft, added) |
|
1909 | 1910 | |
|
1910 | 1911 | # make changelog see real files again |
|
1911 | 1912 | cl.finalize(trp) |
|
1912 | 1913 | |
|
1913 | 1914 | tr.close() |
|
1914 | 1915 | |
|
1915 | 1916 | if changesets > 0: |
|
1916 | 1917 | if srctype != 'strip': |
|
1917 | 1918 | # During strip, branchcache is invalid but coming call to |
|
1918 | 1919 | # `destroyed` will repair it. |
|
1919 | 1920 | # In other case we can safely update cache on disk. |
|
1920 | 1921 | branchmap.updatecache(self.filtered('served')) |
|
1921 | 1922 | def runhooks(): |
|
1922 | 1923 | # These hooks run when the lock releases, not when the |
|
1923 | 1924 | # transaction closes. So it's possible for the changelog |
|
1924 | 1925 | # to have changed since we last saw it. |
|
1925 | 1926 | if clstart >= len(self): |
|
1926 | 1927 | return |
|
1927 | 1928 | |
|
1928 | 1929 | # forcefully update the on-disk branch cache |
|
1929 | 1930 | self.ui.debug("updating the branch cache\n") |
|
1930 | 1931 | self.hook("changegroup", node=hex(cl.node(clstart)), |
|
1931 | 1932 | source=srctype, url=url) |
|
1932 | 1933 | |
|
1933 | 1934 | for n in added: |
|
1934 | 1935 | self.hook("incoming", node=hex(n), source=srctype, |
|
1935 | 1936 | url=url) |
|
1936 | 1937 | |
|
1937 | 1938 | newheads = [h for h in self.heads() if h not in oldheads] |
|
1938 | 1939 | self.ui.log("incoming", |
|
1939 | 1940 | "%s incoming changes - new heads: %s\n", |
|
1940 | 1941 | len(added), |
|
1941 | 1942 | ', '.join([hex(c[:6]) for c in newheads])) |
|
1942 | 1943 | self._afterlock(runhooks) |
|
1943 | 1944 | |
|
1944 | 1945 | finally: |
|
1945 | 1946 | tr.release() |
|
1946 | 1947 | # never return 0 here: |
|
1947 | 1948 | if dh < 0: |
|
1948 | 1949 | return dh - 1 |
|
1949 | 1950 | else: |
|
1950 | 1951 | return dh + 1 |
|
1951 | 1952 | |
|
1952 | 1953 | def addchangegroupfiles(self, source, revmap, trp, pr, needfiles): |
|
1953 | 1954 | revisions = 0 |
|
1954 | 1955 | files = 0 |
|
1955 | 1956 | while True: |
|
1956 | 1957 | chunkdata = source.filelogheader() |
|
1957 | 1958 | if not chunkdata: |
|
1958 | 1959 | break |
|
1959 | 1960 | f = chunkdata["filename"] |
|
1960 | 1961 | self.ui.debug("adding %s revisions\n" % f) |
|
1961 | 1962 | pr() |
|
1962 | 1963 | fl = self.file(f) |
|
1963 | 1964 | o = len(fl) |
|
1964 | 1965 | if not fl.addgroup(source, revmap, trp): |
|
1965 | 1966 | raise util.Abort(_("received file revlog group is empty")) |
|
1966 | 1967 | revisions += len(fl) - o |
|
1967 | 1968 | files += 1 |
|
1968 | 1969 | if f in needfiles: |
|
1969 | 1970 | needs = needfiles[f] |
|
1970 | 1971 | for new in xrange(o, len(fl)): |
|
1971 | 1972 | n = fl.node(new) |
|
1972 | 1973 | if n in needs: |
|
1973 | 1974 | needs.remove(n) |
|
1974 | 1975 | else: |
|
1975 | 1976 | raise util.Abort( |
|
1976 | 1977 | _("received spurious file revlog entry")) |
|
1977 | 1978 | if not needs: |
|
1978 | 1979 | del needfiles[f] |
|
1979 | 1980 | self.ui.progress(_('files'), None) |
|
1980 | 1981 | |
|
1981 | 1982 | for f, needs in needfiles.iteritems(): |
|
1982 | 1983 | fl = self.file(f) |
|
1983 | 1984 | for n in needs: |
|
1984 | 1985 | try: |
|
1985 | 1986 | fl.rev(n) |
|
1986 | 1987 | except error.LookupError: |
|
1987 | 1988 | raise util.Abort( |
|
1988 | 1989 | _('missing file data for %s:%s - run hg verify') % |
|
1989 | 1990 | (f, hex(n))) |
|
1990 | 1991 | |
|
1991 | 1992 | return revisions, files |
|
1992 | 1993 | |
|
1993 | 1994 | def stream_in(self, remote, requirements): |
|
1994 | 1995 | lock = self.lock() |
|
1995 | 1996 | try: |
|
1996 | 1997 | # Save remote branchmap. We will use it later |
|
1997 | 1998 | # to speed up branchcache creation |
|
1998 | 1999 | rbranchmap = None |
|
1999 | 2000 | if remote.capable("branchmap"): |
|
2000 | 2001 | rbranchmap = remote.branchmap() |
|
2001 | 2002 | |
|
2002 | 2003 | fp = remote.stream_out() |
|
2003 | 2004 | l = fp.readline() |
|
2004 | 2005 | try: |
|
2005 | 2006 | resp = int(l) |
|
2006 | 2007 | except ValueError: |
|
2007 | 2008 | raise error.ResponseError( |
|
2008 | 2009 | _('unexpected response from remote server:'), l) |
|
2009 | 2010 | if resp == 1: |
|
2010 | 2011 | raise util.Abort(_('operation forbidden by server')) |
|
2011 | 2012 | elif resp == 2: |
|
2012 | 2013 | raise util.Abort(_('locking the remote repository failed')) |
|
2013 | 2014 | elif resp != 0: |
|
2014 | 2015 | raise util.Abort(_('the server sent an unknown error code')) |
|
2015 | 2016 | self.ui.status(_('streaming all changes\n')) |
|
2016 | 2017 | l = fp.readline() |
|
2017 | 2018 | try: |
|
2018 | 2019 | total_files, total_bytes = map(int, l.split(' ', 1)) |
|
2019 | 2020 | except (ValueError, TypeError): |
|
2020 | 2021 | raise error.ResponseError( |
|
2021 | 2022 | _('unexpected response from remote server:'), l) |
|
2022 | 2023 | self.ui.status(_('%d files to transfer, %s of data\n') % |
|
2023 | 2024 | (total_files, util.bytecount(total_bytes))) |
|
2024 | 2025 | handled_bytes = 0 |
|
2025 | 2026 | self.ui.progress(_('clone'), 0, total=total_bytes) |
|
2026 | 2027 | start = time.time() |
|
2027 | 2028 | |
|
2028 | 2029 | tr = self.transaction(_('clone')) |
|
2029 | 2030 | try: |
|
2030 | 2031 | for i in xrange(total_files): |
|
2031 | 2032 | # XXX doesn't support '\n' or '\r' in filenames |
|
2032 | 2033 | l = fp.readline() |
|
2033 | 2034 | try: |
|
2034 | 2035 | name, size = l.split('\0', 1) |
|
2035 | 2036 | size = int(size) |
|
2036 | 2037 | except (ValueError, TypeError): |
|
2037 | 2038 | raise error.ResponseError( |
|
2038 | 2039 | _('unexpected response from remote server:'), l) |
|
2039 | 2040 | if self.ui.debugflag: |
|
2040 | 2041 | self.ui.debug('adding %s (%s)\n' % |
|
2041 | 2042 | (name, util.bytecount(size))) |
|
2042 | 2043 | # for backwards compat, name was partially encoded |
|
2043 | 2044 | ofp = self.sopener(store.decodedir(name), 'w') |
|
2044 | 2045 | for chunk in util.filechunkiter(fp, limit=size): |
|
2045 | 2046 | handled_bytes += len(chunk) |
|
2046 | 2047 | self.ui.progress(_('clone'), handled_bytes, |
|
2047 | 2048 | total=total_bytes) |
|
2048 | 2049 | ofp.write(chunk) |
|
2049 | 2050 | ofp.close() |
|
2050 | 2051 | tr.close() |
|
2051 | 2052 | finally: |
|
2052 | 2053 | tr.release() |
|
2053 | 2054 | |
|
2054 | 2055 | # Writing straight to files circumvented the inmemory caches |
|
2055 | 2056 | self.invalidate() |
|
2056 | 2057 | |
|
2057 | 2058 | elapsed = time.time() - start |
|
2058 | 2059 | if elapsed <= 0: |
|
2059 | 2060 | elapsed = 0.001 |
|
2060 | 2061 | self.ui.progress(_('clone'), None) |
|
2061 | 2062 | self.ui.status(_('transferred %s in %.1f seconds (%s/sec)\n') % |
|
2062 | 2063 | (util.bytecount(total_bytes), elapsed, |
|
2063 | 2064 | util.bytecount(total_bytes / elapsed))) |
|
2064 | 2065 | |
|
2065 | 2066 | # new requirements = old non-format requirements + |
|
2066 | 2067 | # new format-related |
|
2067 | 2068 | # requirements from the streamed-in repository |
|
2068 | 2069 | requirements.update(set(self.requirements) - self.supportedformats) |
|
2069 | 2070 | self._applyrequirements(requirements) |
|
2070 | 2071 | self._writerequirements() |
|
2071 | 2072 | |
|
2072 | 2073 | if rbranchmap: |
|
2073 | 2074 | rbheads = [] |
|
2074 | 2075 | for bheads in rbranchmap.itervalues(): |
|
2075 | 2076 | rbheads.extend(bheads) |
|
2076 | 2077 | |
|
2077 | 2078 | if rbheads: |
|
2078 | 2079 | rtiprev = max((int(self.changelog.rev(node)) |
|
2079 | 2080 | for node in rbheads)) |
|
2080 | 2081 | cache = branchmap.branchcache(rbranchmap, |
|
2081 | 2082 | self[rtiprev].node(), |
|
2082 | 2083 | rtiprev) |
|
2083 | 2084 | # Try to stick it as low as possible |
|
2084 | 2085 | # filter above served are unlikely to be fetch from a clone |
|
2085 | 2086 | for candidate in ('base', 'immutable', 'served'): |
|
2086 | 2087 | rview = self.filtered(candidate) |
|
2087 | 2088 | if cache.validfor(rview): |
|
2088 | 2089 | self._branchcaches[candidate] = cache |
|
2089 | 2090 | cache.write(rview) |
|
2090 | 2091 | break |
|
2091 | 2092 | self.invalidate() |
|
2092 | 2093 | return len(self.heads()) + 1 |
|
2093 | 2094 | finally: |
|
2094 | 2095 | lock.release() |
|
2095 | 2096 | |
|
2096 | 2097 | def clone(self, remote, heads=[], stream=False): |
|
2097 | 2098 | '''clone remote repository. |
|
2098 | 2099 | |
|
2099 | 2100 | keyword arguments: |
|
2100 | 2101 | heads: list of revs to clone (forces use of pull) |
|
2101 | 2102 | stream: use streaming clone if possible''' |
|
2102 | 2103 | |
|
2103 | 2104 | # now, all clients that can request uncompressed clones can |
|
2104 | 2105 | # read repo formats supported by all servers that can serve |
|
2105 | 2106 | # them. |
|
2106 | 2107 | |
|
2107 | 2108 | # if revlog format changes, client will have to check version |
|
2108 | 2109 | # and format flags on "stream" capability, and use |
|
2109 | 2110 | # uncompressed only if compatible. |
|
2110 | 2111 | |
|
2111 | 2112 | if not stream: |
|
2112 | 2113 | # if the server explicitly prefers to stream (for fast LANs) |
|
2113 | 2114 | stream = remote.capable('stream-preferred') |
|
2114 | 2115 | |
|
2115 | 2116 | if stream and not heads: |
|
2116 | 2117 | # 'stream' means remote revlog format is revlogv1 only |
|
2117 | 2118 | if remote.capable('stream'): |
|
2118 | 2119 | return self.stream_in(remote, set(('revlogv1',))) |
|
2119 | 2120 | # otherwise, 'streamreqs' contains the remote revlog format |
|
2120 | 2121 | streamreqs = remote.capable('streamreqs') |
|
2121 | 2122 | if streamreqs: |
|
2122 | 2123 | streamreqs = set(streamreqs.split(',')) |
|
2123 | 2124 | # if we support it, stream in and adjust our requirements |
|
2124 | 2125 | if not streamreqs - self.supportedformats: |
|
2125 | 2126 | return self.stream_in(remote, streamreqs) |
|
2126 | 2127 | return self.pull(remote, heads) |
|
2127 | 2128 | |
|
2128 | 2129 | def pushkey(self, namespace, key, old, new): |
|
2129 | 2130 | self.hook('prepushkey', throw=True, namespace=namespace, key=key, |
|
2130 | 2131 | old=old, new=new) |
|
2131 | 2132 | self.ui.debug('pushing key for "%s:%s"\n' % (namespace, key)) |
|
2132 | 2133 | ret = pushkey.push(self, namespace, key, old, new) |
|
2133 | 2134 | self.hook('pushkey', namespace=namespace, key=key, old=old, new=new, |
|
2134 | 2135 | ret=ret) |
|
2135 | 2136 | return ret |
|
2136 | 2137 | |
|
2137 | 2138 | def listkeys(self, namespace): |
|
2138 | 2139 | self.hook('prelistkeys', throw=True, namespace=namespace) |
|
2139 | 2140 | self.ui.debug('listing keys for "%s"\n' % namespace) |
|
2140 | 2141 | values = pushkey.list(self, namespace) |
|
2141 | 2142 | self.hook('listkeys', namespace=namespace, values=values) |
|
2142 | 2143 | return values |
|
2143 | 2144 | |
|
2144 | 2145 | def debugwireargs(self, one, two, three=None, four=None, five=None): |
|
2145 | 2146 | '''used to test argument passing over the wire''' |
|
2146 | 2147 | return "%s %s %s %s %s" % (one, two, three, four, five) |
|
2147 | 2148 | |
|
2148 | 2149 | def savecommitmessage(self, text): |
|
2149 | 2150 | fp = self.opener('last-message.txt', 'wb') |
|
2150 | 2151 | try: |
|
2151 | 2152 | fp.write(text) |
|
2152 | 2153 | finally: |
|
2153 | 2154 | fp.close() |
|
2154 | 2155 | return self.pathto(fp.name[len(self.root) + 1:]) |
|
2155 | 2156 | |
|
2156 | 2157 | # used to avoid circular references so destructors work |
|
2157 | 2158 | def aftertrans(files): |
|
2158 | 2159 | renamefiles = [tuple(t) for t in files] |
|
2159 | 2160 | def a(): |
|
2160 | 2161 | for vfs, src, dest in renamefiles: |
|
2161 | 2162 | try: |
|
2162 | 2163 | vfs.rename(src, dest) |
|
2163 | 2164 | except OSError: # journal file does not yet exist |
|
2164 | 2165 | pass |
|
2165 | 2166 | return a |
|
2166 | 2167 | |
|
2167 | 2168 | def undoname(fn): |
|
2168 | 2169 | base, name = os.path.split(fn) |
|
2169 | 2170 | assert name.startswith('journal') |
|
2170 | 2171 | return os.path.join(base, name.replace('journal', 'undo', 1)) |
|
2171 | 2172 | |
|
2172 | 2173 | def instance(ui, path, create): |
|
2173 | 2174 | return localrepository(ui, util.urllocalpath(path), create) |
|
2174 | 2175 | |
|
2175 | 2176 | def islocal(path): |
|
2176 | 2177 | return True |
@@ -1,523 +1,529 b'' | |||
|
1 | 1 | # store.py - repository store handling for Mercurial |
|
2 | 2 | # |
|
3 | 3 | # Copyright 2008 Matt Mackall <mpm@selenic.com> |
|
4 | 4 | # |
|
5 | 5 | # This software may be used and distributed according to the terms of the |
|
6 | 6 | # GNU General Public License version 2 or any later version. |
|
7 | 7 | |
|
8 | 8 | from i18n import _ |
|
9 | 9 | import scmutil, util, parsers |
|
10 | 10 | import os, stat, errno |
|
11 | 11 | |
|
12 | 12 | _sha = util.sha1 |
|
13 | 13 | |
|
14 | 14 | # This avoids a collision between a file named foo and a dir named |
|
15 | 15 | # foo.i or foo.d |
|
16 | 16 | def _encodedir(path): |
|
17 | 17 | ''' |
|
18 | 18 | >>> _encodedir('data/foo.i') |
|
19 | 19 | 'data/foo.i' |
|
20 | 20 | >>> _encodedir('data/foo.i/bla.i') |
|
21 | 21 | 'data/foo.i.hg/bla.i' |
|
22 | 22 | >>> _encodedir('data/foo.i.hg/bla.i') |
|
23 | 23 | 'data/foo.i.hg.hg/bla.i' |
|
24 | 24 | >>> _encodedir('data/foo.i\\ndata/foo.i/bla.i\\ndata/foo.i.hg/bla.i\\n') |
|
25 | 25 | 'data/foo.i\\ndata/foo.i.hg/bla.i\\ndata/foo.i.hg.hg/bla.i\\n' |
|
26 | 26 | ''' |
|
27 | 27 | return (path |
|
28 | 28 | .replace(".hg/", ".hg.hg/") |
|
29 | 29 | .replace(".i/", ".i.hg/") |
|
30 | 30 | .replace(".d/", ".d.hg/")) |
|
31 | 31 | |
|
32 | 32 | encodedir = getattr(parsers, 'encodedir', _encodedir) |
|
33 | 33 | |
|
34 | 34 | def decodedir(path): |
|
35 | 35 | ''' |
|
36 | 36 | >>> decodedir('data/foo.i') |
|
37 | 37 | 'data/foo.i' |
|
38 | 38 | >>> decodedir('data/foo.i.hg/bla.i') |
|
39 | 39 | 'data/foo.i/bla.i' |
|
40 | 40 | >>> decodedir('data/foo.i.hg.hg/bla.i') |
|
41 | 41 | 'data/foo.i.hg/bla.i' |
|
42 | 42 | ''' |
|
43 | 43 | if ".hg/" not in path: |
|
44 | 44 | return path |
|
45 | 45 | return (path |
|
46 | 46 | .replace(".d.hg/", ".d/") |
|
47 | 47 | .replace(".i.hg/", ".i/") |
|
48 | 48 | .replace(".hg.hg/", ".hg/")) |
|
49 | 49 | |
|
50 | 50 | def _buildencodefun(): |
|
51 | 51 | ''' |
|
52 | 52 | >>> enc, dec = _buildencodefun() |
|
53 | 53 | |
|
54 | 54 | >>> enc('nothing/special.txt') |
|
55 | 55 | 'nothing/special.txt' |
|
56 | 56 | >>> dec('nothing/special.txt') |
|
57 | 57 | 'nothing/special.txt' |
|
58 | 58 | |
|
59 | 59 | >>> enc('HELLO') |
|
60 | 60 | '_h_e_l_l_o' |
|
61 | 61 | >>> dec('_h_e_l_l_o') |
|
62 | 62 | 'HELLO' |
|
63 | 63 | |
|
64 | 64 | >>> enc('hello:world?') |
|
65 | 65 | 'hello~3aworld~3f' |
|
66 | 66 | >>> dec('hello~3aworld~3f') |
|
67 | 67 | 'hello:world?' |
|
68 | 68 | |
|
69 | 69 | >>> enc('the\x07quick\xADshot') |
|
70 | 70 | 'the~07quick~adshot' |
|
71 | 71 | >>> dec('the~07quick~adshot') |
|
72 | 72 | 'the\\x07quick\\xadshot' |
|
73 | 73 | ''' |
|
74 | 74 | e = '_' |
|
75 | 75 | winreserved = [ord(x) for x in '\\:*?"<>|'] |
|
76 | 76 | cmap = dict([(chr(x), chr(x)) for x in xrange(127)]) |
|
77 | 77 | for x in (range(32) + range(126, 256) + winreserved): |
|
78 | 78 | cmap[chr(x)] = "~%02x" % x |
|
79 | 79 | for x in range(ord("A"), ord("Z") + 1) + [ord(e)]: |
|
80 | 80 | cmap[chr(x)] = e + chr(x).lower() |
|
81 | 81 | dmap = {} |
|
82 | 82 | for k, v in cmap.iteritems(): |
|
83 | 83 | dmap[v] = k |
|
84 | 84 | def decode(s): |
|
85 | 85 | i = 0 |
|
86 | 86 | while i < len(s): |
|
87 | 87 | for l in xrange(1, 4): |
|
88 | 88 | try: |
|
89 | 89 | yield dmap[s[i:i + l]] |
|
90 | 90 | i += l |
|
91 | 91 | break |
|
92 | 92 | except KeyError: |
|
93 | 93 | pass |
|
94 | 94 | else: |
|
95 | 95 | raise KeyError |
|
96 | 96 | return (lambda s: ''.join([cmap[c] for c in s]), |
|
97 | 97 | lambda s: ''.join(list(decode(s)))) |
|
98 | 98 | |
|
99 | 99 | _encodefname, _decodefname = _buildencodefun() |
|
100 | 100 | |
|
101 | 101 | def encodefilename(s): |
|
102 | 102 | ''' |
|
103 | 103 | >>> encodefilename('foo.i/bar.d/bla.hg/hi:world?/HELLO') |
|
104 | 104 | 'foo.i.hg/bar.d.hg/bla.hg.hg/hi~3aworld~3f/_h_e_l_l_o' |
|
105 | 105 | ''' |
|
106 | 106 | return _encodefname(encodedir(s)) |
|
107 | 107 | |
|
108 | 108 | def decodefilename(s): |
|
109 | 109 | ''' |
|
110 | 110 | >>> decodefilename('foo.i.hg/bar.d.hg/bla.hg.hg/hi~3aworld~3f/_h_e_l_l_o') |
|
111 | 111 | 'foo.i/bar.d/bla.hg/hi:world?/HELLO' |
|
112 | 112 | ''' |
|
113 | 113 | return decodedir(_decodefname(s)) |
|
114 | 114 | |
|
115 | 115 | def _buildlowerencodefun(): |
|
116 | 116 | ''' |
|
117 | 117 | >>> f = _buildlowerencodefun() |
|
118 | 118 | >>> f('nothing/special.txt') |
|
119 | 119 | 'nothing/special.txt' |
|
120 | 120 | >>> f('HELLO') |
|
121 | 121 | 'hello' |
|
122 | 122 | >>> f('hello:world?') |
|
123 | 123 | 'hello~3aworld~3f' |
|
124 | 124 | >>> f('the\x07quick\xADshot') |
|
125 | 125 | 'the~07quick~adshot' |
|
126 | 126 | ''' |
|
127 | 127 | winreserved = [ord(x) for x in '\\:*?"<>|'] |
|
128 | 128 | cmap = dict([(chr(x), chr(x)) for x in xrange(127)]) |
|
129 | 129 | for x in (range(32) + range(126, 256) + winreserved): |
|
130 | 130 | cmap[chr(x)] = "~%02x" % x |
|
131 | 131 | for x in range(ord("A"), ord("Z") + 1): |
|
132 | 132 | cmap[chr(x)] = chr(x).lower() |
|
133 | 133 | return lambda s: "".join([cmap[c] for c in s]) |
|
134 | 134 | |
|
135 | 135 | lowerencode = getattr(parsers, 'lowerencode', None) or _buildlowerencodefun() |
|
136 | 136 | |
|
137 | 137 | # Windows reserved names: con, prn, aux, nul, com1..com9, lpt1..lpt9 |
|
138 | 138 | _winres3 = ('aux', 'con', 'prn', 'nul') # length 3 |
|
139 | 139 | _winres4 = ('com', 'lpt') # length 4 (with trailing 1..9) |
|
140 | 140 | def _auxencode(path, dotencode): |
|
141 | 141 | ''' |
|
142 | 142 | Encodes filenames containing names reserved by Windows or which end in |
|
143 | 143 | period or space. Does not touch other single reserved characters c. |
|
144 | 144 | Specifically, c in '\\:*?"<>|' or ord(c) <= 31 are *not* encoded here. |
|
145 | 145 | Additionally encodes space or period at the beginning, if dotencode is |
|
146 | 146 | True. Parameter path is assumed to be all lowercase. |
|
147 | 147 | A segment only needs encoding if a reserved name appears as a |
|
148 | 148 | basename (e.g. "aux", "aux.foo"). A directory or file named "foo.aux" |
|
149 | 149 | doesn't need encoding. |
|
150 | 150 | |
|
151 | 151 | >>> s = '.foo/aux.txt/txt.aux/con/prn/nul/foo.' |
|
152 | 152 | >>> _auxencode(s.split('/'), True) |
|
153 | 153 | ['~2efoo', 'au~78.txt', 'txt.aux', 'co~6e', 'pr~6e', 'nu~6c', 'foo~2e'] |
|
154 | 154 | >>> s = '.com1com2/lpt9.lpt4.lpt1/conprn/com0/lpt0/foo.' |
|
155 | 155 | >>> _auxencode(s.split('/'), False) |
|
156 | 156 | ['.com1com2', 'lp~749.lpt4.lpt1', 'conprn', 'com0', 'lpt0', 'foo~2e'] |
|
157 | 157 | >>> _auxencode(['foo. '], True) |
|
158 | 158 | ['foo.~20'] |
|
159 | 159 | >>> _auxencode([' .foo'], True) |
|
160 | 160 | ['~20.foo'] |
|
161 | 161 | ''' |
|
162 | 162 | for i, n in enumerate(path): |
|
163 | 163 | if not n: |
|
164 | 164 | continue |
|
165 | 165 | if dotencode and n[0] in '. ': |
|
166 | 166 | n = "~%02x" % ord(n[0]) + n[1:] |
|
167 | 167 | path[i] = n |
|
168 | 168 | else: |
|
169 | 169 | l = n.find('.') |
|
170 | 170 | if l == -1: |
|
171 | 171 | l = len(n) |
|
172 | 172 | if ((l == 3 and n[:3] in _winres3) or |
|
173 | 173 | (l == 4 and n[3] <= '9' and n[3] >= '1' |
|
174 | 174 | and n[:3] in _winres4)): |
|
175 | 175 | # encode third letter ('aux' -> 'au~78') |
|
176 | 176 | ec = "~%02x" % ord(n[2]) |
|
177 | 177 | n = n[0:2] + ec + n[3:] |
|
178 | 178 | path[i] = n |
|
179 | 179 | if n[-1] in '. ': |
|
180 | 180 | # encode last period or space ('foo...' -> 'foo..~2e') |
|
181 | 181 | path[i] = n[:-1] + "~%02x" % ord(n[-1]) |
|
182 | 182 | return path |
|
183 | 183 | |
|
184 | 184 | _maxstorepathlen = 120 |
|
185 | 185 | _dirprefixlen = 8 |
|
186 | 186 | _maxshortdirslen = 8 * (_dirprefixlen + 1) - 4 |
|
187 | 187 | |
|
188 | 188 | def _hashencode(path, dotencode): |
|
189 | 189 | digest = _sha(path).hexdigest() |
|
190 | 190 | le = lowerencode(path).split('/')[1:] |
|
191 | 191 | parts = _auxencode(le, dotencode) |
|
192 | 192 | basename = parts[-1] |
|
193 | 193 | _root, ext = os.path.splitext(basename) |
|
194 | 194 | sdirs = [] |
|
195 | 195 | sdirslen = 0 |
|
196 | 196 | for p in parts[:-1]: |
|
197 | 197 | d = p[:_dirprefixlen] |
|
198 | 198 | if d[-1] in '. ': |
|
199 | 199 | # Windows can't access dirs ending in period or space |
|
200 | 200 | d = d[:-1] + '_' |
|
201 | 201 | if sdirslen == 0: |
|
202 | 202 | t = len(d) |
|
203 | 203 | else: |
|
204 | 204 | t = sdirslen + 1 + len(d) |
|
205 | 205 | if t > _maxshortdirslen: |
|
206 | 206 | break |
|
207 | 207 | sdirs.append(d) |
|
208 | 208 | sdirslen = t |
|
209 | 209 | dirs = '/'.join(sdirs) |
|
210 | 210 | if len(dirs) > 0: |
|
211 | 211 | dirs += '/' |
|
212 | 212 | res = 'dh/' + dirs + digest + ext |
|
213 | 213 | spaceleft = _maxstorepathlen - len(res) |
|
214 | 214 | if spaceleft > 0: |
|
215 | 215 | filler = basename[:spaceleft] |
|
216 | 216 | res = 'dh/' + dirs + filler + digest + ext |
|
217 | 217 | return res |
|
218 | 218 | |
|
219 | 219 | def _hybridencode(path, dotencode): |
|
220 | 220 | '''encodes path with a length limit |
|
221 | 221 | |
|
222 | 222 | Encodes all paths that begin with 'data/', according to the following. |
|
223 | 223 | |
|
224 | 224 | Default encoding (reversible): |
|
225 | 225 | |
|
226 | 226 | Encodes all uppercase letters 'X' as '_x'. All reserved or illegal |
|
227 | 227 | characters are encoded as '~xx', where xx is the two digit hex code |
|
228 | 228 | of the character (see encodefilename). |
|
229 | 229 | Relevant path components consisting of Windows reserved filenames are |
|
230 | 230 | masked by encoding the third character ('aux' -> 'au~78', see _auxencode). |
|
231 | 231 | |
|
232 | 232 | Hashed encoding (not reversible): |
|
233 | 233 | |
|
234 | 234 | If the default-encoded path is longer than _maxstorepathlen, a |
|
235 | 235 | non-reversible hybrid hashing of the path is done instead. |
|
236 | 236 | This encoding uses up to _dirprefixlen characters of all directory |
|
237 | 237 | levels of the lowerencoded path, but not more levels than can fit into |
|
238 | 238 | _maxshortdirslen. |
|
239 | 239 | Then follows the filler followed by the sha digest of the full path. |
|
240 | 240 | The filler is the beginning of the basename of the lowerencoded path |
|
241 | 241 | (the basename is everything after the last path separator). The filler |
|
242 | 242 | is as long as possible, filling in characters from the basename until |
|
243 | 243 | the encoded path has _maxstorepathlen characters (or all chars of the |
|
244 | 244 | basename have been taken). |
|
245 | 245 | The extension (e.g. '.i' or '.d') is preserved. |
|
246 | 246 | |
|
247 | 247 | The string 'data/' at the beginning is replaced with 'dh/', if the hashed |
|
248 | 248 | encoding was used. |
|
249 | 249 | ''' |
|
250 | 250 | path = encodedir(path) |
|
251 | 251 | ef = _encodefname(path).split('/') |
|
252 | 252 | res = '/'.join(_auxencode(ef, dotencode)) |
|
253 | 253 | if len(res) > _maxstorepathlen: |
|
254 | 254 | res = _hashencode(path, dotencode) |
|
255 | 255 | return res |
|
256 | 256 | |
|
257 | 257 | def _pathencode(path): |
|
258 | 258 | de = encodedir(path) |
|
259 | 259 | if len(path) > _maxstorepathlen: |
|
260 | 260 | return _hashencode(de, True) |
|
261 | 261 | ef = _encodefname(de).split('/') |
|
262 | 262 | res = '/'.join(_auxencode(ef, True)) |
|
263 | 263 | if len(res) > _maxstorepathlen: |
|
264 | 264 | return _hashencode(de, True) |
|
265 | 265 | return res |
|
266 | 266 | |
|
267 | 267 | _pathencode = getattr(parsers, 'pathencode', _pathencode) |
|
268 | 268 | |
|
269 | 269 | def _plainhybridencode(f): |
|
270 | 270 | return _hybridencode(f, False) |
|
271 | 271 | |
|
272 | 272 | def _calcmode(vfs): |
|
273 | 273 | try: |
|
274 | 274 | # files in .hg/ will be created using this mode |
|
275 | 275 | mode = vfs.stat().st_mode |
|
276 | 276 | # avoid some useless chmods |
|
277 | 277 | if (0777 & ~util.umask) == (0777 & mode): |
|
278 | 278 | mode = None |
|
279 | 279 | except OSError: |
|
280 | 280 | mode = None |
|
281 | 281 | return mode |
|
282 | 282 | |
|
283 | 283 | _data = ('data 00manifest.d 00manifest.i 00changelog.d 00changelog.i' |
|
284 | 284 | ' phaseroots obsstore') |
|
285 | 285 | |
|
286 | 286 | class basicstore(object): |
|
287 | 287 | '''base class for local repository stores''' |
|
288 | 288 | def __init__(self, path, vfstype): |
|
289 | 289 | vfs = vfstype(path) |
|
290 | 290 | self.path = vfs.base |
|
291 | 291 | self.createmode = _calcmode(vfs) |
|
292 | 292 | vfs.createmode = self.createmode |
|
293 | 293 | self.rawvfs = vfs |
|
294 | 294 | self.vfs = scmutil.filtervfs(vfs, encodedir) |
|
295 | 295 | self.opener = self.vfs |
|
296 | 296 | |
|
297 | 297 | def join(self, f): |
|
298 | 298 | return self.path + '/' + encodedir(f) |
|
299 | 299 | |
|
300 | 300 | def _walk(self, relpath, recurse): |
|
301 | 301 | '''yields (unencoded, encoded, size)''' |
|
302 | 302 | path = self.path |
|
303 | 303 | if relpath: |
|
304 | 304 | path += '/' + relpath |
|
305 | 305 | striplen = len(self.path) + 1 |
|
306 | 306 | l = [] |
|
307 | 307 | if self.rawvfs.isdir(path): |
|
308 | 308 | visit = [path] |
|
309 | 309 | readdir = self.rawvfs.readdir |
|
310 | 310 | while visit: |
|
311 | 311 | p = visit.pop() |
|
312 | 312 | for f, kind, st in readdir(p, stat=True): |
|
313 | 313 | fp = p + '/' + f |
|
314 | 314 | if kind == stat.S_IFREG and f[-2:] in ('.d', '.i'): |
|
315 | 315 | n = util.pconvert(fp[striplen:]) |
|
316 | 316 | l.append((decodedir(n), n, st.st_size)) |
|
317 | 317 | elif kind == stat.S_IFDIR and recurse: |
|
318 | 318 | visit.append(fp) |
|
319 | 319 | l.sort() |
|
320 | 320 | return l |
|
321 | 321 | |
|
322 | 322 | def datafiles(self): |
|
323 | 323 | return self._walk('data', True) |
|
324 | 324 | |
|
325 | 325 | def topfiles(self): |
|
326 | 326 | # yield manifest before changelog |
|
327 | 327 | return reversed(self._walk('', False)) |
|
328 | 328 | |
|
329 | 329 | def walk(self): |
|
330 | 330 | '''yields (unencoded, encoded, size)''' |
|
331 | 331 | # yield data files first |
|
332 | 332 | for x in self.datafiles(): |
|
333 | 333 | yield x |
|
334 | 334 | for x in self.topfiles(): |
|
335 | 335 | yield x |
|
336 | 336 | |
|
337 | 337 | def copylist(self): |
|
338 | 338 | return ['requires'] + _data.split() |
|
339 | 339 | |
|
340 | 340 | def write(self, tr): |
|
341 | 341 | pass |
|
342 | 342 | |
|
343 | def invalidatecaches(self): | |
|
344 | pass | |
|
345 | ||
|
343 | 346 | def __contains__(self, path): |
|
344 | 347 | '''Checks if the store contains path''' |
|
345 | 348 | path = "/".join(("data", path)) |
|
346 | 349 | # file? |
|
347 | 350 | if self.vfs.exists(path + ".i"): |
|
348 | 351 | return True |
|
349 | 352 | # dir? |
|
350 | 353 | if not path.endswith("/"): |
|
351 | 354 | path = path + "/" |
|
352 | 355 | return self.vfs.exists(path) |
|
353 | 356 | |
|
354 | 357 | class encodedstore(basicstore): |
|
355 | 358 | def __init__(self, path, vfstype): |
|
356 | 359 | vfs = vfstype(path + '/store') |
|
357 | 360 | self.path = vfs.base |
|
358 | 361 | self.createmode = _calcmode(vfs) |
|
359 | 362 | vfs.createmode = self.createmode |
|
360 | 363 | self.rawvfs = vfs |
|
361 | 364 | self.vfs = scmutil.filtervfs(vfs, encodefilename) |
|
362 | 365 | self.opener = self.vfs |
|
363 | 366 | |
|
364 | 367 | def datafiles(self): |
|
365 | 368 | for a, b, size in self._walk('data', True): |
|
366 | 369 | try: |
|
367 | 370 | a = decodefilename(a) |
|
368 | 371 | except KeyError: |
|
369 | 372 | a = None |
|
370 | 373 | yield a, b, size |
|
371 | 374 | |
|
372 | 375 | def join(self, f): |
|
373 | 376 | return self.path + '/' + encodefilename(f) |
|
374 | 377 | |
|
375 | 378 | def copylist(self): |
|
376 | 379 | return (['requires', '00changelog.i'] + |
|
377 | 380 | ['store/' + f for f in _data.split()]) |
|
378 | 381 | |
|
379 | 382 | class fncache(object): |
|
380 | 383 | # the filename used to be partially encoded |
|
381 | 384 | # hence the encodedir/decodedir dance |
|
382 | 385 | def __init__(self, vfs): |
|
383 | 386 | self.vfs = vfs |
|
384 | 387 | self.entries = None |
|
385 | 388 | self._dirty = False |
|
386 | 389 | |
|
387 | 390 | def _load(self): |
|
388 | 391 | '''fill the entries from the fncache file''' |
|
389 | 392 | self._dirty = False |
|
390 | 393 | try: |
|
391 | 394 | fp = self.vfs('fncache', mode='rb') |
|
392 | 395 | except IOError: |
|
393 | 396 | # skip nonexistent file |
|
394 | 397 | self.entries = set() |
|
395 | 398 | return |
|
396 | 399 | self.entries = set(decodedir(fp.read()).splitlines()) |
|
397 | 400 | if '' in self.entries: |
|
398 | 401 | fp.seek(0) |
|
399 | 402 | for n, line in enumerate(fp): |
|
400 | 403 | if not line.rstrip('\n'): |
|
401 | 404 | t = _('invalid entry in fncache, line %s') % (n + 1) |
|
402 | 405 | raise util.Abort(t) |
|
403 | 406 | fp.close() |
|
404 | 407 | |
|
405 | 408 | def write(self, tr): |
|
406 | 409 | if self._dirty: |
|
407 | 410 | tr.addbackup('fncache') |
|
408 | 411 | fp = self.vfs('fncache', mode='wb', atomictemp=True) |
|
409 | 412 | if self.entries: |
|
410 | 413 | fp.write(encodedir('\n'.join(self.entries) + '\n')) |
|
411 | 414 | fp.close() |
|
412 | 415 | self._dirty = False |
|
413 | 416 | |
|
414 | 417 | def add(self, fn): |
|
415 | 418 | if self.entries is None: |
|
416 | 419 | self._load() |
|
417 | 420 | if fn not in self.entries: |
|
418 | 421 | self._dirty = True |
|
419 | 422 | self.entries.add(fn) |
|
420 | 423 | |
|
421 | 424 | def __contains__(self, fn): |
|
422 | 425 | if self.entries is None: |
|
423 | 426 | self._load() |
|
424 | 427 | return fn in self.entries |
|
425 | 428 | |
|
426 | 429 | def __iter__(self): |
|
427 | 430 | if self.entries is None: |
|
428 | 431 | self._load() |
|
429 | 432 | return iter(self.entries) |
|
430 | 433 | |
|
431 | 434 | class _fncachevfs(scmutil.abstractvfs, scmutil.auditvfs): |
|
432 | 435 | def __init__(self, vfs, fnc, encode): |
|
433 | 436 | scmutil.auditvfs.__init__(self, vfs) |
|
434 | 437 | self.fncache = fnc |
|
435 | 438 | self.encode = encode |
|
436 | 439 | |
|
437 | 440 | def __call__(self, path, mode='r', *args, **kw): |
|
438 | 441 | if mode not in ('r', 'rb') and path.startswith('data/'): |
|
439 | 442 | self.fncache.add(path) |
|
440 | 443 | return self.vfs(self.encode(path), mode, *args, **kw) |
|
441 | 444 | |
|
442 | 445 | def join(self, path): |
|
443 | 446 | if path: |
|
444 | 447 | return self.vfs.join(self.encode(path)) |
|
445 | 448 | else: |
|
446 | 449 | return self.vfs.join(path) |
|
447 | 450 | |
|
448 | 451 | class fncachestore(basicstore): |
|
449 | 452 | def __init__(self, path, vfstype, dotencode): |
|
450 | 453 | if dotencode: |
|
451 | 454 | encode = _pathencode |
|
452 | 455 | else: |
|
453 | 456 | encode = _plainhybridencode |
|
454 | 457 | self.encode = encode |
|
455 | 458 | vfs = vfstype(path + '/store') |
|
456 | 459 | self.path = vfs.base |
|
457 | 460 | self.pathsep = self.path + '/' |
|
458 | 461 | self.createmode = _calcmode(vfs) |
|
459 | 462 | vfs.createmode = self.createmode |
|
460 | 463 | self.rawvfs = vfs |
|
461 | 464 | fnc = fncache(vfs) |
|
462 | 465 | self.fncache = fnc |
|
463 | 466 | self.vfs = _fncachevfs(vfs, fnc, encode) |
|
464 | 467 | self.opener = self.vfs |
|
465 | 468 | |
|
466 | 469 | def join(self, f): |
|
467 | 470 | return self.pathsep + self.encode(f) |
|
468 | 471 | |
|
469 | 472 | def getsize(self, path): |
|
470 | 473 | return self.rawvfs.stat(path).st_size |
|
471 | 474 | |
|
472 | 475 | def datafiles(self): |
|
473 | 476 | existing = [] |
|
474 | 477 | for f in sorted(self.fncache): |
|
475 | 478 | ef = self.encode(f) |
|
476 | 479 | try: |
|
477 | 480 | yield f, ef, self.getsize(ef) |
|
478 | 481 | existing.append(f) |
|
479 | 482 | except OSError, err: |
|
480 | 483 | if err.errno != errno.ENOENT: |
|
481 | 484 | raise |
|
482 | 485 | |
|
483 | 486 | def copylist(self): |
|
484 | 487 | d = ('data dh fncache phaseroots obsstore' |
|
485 | 488 | ' 00manifest.d 00manifest.i 00changelog.d 00changelog.i') |
|
486 | 489 | return (['requires', '00changelog.i'] + |
|
487 | 490 | ['store/' + f for f in d.split()]) |
|
488 | 491 | |
|
489 | 492 | def write(self, tr): |
|
490 | 493 | self.fncache.write(tr) |
|
491 | 494 | |
|
495 | def invalidatecaches(self): | |
|
496 | self.fncache.entries = None | |
|
497 | ||
|
492 | 498 | def _exists(self, f): |
|
493 | 499 | ef = self.encode(f) |
|
494 | 500 | try: |
|
495 | 501 | self.getsize(ef) |
|
496 | 502 | return True |
|
497 | 503 | except OSError, err: |
|
498 | 504 | if err.errno != errno.ENOENT: |
|
499 | 505 | raise |
|
500 | 506 | # nonexistent entry |
|
501 | 507 | return False |
|
502 | 508 | |
|
503 | 509 | def __contains__(self, path): |
|
504 | 510 | '''Checks if the store contains path''' |
|
505 | 511 | path = "/".join(("data", path)) |
|
506 | 512 | # check for files (exact match) |
|
507 | 513 | e = path + '.i' |
|
508 | 514 | if e in self.fncache and self._exists(e): |
|
509 | 515 | return True |
|
510 | 516 | # now check for directories (prefix match) |
|
511 | 517 | if not path.endswith('/'): |
|
512 | 518 | path += '/' |
|
513 | 519 | for e in self.fncache: |
|
514 | 520 | if e.startswith(path) and self._exists(e): |
|
515 | 521 | return True |
|
516 | 522 | return False |
|
517 | 523 | |
|
518 | 524 | def store(requirements, path, vfstype): |
|
519 | 525 | if 'store' in requirements: |
|
520 | 526 | if 'fncache' in requirements: |
|
521 | 527 | return fncachestore(path, vfstype, 'dotencode' in requirements) |
|
522 | 528 | return encodedstore(path, vfstype) |
|
523 | 529 | return basicstore(path, vfstype) |
General Comments 0
You need to be logged in to leave comments.
Login now