##// END OF EJS Templates
localrepo: document nodebookmarks
Augie Fackler -
r27166:263db313 default
parent child Browse files
Show More
@@ -1,1922 +1,1923 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, wdirrev, short
8 8 from i18n import _
9 9 import urllib
10 10 import peer, changegroup, subrepo, pushkey, obsolete, repoview
11 11 import changelog, dirstate, filelog, manifest, context, bookmarks, phases
12 12 import lock as lockmod
13 13 import transaction, store, encoding, exchange, bundle2
14 14 import scmutil, util, extensions, hook, error, revset, cmdutil
15 15 import match as matchmod
16 16 import merge as mergemod
17 17 import tags as tagsmod
18 18 from lock import release
19 19 import weakref, errno, os, time, inspect, random
20 20 import branchmap, pathutil
21 21 import namespaces
22 22 propertycache = util.propertycache
23 23 filecache = scmutil.filecache
24 24
25 25 class repofilecache(filecache):
26 26 """All filecache usage on repo are done for logic that should be unfiltered
27 27 """
28 28
29 29 def __get__(self, repo, type=None):
30 30 return super(repofilecache, self).__get__(repo.unfiltered(), type)
31 31 def __set__(self, repo, value):
32 32 return super(repofilecache, self).__set__(repo.unfiltered(), value)
33 33 def __delete__(self, repo):
34 34 return super(repofilecache, self).__delete__(repo.unfiltered())
35 35
36 36 class storecache(repofilecache):
37 37 """filecache for files in the store"""
38 38 def join(self, obj, fname):
39 39 return obj.sjoin(fname)
40 40
41 41 class unfilteredpropertycache(propertycache):
42 42 """propertycache that apply to unfiltered repo only"""
43 43
44 44 def __get__(self, repo, type=None):
45 45 unfi = repo.unfiltered()
46 46 if unfi is repo:
47 47 return super(unfilteredpropertycache, self).__get__(unfi)
48 48 return getattr(unfi, self.name)
49 49
50 50 class filteredpropertycache(propertycache):
51 51 """propertycache that must take filtering in account"""
52 52
53 53 def cachevalue(self, obj, value):
54 54 object.__setattr__(obj, self.name, value)
55 55
56 56
57 57 def hasunfilteredcache(repo, name):
58 58 """check if a repo has an unfilteredpropertycache value for <name>"""
59 59 return name in vars(repo.unfiltered())
60 60
61 61 def unfilteredmethod(orig):
62 62 """decorate method that always need to be run on unfiltered version"""
63 63 def wrapper(repo, *args, **kwargs):
64 64 return orig(repo.unfiltered(), *args, **kwargs)
65 65 return wrapper
66 66
67 67 moderncaps = set(('lookup', 'branchmap', 'pushkey', 'known', 'getbundle',
68 68 'unbundle'))
69 69 legacycaps = moderncaps.union(set(['changegroupsubset']))
70 70
71 71 class localpeer(peer.peerrepository):
72 72 '''peer for a local repo; reflects only the most recent API'''
73 73
74 74 def __init__(self, repo, caps=moderncaps):
75 75 peer.peerrepository.__init__(self)
76 76 self._repo = repo.filtered('served')
77 77 self.ui = repo.ui
78 78 self._caps = repo._restrictcapabilities(caps)
79 79 self.requirements = repo.requirements
80 80 self.supportedformats = repo.supportedformats
81 81
82 82 def close(self):
83 83 self._repo.close()
84 84
85 85 def _capabilities(self):
86 86 return self._caps
87 87
88 88 def local(self):
89 89 return self._repo
90 90
91 91 def canpush(self):
92 92 return True
93 93
94 94 def url(self):
95 95 return self._repo.url()
96 96
97 97 def lookup(self, key):
98 98 return self._repo.lookup(key)
99 99
100 100 def branchmap(self):
101 101 return self._repo.branchmap()
102 102
103 103 def heads(self):
104 104 return self._repo.heads()
105 105
106 106 def known(self, nodes):
107 107 return self._repo.known(nodes)
108 108
109 109 def getbundle(self, source, heads=None, common=None, bundlecaps=None,
110 110 **kwargs):
111 111 cg = exchange.getbundle(self._repo, source, heads=heads,
112 112 common=common, bundlecaps=bundlecaps, **kwargs)
113 113 if bundlecaps is not None and 'HG20' in bundlecaps:
114 114 # When requesting a bundle2, getbundle returns a stream to make the
115 115 # wire level function happier. We need to build a proper object
116 116 # from it in local peer.
117 117 cg = bundle2.getunbundler(self.ui, cg)
118 118 return cg
119 119
120 120 # TODO We might want to move the next two calls into legacypeer and add
121 121 # unbundle instead.
122 122
123 123 def unbundle(self, cg, heads, url):
124 124 """apply a bundle on a repo
125 125
126 126 This function handles the repo locking itself."""
127 127 try:
128 128 try:
129 129 cg = exchange.readbundle(self.ui, cg, None)
130 130 ret = exchange.unbundle(self._repo, cg, heads, 'push', url)
131 131 if util.safehasattr(ret, 'getchunks'):
132 132 # This is a bundle20 object, turn it into an unbundler.
133 133 # This little dance should be dropped eventually when the
134 134 # API is finally improved.
135 135 stream = util.chunkbuffer(ret.getchunks())
136 136 ret = bundle2.getunbundler(self.ui, stream)
137 137 return ret
138 138 except Exception as exc:
139 139 # If the exception contains output salvaged from a bundle2
140 140 # reply, we need to make sure it is printed before continuing
141 141 # to fail. So we build a bundle2 with such output and consume
142 142 # it directly.
143 143 #
144 144 # This is not very elegant but allows a "simple" solution for
145 145 # issue4594
146 146 output = getattr(exc, '_bundle2salvagedoutput', ())
147 147 if output:
148 148 bundler = bundle2.bundle20(self._repo.ui)
149 149 for out in output:
150 150 bundler.addpart(out)
151 151 stream = util.chunkbuffer(bundler.getchunks())
152 152 b = bundle2.getunbundler(self.ui, stream)
153 153 bundle2.processbundle(self._repo, b)
154 154 raise
155 155 except error.PushRaced as exc:
156 156 raise error.ResponseError(_('push failed:'), str(exc))
157 157
158 158 def lock(self):
159 159 return self._repo.lock()
160 160
161 161 def addchangegroup(self, cg, source, url):
162 162 return cg.apply(self._repo, source, url)
163 163
164 164 def pushkey(self, namespace, key, old, new):
165 165 return self._repo.pushkey(namespace, key, old, new)
166 166
167 167 def listkeys(self, namespace):
168 168 return self._repo.listkeys(namespace)
169 169
170 170 def debugwireargs(self, one, two, three=None, four=None, five=None):
171 171 '''used to test argument passing over the wire'''
172 172 return "%s %s %s %s %s" % (one, two, three, four, five)
173 173
174 174 class locallegacypeer(localpeer):
175 175 '''peer extension which implements legacy methods too; used for tests with
176 176 restricted capabilities'''
177 177
178 178 def __init__(self, repo):
179 179 localpeer.__init__(self, repo, caps=legacycaps)
180 180
181 181 def branches(self, nodes):
182 182 return self._repo.branches(nodes)
183 183
184 184 def between(self, pairs):
185 185 return self._repo.between(pairs)
186 186
187 187 def changegroup(self, basenodes, source):
188 188 return changegroup.changegroup(self._repo, basenodes, source)
189 189
190 190 def changegroupsubset(self, bases, heads, source):
191 191 return changegroup.changegroupsubset(self._repo, bases, heads, source)
192 192
193 193 class localrepository(object):
194 194
195 195 supportedformats = set(('revlogv1', 'generaldelta', 'treemanifest',
196 196 'manifestv2'))
197 197 _basesupported = supportedformats | set(('store', 'fncache', 'shared',
198 198 'dotencode'))
199 199 openerreqs = set(('revlogv1', 'generaldelta', 'treemanifest', 'manifestv2'))
200 200 filtername = None
201 201
202 202 # a list of (ui, featureset) functions.
203 203 # only functions defined in module of enabled extensions are invoked
204 204 featuresetupfuncs = set()
205 205
206 206 def _baserequirements(self, create):
207 207 return ['revlogv1']
208 208
209 209 def __init__(self, baseui, path=None, create=False):
210 210 self.requirements = set()
211 211 self.wvfs = scmutil.vfs(path, expandpath=True, realpath=True)
212 212 self.wopener = self.wvfs
213 213 self.root = self.wvfs.base
214 214 self.path = self.wvfs.join(".hg")
215 215 self.origroot = path
216 216 self.auditor = pathutil.pathauditor(self.root, self._checknested)
217 217 self.vfs = scmutil.vfs(self.path)
218 218 self.opener = self.vfs
219 219 self.baseui = baseui
220 220 self.ui = baseui.copy()
221 221 self.ui.copy = baseui.copy # prevent copying repo configuration
222 222 # A list of callback to shape the phase if no data were found.
223 223 # Callback are in the form: func(repo, roots) --> processed root.
224 224 # This list it to be filled by extension during repo setup
225 225 self._phasedefaults = []
226 226 try:
227 227 self.ui.readconfig(self.join("hgrc"), self.root)
228 228 extensions.loadall(self.ui)
229 229 except IOError:
230 230 pass
231 231
232 232 if self.featuresetupfuncs:
233 233 self.supported = set(self._basesupported) # use private copy
234 234 extmods = set(m.__name__ for n, m
235 235 in extensions.extensions(self.ui))
236 236 for setupfunc in self.featuresetupfuncs:
237 237 if setupfunc.__module__ in extmods:
238 238 setupfunc(self.ui, self.supported)
239 239 else:
240 240 self.supported = self._basesupported
241 241
242 242 if not self.vfs.isdir():
243 243 if create:
244 244 if not self.wvfs.exists():
245 245 self.wvfs.makedirs()
246 246 self.vfs.makedir(notindexed=True)
247 247 self.requirements.update(self._baserequirements(create))
248 248 if self.ui.configbool('format', 'usestore', True):
249 249 self.vfs.mkdir("store")
250 250 self.requirements.add("store")
251 251 if self.ui.configbool('format', 'usefncache', True):
252 252 self.requirements.add("fncache")
253 253 if self.ui.configbool('format', 'dotencode', True):
254 254 self.requirements.add('dotencode')
255 255 # create an invalid changelog
256 256 self.vfs.append(
257 257 "00changelog.i",
258 258 '\0\0\0\2' # represents revlogv2
259 259 ' dummy changelog to prevent using the old repo layout'
260 260 )
261 261 if scmutil.gdinitconfig(self.ui):
262 262 self.requirements.add("generaldelta")
263 263 if self.ui.configbool('experimental', 'treemanifest', False):
264 264 self.requirements.add("treemanifest")
265 265 if self.ui.configbool('experimental', 'manifestv2', False):
266 266 self.requirements.add("manifestv2")
267 267 else:
268 268 raise error.RepoError(_("repository %s not found") % path)
269 269 elif create:
270 270 raise error.RepoError(_("repository %s already exists") % path)
271 271 else:
272 272 try:
273 273 self.requirements = scmutil.readrequires(
274 274 self.vfs, self.supported)
275 275 except IOError as inst:
276 276 if inst.errno != errno.ENOENT:
277 277 raise
278 278
279 279 self.sharedpath = self.path
280 280 try:
281 281 vfs = scmutil.vfs(self.vfs.read("sharedpath").rstrip('\n'),
282 282 realpath=True)
283 283 s = vfs.base
284 284 if not vfs.exists():
285 285 raise error.RepoError(
286 286 _('.hg/sharedpath points to nonexistent directory %s') % s)
287 287 self.sharedpath = s
288 288 except IOError as inst:
289 289 if inst.errno != errno.ENOENT:
290 290 raise
291 291
292 292 self.store = store.store(
293 293 self.requirements, self.sharedpath, scmutil.vfs)
294 294 self.spath = self.store.path
295 295 self.svfs = self.store.vfs
296 296 self.sjoin = self.store.join
297 297 self.vfs.createmode = self.store.createmode
298 298 self._applyopenerreqs()
299 299 if create:
300 300 self._writerequirements()
301 301
302 302 self._dirstatevalidatewarned = False
303 303
304 304 self._branchcaches = {}
305 305 self._revbranchcache = None
306 306 self.filterpats = {}
307 307 self._datafilters = {}
308 308 self._transref = self._lockref = self._wlockref = None
309 309
310 310 # A cache for various files under .hg/ that tracks file changes,
311 311 # (used by the filecache decorator)
312 312 #
313 313 # Maps a property name to its util.filecacheentry
314 314 self._filecache = {}
315 315
316 316 # hold sets of revision to be filtered
317 317 # should be cleared when something might have changed the filter value:
318 318 # - new changesets,
319 319 # - phase change,
320 320 # - new obsolescence marker,
321 321 # - working directory parent change,
322 322 # - bookmark changes
323 323 self.filteredrevcache = {}
324 324
325 325 # generic mapping between names and nodes
326 326 self.names = namespaces.namespaces()
327 327
328 328 def close(self):
329 329 self._writecaches()
330 330
331 331 def _writecaches(self):
332 332 if self._revbranchcache:
333 333 self._revbranchcache.write()
334 334
335 335 def _restrictcapabilities(self, caps):
336 336 if self.ui.configbool('experimental', 'bundle2-advertise', True):
337 337 caps = set(caps)
338 338 capsblob = bundle2.encodecaps(bundle2.getrepocaps(self))
339 339 caps.add('bundle2=' + urllib.quote(capsblob))
340 340 return caps
341 341
342 342 def _applyopenerreqs(self):
343 343 self.svfs.options = dict((r, 1) for r in self.requirements
344 344 if r in self.openerreqs)
345 345 # experimental config: format.chunkcachesize
346 346 chunkcachesize = self.ui.configint('format', 'chunkcachesize')
347 347 if chunkcachesize is not None:
348 348 self.svfs.options['chunkcachesize'] = chunkcachesize
349 349 # experimental config: format.maxchainlen
350 350 maxchainlen = self.ui.configint('format', 'maxchainlen')
351 351 if maxchainlen is not None:
352 352 self.svfs.options['maxchainlen'] = maxchainlen
353 353 # experimental config: format.manifestcachesize
354 354 manifestcachesize = self.ui.configint('format', 'manifestcachesize')
355 355 if manifestcachesize is not None:
356 356 self.svfs.options['manifestcachesize'] = manifestcachesize
357 357 # experimental config: format.aggressivemergedeltas
358 358 aggressivemergedeltas = self.ui.configbool('format',
359 359 'aggressivemergedeltas', False)
360 360 self.svfs.options['aggressivemergedeltas'] = aggressivemergedeltas
361 361 self.svfs.options['lazydeltabase'] = not scmutil.gddeltaconfig(self.ui)
362 362
363 363 def _writerequirements(self):
364 364 scmutil.writerequires(self.vfs, self.requirements)
365 365
366 366 def _checknested(self, path):
367 367 """Determine if path is a legal nested repository."""
368 368 if not path.startswith(self.root):
369 369 return False
370 370 subpath = path[len(self.root) + 1:]
371 371 normsubpath = util.pconvert(subpath)
372 372
373 373 # XXX: Checking against the current working copy is wrong in
374 374 # the sense that it can reject things like
375 375 #
376 376 # $ hg cat -r 10 sub/x.txt
377 377 #
378 378 # if sub/ is no longer a subrepository in the working copy
379 379 # parent revision.
380 380 #
381 381 # However, it can of course also allow things that would have
382 382 # been rejected before, such as the above cat command if sub/
383 383 # is a subrepository now, but was a normal directory before.
384 384 # The old path auditor would have rejected by mistake since it
385 385 # panics when it sees sub/.hg/.
386 386 #
387 387 # All in all, checking against the working copy seems sensible
388 388 # since we want to prevent access to nested repositories on
389 389 # the filesystem *now*.
390 390 ctx = self[None]
391 391 parts = util.splitpath(subpath)
392 392 while parts:
393 393 prefix = '/'.join(parts)
394 394 if prefix in ctx.substate:
395 395 if prefix == normsubpath:
396 396 return True
397 397 else:
398 398 sub = ctx.sub(prefix)
399 399 return sub.checknested(subpath[len(prefix) + 1:])
400 400 else:
401 401 parts.pop()
402 402 return False
403 403
404 404 def peer(self):
405 405 return localpeer(self) # not cached to avoid reference cycle
406 406
407 407 def unfiltered(self):
408 408 """Return unfiltered version of the repository
409 409
410 410 Intended to be overwritten by filtered repo."""
411 411 return self
412 412
413 413 def filtered(self, name):
414 414 """Return a filtered version of a repository"""
415 415 # build a new class with the mixin and the current class
416 416 # (possibly subclass of the repo)
417 417 class proxycls(repoview.repoview, self.unfiltered().__class__):
418 418 pass
419 419 return proxycls(self, name)
420 420
421 421 @repofilecache('bookmarks')
422 422 def _bookmarks(self):
423 423 return bookmarks.bmstore(self)
424 424
425 425 @repofilecache('bookmarks.current')
426 426 def _activebookmark(self):
427 427 return bookmarks.readactive(self)
428 428
429 429 def bookmarkheads(self, bookmark):
430 430 name = bookmark.split('@', 1)[0]
431 431 heads = []
432 432 for mark, n in self._bookmarks.iteritems():
433 433 if mark.split('@', 1)[0] == name:
434 434 heads.append(n)
435 435 return heads
436 436
437 437 # _phaserevs and _phasesets depend on changelog. what we need is to
438 438 # call _phasecache.invalidate() if '00changelog.i' was changed, but it
439 439 # can't be easily expressed in filecache mechanism.
440 440 @storecache('phaseroots', '00changelog.i')
441 441 def _phasecache(self):
442 442 return phases.phasecache(self, self._phasedefaults)
443 443
444 444 @storecache('obsstore')
445 445 def obsstore(self):
446 446 # read default format for new obsstore.
447 447 # developer config: format.obsstore-version
448 448 defaultformat = self.ui.configint('format', 'obsstore-version', None)
449 449 # rely on obsstore class default when possible.
450 450 kwargs = {}
451 451 if defaultformat is not None:
452 452 kwargs['defaultformat'] = defaultformat
453 453 readonly = not obsolete.isenabled(self, obsolete.createmarkersopt)
454 454 store = obsolete.obsstore(self.svfs, readonly=readonly,
455 455 **kwargs)
456 456 if store and readonly:
457 457 self.ui.warn(
458 458 _('obsolete feature not enabled but %i markers found!\n')
459 459 % len(list(store)))
460 460 return store
461 461
462 462 @storecache('00changelog.i')
463 463 def changelog(self):
464 464 c = changelog.changelog(self.svfs)
465 465 if 'HG_PENDING' in os.environ:
466 466 p = os.environ['HG_PENDING']
467 467 if p.startswith(self.root):
468 468 c.readpending('00changelog.i.a')
469 469 return c
470 470
471 471 @storecache('00manifest.i')
472 472 def manifest(self):
473 473 return manifest.manifest(self.svfs)
474 474
475 475 def dirlog(self, dir):
476 476 return self.manifest.dirlog(dir)
477 477
478 478 @repofilecache('dirstate')
479 479 def dirstate(self):
480 480 return dirstate.dirstate(self.vfs, self.ui, self.root,
481 481 self._dirstatevalidate)
482 482
483 483 def _dirstatevalidate(self, node):
484 484 try:
485 485 self.changelog.rev(node)
486 486 return node
487 487 except error.LookupError:
488 488 if not self._dirstatevalidatewarned:
489 489 self._dirstatevalidatewarned = True
490 490 self.ui.warn(_("warning: ignoring unknown"
491 491 " working parent %s!\n") % short(node))
492 492 return nullid
493 493
494 494 def __getitem__(self, changeid):
495 495 if changeid is None or changeid == wdirrev:
496 496 return context.workingctx(self)
497 497 if isinstance(changeid, slice):
498 498 return [context.changectx(self, i)
499 499 for i in xrange(*changeid.indices(len(self)))
500 500 if i not in self.changelog.filteredrevs]
501 501 return context.changectx(self, changeid)
502 502
503 503 def __contains__(self, changeid):
504 504 try:
505 505 self[changeid]
506 506 return True
507 507 except error.RepoLookupError:
508 508 return False
509 509
510 510 def __nonzero__(self):
511 511 return True
512 512
513 513 def __len__(self):
514 514 return len(self.changelog)
515 515
516 516 def __iter__(self):
517 517 return iter(self.changelog)
518 518
519 519 def revs(self, expr, *args):
520 520 '''Find revisions matching a revset.
521 521
522 522 The revset is specified as a string ``expr`` that may contain
523 523 %-formatting to escape certain types. See ``revset.formatspec``.
524 524
525 525 Return a revset.abstractsmartset, which is a list-like interface
526 526 that contains integer revisions.
527 527 '''
528 528 expr = revset.formatspec(expr, *args)
529 529 m = revset.match(None, expr)
530 530 return m(self)
531 531
532 532 def set(self, expr, *args):
533 533 '''Find revisions matching a revset and emit changectx instances.
534 534
535 535 This is a convenience wrapper around ``revs()`` that iterates the
536 536 result and is a generator of changectx instances.
537 537 '''
538 538 for r in self.revs(expr, *args):
539 539 yield self[r]
540 540
541 541 def url(self):
542 542 return 'file:' + self.root
543 543
544 544 def hook(self, name, throw=False, **args):
545 545 """Call a hook, passing this repo instance.
546 546
547 547 This a convenience method to aid invoking hooks. Extensions likely
548 548 won't call this unless they have registered a custom hook or are
549 549 replacing code that is expected to call a hook.
550 550 """
551 551 return hook.hook(self.ui, self, name, throw, **args)
552 552
553 553 @unfilteredmethod
554 554 def _tag(self, names, node, message, local, user, date, extra=None,
555 555 editor=False):
556 556 if isinstance(names, str):
557 557 names = (names,)
558 558
559 559 branches = self.branchmap()
560 560 for name in names:
561 561 self.hook('pretag', throw=True, node=hex(node), tag=name,
562 562 local=local)
563 563 if name in branches:
564 564 self.ui.warn(_("warning: tag %s conflicts with existing"
565 565 " branch name\n") % name)
566 566
567 567 def writetags(fp, names, munge, prevtags):
568 568 fp.seek(0, 2)
569 569 if prevtags and prevtags[-1] != '\n':
570 570 fp.write('\n')
571 571 for name in names:
572 572 if munge:
573 573 m = munge(name)
574 574 else:
575 575 m = name
576 576
577 577 if (self._tagscache.tagtypes and
578 578 name in self._tagscache.tagtypes):
579 579 old = self.tags().get(name, nullid)
580 580 fp.write('%s %s\n' % (hex(old), m))
581 581 fp.write('%s %s\n' % (hex(node), m))
582 582 fp.close()
583 583
584 584 prevtags = ''
585 585 if local:
586 586 try:
587 587 fp = self.vfs('localtags', 'r+')
588 588 except IOError:
589 589 fp = self.vfs('localtags', 'a')
590 590 else:
591 591 prevtags = fp.read()
592 592
593 593 # local tags are stored in the current charset
594 594 writetags(fp, names, None, prevtags)
595 595 for name in names:
596 596 self.hook('tag', node=hex(node), tag=name, local=local)
597 597 return
598 598
599 599 try:
600 600 fp = self.wfile('.hgtags', 'rb+')
601 601 except IOError as e:
602 602 if e.errno != errno.ENOENT:
603 603 raise
604 604 fp = self.wfile('.hgtags', 'ab')
605 605 else:
606 606 prevtags = fp.read()
607 607
608 608 # committed tags are stored in UTF-8
609 609 writetags(fp, names, encoding.fromlocal, prevtags)
610 610
611 611 fp.close()
612 612
613 613 self.invalidatecaches()
614 614
615 615 if '.hgtags' not in self.dirstate:
616 616 self[None].add(['.hgtags'])
617 617
618 618 m = matchmod.exact(self.root, '', ['.hgtags'])
619 619 tagnode = self.commit(message, user, date, extra=extra, match=m,
620 620 editor=editor)
621 621
622 622 for name in names:
623 623 self.hook('tag', node=hex(node), tag=name, local=local)
624 624
625 625 return tagnode
626 626
627 627 def tag(self, names, node, message, local, user, date, editor=False):
628 628 '''tag a revision with one or more symbolic names.
629 629
630 630 names is a list of strings or, when adding a single tag, names may be a
631 631 string.
632 632
633 633 if local is True, the tags are stored in a per-repository file.
634 634 otherwise, they are stored in the .hgtags file, and a new
635 635 changeset is committed with the change.
636 636
637 637 keyword arguments:
638 638
639 639 local: whether to store tags in non-version-controlled file
640 640 (default False)
641 641
642 642 message: commit message to use if committing
643 643
644 644 user: name of user to use if committing
645 645
646 646 date: date tuple to use if committing'''
647 647
648 648 if not local:
649 649 m = matchmod.exact(self.root, '', ['.hgtags'])
650 650 if any(self.status(match=m, unknown=True, ignored=True)):
651 651 raise error.Abort(_('working copy of .hgtags is changed'),
652 652 hint=_('please commit .hgtags manually'))
653 653
654 654 self.tags() # instantiate the cache
655 655 self._tag(names, node, message, local, user, date, editor=editor)
656 656
657 657 @filteredpropertycache
658 658 def _tagscache(self):
659 659 '''Returns a tagscache object that contains various tags related
660 660 caches.'''
661 661
662 662 # This simplifies its cache management by having one decorated
663 663 # function (this one) and the rest simply fetch things from it.
664 664 class tagscache(object):
665 665 def __init__(self):
666 666 # These two define the set of tags for this repository. tags
667 667 # maps tag name to node; tagtypes maps tag name to 'global' or
668 668 # 'local'. (Global tags are defined by .hgtags across all
669 669 # heads, and local tags are defined in .hg/localtags.)
670 670 # They constitute the in-memory cache of tags.
671 671 self.tags = self.tagtypes = None
672 672
673 673 self.nodetagscache = self.tagslist = None
674 674
675 675 cache = tagscache()
676 676 cache.tags, cache.tagtypes = self._findtags()
677 677
678 678 return cache
679 679
680 680 def tags(self):
681 681 '''return a mapping of tag to node'''
682 682 t = {}
683 683 if self.changelog.filteredrevs:
684 684 tags, tt = self._findtags()
685 685 else:
686 686 tags = self._tagscache.tags
687 687 for k, v in tags.iteritems():
688 688 try:
689 689 # ignore tags to unknown nodes
690 690 self.changelog.rev(v)
691 691 t[k] = v
692 692 except (error.LookupError, ValueError):
693 693 pass
694 694 return t
695 695
696 696 def _findtags(self):
697 697 '''Do the hard work of finding tags. Return a pair of dicts
698 698 (tags, tagtypes) where tags maps tag name to node, and tagtypes
699 699 maps tag name to a string like \'global\' or \'local\'.
700 700 Subclasses or extensions are free to add their own tags, but
701 701 should be aware that the returned dicts will be retained for the
702 702 duration of the localrepo object.'''
703 703
704 704 # XXX what tagtype should subclasses/extensions use? Currently
705 705 # mq and bookmarks add tags, but do not set the tagtype at all.
706 706 # Should each extension invent its own tag type? Should there
707 707 # be one tagtype for all such "virtual" tags? Or is the status
708 708 # quo fine?
709 709
710 710 alltags = {} # map tag name to (node, hist)
711 711 tagtypes = {}
712 712
713 713 tagsmod.findglobaltags(self.ui, self, alltags, tagtypes)
714 714 tagsmod.readlocaltags(self.ui, self, alltags, tagtypes)
715 715
716 716 # Build the return dicts. Have to re-encode tag names because
717 717 # the tags module always uses UTF-8 (in order not to lose info
718 718 # writing to the cache), but the rest of Mercurial wants them in
719 719 # local encoding.
720 720 tags = {}
721 721 for (name, (node, hist)) in alltags.iteritems():
722 722 if node != nullid:
723 723 tags[encoding.tolocal(name)] = node
724 724 tags['tip'] = self.changelog.tip()
725 725 tagtypes = dict([(encoding.tolocal(name), value)
726 726 for (name, value) in tagtypes.iteritems()])
727 727 return (tags, tagtypes)
728 728
729 729 def tagtype(self, tagname):
730 730 '''
731 731 return the type of the given tag. result can be:
732 732
733 733 'local' : a local tag
734 734 'global' : a global tag
735 735 None : tag does not exist
736 736 '''
737 737
738 738 return self._tagscache.tagtypes.get(tagname)
739 739
740 740 def tagslist(self):
741 741 '''return a list of tags ordered by revision'''
742 742 if not self._tagscache.tagslist:
743 743 l = []
744 744 for t, n in self.tags().iteritems():
745 745 l.append((self.changelog.rev(n), t, n))
746 746 self._tagscache.tagslist = [(t, n) for r, t, n in sorted(l)]
747 747
748 748 return self._tagscache.tagslist
749 749
750 750 def nodetags(self, node):
751 751 '''return the tags associated with a node'''
752 752 if not self._tagscache.nodetagscache:
753 753 nodetagscache = {}
754 754 for t, n in self._tagscache.tags.iteritems():
755 755 nodetagscache.setdefault(n, []).append(t)
756 756 for tags in nodetagscache.itervalues():
757 757 tags.sort()
758 758 self._tagscache.nodetagscache = nodetagscache
759 759 return self._tagscache.nodetagscache.get(node, [])
760 760
761 761 def nodebookmarks(self, node):
762 """return the list of bookmarks pointing to the specified node"""
762 763 marks = []
763 764 for bookmark, n in self._bookmarks.iteritems():
764 765 if n == node:
765 766 marks.append(bookmark)
766 767 return sorted(marks)
767 768
768 769 def branchmap(self):
769 770 '''returns a dictionary {branch: [branchheads]} with branchheads
770 771 ordered by increasing revision number'''
771 772 branchmap.updatecache(self)
772 773 return self._branchcaches[self.filtername]
773 774
774 775 @unfilteredmethod
775 776 def revbranchcache(self):
776 777 if not self._revbranchcache:
777 778 self._revbranchcache = branchmap.revbranchcache(self.unfiltered())
778 779 return self._revbranchcache
779 780
780 781 def branchtip(self, branch, ignoremissing=False):
781 782 '''return the tip node for a given branch
782 783
783 784 If ignoremissing is True, then this method will not raise an error.
784 785 This is helpful for callers that only expect None for a missing branch
785 786 (e.g. namespace).
786 787
787 788 '''
788 789 try:
789 790 return self.branchmap().branchtip(branch)
790 791 except KeyError:
791 792 if not ignoremissing:
792 793 raise error.RepoLookupError(_("unknown branch '%s'") % branch)
793 794 else:
794 795 pass
795 796
796 797 def lookup(self, key):
797 798 return self[key].node()
798 799
799 800 def lookupbranch(self, key, remote=None):
800 801 repo = remote or self
801 802 if key in repo.branchmap():
802 803 return key
803 804
804 805 repo = (remote and remote.local()) and remote or self
805 806 return repo[key].branch()
806 807
807 808 def known(self, nodes):
808 809 nm = self.changelog.nodemap
809 810 pc = self._phasecache
810 811 result = []
811 812 for n in nodes:
812 813 r = nm.get(n)
813 814 resp = not (r is None or pc.phase(self, r) >= phases.secret)
814 815 result.append(resp)
815 816 return result
816 817
817 818 def local(self):
818 819 return self
819 820
820 821 def publishing(self):
821 822 # it's safe (and desirable) to trust the publish flag unconditionally
822 823 # so that we don't finalize changes shared between users via ssh or nfs
823 824 return self.ui.configbool('phases', 'publish', True, untrusted=True)
824 825
825 826 def cancopy(self):
826 827 # so statichttprepo's override of local() works
827 828 if not self.local():
828 829 return False
829 830 if not self.publishing():
830 831 return True
831 832 # if publishing we can't copy if there is filtered content
832 833 return not self.filtered('visible').changelog.filteredrevs
833 834
834 835 def shared(self):
835 836 '''the type of shared repository (None if not shared)'''
836 837 if self.sharedpath != self.path:
837 838 return 'store'
838 839 return None
839 840
840 841 def join(self, f, *insidef):
841 842 return self.vfs.join(os.path.join(f, *insidef))
842 843
843 844 def wjoin(self, f, *insidef):
844 845 return self.vfs.reljoin(self.root, f, *insidef)
845 846
846 847 def file(self, f):
847 848 if f[0] == '/':
848 849 f = f[1:]
849 850 return filelog.filelog(self.svfs, f)
850 851
851 852 def changectx(self, changeid):
852 853 return self[changeid]
853 854
854 855 def parents(self, changeid=None):
855 856 '''get list of changectxs for parents of changeid'''
856 857 return self[changeid].parents()
857 858
858 859 def setparents(self, p1, p2=nullid):
859 860 self.dirstate.beginparentchange()
860 861 copies = self.dirstate.setparents(p1, p2)
861 862 pctx = self[p1]
862 863 if copies:
863 864 # Adjust copy records, the dirstate cannot do it, it
864 865 # requires access to parents manifests. Preserve them
865 866 # only for entries added to first parent.
866 867 for f in copies:
867 868 if f not in pctx and copies[f] in pctx:
868 869 self.dirstate.copy(copies[f], f)
869 870 if p2 == nullid:
870 871 for f, s in sorted(self.dirstate.copies().items()):
871 872 if f not in pctx and s not in pctx:
872 873 self.dirstate.copy(None, f)
873 874 self.dirstate.endparentchange()
874 875
875 876 def filectx(self, path, changeid=None, fileid=None):
876 877 """changeid can be a changeset revision, node, or tag.
877 878 fileid can be a file revision or node."""
878 879 return context.filectx(self, path, changeid, fileid)
879 880
880 881 def getcwd(self):
881 882 return self.dirstate.getcwd()
882 883
883 884 def pathto(self, f, cwd=None):
884 885 return self.dirstate.pathto(f, cwd)
885 886
886 887 def wfile(self, f, mode='r'):
887 888 return self.wvfs(f, mode)
888 889
889 890 def _link(self, f):
890 891 return self.wvfs.islink(f)
891 892
892 893 def _loadfilter(self, filter):
893 894 if filter not in self.filterpats:
894 895 l = []
895 896 for pat, cmd in self.ui.configitems(filter):
896 897 if cmd == '!':
897 898 continue
898 899 mf = matchmod.match(self.root, '', [pat])
899 900 fn = None
900 901 params = cmd
901 902 for name, filterfn in self._datafilters.iteritems():
902 903 if cmd.startswith(name):
903 904 fn = filterfn
904 905 params = cmd[len(name):].lstrip()
905 906 break
906 907 if not fn:
907 908 fn = lambda s, c, **kwargs: util.filter(s, c)
908 909 # Wrap old filters not supporting keyword arguments
909 910 if not inspect.getargspec(fn)[2]:
910 911 oldfn = fn
911 912 fn = lambda s, c, **kwargs: oldfn(s, c)
912 913 l.append((mf, fn, params))
913 914 self.filterpats[filter] = l
914 915 return self.filterpats[filter]
915 916
916 917 def _filter(self, filterpats, filename, data):
917 918 for mf, fn, cmd in filterpats:
918 919 if mf(filename):
919 920 self.ui.debug("filtering %s through %s\n" % (filename, cmd))
920 921 data = fn(data, cmd, ui=self.ui, repo=self, filename=filename)
921 922 break
922 923
923 924 return data
924 925
925 926 @unfilteredpropertycache
926 927 def _encodefilterpats(self):
927 928 return self._loadfilter('encode')
928 929
929 930 @unfilteredpropertycache
930 931 def _decodefilterpats(self):
931 932 return self._loadfilter('decode')
932 933
933 934 def adddatafilter(self, name, filter):
934 935 self._datafilters[name] = filter
935 936
936 937 def wread(self, filename):
937 938 if self._link(filename):
938 939 data = self.wvfs.readlink(filename)
939 940 else:
940 941 data = self.wvfs.read(filename)
941 942 return self._filter(self._encodefilterpats, filename, data)
942 943
943 944 def wwrite(self, filename, data, flags):
944 945 """write ``data`` into ``filename`` in the working directory
945 946
946 947 This returns length of written (maybe decoded) data.
947 948 """
948 949 data = self._filter(self._decodefilterpats, filename, data)
949 950 if 'l' in flags:
950 951 self.wvfs.symlink(data, filename)
951 952 else:
952 953 self.wvfs.write(filename, data)
953 954 if 'x' in flags:
954 955 self.wvfs.setflags(filename, False, True)
955 956 return len(data)
956 957
957 958 def wwritedata(self, filename, data):
958 959 return self._filter(self._decodefilterpats, filename, data)
959 960
960 961 def currenttransaction(self):
961 962 """return the current transaction or None if non exists"""
962 963 if self._transref:
963 964 tr = self._transref()
964 965 else:
965 966 tr = None
966 967
967 968 if tr and tr.running():
968 969 return tr
969 970 return None
970 971
971 972 def transaction(self, desc, report=None):
972 973 if (self.ui.configbool('devel', 'all-warnings')
973 974 or self.ui.configbool('devel', 'check-locks')):
974 975 l = self._lockref and self._lockref()
975 976 if l is None or not l.held:
976 977 self.ui.develwarn('transaction with no lock')
977 978 tr = self.currenttransaction()
978 979 if tr is not None:
979 980 return tr.nest()
980 981
981 982 # abort here if the journal already exists
982 983 if self.svfs.exists("journal"):
983 984 raise error.RepoError(
984 985 _("abandoned transaction found"),
985 986 hint=_("run 'hg recover' to clean up transaction"))
986 987
987 988 # make journal.dirstate contain in-memory changes at this point
988 989 self.dirstate.write(None)
989 990
990 991 idbase = "%.40f#%f" % (random.random(), time.time())
991 992 txnid = 'TXN:' + util.sha1(idbase).hexdigest()
992 993 self.hook('pretxnopen', throw=True, txnname=desc, txnid=txnid)
993 994
994 995 self._writejournal(desc)
995 996 renames = [(vfs, x, undoname(x)) for vfs, x in self._journalfiles()]
996 997 if report:
997 998 rp = report
998 999 else:
999 1000 rp = self.ui.warn
1000 1001 vfsmap = {'plain': self.vfs} # root of .hg/
1001 1002 # we must avoid cyclic reference between repo and transaction.
1002 1003 reporef = weakref.ref(self)
1003 1004 def validate(tr):
1004 1005 """will run pre-closing hooks"""
1005 1006 reporef().hook('pretxnclose', throw=True,
1006 1007 txnname=desc, **tr.hookargs)
1007 1008 def releasefn(tr, success):
1008 1009 repo = reporef()
1009 1010 if success:
1010 1011 # this should be explicitly invoked here, because
1011 1012 # in-memory changes aren't written out at closing
1012 1013 # transaction, if tr.addfilegenerator (via
1013 1014 # dirstate.write or so) isn't invoked while
1014 1015 # transaction running
1015 1016 repo.dirstate.write(None)
1016 1017 else:
1017 1018 # prevent in-memory changes from being written out at
1018 1019 # the end of outer wlock scope or so
1019 1020 repo.dirstate.invalidate()
1020 1021
1021 1022 # discard all changes (including ones already written
1022 1023 # out) in this transaction
1023 1024 repo.vfs.rename('journal.dirstate', 'dirstate')
1024 1025
1025 1026 repo.invalidate(clearfilecache=True)
1026 1027
1027 1028 tr = transaction.transaction(rp, self.svfs, vfsmap,
1028 1029 "journal",
1029 1030 "undo",
1030 1031 aftertrans(renames),
1031 1032 self.store.createmode,
1032 1033 validator=validate,
1033 1034 releasefn=releasefn)
1034 1035
1035 1036 tr.hookargs['txnid'] = txnid
1036 1037 # note: writing the fncache only during finalize mean that the file is
1037 1038 # outdated when running hooks. As fncache is used for streaming clone,
1038 1039 # this is not expected to break anything that happen during the hooks.
1039 1040 tr.addfinalize('flush-fncache', self.store.write)
1040 1041 def txnclosehook(tr2):
1041 1042 """To be run if transaction is successful, will schedule a hook run
1042 1043 """
1043 1044 def hook():
1044 1045 reporef().hook('txnclose', throw=False, txnname=desc,
1045 1046 **tr2.hookargs)
1046 1047 reporef()._afterlock(hook)
1047 1048 tr.addfinalize('txnclose-hook', txnclosehook)
1048 1049 def txnaborthook(tr2):
1049 1050 """To be run if transaction is aborted
1050 1051 """
1051 1052 reporef().hook('txnabort', throw=False, txnname=desc,
1052 1053 **tr2.hookargs)
1053 1054 tr.addabort('txnabort-hook', txnaborthook)
1054 1055 # avoid eager cache invalidation. in-memory data should be identical
1055 1056 # to stored data if transaction has no error.
1056 1057 tr.addpostclose('refresh-filecachestats', self._refreshfilecachestats)
1057 1058 self._transref = weakref.ref(tr)
1058 1059 return tr
1059 1060
1060 1061 def _journalfiles(self):
1061 1062 return ((self.svfs, 'journal'),
1062 1063 (self.vfs, 'journal.dirstate'),
1063 1064 (self.vfs, 'journal.branch'),
1064 1065 (self.vfs, 'journal.desc'),
1065 1066 (self.vfs, 'journal.bookmarks'),
1066 1067 (self.svfs, 'journal.phaseroots'))
1067 1068
1068 1069 def undofiles(self):
1069 1070 return [(vfs, undoname(x)) for vfs, x in self._journalfiles()]
1070 1071
1071 1072 def _writejournal(self, desc):
1072 1073 self.vfs.write("journal.dirstate",
1073 1074 self.vfs.tryread("dirstate"))
1074 1075 self.vfs.write("journal.branch",
1075 1076 encoding.fromlocal(self.dirstate.branch()))
1076 1077 self.vfs.write("journal.desc",
1077 1078 "%d\n%s\n" % (len(self), desc))
1078 1079 self.vfs.write("journal.bookmarks",
1079 1080 self.vfs.tryread("bookmarks"))
1080 1081 self.svfs.write("journal.phaseroots",
1081 1082 self.svfs.tryread("phaseroots"))
1082 1083
1083 1084 def recover(self):
1084 1085 lock = self.lock()
1085 1086 try:
1086 1087 if self.svfs.exists("journal"):
1087 1088 self.ui.status(_("rolling back interrupted transaction\n"))
1088 1089 vfsmap = {'': self.svfs,
1089 1090 'plain': self.vfs,}
1090 1091 transaction.rollback(self.svfs, vfsmap, "journal",
1091 1092 self.ui.warn)
1092 1093 self.invalidate()
1093 1094 return True
1094 1095 else:
1095 1096 self.ui.warn(_("no interrupted transaction available\n"))
1096 1097 return False
1097 1098 finally:
1098 1099 lock.release()
1099 1100
1100 1101 def rollback(self, dryrun=False, force=False):
1101 1102 wlock = lock = dsguard = None
1102 1103 try:
1103 1104 wlock = self.wlock()
1104 1105 lock = self.lock()
1105 1106 if self.svfs.exists("undo"):
1106 1107 dsguard = cmdutil.dirstateguard(self, 'rollback')
1107 1108
1108 1109 return self._rollback(dryrun, force, dsguard)
1109 1110 else:
1110 1111 self.ui.warn(_("no rollback information available\n"))
1111 1112 return 1
1112 1113 finally:
1113 1114 release(dsguard, lock, wlock)
1114 1115
1115 1116 @unfilteredmethod # Until we get smarter cache management
1116 1117 def _rollback(self, dryrun, force, dsguard):
1117 1118 ui = self.ui
1118 1119 try:
1119 1120 args = self.vfs.read('undo.desc').splitlines()
1120 1121 (oldlen, desc, detail) = (int(args[0]), args[1], None)
1121 1122 if len(args) >= 3:
1122 1123 detail = args[2]
1123 1124 oldtip = oldlen - 1
1124 1125
1125 1126 if detail and ui.verbose:
1126 1127 msg = (_('repository tip rolled back to revision %s'
1127 1128 ' (undo %s: %s)\n')
1128 1129 % (oldtip, desc, detail))
1129 1130 else:
1130 1131 msg = (_('repository tip rolled back to revision %s'
1131 1132 ' (undo %s)\n')
1132 1133 % (oldtip, desc))
1133 1134 except IOError:
1134 1135 msg = _('rolling back unknown transaction\n')
1135 1136 desc = None
1136 1137
1137 1138 if not force and self['.'] != self['tip'] and desc == 'commit':
1138 1139 raise error.Abort(
1139 1140 _('rollback of last commit while not checked out '
1140 1141 'may lose data'), hint=_('use -f to force'))
1141 1142
1142 1143 ui.status(msg)
1143 1144 if dryrun:
1144 1145 return 0
1145 1146
1146 1147 parents = self.dirstate.parents()
1147 1148 self.destroying()
1148 1149 vfsmap = {'plain': self.vfs, '': self.svfs}
1149 1150 transaction.rollback(self.svfs, vfsmap, 'undo', ui.warn)
1150 1151 if self.vfs.exists('undo.bookmarks'):
1151 1152 self.vfs.rename('undo.bookmarks', 'bookmarks')
1152 1153 if self.svfs.exists('undo.phaseroots'):
1153 1154 self.svfs.rename('undo.phaseroots', 'phaseroots')
1154 1155 self.invalidate()
1155 1156
1156 1157 parentgone = (parents[0] not in self.changelog.nodemap or
1157 1158 parents[1] not in self.changelog.nodemap)
1158 1159 if parentgone:
1159 1160 # prevent dirstateguard from overwriting already restored one
1160 1161 dsguard.close()
1161 1162
1162 1163 self.vfs.rename('undo.dirstate', 'dirstate')
1163 1164 try:
1164 1165 branch = self.vfs.read('undo.branch')
1165 1166 self.dirstate.setbranch(encoding.tolocal(branch))
1166 1167 except IOError:
1167 1168 ui.warn(_('named branch could not be reset: '
1168 1169 'current branch is still \'%s\'\n')
1169 1170 % self.dirstate.branch())
1170 1171
1171 1172 self.dirstate.invalidate()
1172 1173 parents = tuple([p.rev() for p in self.parents()])
1173 1174 if len(parents) > 1:
1174 1175 ui.status(_('working directory now based on '
1175 1176 'revisions %d and %d\n') % parents)
1176 1177 else:
1177 1178 ui.status(_('working directory now based on '
1178 1179 'revision %d\n') % parents)
1179 1180 mergemod.mergestate.clean(self, self['.'].node())
1180 1181
1181 1182 # TODO: if we know which new heads may result from this rollback, pass
1182 1183 # them to destroy(), which will prevent the branchhead cache from being
1183 1184 # invalidated.
1184 1185 self.destroyed()
1185 1186 return 0
1186 1187
1187 1188 def invalidatecaches(self):
1188 1189
1189 1190 if '_tagscache' in vars(self):
1190 1191 # can't use delattr on proxy
1191 1192 del self.__dict__['_tagscache']
1192 1193
1193 1194 self.unfiltered()._branchcaches.clear()
1194 1195 self.invalidatevolatilesets()
1195 1196
1196 1197 def invalidatevolatilesets(self):
1197 1198 self.filteredrevcache.clear()
1198 1199 obsolete.clearobscaches(self)
1199 1200
1200 1201 def invalidatedirstate(self):
1201 1202 '''Invalidates the dirstate, causing the next call to dirstate
1202 1203 to check if it was modified since the last time it was read,
1203 1204 rereading it if it has.
1204 1205
1205 1206 This is different to dirstate.invalidate() that it doesn't always
1206 1207 rereads the dirstate. Use dirstate.invalidate() if you want to
1207 1208 explicitly read the dirstate again (i.e. restoring it to a previous
1208 1209 known good state).'''
1209 1210 if hasunfilteredcache(self, 'dirstate'):
1210 1211 for k in self.dirstate._filecache:
1211 1212 try:
1212 1213 delattr(self.dirstate, k)
1213 1214 except AttributeError:
1214 1215 pass
1215 1216 delattr(self.unfiltered(), 'dirstate')
1216 1217
1217 1218 def invalidate(self, clearfilecache=False):
1218 1219 unfiltered = self.unfiltered() # all file caches are stored unfiltered
1219 1220 for k in self._filecache.keys():
1220 1221 # dirstate is invalidated separately in invalidatedirstate()
1221 1222 if k == 'dirstate':
1222 1223 continue
1223 1224
1224 1225 if clearfilecache:
1225 1226 del self._filecache[k]
1226 1227 try:
1227 1228 delattr(unfiltered, k)
1228 1229 except AttributeError:
1229 1230 pass
1230 1231 self.invalidatecaches()
1231 1232 self.store.invalidatecaches()
1232 1233
1233 1234 def invalidateall(self):
1234 1235 '''Fully invalidates both store and non-store parts, causing the
1235 1236 subsequent operation to reread any outside changes.'''
1236 1237 # extension should hook this to invalidate its caches
1237 1238 self.invalidate()
1238 1239 self.invalidatedirstate()
1239 1240
1240 1241 def _refreshfilecachestats(self, tr):
1241 1242 """Reload stats of cached files so that they are flagged as valid"""
1242 1243 for k, ce in self._filecache.items():
1243 1244 if k == 'dirstate' or k not in self.__dict__:
1244 1245 continue
1245 1246 ce.refresh()
1246 1247
1247 1248 def _lock(self, vfs, lockname, wait, releasefn, acquirefn, desc,
1248 1249 inheritchecker=None, parentenvvar=None):
1249 1250 parentlock = None
1250 1251 # the contents of parentenvvar are used by the underlying lock to
1251 1252 # determine whether it can be inherited
1252 1253 if parentenvvar is not None:
1253 1254 parentlock = os.environ.get(parentenvvar)
1254 1255 try:
1255 1256 l = lockmod.lock(vfs, lockname, 0, releasefn=releasefn,
1256 1257 acquirefn=acquirefn, desc=desc,
1257 1258 inheritchecker=inheritchecker,
1258 1259 parentlock=parentlock)
1259 1260 except error.LockHeld as inst:
1260 1261 if not wait:
1261 1262 raise
1262 1263 self.ui.warn(_("waiting for lock on %s held by %r\n") %
1263 1264 (desc, inst.locker))
1264 1265 # default to 600 seconds timeout
1265 1266 l = lockmod.lock(vfs, lockname,
1266 1267 int(self.ui.config("ui", "timeout", "600")),
1267 1268 releasefn=releasefn, acquirefn=acquirefn,
1268 1269 desc=desc)
1269 1270 self.ui.warn(_("got lock after %s seconds\n") % l.delay)
1270 1271 return l
1271 1272
1272 1273 def _afterlock(self, callback):
1273 1274 """add a callback to be run when the repository is fully unlocked
1274 1275
1275 1276 The callback will be executed when the outermost lock is released
1276 1277 (with wlock being higher level than 'lock')."""
1277 1278 for ref in (self._wlockref, self._lockref):
1278 1279 l = ref and ref()
1279 1280 if l and l.held:
1280 1281 l.postrelease.append(callback)
1281 1282 break
1282 1283 else: # no lock have been found.
1283 1284 callback()
1284 1285
1285 1286 def lock(self, wait=True):
1286 1287 '''Lock the repository store (.hg/store) and return a weak reference
1287 1288 to the lock. Use this before modifying the store (e.g. committing or
1288 1289 stripping). If you are opening a transaction, get a lock as well.)
1289 1290
1290 1291 If both 'lock' and 'wlock' must be acquired, ensure you always acquires
1291 1292 'wlock' first to avoid a dead-lock hazard.'''
1292 1293 l = self._lockref and self._lockref()
1293 1294 if l is not None and l.held:
1294 1295 l.lock()
1295 1296 return l
1296 1297
1297 1298 l = self._lock(self.svfs, "lock", wait, None,
1298 1299 self.invalidate, _('repository %s') % self.origroot)
1299 1300 self._lockref = weakref.ref(l)
1300 1301 return l
1301 1302
1302 1303 def _wlockchecktransaction(self):
1303 1304 if self.currenttransaction() is not None:
1304 1305 raise error.LockInheritanceContractViolation(
1305 1306 'wlock cannot be inherited in the middle of a transaction')
1306 1307
1307 1308 def wlock(self, wait=True):
1308 1309 '''Lock the non-store parts of the repository (everything under
1309 1310 .hg except .hg/store) and return a weak reference to the lock.
1310 1311
1311 1312 Use this before modifying files in .hg.
1312 1313
1313 1314 If both 'lock' and 'wlock' must be acquired, ensure you always acquires
1314 1315 'wlock' first to avoid a dead-lock hazard.'''
1315 1316 l = self._wlockref and self._wlockref()
1316 1317 if l is not None and l.held:
1317 1318 l.lock()
1318 1319 return l
1319 1320
1320 1321 # We do not need to check for non-waiting lock acquisition. Such
1321 1322 # acquisition would not cause dead-lock as they would just fail.
1322 1323 if wait and (self.ui.configbool('devel', 'all-warnings')
1323 1324 or self.ui.configbool('devel', 'check-locks')):
1324 1325 l = self._lockref and self._lockref()
1325 1326 if l is not None and l.held:
1326 1327 self.ui.develwarn('"wlock" acquired after "lock"')
1327 1328
1328 1329 def unlock():
1329 1330 if self.dirstate.pendingparentchange():
1330 1331 self.dirstate.invalidate()
1331 1332 else:
1332 1333 self.dirstate.write(None)
1333 1334
1334 1335 self._filecache['dirstate'].refresh()
1335 1336
1336 1337 l = self._lock(self.vfs, "wlock", wait, unlock,
1337 1338 self.invalidatedirstate, _('working directory of %s') %
1338 1339 self.origroot,
1339 1340 inheritchecker=self._wlockchecktransaction,
1340 1341 parentenvvar='HG_WLOCK_LOCKER')
1341 1342 self._wlockref = weakref.ref(l)
1342 1343 return l
1343 1344
1344 1345 def _currentlock(self, lockref):
1345 1346 """Returns the lock if it's held, or None if it's not."""
1346 1347 if lockref is None:
1347 1348 return None
1348 1349 l = lockref()
1349 1350 if l is None or not l.held:
1350 1351 return None
1351 1352 return l
1352 1353
1353 1354 def currentwlock(self):
1354 1355 """Returns the wlock if it's held, or None if it's not."""
1355 1356 return self._currentlock(self._wlockref)
1356 1357
1357 1358 def _filecommit(self, fctx, manifest1, manifest2, linkrev, tr, changelist):
1358 1359 """
1359 1360 commit an individual file as part of a larger transaction
1360 1361 """
1361 1362
1362 1363 fname = fctx.path()
1363 1364 fparent1 = manifest1.get(fname, nullid)
1364 1365 fparent2 = manifest2.get(fname, nullid)
1365 1366 if isinstance(fctx, context.filectx):
1366 1367 node = fctx.filenode()
1367 1368 if node in [fparent1, fparent2]:
1368 1369 self.ui.debug('reusing %s filelog entry\n' % fname)
1369 1370 return node
1370 1371
1371 1372 flog = self.file(fname)
1372 1373 meta = {}
1373 1374 copy = fctx.renamed()
1374 1375 if copy and copy[0] != fname:
1375 1376 # Mark the new revision of this file as a copy of another
1376 1377 # file. This copy data will effectively act as a parent
1377 1378 # of this new revision. If this is a merge, the first
1378 1379 # parent will be the nullid (meaning "look up the copy data")
1379 1380 # and the second one will be the other parent. For example:
1380 1381 #
1381 1382 # 0 --- 1 --- 3 rev1 changes file foo
1382 1383 # \ / rev2 renames foo to bar and changes it
1383 1384 # \- 2 -/ rev3 should have bar with all changes and
1384 1385 # should record that bar descends from
1385 1386 # bar in rev2 and foo in rev1
1386 1387 #
1387 1388 # this allows this merge to succeed:
1388 1389 #
1389 1390 # 0 --- 1 --- 3 rev4 reverts the content change from rev2
1390 1391 # \ / merging rev3 and rev4 should use bar@rev2
1391 1392 # \- 2 --- 4 as the merge base
1392 1393 #
1393 1394
1394 1395 cfname = copy[0]
1395 1396 crev = manifest1.get(cfname)
1396 1397 newfparent = fparent2
1397 1398
1398 1399 if manifest2: # branch merge
1399 1400 if fparent2 == nullid or crev is None: # copied on remote side
1400 1401 if cfname in manifest2:
1401 1402 crev = manifest2[cfname]
1402 1403 newfparent = fparent1
1403 1404
1404 1405 # Here, we used to search backwards through history to try to find
1405 1406 # where the file copy came from if the source of a copy was not in
1406 1407 # the parent directory. However, this doesn't actually make sense to
1407 1408 # do (what does a copy from something not in your working copy even
1408 1409 # mean?) and it causes bugs (eg, issue4476). Instead, we will warn
1409 1410 # the user that copy information was dropped, so if they didn't
1410 1411 # expect this outcome it can be fixed, but this is the correct
1411 1412 # behavior in this circumstance.
1412 1413
1413 1414 if crev:
1414 1415 self.ui.debug(" %s: copy %s:%s\n" % (fname, cfname, hex(crev)))
1415 1416 meta["copy"] = cfname
1416 1417 meta["copyrev"] = hex(crev)
1417 1418 fparent1, fparent2 = nullid, newfparent
1418 1419 else:
1419 1420 self.ui.warn(_("warning: can't find ancestor for '%s' "
1420 1421 "copied from '%s'!\n") % (fname, cfname))
1421 1422
1422 1423 elif fparent1 == nullid:
1423 1424 fparent1, fparent2 = fparent2, nullid
1424 1425 elif fparent2 != nullid:
1425 1426 # is one parent an ancestor of the other?
1426 1427 fparentancestors = flog.commonancestorsheads(fparent1, fparent2)
1427 1428 if fparent1 in fparentancestors:
1428 1429 fparent1, fparent2 = fparent2, nullid
1429 1430 elif fparent2 in fparentancestors:
1430 1431 fparent2 = nullid
1431 1432
1432 1433 # is the file changed?
1433 1434 text = fctx.data()
1434 1435 if fparent2 != nullid or flog.cmp(fparent1, text) or meta:
1435 1436 changelist.append(fname)
1436 1437 return flog.add(text, meta, tr, linkrev, fparent1, fparent2)
1437 1438 # are just the flags changed during merge?
1438 1439 elif fname in manifest1 and manifest1.flags(fname) != fctx.flags():
1439 1440 changelist.append(fname)
1440 1441
1441 1442 return fparent1
1442 1443
1443 1444 @unfilteredmethod
1444 1445 def commit(self, text="", user=None, date=None, match=None, force=False,
1445 1446 editor=False, extra=None):
1446 1447 """Add a new revision to current repository.
1447 1448
1448 1449 Revision information is gathered from the working directory,
1449 1450 match can be used to filter the committed files. If editor is
1450 1451 supplied, it is called to get a commit message.
1451 1452 """
1452 1453 if extra is None:
1453 1454 extra = {}
1454 1455
1455 1456 def fail(f, msg):
1456 1457 raise error.Abort('%s: %s' % (f, msg))
1457 1458
1458 1459 if not match:
1459 1460 match = matchmod.always(self.root, '')
1460 1461
1461 1462 if not force:
1462 1463 vdirs = []
1463 1464 match.explicitdir = vdirs.append
1464 1465 match.bad = fail
1465 1466
1466 1467 wlock = lock = tr = None
1467 1468 try:
1468 1469 wlock = self.wlock()
1469 1470 wctx = self[None]
1470 1471 merge = len(wctx.parents()) > 1
1471 1472
1472 1473 if not force and merge and match.ispartial():
1473 1474 raise error.Abort(_('cannot partially commit a merge '
1474 1475 '(do not specify files or patterns)'))
1475 1476
1476 1477 status = self.status(match=match, clean=force)
1477 1478 if force:
1478 1479 status.modified.extend(status.clean) # mq may commit clean files
1479 1480
1480 1481 # check subrepos
1481 1482 subs = []
1482 1483 commitsubs = set()
1483 1484 newstate = wctx.substate.copy()
1484 1485 # only manage subrepos and .hgsubstate if .hgsub is present
1485 1486 if '.hgsub' in wctx:
1486 1487 # we'll decide whether to track this ourselves, thanks
1487 1488 for c in status.modified, status.added, status.removed:
1488 1489 if '.hgsubstate' in c:
1489 1490 c.remove('.hgsubstate')
1490 1491
1491 1492 # compare current state to last committed state
1492 1493 # build new substate based on last committed state
1493 1494 oldstate = wctx.p1().substate
1494 1495 for s in sorted(newstate.keys()):
1495 1496 if not match(s):
1496 1497 # ignore working copy, use old state if present
1497 1498 if s in oldstate:
1498 1499 newstate[s] = oldstate[s]
1499 1500 continue
1500 1501 if not force:
1501 1502 raise error.Abort(
1502 1503 _("commit with new subrepo %s excluded") % s)
1503 1504 dirtyreason = wctx.sub(s).dirtyreason(True)
1504 1505 if dirtyreason:
1505 1506 if not self.ui.configbool('ui', 'commitsubrepos'):
1506 1507 raise error.Abort(dirtyreason,
1507 1508 hint=_("use --subrepos for recursive commit"))
1508 1509 subs.append(s)
1509 1510 commitsubs.add(s)
1510 1511 else:
1511 1512 bs = wctx.sub(s).basestate()
1512 1513 newstate[s] = (newstate[s][0], bs, newstate[s][2])
1513 1514 if oldstate.get(s, (None, None, None))[1] != bs:
1514 1515 subs.append(s)
1515 1516
1516 1517 # check for removed subrepos
1517 1518 for p in wctx.parents():
1518 1519 r = [s for s in p.substate if s not in newstate]
1519 1520 subs += [s for s in r if match(s)]
1520 1521 if subs:
1521 1522 if (not match('.hgsub') and
1522 1523 '.hgsub' in (wctx.modified() + wctx.added())):
1523 1524 raise error.Abort(
1524 1525 _("can't commit subrepos without .hgsub"))
1525 1526 status.modified.insert(0, '.hgsubstate')
1526 1527
1527 1528 elif '.hgsub' in status.removed:
1528 1529 # clean up .hgsubstate when .hgsub is removed
1529 1530 if ('.hgsubstate' in wctx and
1530 1531 '.hgsubstate' not in (status.modified + status.added +
1531 1532 status.removed)):
1532 1533 status.removed.insert(0, '.hgsubstate')
1533 1534
1534 1535 # make sure all explicit patterns are matched
1535 1536 if not force and (match.isexact() or match.prefix()):
1536 1537 matched = set(status.modified + status.added + status.removed)
1537 1538
1538 1539 for f in match.files():
1539 1540 f = self.dirstate.normalize(f)
1540 1541 if f == '.' or f in matched or f in wctx.substate:
1541 1542 continue
1542 1543 if f in status.deleted:
1543 1544 fail(f, _('file not found!'))
1544 1545 if f in vdirs: # visited directory
1545 1546 d = f + '/'
1546 1547 for mf in matched:
1547 1548 if mf.startswith(d):
1548 1549 break
1549 1550 else:
1550 1551 fail(f, _("no match under directory!"))
1551 1552 elif f not in self.dirstate:
1552 1553 fail(f, _("file not tracked!"))
1553 1554
1554 1555 cctx = context.workingcommitctx(self, status,
1555 1556 text, user, date, extra)
1556 1557
1557 1558 # internal config: ui.allowemptycommit
1558 1559 allowemptycommit = (wctx.branch() != wctx.p1().branch()
1559 1560 or extra.get('close') or merge or cctx.files()
1560 1561 or self.ui.configbool('ui', 'allowemptycommit'))
1561 1562 if not allowemptycommit:
1562 1563 return None
1563 1564
1564 1565 if merge and cctx.deleted():
1565 1566 raise error.Abort(_("cannot commit merge with missing files"))
1566 1567
1567 1568 unresolved, driverresolved = False, False
1568 1569 ms = mergemod.mergestate.read(self)
1569 1570 for f in status.modified:
1570 1571 if f in ms:
1571 1572 if ms[f] == 'u':
1572 1573 unresolved = True
1573 1574 elif ms[f] == 'd':
1574 1575 driverresolved = True
1575 1576
1576 1577 if unresolved:
1577 1578 raise error.Abort(_('unresolved merge conflicts '
1578 1579 '(see "hg help resolve")'))
1579 1580 if driverresolved or ms.mdstate() != 's':
1580 1581 raise error.Abort(_('driver-resolved merge conflicts'),
1581 1582 hint=_('run "hg resolve --all" to resolve'))
1582 1583
1583 1584 if editor:
1584 1585 cctx._text = editor(self, cctx, subs)
1585 1586 edited = (text != cctx._text)
1586 1587
1587 1588 # Save commit message in case this transaction gets rolled back
1588 1589 # (e.g. by a pretxncommit hook). Leave the content alone on
1589 1590 # the assumption that the user will use the same editor again.
1590 1591 msgfn = self.savecommitmessage(cctx._text)
1591 1592
1592 1593 # commit subs and write new state
1593 1594 if subs:
1594 1595 for s in sorted(commitsubs):
1595 1596 sub = wctx.sub(s)
1596 1597 self.ui.status(_('committing subrepository %s\n') %
1597 1598 subrepo.subrelpath(sub))
1598 1599 sr = sub.commit(cctx._text, user, date)
1599 1600 newstate[s] = (newstate[s][0], sr)
1600 1601 subrepo.writestate(self, newstate)
1601 1602
1602 1603 p1, p2 = self.dirstate.parents()
1603 1604 lock = self.lock()
1604 1605 hookp1, hookp2 = hex(p1), (p2 != nullid and hex(p2) or '')
1605 1606 try:
1606 1607 self.hook("precommit", throw=True, parent1=hookp1,
1607 1608 parent2=hookp2)
1608 1609 tr = self.transaction('commit')
1609 1610 ret = self.commitctx(cctx, True)
1610 1611 except: # re-raises
1611 1612 if edited:
1612 1613 self.ui.write(
1613 1614 _('note: commit message saved in %s\n') % msgfn)
1614 1615 raise
1615 1616 # update bookmarks, dirstate and mergestate
1616 1617 bookmarks.update(self, [p1, p2], ret)
1617 1618 cctx.markcommitted(ret)
1618 1619 ms.reset()
1619 1620 tr.close()
1620 1621
1621 1622 finally:
1622 1623 lockmod.release(tr, lock, wlock)
1623 1624
1624 1625 def commithook(node=hex(ret), parent1=hookp1, parent2=hookp2):
1625 1626 # hack for command that use a temporary commit (eg: histedit)
1626 1627 # temporary commit got stripped before hook release
1627 1628 if self.changelog.hasnode(ret):
1628 1629 self.hook("commit", node=node, parent1=parent1,
1629 1630 parent2=parent2)
1630 1631 self._afterlock(commithook)
1631 1632 return ret
1632 1633
1633 1634 @unfilteredmethod
1634 1635 def commitctx(self, ctx, error=False):
1635 1636 """Add a new revision to current repository.
1636 1637 Revision information is passed via the context argument.
1637 1638 """
1638 1639
1639 1640 tr = None
1640 1641 p1, p2 = ctx.p1(), ctx.p2()
1641 1642 user = ctx.user()
1642 1643
1643 1644 lock = self.lock()
1644 1645 try:
1645 1646 tr = self.transaction("commit")
1646 1647 trp = weakref.proxy(tr)
1647 1648
1648 1649 if ctx.files():
1649 1650 m1 = p1.manifest()
1650 1651 m2 = p2.manifest()
1651 1652 m = m1.copy()
1652 1653
1653 1654 # check in files
1654 1655 added = []
1655 1656 changed = []
1656 1657 removed = list(ctx.removed())
1657 1658 linkrev = len(self)
1658 1659 self.ui.note(_("committing files:\n"))
1659 1660 for f in sorted(ctx.modified() + ctx.added()):
1660 1661 self.ui.note(f + "\n")
1661 1662 try:
1662 1663 fctx = ctx[f]
1663 1664 if fctx is None:
1664 1665 removed.append(f)
1665 1666 else:
1666 1667 added.append(f)
1667 1668 m[f] = self._filecommit(fctx, m1, m2, linkrev,
1668 1669 trp, changed)
1669 1670 m.setflag(f, fctx.flags())
1670 1671 except OSError as inst:
1671 1672 self.ui.warn(_("trouble committing %s!\n") % f)
1672 1673 raise
1673 1674 except IOError as inst:
1674 1675 errcode = getattr(inst, 'errno', errno.ENOENT)
1675 1676 if error or errcode and errcode != errno.ENOENT:
1676 1677 self.ui.warn(_("trouble committing %s!\n") % f)
1677 1678 raise
1678 1679
1679 1680 # update manifest
1680 1681 self.ui.note(_("committing manifest\n"))
1681 1682 removed = [f for f in sorted(removed) if f in m1 or f in m2]
1682 1683 drop = [f for f in removed if f in m]
1683 1684 for f in drop:
1684 1685 del m[f]
1685 1686 mn = self.manifest.add(m, trp, linkrev,
1686 1687 p1.manifestnode(), p2.manifestnode(),
1687 1688 added, drop)
1688 1689 files = changed + removed
1689 1690 else:
1690 1691 mn = p1.manifestnode()
1691 1692 files = []
1692 1693
1693 1694 # update changelog
1694 1695 self.ui.note(_("committing changelog\n"))
1695 1696 self.changelog.delayupdate(tr)
1696 1697 n = self.changelog.add(mn, files, ctx.description(),
1697 1698 trp, p1.node(), p2.node(),
1698 1699 user, ctx.date(), ctx.extra().copy())
1699 1700 xp1, xp2 = p1.hex(), p2 and p2.hex() or ''
1700 1701 self.hook('pretxncommit', throw=True, node=hex(n), parent1=xp1,
1701 1702 parent2=xp2)
1702 1703 # set the new commit is proper phase
1703 1704 targetphase = subrepo.newcommitphase(self.ui, ctx)
1704 1705 if targetphase:
1705 1706 # retract boundary do not alter parent changeset.
1706 1707 # if a parent have higher the resulting phase will
1707 1708 # be compliant anyway
1708 1709 #
1709 1710 # if minimal phase was 0 we don't need to retract anything
1710 1711 phases.retractboundary(self, tr, targetphase, [n])
1711 1712 tr.close()
1712 1713 branchmap.updatecache(self.filtered('served'))
1713 1714 return n
1714 1715 finally:
1715 1716 if tr:
1716 1717 tr.release()
1717 1718 lock.release()
1718 1719
1719 1720 @unfilteredmethod
1720 1721 def destroying(self):
1721 1722 '''Inform the repository that nodes are about to be destroyed.
1722 1723 Intended for use by strip and rollback, so there's a common
1723 1724 place for anything that has to be done before destroying history.
1724 1725
1725 1726 This is mostly useful for saving state that is in memory and waiting
1726 1727 to be flushed when the current lock is released. Because a call to
1727 1728 destroyed is imminent, the repo will be invalidated causing those
1728 1729 changes to stay in memory (waiting for the next unlock), or vanish
1729 1730 completely.
1730 1731 '''
1731 1732 # When using the same lock to commit and strip, the phasecache is left
1732 1733 # dirty after committing. Then when we strip, the repo is invalidated,
1733 1734 # causing those changes to disappear.
1734 1735 if '_phasecache' in vars(self):
1735 1736 self._phasecache.write()
1736 1737
1737 1738 @unfilteredmethod
1738 1739 def destroyed(self):
1739 1740 '''Inform the repository that nodes have been destroyed.
1740 1741 Intended for use by strip and rollback, so there's a common
1741 1742 place for anything that has to be done after destroying history.
1742 1743 '''
1743 1744 # When one tries to:
1744 1745 # 1) destroy nodes thus calling this method (e.g. strip)
1745 1746 # 2) use phasecache somewhere (e.g. commit)
1746 1747 #
1747 1748 # then 2) will fail because the phasecache contains nodes that were
1748 1749 # removed. We can either remove phasecache from the filecache,
1749 1750 # causing it to reload next time it is accessed, or simply filter
1750 1751 # the removed nodes now and write the updated cache.
1751 1752 self._phasecache.filterunknown(self)
1752 1753 self._phasecache.write()
1753 1754
1754 1755 # update the 'served' branch cache to help read only server process
1755 1756 # Thanks to branchcache collaboration this is done from the nearest
1756 1757 # filtered subset and it is expected to be fast.
1757 1758 branchmap.updatecache(self.filtered('served'))
1758 1759
1759 1760 # Ensure the persistent tag cache is updated. Doing it now
1760 1761 # means that the tag cache only has to worry about destroyed
1761 1762 # heads immediately after a strip/rollback. That in turn
1762 1763 # guarantees that "cachetip == currenttip" (comparing both rev
1763 1764 # and node) always means no nodes have been added or destroyed.
1764 1765
1765 1766 # XXX this is suboptimal when qrefresh'ing: we strip the current
1766 1767 # head, refresh the tag cache, then immediately add a new head.
1767 1768 # But I think doing it this way is necessary for the "instant
1768 1769 # tag cache retrieval" case to work.
1769 1770 self.invalidate()
1770 1771
1771 1772 def walk(self, match, node=None):
1772 1773 '''
1773 1774 walk recursively through the directory tree or a given
1774 1775 changeset, finding all files matched by the match
1775 1776 function
1776 1777 '''
1777 1778 return self[node].walk(match)
1778 1779
1779 1780 def status(self, node1='.', node2=None, match=None,
1780 1781 ignored=False, clean=False, unknown=False,
1781 1782 listsubrepos=False):
1782 1783 '''a convenience method that calls node1.status(node2)'''
1783 1784 return self[node1].status(node2, match, ignored, clean, unknown,
1784 1785 listsubrepos)
1785 1786
1786 1787 def heads(self, start=None):
1787 1788 heads = self.changelog.heads(start)
1788 1789 # sort the output in rev descending order
1789 1790 return sorted(heads, key=self.changelog.rev, reverse=True)
1790 1791
1791 1792 def branchheads(self, branch=None, start=None, closed=False):
1792 1793 '''return a (possibly filtered) list of heads for the given branch
1793 1794
1794 1795 Heads are returned in topological order, from newest to oldest.
1795 1796 If branch is None, use the dirstate branch.
1796 1797 If start is not None, return only heads reachable from start.
1797 1798 If closed is True, return heads that are marked as closed as well.
1798 1799 '''
1799 1800 if branch is None:
1800 1801 branch = self[None].branch()
1801 1802 branches = self.branchmap()
1802 1803 if branch not in branches:
1803 1804 return []
1804 1805 # the cache returns heads ordered lowest to highest
1805 1806 bheads = list(reversed(branches.branchheads(branch, closed=closed)))
1806 1807 if start is not None:
1807 1808 # filter out the heads that cannot be reached from startrev
1808 1809 fbheads = set(self.changelog.nodesbetween([start], bheads)[2])
1809 1810 bheads = [h for h in bheads if h in fbheads]
1810 1811 return bheads
1811 1812
1812 1813 def branches(self, nodes):
1813 1814 if not nodes:
1814 1815 nodes = [self.changelog.tip()]
1815 1816 b = []
1816 1817 for n in nodes:
1817 1818 t = n
1818 1819 while True:
1819 1820 p = self.changelog.parents(n)
1820 1821 if p[1] != nullid or p[0] == nullid:
1821 1822 b.append((t, n, p[0], p[1]))
1822 1823 break
1823 1824 n = p[0]
1824 1825 return b
1825 1826
1826 1827 def between(self, pairs):
1827 1828 r = []
1828 1829
1829 1830 for top, bottom in pairs:
1830 1831 n, l, i = top, [], 0
1831 1832 f = 1
1832 1833
1833 1834 while n != bottom and n != nullid:
1834 1835 p = self.changelog.parents(n)[0]
1835 1836 if i == f:
1836 1837 l.append(n)
1837 1838 f = f * 2
1838 1839 n = p
1839 1840 i += 1
1840 1841
1841 1842 r.append(l)
1842 1843
1843 1844 return r
1844 1845
1845 1846 def checkpush(self, pushop):
1846 1847 """Extensions can override this function if additional checks have
1847 1848 to be performed before pushing, or call it if they override push
1848 1849 command.
1849 1850 """
1850 1851 pass
1851 1852
1852 1853 @unfilteredpropertycache
1853 1854 def prepushoutgoinghooks(self):
1854 1855 """Return util.hooks consists of "(repo, remote, outgoing)"
1855 1856 functions, which are called before pushing changesets.
1856 1857 """
1857 1858 return util.hooks()
1858 1859
1859 1860 def pushkey(self, namespace, key, old, new):
1860 1861 try:
1861 1862 tr = self.currenttransaction()
1862 1863 hookargs = {}
1863 1864 if tr is not None:
1864 1865 hookargs.update(tr.hookargs)
1865 1866 hookargs['namespace'] = namespace
1866 1867 hookargs['key'] = key
1867 1868 hookargs['old'] = old
1868 1869 hookargs['new'] = new
1869 1870 self.hook('prepushkey', throw=True, **hookargs)
1870 1871 except error.HookAbort as exc:
1871 1872 self.ui.write_err(_("pushkey-abort: %s\n") % exc)
1872 1873 if exc.hint:
1873 1874 self.ui.write_err(_("(%s)\n") % exc.hint)
1874 1875 return False
1875 1876 self.ui.debug('pushing key for "%s:%s"\n' % (namespace, key))
1876 1877 ret = pushkey.push(self, namespace, key, old, new)
1877 1878 def runhook():
1878 1879 self.hook('pushkey', namespace=namespace, key=key, old=old, new=new,
1879 1880 ret=ret)
1880 1881 self._afterlock(runhook)
1881 1882 return ret
1882 1883
1883 1884 def listkeys(self, namespace):
1884 1885 self.hook('prelistkeys', throw=True, namespace=namespace)
1885 1886 self.ui.debug('listing keys for "%s"\n' % namespace)
1886 1887 values = pushkey.list(self, namespace)
1887 1888 self.hook('listkeys', namespace=namespace, values=values)
1888 1889 return values
1889 1890
1890 1891 def debugwireargs(self, one, two, three=None, four=None, five=None):
1891 1892 '''used to test argument passing over the wire'''
1892 1893 return "%s %s %s %s %s" % (one, two, three, four, five)
1893 1894
1894 1895 def savecommitmessage(self, text):
1895 1896 fp = self.vfs('last-message.txt', 'wb')
1896 1897 try:
1897 1898 fp.write(text)
1898 1899 finally:
1899 1900 fp.close()
1900 1901 return self.pathto(fp.name[len(self.root) + 1:])
1901 1902
1902 1903 # used to avoid circular references so destructors work
1903 1904 def aftertrans(files):
1904 1905 renamefiles = [tuple(t) for t in files]
1905 1906 def a():
1906 1907 for vfs, src, dest in renamefiles:
1907 1908 try:
1908 1909 vfs.rename(src, dest)
1909 1910 except OSError: # journal file does not yet exist
1910 1911 pass
1911 1912 return a
1912 1913
1913 1914 def undoname(fn):
1914 1915 base, name = os.path.split(fn)
1915 1916 assert name.startswith('journal')
1916 1917 return os.path.join(base, name.replace('journal', 'undo', 1))
1917 1918
1918 1919 def instance(ui, path, create):
1919 1920 return localrepository(ui, util.urllocalpath(path), create)
1920 1921
1921 1922 def islocal(path):
1922 1923 return True
General Comments 0
You need to be logged in to leave comments. Login now