localrepo.py
3312 lines
| 129.0 KiB
| text/x-python
|
PythonLexer
/ mercurial / localrepo.py
|
r1089 | # localrepo.py - read/write repository class for mercurial | ||
# | ||||
|
r4635 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> | ||
|
r1089 | # | ||
|
r8225 | # This software may be used and distributed according to the terms of the | ||
|
r10263 | # GNU General Public License version 2 or any later version. | ||
|
r27522 | |||
from __future__ import absolute_import | ||||
import errno | ||||
|
r29341 | import hashlib | ||
|
r27522 | import os | ||
import random | ||||
|
r37648 | import sys | ||
|
r27522 | import time | ||
import weakref | ||||
from .i18n import _ | ||||
from .node import ( | ||||
|
r39994 | bin, | ||
|
r27522 | hex, | ||
nullid, | ||||
|
r39994 | nullrev, | ||
|
r27522 | short, | ||
) | ||||
from . import ( | ||||
bookmarks, | ||||
branchmap, | ||||
bundle2, | ||||
changegroup, | ||||
changelog, | ||||
|
r31111 | color, | ||
|
r27522 | context, | ||
dirstate, | ||||
|
r30492 | dirstateguard, | ||
|
r34099 | discovery, | ||
|
r27522 | encoding, | ||
error, | ||||
exchange, | ||||
extensions, | ||||
filelog, | ||||
hook, | ||||
lock as lockmod, | ||||
manifest, | ||||
match as matchmod, | ||||
merge as mergemod, | ||||
|
r30496 | mergeutil, | ||
|
r27522 | namespaces, | ||
|
r36489 | narrowspec, | ||
|
r27522 | obsolete, | ||
pathutil, | ||||
phases, | ||||
pushkey, | ||||
|
r31508 | pycompat, | ||
|
r33802 | repository, | ||
|
r27522 | repoview, | ||
revset, | ||||
|
r31024 | revsetlang, | ||
|
r27522 | scmutil, | ||
|
r33373 | sparse, | ||
|
r39733 | store as storemod, | ||
|
r36026 | subrepoutil, | ||
|
r27522 | tags as tagsmod, | ||
transaction, | ||||
|
r31054 | txnutil, | ||
|
r27522 | util, | ||
|
r31231 | vfs as vfsmod, | ||
|
r27522 | ) | ||
|
r37102 | from .utils import ( | ||
|
r37828 | interfaceutil, | ||
|
r37138 | procutil, | ||
|
r37102 | stringutil, | ||
) | ||||
|
r27522 | |||
|
r39542 | from .revlogutils import ( | ||
constants as revlogconst, | ||||
) | ||||
|
r27522 | release = lockmod.release | ||
|
r28883 | urlerr = util.urlerr | ||
urlreq = util.urlreq | ||||
|
r8109 | |||
|
r33277 | # set of (path, vfs-location) tuples. vfs-location is: | ||
# - 'plain for vfs relative paths | ||||
# - '' for svfs relative paths | ||||
_cachedfiles = set() | ||||
|
r33173 | class _basefilecache(scmutil.filecache): | ||
|
r18014 | """All filecache usage on repo are done for logic that should be unfiltered | ||
""" | ||||
def __get__(self, repo, type=None): | ||||
|
r29373 | if repo is None: | ||
return self | ||||
|
r40454 | # proxy to unfiltered __dict__ since filtered repo has no entry | ||
|
r40453 | unfi = repo.unfiltered() | ||
try: | ||||
return unfi.__dict__[self.sname] | ||||
except KeyError: | ||||
pass | ||||
return super(_basefilecache, self).__get__(unfi, type) | ||||
|
r40454 | |||
def set(self, repo, value): | ||||
return super(_basefilecache, self).set(repo.unfiltered(), value) | ||||
|
r18014 | |||
|
r33173 | class repofilecache(_basefilecache): | ||
"""filecache for files in .hg but outside of .hg/store""" | ||||
|
r33277 | def __init__(self, *paths): | ||
super(repofilecache, self).__init__(*paths) | ||||
for path in paths: | ||||
_cachedfiles.add((path, 'plain')) | ||||
|
r33173 | def join(self, obj, fname): | ||
return obj.vfs.join(fname) | ||||
class storecache(_basefilecache): | ||||
|
r16198 | """filecache for files in the store""" | ||
|
r33277 | def __init__(self, *paths): | ||
super(storecache, self).__init__(*paths) | ||||
for path in paths: | ||||
_cachedfiles.add((path, '')) | ||||
|
r16198 | def join(self, obj, fname): | ||
return obj.sjoin(fname) | ||||
r42539 | class mixedrepostorecache(_basefilecache): | |||
"""filecache for a mix files in .hg/store and outside""" | ||||
def __init__(self, *pathsandlocations): | ||||
# scmutil.filecache only uses the path for passing back into our | ||||
# join(), so we can safely pass a list of paths and locations | ||||
super(mixedrepostorecache, self).__init__(*pathsandlocations) | ||||
|
r42632 | _cachedfiles.update(pathsandlocations) | ||
r42539 | ||||
def join(self, obj, fnameandlocation): | ||||
fname, location = fnameandlocation | ||||
|
r42613 | if location == 'plain': | ||
r42539 | return obj.vfs.join(fname) | |||
else: | ||||
|
r42613 | if location != '': | ||
r42539 | raise error.ProgrammingError('unexpected location: %s' % | |||
location) | ||||
return obj.sjoin(fname) | ||||
|
r33382 | def isfilecached(repo, name): | ||
"""check if a repo has already cached "name" filecache-ed property | ||||
This returns (cachedobj-or-None, iscached) tuple. | ||||
""" | ||||
cacheentry = repo.unfiltered()._filecache.get(name, None) | ||||
if not cacheentry: | ||||
return None, False | ||||
return cacheentry.obj, True | ||||
|
r29104 | class unfilteredpropertycache(util.propertycache): | ||
|
r18013 | """propertycache that apply to unfiltered repo only""" | ||
def __get__(self, repo, type=None): | ||||
|
r19846 | unfi = repo.unfiltered() | ||
if unfi is repo: | ||||
return super(unfilteredpropertycache, self).__get__(unfi) | ||||
return getattr(unfi, self.name) | ||||
|
r18013 | |||
|
r29104 | class filteredpropertycache(util.propertycache): | ||
|
r18013 | """propertycache that must take filtering in account""" | ||
def cachevalue(self, obj, value): | ||||
object.__setattr__(obj, self.name, value) | ||||
def hasunfilteredcache(repo, name): | ||||
|
r18644 | """check if a repo has an unfilteredpropertycache value for <name>""" | ||
|
r18013 | return name in vars(repo.unfiltered()) | ||
|
r18016 | def unfilteredmethod(orig): | ||
|
r17994 | """decorate method that always need to be run on unfiltered version""" | ||
def wrapper(repo, *args, **kwargs): | ||||
return orig(repo.unfiltered(), *args, **kwargs) | ||||
return wrapper | ||||
|
r32291 | moderncaps = {'lookup', 'branchmap', 'pushkey', 'known', 'getbundle', | ||
'unbundle'} | ||||
legacycaps = moderncaps.union({'changegroupsubset'}) | ||||
|
r17192 | |||
|
r37828 | @interfaceutil.implementer(repository.ipeercommandexecutor) | ||
|
r37648 | class localcommandexecutor(object): | ||
def __init__(self, peer): | ||||
self._peer = peer | ||||
self._sent = False | ||||
self._closed = False | ||||
def __enter__(self): | ||||
return self | ||||
def __exit__(self, exctype, excvalue, exctb): | ||||
self.close() | ||||
def callcommand(self, command, args): | ||||
if self._sent: | ||||
raise error.ProgrammingError('callcommand() cannot be used after ' | ||||
'sendcommands()') | ||||
if self._closed: | ||||
raise error.ProgrammingError('callcommand() cannot be used after ' | ||||
'close()') | ||||
# We don't need to support anything fancy. Just call the named | ||||
# method on the peer and return a resolved future. | ||||
fn = getattr(self._peer, pycompat.sysstr(command)) | ||||
f = pycompat.futures.Future() | ||||
try: | ||||
|
r37688 | result = fn(**pycompat.strkwargs(args)) | ||
|
r37648 | except Exception: | ||
|
r37687 | pycompat.future_set_exception_info(f, sys.exc_info()[1:]) | ||
|
r37648 | else: | ||
f.set_result(result) | ||||
return f | ||||
def sendcommands(self): | ||||
self._sent = True | ||||
def close(self): | ||||
self._closed = True | ||||
|
r37828 | @interfaceutil.implementer(repository.ipeercommands) | ||
|
r33802 | class localpeer(repository.peer): | ||
|
r17192 | '''peer for a local repo; reflects only the most recent API''' | ||
|
r31412 | def __init__(self, repo, caps=None): | ||
|
r33802 | super(localpeer, self).__init__() | ||
|
r31412 | if caps is None: | ||
caps = moderncaps.copy() | ||||
|
r18382 | self._repo = repo.filtered('served') | ||
|
r37337 | self.ui = repo.ui | ||
|
r17192 | self._caps = repo._restrictcapabilities(caps) | ||
|
r33802 | # Begin of _basepeer interface. | ||
def url(self): | ||||
return self._repo.url() | ||||
def local(self): | ||||
return self._repo | ||||
def peer(self): | ||||
return self | ||||
def canpush(self): | ||||
return True | ||||
|
r17192 | def close(self): | ||
self._repo.close() | ||||
|
r33802 | # End of _basepeer interface. | ||
|
r17192 | |||
|
r33802 | # Begin of _basewirecommands interface. | ||
|
r17192 | |||
def branchmap(self): | ||||
|
r18279 | return self._repo.branchmap() | ||
|
r17192 | |||
|
r33802 | def capabilities(self): | ||
return self._caps | ||||
|
r17192 | |||
|
r37667 | def clonebundles(self): | ||
return self._repo.tryread('clonebundles.manifest') | ||||
|
r33802 | def debugwireargs(self, one, two, three=None, four=None, five=None): | ||
"""Used to test argument passing over the wire""" | ||||
|
r36572 | return "%s %s %s %s %s" % (one, two, pycompat.bytestr(three), | ||
pycompat.bytestr(four), | ||||
pycompat.bytestr(five)) | ||||
|
r17192 | |||
|
r20953 | def getbundle(self, source, heads=None, common=None, bundlecaps=None, | ||
|
r24639 | **kwargs): | ||
|
r30187 | chunks = exchange.getbundlechunks(self._repo, source, heads=heads, | ||
common=common, bundlecaps=bundlecaps, | ||||
|
r35803 | **kwargs)[1] | ||
|
r30187 | cb = util.chunkbuffer(chunks) | ||
|
r32149 | if exchange.bundle2requested(bundlecaps): | ||
|
r21068 | # When requesting a bundle2, getbundle returns a stream to make the | ||
# wire level function happier. We need to build a proper object | ||||
# from it in local peer. | ||||
|
r30187 | return bundle2.getunbundler(self.ui, cb) | ||
else: | ||||
return changegroup.getunbundler('01', cb, None) | ||||
|
r17192 | |||
|
r33802 | def heads(self): | ||
return self._repo.heads() | ||||
def known(self, nodes): | ||||
return self._repo.known(nodes) | ||||
def listkeys(self, namespace): | ||||
return self._repo.listkeys(namespace) | ||||
def lookup(self, key): | ||||
return self._repo.lookup(key) | ||||
def pushkey(self, namespace, key, old, new): | ||||
return self._repo.pushkey(namespace, key, old, new) | ||||
def stream_out(self): | ||||
raise error.Abort(_('cannot perform stream clone against local ' | ||||
'peer')) | ||||
|
r17192 | |||
|
r37664 | def unbundle(self, bundle, heads, url): | ||
|
r20969 | """apply a bundle on a repo | ||
This function handles the repo locking itself.""" | ||||
try: | ||||
|
r24798 | try: | ||
|
r37664 | bundle = exchange.readbundle(self.ui, bundle, None) | ||
ret = exchange.unbundle(self._repo, bundle, heads, 'push', url) | ||||
|
r24798 | if util.safehasattr(ret, 'getchunks'): | ||
# This is a bundle20 object, turn it into an unbundler. | ||||
# This little dance should be dropped eventually when the | ||||
# API is finally improved. | ||||
stream = util.chunkbuffer(ret.getchunks()) | ||||
ret = bundle2.getunbundler(self.ui, stream) | ||||
return ret | ||||
|
r25660 | except Exception as exc: | ||
|
r24799 | # If the exception contains output salvaged from a bundle2 | ||
# reply, we need to make sure it is printed before continuing | ||||
# to fail. So we build a bundle2 with such output and consume | ||||
# it directly. | ||||
# | ||||
# This is not very elegant but allows a "simple" solution for | ||||
# issue4594 | ||||
output = getattr(exc, '_bundle2salvagedoutput', ()) | ||||
if output: | ||||
bundler = bundle2.bundle20(self._repo.ui) | ||||
for out in output: | ||||
bundler.addpart(out) | ||||
stream = util.chunkbuffer(bundler.getchunks()) | ||||
b = bundle2.getunbundler(self.ui, stream) | ||||
bundle2.processbundle(self._repo, b) | ||||
|
r24798 | raise | ||
|
r25660 | except error.PushRaced as exc: | ||
|
r36440 | raise error.ResponseError(_('push failed:'), | ||
|
r37102 | stringutil.forcebytestr(exc)) | ||
|
r20969 | |||
|
r33802 | # End of _basewirecommands interface. | ||
|
r17192 | |||
|
r33802 | # Begin of peer interface. | ||
|
r17192 | |||
|
r37648 | def commandexecutor(self): | ||
return localcommandexecutor(self) | ||||
|
r33802 | # End of peer interface. | ||
|
r37828 | @interfaceutil.implementer(repository.ipeerlegacycommands) | ||
|
r37653 | class locallegacypeer(localpeer): | ||
|
r17192 | '''peer extension which implements legacy methods too; used for tests with | ||
restricted capabilities''' | ||||
def __init__(self, repo): | ||||
|
r33802 | super(locallegacypeer, self).__init__(repo, caps=legacycaps) | ||
# Begin of baselegacywirecommands interface. | ||||
def between(self, pairs): | ||||
return self._repo.between(pairs) | ||||
|
r17192 | |||
def branches(self, nodes): | ||||
return self._repo.branches(nodes) | ||||
|
r37653 | def changegroup(self, nodes, source): | ||
outgoing = discovery.outgoing(self._repo, missingroots=nodes, | ||||
|
r34102 | missingheads=self._repo.heads()) | ||
return changegroup.makechangegroup(self._repo, outgoing, '01', source) | ||||
|
r17192 | |||
def changegroupsubset(self, bases, heads, source): | ||||
|
r34099 | outgoing = discovery.outgoing(self._repo, missingroots=bases, | ||
missingheads=heads) | ||||
return changegroup.makechangegroup(self._repo, outgoing, '01', source) | ||||
|
r17192 | |||
|
r33802 | # End of baselegacywirecommands interface. | ||
|
r32697 | # Increment the sub-version when the revlog v2 format changes to lock out old | ||
# clients. | ||||
|
r41238 | REVLOGV2_REQUIREMENT = 'exp-revlogv2.1' | ||
|
r32697 | |||
|
r38739 | # A repository with the sparserevlog feature will have delta chains that | ||
# can spread over a larger span. Sparse reading cuts these large spans into | ||||
# pieces, so that each piece isn't too big. | ||||
# Without the sparserevlog capability, reading from the repository could use | ||||
# huge amounts of memory, because the whole span would be read at once, | ||||
# including all the intermediate revisions that aren't pertinent for the chain. | ||||
# This is why once a repository has enabled sparse-read, it becomes required. | ||||
SPARSEREVLOG_REQUIREMENT = 'sparserevlog' | ||||
|
r37153 | # Functions receiving (ui, features) that extensions can register to impact | ||
# the ability to load repositories with custom requirements. Only | ||||
# functions defined in loaded extensions are called. | ||||
# | ||||
# The function receives a set of requirement strings that the repository | ||||
# is capable of opening. Functions will typically add elements to the | ||||
# set to reflect that the extension knows how to handle that requirements. | ||||
featuresetupfuncs = set() | ||||
|
r39725 | def makelocalrepository(baseui, path, intents=None): | ||
|
r39723 | """Create a local repository object. | ||
Given arguments needed to construct a local repository, this function | ||||
|
r39800 | performs various early repository loading functionality (such as | ||
reading the ``.hg/requires`` and ``.hg/hgrc`` files), validates that | ||||
the repository can be opened, derives a type suitable for representing | ||||
that repository, and returns an instance of it. | ||||
|
r39723 | |||
The returned object conforms to the ``repository.completelocalrepository`` | ||||
interface. | ||||
|
r39800 | |||
The repository type is derived by calling a series of factory functions | ||||
for each aspect/interface of the final repository. These are defined by | ||||
``REPO_INTERFACES``. | ||||
Each factory function is called to produce a type implementing a specific | ||||
interface. The cumulative list of returned types will be combined into a | ||||
new type and that type will be instantiated to represent the local | ||||
repository. | ||||
The factory functions each receive various state that may be consulted | ||||
as part of deriving a type. | ||||
Extensions should wrap these factory functions to customize repository type | ||||
creation. Note that an extension's wrapped function may be called even if | ||||
that extension is not loaded for the repo being constructed. Extensions | ||||
should check if their ``__name__`` appears in the | ||||
``extensionmodulenames`` set passed to the factory function and no-op if | ||||
not. | ||||
|
r39723 | """ | ||
|
r39725 | ui = baseui.copy() | ||
# Prevent copying repo configuration. | ||||
ui.copy = baseui.copy | ||||
|
r39724 | # Working directory VFS rooted at repository root. | ||
wdirvfs = vfsmod.vfs(path, expandpath=True, realpath=True) | ||||
# Main VFS for .hg/ directory. | ||||
hgpath = wdirvfs.join(b'.hg') | ||||
hgvfs = vfsmod.vfs(hgpath, cacheaudited=True) | ||||
|
r39727 | # The .hg/ path should exist and should be a directory. All other | ||
# cases are errors. | ||||
if not hgvfs.isdir(): | ||||
try: | ||||
hgvfs.stat() | ||||
except OSError as e: | ||||
if e.errno != errno.ENOENT: | ||||
raise | ||||
raise error.RepoError(_(b'repository %s not found') % path) | ||||
|
r39728 | # .hg/requires file contains a newline-delimited list of | ||
# features/capabilities the opener (us) must have in order to use | ||||
# the repository. This file was introduced in Mercurial 0.9.2, | ||||
# which means very old repositories may not have one. We assume | ||||
# a missing file translates to no requirements. | ||||
try: | ||||
requirements = set(hgvfs.read(b'requires').splitlines()) | ||||
except IOError as e: | ||||
if e.errno != errno.ENOENT: | ||||
raise | ||||
requirements = set() | ||||
|
r39726 | # The .hg/hgrc file may load extensions or contain config options | ||
# that influence repository construction. Attempt to load it and | ||||
# process any new extensions that it may have pulled in. | ||||
|
r40571 | if loadhgrc(ui, wdirvfs, hgvfs, requirements): | ||
|
r39888 | afterhgrcload(ui, wdirvfs, hgvfs, requirements) | ||
|
r39726 | extensions.loadall(ui) | ||
|
r40760 | extensions.populateui(ui) | ||
|
r39726 | |||
|
r39800 | # Set of module names of extensions loaded for this repository. | ||
extensionmodulenames = {m.__name__ for n, m in extensions.extensions(ui)} | ||||
|
r39729 | supportedrequirements = gathersupportedrequirements(ui) | ||
|
r39731 | |||
# We first validate the requirements are known. | ||||
|
r39729 | ensurerequirementsrecognized(requirements, supportedrequirements) | ||
|
r39731 | # Then we validate that the known set is reasonable to use together. | ||
ensurerequirementscompatible(ui, requirements) | ||||
|
r39732 | # TODO there are unhandled edge cases related to opening repositories with | ||
# shared storage. If storage is shared, we should also test for requirements | ||||
# compatibility in the pointed-to repo. This entails loading the .hg/hgrc in | ||||
# that repo, as that repo may load extensions needed to open it. This is a | ||||
# bit complicated because we don't want the other hgrc to overwrite settings | ||||
# in this hgrc. | ||||
# | ||||
# This bug is somewhat mitigated by the fact that we copy the .hg/requires | ||||
# file when sharing repos. But if a requirement is added after the share is | ||||
# performed, thereby introducing a new requirement for the opener, we may | ||||
# will not see that and could encounter a run-time error interacting with | ||||
# that shared store since it has an unknown-to-us requirement. | ||||
|
r39729 | # At this point, we know we should be capable of opening the repository. | ||
# Now get on with doing that. | ||||
|
r39886 | features = set() | ||
|
r39733 | # The "store" part of the repository holds versioned data. How it is | ||
# accessed is determined by various requirements. The ``shared`` or | ||||
# ``relshared`` requirements indicate the store lives in the path contained | ||||
# in the ``.hg/sharedpath`` file. This is an absolute path for | ||||
# ``shared`` and relative to ``.hg/`` for ``relshared``. | ||||
if b'shared' in requirements or b'relshared' in requirements: | ||||
sharedpath = hgvfs.read(b'sharedpath').rstrip(b'\n') | ||||
if b'relshared' in requirements: | ||||
sharedpath = hgvfs.join(sharedpath) | ||||
sharedvfs = vfsmod.vfs(sharedpath, realpath=True) | ||||
if not sharedvfs.exists(): | ||||
raise error.RepoError(_(b'.hg/sharedpath points to nonexistent ' | ||||
b'directory %s') % sharedvfs.base) | ||||
|
r39886 | features.add(repository.REPO_FEATURE_SHARED_STORAGE) | ||
|
r39733 | storebasepath = sharedvfs.base | ||
cachepath = sharedvfs.join(b'cache') | ||||
else: | ||||
storebasepath = hgvfs.base | ||||
cachepath = hgvfs.join(b'cache') | ||||
|
r40826 | wcachepath = hgvfs.join(b'wcache') | ||
|
r39733 | |||
# The store has changed over time and the exact layout is dictated by | ||||
# requirements. The store interface abstracts differences across all | ||||
# of them. | ||||
|
r39734 | store = makestore(requirements, storebasepath, | ||
lambda base: vfsmod.vfs(base, cacheaudited=True)) | ||||
|
r39733 | hgvfs.createmode = store.createmode | ||
|
r39736 | storevfs = store.vfs | ||
|
r39886 | storevfs.options = resolvestorevfsoptions(ui, requirements, features) | ||
|
r39736 | |||
|
r39733 | # The cache vfs is used to manage cache files. | ||
cachevfs = vfsmod.vfs(cachepath, cacheaudited=True) | ||||
cachevfs.createmode = store.createmode | ||||
|
r40826 | # The cache vfs is used to manage cache files related to the working copy | ||
wcachevfs = vfsmod.vfs(wcachepath, cacheaudited=True) | ||||
wcachevfs.createmode = store.createmode | ||||
|
r39733 | |||
|
r39800 | # Now resolve the type for the repository object. We do this by repeatedly | ||
# calling a factory function to produces types for specific aspects of the | ||||
# repo's operation. The aggregate returned types are used as base classes | ||||
# for a dynamically-derived type, which will represent our new repository. | ||||
bases = [] | ||||
extrastate = {} | ||||
for iface, fn in REPO_INTERFACES: | ||||
# We pass all potentially useful state to give extensions tons of | ||||
# flexibility. | ||||
|
r40030 | typ = fn()(ui=ui, | ||
|
r39800 | intents=intents, | ||
requirements=requirements, | ||||
|
r39886 | features=features, | ||
|
r39800 | wdirvfs=wdirvfs, | ||
hgvfs=hgvfs, | ||||
store=store, | ||||
storevfs=storevfs, | ||||
storeoptions=storevfs.options, | ||||
cachevfs=cachevfs, | ||||
|
r40826 | wcachevfs=wcachevfs, | ||
|
r39800 | extensionmodulenames=extensionmodulenames, | ||
extrastate=extrastate, | ||||
baseclasses=bases) | ||||
if not isinstance(typ, type): | ||||
raise error.ProgrammingError('unable to construct type for %s' % | ||||
iface) | ||||
bases.append(typ) | ||||
# type() allows you to use characters in type names that wouldn't be | ||||
# recognized as Python symbols in source code. We abuse that to add | ||||
# rich information about our constructed repo. | ||||
name = pycompat.sysstr(b'derivedrepo:%s<%s>' % ( | ||||
wdirvfs.base, | ||||
b','.join(sorted(requirements)))) | ||||
cls = type(name, tuple(bases), {}) | ||||
return cls( | ||||
|
r39725 | baseui=baseui, | ||
ui=ui, | ||||
origroot=path, | ||||
|
r39724 | wdirvfs=wdirvfs, | ||
hgvfs=hgvfs, | ||||
|
r39728 | requirements=requirements, | ||
|
r39729 | supportedrequirements=supportedrequirements, | ||
|
r39733 | sharedpath=storebasepath, | ||
store=store, | ||||
cachevfs=cachevfs, | ||||
|
r40826 | wcachevfs=wcachevfs, | ||
|
r39886 | features=features, | ||
|
r39724 | intents=intents) | ||
|
r39723 | |||
|
r40571 | def loadhgrc(ui, wdirvfs, hgvfs, requirements): | ||
"""Load hgrc files/content into a ui instance. | ||||
This is called during repository opening to load any additional | ||||
config files or settings relevant to the current repository. | ||||
Returns a bool indicating whether any additional configs were loaded. | ||||
Extensions should monkeypatch this function to modify how per-repo | ||||
configs are loaded. For example, an extension may wish to pull in | ||||
configs from alternate files or sources. | ||||
""" | ||||
try: | ||||
ui.readconfig(hgvfs.join(b'hgrc'), root=wdirvfs.base) | ||||
return True | ||||
except IOError: | ||||
return False | ||||
|
r39888 | def afterhgrcload(ui, wdirvfs, hgvfs, requirements): | ||
"""Perform additional actions after .hg/hgrc is loaded. | ||||
This function is called during repository loading immediately after | ||||
the .hg/hgrc file is loaded and before per-repo extensions are loaded. | ||||
The function can be used to validate configs, automatically add | ||||
options (including extensions) based on requirements, etc. | ||||
""" | ||||
# Map of requirements to list of extensions to load automatically when | ||||
# requirement is present. | ||||
autoextensions = { | ||||
|
r39890 | b'largefiles': [b'largefiles'], | ||
|
r39888 | b'lfs': [b'lfs'], | ||
} | ||||
for requirement, names in sorted(autoextensions.items()): | ||||
if requirement not in requirements: | ||||
continue | ||||
for name in names: | ||||
if not ui.hasconfig(b'extensions', name): | ||||
ui.setconfig(b'extensions', name, b'', source='autoload') | ||||
|
r39729 | def gathersupportedrequirements(ui): | ||
"""Determine the complete set of recognized requirements.""" | ||||
# Start with all requirements supported by this file. | ||||
supported = set(localrepository._basesupported) | ||||
# Execute ``featuresetupfuncs`` entries if they belong to an extension | ||||
# relevant to this ui instance. | ||||
modules = {m.__name__ for n, m in extensions.extensions(ui)} | ||||
for fn in featuresetupfuncs: | ||||
if fn.__module__ in modules: | ||||
fn(ui, supported) | ||||
# Add derived requirements from registered compression engines. | ||||
for name in util.compengines: | ||||
engine = util.compengines[name] | ||||
r42304 | if engine.available() and engine.revlogheader(): | |||
|
r39729 | supported.add(b'exp-compression-%s' % name) | ||
r42305 | if engine.name() == 'zstd': | |||
supported.add(b'revlog-compression-zstd') | ||||
|
r39729 | |||
return supported | ||||
def ensurerequirementsrecognized(requirements, supported): | ||||
"""Validate that a set of local requirements is recognized. | ||||
Receives a set of requirements. Raises an ``error.RepoError`` if there | ||||
exists any requirement in that set that currently loaded code doesn't | ||||
recognize. | ||||
Returns a set of supported requirements. | ||||
""" | ||||
missing = set() | ||||
for requirement in requirements: | ||||
if requirement in supported: | ||||
continue | ||||
if not requirement or not requirement[0:1].isalnum(): | ||||
raise error.RequirementError(_(b'.hg/requires file is corrupt')) | ||||
missing.add(requirement) | ||||
if missing: | ||||
raise error.RequirementError( | ||||
_(b'repository requires features unknown to this Mercurial: %s') % | ||||
b' '.join(sorted(missing)), | ||||
hint=_(b'see https://mercurial-scm.org/wiki/MissingRequirement ' | ||||
b'for more information')) | ||||
|
r39731 | def ensurerequirementscompatible(ui, requirements): | ||
"""Validates that a set of recognized requirements is mutually compatible. | ||||
Some requirements may not be compatible with others or require | ||||
config options that aren't enabled. This function is called during | ||||
repository opening to ensure that the set of requirements needed | ||||
to open a repository is sane and compatible with config options. | ||||
Extensions can monkeypatch this function to perform additional | ||||
checking. | ||||
``error.RepoError`` should be raised on failure. | ||||
""" | ||||
if b'exp-sparse' in requirements and not sparse.enabled: | ||||
raise error.RepoError(_(b'repository is using sparse feature but ' | ||||
b'sparse is not enabled; enable the ' | ||||
b'"sparse" extensions to access')) | ||||
|
r39734 | def makestore(requirements, path, vfstype): | ||
"""Construct a storage object for a repository.""" | ||||
if b'store' in requirements: | ||||
if b'fncache' in requirements: | ||||
return storemod.fncachestore(path, vfstype, | ||||
b'dotencode' in requirements) | ||||
return storemod.encodedstore(path, vfstype) | ||||
return storemod.basicstore(path, vfstype) | ||||
|
r39886 | def resolvestorevfsoptions(ui, requirements, features): | ||
|
r39736 | """Resolve the options to pass to the store vfs opener. | ||
The returned dict is used to influence behavior of the storage layer. | ||||
""" | ||||
options = {} | ||||
if b'treemanifest' in requirements: | ||||
options[b'treemanifest'] = True | ||||
# experimental config: format.manifestcachesize | ||||
manifestcachesize = ui.configint(b'format', b'manifestcachesize') | ||||
if manifestcachesize is not None: | ||||
options[b'manifestcachesize'] = manifestcachesize | ||||
# In the absence of another requirement superseding a revlog-related | ||||
# requirement, we have to assume the repo is using revlog version 0. | ||||
# This revlog format is super old and we don't bother trying to parse | ||||
# opener options for it because those options wouldn't do anything | ||||
# meaningful on such old repos. | ||||
if b'revlogv1' in requirements or REVLOGV2_REQUIREMENT in requirements: | ||||
|
r39886 | options.update(resolverevlogstorevfsoptions(ui, requirements, features)) | ||
|
r39736 | |||
return options | ||||
|
r39886 | def resolverevlogstorevfsoptions(ui, requirements, features): | ||
|
r39736 | """Resolve opener options specific to revlogs.""" | ||
options = {} | ||||
|
r40303 | options[b'flagprocessors'] = {} | ||
|
r39736 | |||
if b'revlogv1' in requirements: | ||||
options[b'revlogv1'] = True | ||||
if REVLOGV2_REQUIREMENT in requirements: | ||||
options[b'revlogv2'] = True | ||||
if b'generaldelta' in requirements: | ||||
options[b'generaldelta'] = True | ||||
# experimental config: format.chunkcachesize | ||||
chunkcachesize = ui.configint(b'format', b'chunkcachesize') | ||||
if chunkcachesize is not None: | ||||
options[b'chunkcachesize'] = chunkcachesize | ||||
deltabothparents = ui.configbool(b'storage', | ||||
b'revlog.optimize-delta-parent-choice') | ||||
options[b'deltabothparents'] = deltabothparents | ||||
r41985 | lazydelta = ui.configbool(b'storage', b'revlog.reuse-external-delta') | |||
lazydeltabase = False | ||||
if lazydelta: | ||||
lazydeltabase = ui.configbool(b'storage', | ||||
b'revlog.reuse-external-delta-parent') | ||||
r41984 | if lazydeltabase is None: | |||
lazydeltabase = not scmutil.gddeltaconfig(ui) | ||||
r41985 | options[b'lazydelta'] = lazydelta | |||
r41984 | options[b'lazydeltabase'] = lazydeltabase | |||
|
r39736 | |||
chainspan = ui.configbytes(b'experimental', b'maxdeltachainspan') | ||||
if 0 <= chainspan: | ||||
options[b'maxdeltachainspan'] = chainspan | ||||
|
r41332 | mmapindexthreshold = ui.configbytes(b'experimental', | ||
b'mmapindexthreshold') | ||||
|
r39736 | if mmapindexthreshold is not None: | ||
options[b'mmapindexthreshold'] = mmapindexthreshold | ||||
withsparseread = ui.configbool(b'experimental', b'sparse-read') | ||||
srdensitythres = float(ui.config(b'experimental', | ||||
b'sparse-read.density-threshold')) | ||||
srmingapsize = ui.configbytes(b'experimental', | ||||
b'sparse-read.min-gap-size') | ||||
options[b'with-sparse-read'] = withsparseread | ||||
options[b'sparse-read-density-threshold'] = srdensitythres | ||||
options[b'sparse-read-min-gap-size'] = srmingapsize | ||||
sparserevlog = SPARSEREVLOG_REQUIREMENT in requirements | ||||
options[b'sparse-revlog'] = sparserevlog | ||||
if sparserevlog: | ||||
options[b'generaldelta'] = True | ||||
maxchainlen = None | ||||
if sparserevlog: | ||||
maxchainlen = revlogconst.SPARSE_REVLOG_MAX_CHAIN_LENGTH | ||||
# experimental config: format.maxchainlen | ||||
maxchainlen = ui.configint(b'format', b'maxchainlen', maxchainlen) | ||||
if maxchainlen is not None: | ||||
options[b'maxchainlen'] = maxchainlen | ||||
for r in requirements: | ||||
r42305 | # we allow multiple compression engine requirement to co-exist because | |||
# strickly speaking, revlog seems to support mixed compression style. | ||||
# | ||||
# The compression used for new entries will be "the last one" | ||||
prefix = r.startswith | ||||
if prefix('revlog-compression-') or prefix('exp-compression-'): | ||||
options[b'compengine'] = r.split('-', 2)[2] | ||||
|
r39736 | |||
r42210 | options[b'zlib.level'] = ui.configint(b'storage', b'revlog.zlib.level') | |||
if options[b'zlib.level'] is not None: | ||||
if not (0 <= options[b'zlib.level'] <= 9): | ||||
msg = _('invalid value for `storage.revlog.zlib.level` config: %d') | ||||
raise error.Abort(msg % options[b'zlib.level']) | ||||
r42211 | options[b'zstd.level'] = ui.configint(b'storage', b'revlog.zstd.level') | |||
if options[b'zstd.level'] is not None: | ||||
if not (0 <= options[b'zstd.level'] <= 22): | ||||
msg = _('invalid value for `storage.revlog.zstd.level` config: %d') | ||||
raise error.Abort(msg % options[b'zstd.level']) | ||||
r42210 | ||||
|
r39806 | if repository.NARROW_REQUIREMENT in requirements: | ||
options[b'enableellipsis'] = True | ||||
|
r39736 | return options | ||
|
r39800 | def makemain(**kwargs): | ||
"""Produce a type conforming to ``ilocalrepositorymain``.""" | ||||
return localrepository | ||||
@interfaceutil.implementer(repository.ilocalrepositoryfilestorage) | ||||
class revlogfilestorage(object): | ||||
"""File storage when using revlogs.""" | ||||
def file(self, path): | ||||
if path[0] == b'/': | ||||
path = path[1:] | ||||
return filelog.filelog(self.svfs, path) | ||||
|
r39801 | @interfaceutil.implementer(repository.ilocalrepositoryfilestorage) | ||
class revlognarrowfilestorage(object): | ||||
"""File storage when using revlogs and narrow files.""" | ||||
def file(self, path): | ||||
if path[0] == b'/': | ||||
path = path[1:] | ||||
|
r41266 | return filelog.narrowfilelog(self.svfs, path, self._storenarrowmatch) | ||
|
r39801 | |||
|
r39886 | def makefilestorage(requirements, features, **kwargs): | ||
|
r39800 | """Produce a type conforming to ``ilocalrepositoryfilestorage``.""" | ||
|
r39886 | features.add(repository.REPO_FEATURE_REVLOG_FILE_STORAGE) | ||
|
r40063 | features.add(repository.REPO_FEATURE_STREAM_CLONE) | ||
|
r39886 | |||
|
r39801 | if repository.NARROW_REQUIREMENT in requirements: | ||
return revlognarrowfilestorage | ||||
else: | ||||
return revlogfilestorage | ||||
|
r39800 | |||
# List of repository interfaces and factory functions for them. Each | ||||
# will be called in order during ``makelocalrepository()`` to iteratively | ||||
|
r40030 | # derive the final type for a local repository instance. We capture the | ||
# function as a lambda so we don't hold a reference and the module-level | ||||
# functions can be wrapped. | ||||
|
r39800 | REPO_INTERFACES = [ | ||
|
r40030 | (repository.ilocalrepositorymain, lambda: makemain), | ||
(repository.ilocalrepositoryfilestorage, lambda: makefilestorage), | ||||
|
r39800 | ] | ||
@interfaceutil.implementer(repository.ilocalrepositorymain) | ||||
|
r17192 | class localrepository(object): | ||
|
r39800 | """Main class for representing local repositories. | ||
All local repositories are instances of this class. | ||||
Constructed on its own, instances of this class are not usable as | ||||
repository objects. To obtain a usable repository object, call | ||||
``hg.repository()``, ``localrepo.instance()``, or | ||||
``localrepo.makelocalrepository()``. The latter is the lowest-level. | ||||
``instance()`` adds support for creating new repositories. | ||||
``hg.repository()`` adds more extension integration, including calling | ||||
``reposetup()``. Generally speaking, ``hg.repository()`` should be | ||||
used. | ||||
""" | ||||
|
r17192 | |||
|
r36391 | # obsolete experimental requirements: | ||
# - manifestv2: An experimental new manifest format that allowed | ||||
# for stem compression of long paths. Experiment ended up not | ||||
# being successful (repository sizes went up due to worse delta | ||||
# chains), and the code was deleted in 4.6. | ||||
|
r32315 | supportedformats = { | ||
'revlogv1', | ||||
'generaldelta', | ||||
'treemanifest', | ||||
|
r32697 | REVLOGV2_REQUIREMENT, | ||
|
r38739 | SPARSEREVLOG_REQUIREMENT, | ||
|
r42512 | bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT, | ||
|
r32315 | } | ||
_basesupported = supportedformats | { | ||||
'store', | ||||
'fncache', | ||||
'shared', | ||||
'relshared', | ||||
'dotencode', | ||||
|
r33556 | 'exp-sparse', | ||
|
r39334 | 'internal-phase' | ||
|
r32315 | } | ||
|
r17137 | |||
|
r33436 | # list of prefix for file which can be written without 'wlock' | ||
# Extensions should extend this list when needed | ||||
_wlockfreeprefix = { | ||||
# We migh consider requiring 'wlock' for the next | ||||
# two, but pretty much all the existing code assume | ||||
# wlock is not needed so we keep them excluded for | ||||
# now. | ||||
'hgrc', | ||||
'requires', | ||||
# XXX cache is a complicatged business someone | ||||
# should investigate this in depth at some point | ||||
'cache/', | ||||
# XXX shouldn't be dirstate covered by the wlock? | ||||
'dirstate', | ||||
# XXX bisect was still a bit too messy at the time | ||||
# this changeset was introduced. Someone should fix | ||||
# the remainig bit and drop this line | ||||
'bisect.state', | ||||
} | ||||
|
r39728 | def __init__(self, baseui, ui, origroot, wdirvfs, hgvfs, requirements, | ||
|
r40826 | supportedrequirements, sharedpath, store, cachevfs, wcachevfs, | ||
|
r39886 | features, intents=None): | ||
|
r39584 | """Create a new local repository instance. | ||
|
r39724 | Most callers should use ``hg.repository()``, ``localrepo.instance()``, | ||
or ``localrepo.makelocalrepository()`` for obtaining a new repository | ||||
object. | ||||
Arguments: | ||||
baseui | ||||
|
r39725 | ``ui.ui`` instance that ``ui`` argument was based off of. | ||
ui | ||||
``ui.ui`` instance for use by the repository. | ||||
|
r39724 | |||
origroot | ||||
``bytes`` path to working directory root of this repository. | ||||
wdirvfs | ||||
``vfs.vfs`` rooted at the working directory. | ||||
hgvfs | ||||
``vfs.vfs`` rooted at .hg/ | ||||
|
r39728 | requirements | ||
``set`` of bytestrings representing repository opening requirements. | ||||
|
r39729 | supportedrequirements | ||
``set`` of bytestrings representing repository requirements that we | ||||
know how to open. May be a supetset of ``requirements``. | ||||
|
r39733 | sharedpath | ||
``bytes`` Defining path to storage base directory. Points to a | ||||
``.hg/`` directory somewhere. | ||||
store | ||||
``store.basicstore`` (or derived) instance providing access to | ||||
versioned storage. | ||||
cachevfs | ||||
``vfs.vfs`` used for cache files. | ||||
|
r40826 | wcachevfs | ||
``vfs.vfs`` used for cache files related to the working copy. | ||||
|
r39886 | features | ||
``set`` of bytestrings defining features/capabilities of this | ||||
instance. | ||||
|
r39724 | intents | ||
``set`` of system strings indicating what this repo will be used | ||||
for. | ||||
|
r39584 | """ | ||
|
r39724 | self.baseui = baseui | ||
|
r39725 | self.ui = ui | ||
|
r39724 | self.origroot = origroot | ||
# vfs rooted at working directory. | ||||
self.wvfs = wdirvfs | ||||
self.root = wdirvfs.base | ||||
# vfs rooted at .hg/. Used to access most non-store paths. | ||||
self.vfs = hgvfs | ||||
self.path = hgvfs.base | ||||
|
r39729 | self.requirements = requirements | ||
self.supported = supportedrequirements | ||||
|
r39733 | self.sharedpath = sharedpath | ||
self.store = store | ||||
self.cachevfs = cachevfs | ||||
|
r40826 | self.wcachevfs = wcachevfs | ||
|
r39886 | self.features = features | ||
|
r39584 | |||
|
r32730 | self.filtername = None | ||
|
r39724 | |||
|
r33436 | if (self.ui.configbool('devel', 'all-warnings') or | ||
self.ui.configbool('devel', 'check-locks')): | ||||
self.vfs.audit = self._getvfsward(self.vfs.audit) | ||||
|
r15922 | # A list of callback to shape the phase if no data were found. | ||
# Callback are in the form: func(repo, roots) --> processed root. | ||||
# This list it to be filled by extension during repo setup | ||||
self._phasedefaults = [] | ||||
|
r1089 | |||
|
r31111 | color.setup(self.ui) | ||
|
r19778 | |||
|
r6840 | self.spath = self.store.path | ||
|
r17654 | self.svfs = self.store.vfs | ||
|
r6840 | self.sjoin = self.store.join | ||
|
r33437 | if (self.ui.configbool('devel', 'all-warnings') or | ||
self.ui.configbool('devel', 'check-locks')): | ||||
if util.safehasattr(self.svfs, 'vfs'): # this is filtervfs | ||||
self.svfs.vfs.audit = self._getsvfsward(self.svfs.vfs.audit) | ||||
else: # standard vfs | ||||
self.svfs.audit = self._getsvfsward(self.svfs.audit) | ||||
|
r3850 | |||
|
r26155 | self._dirstatevalidatewarned = False | ||
|
r9146 | |||
|
r41764 | self._branchcaches = branchmap.BranchMapCache() | ||
|
r24373 | self._revbranchcache = None | ||
|
r37155 | self._filterpats = {} | ||
|
r5966 | self._datafilters = {} | ||
|
r4916 | self._transref = self._lockref = self._wlockref = None | ||
|
r1089 | |||
|
r14929 | # A cache for various files under .hg/ that tracks file changes, | ||
# (used by the filecache decorator) | ||||
# | ||||
# Maps a property name to its util.filecacheentry | ||||
self._filecache = {} | ||||
|
r18101 | # hold sets of revision to be filtered | ||
# should be cleared when something might have changed the filter value: | ||||
# - new changesets, | ||||
# - phase change, | ||||
# - new obsolescence marker, | ||||
# - working directory parent change, | ||||
# - bookmark changes | ||||
self.filteredrevcache = {} | ||||
|
r32814 | # post-dirstate-status hooks | ||
self._postdsstatus = [] | ||||
|
r23558 | # generic mapping between names and nodes | ||
|
r23561 | self.names = namespaces.namespaces() | ||
|
r23558 | |||
|
r33302 | # Key to signature value. | ||
self._sparsesignaturecache = {} | ||||
# Signature to cached matcher instance. | ||||
self._sparsematchercache = {} | ||||
r42417 | self._extrafilterid = repoview.extrafilter(ui) | |||
|
r33436 | def _getvfsward(self, origfunc): | ||
"""build a ward for self.vfs""" | ||||
rref = weakref.ref(self) | ||||
def checkvfs(path, mode=None): | ||||
ret = origfunc(path, mode=mode) | ||||
repo = rref() | ||||
if (repo is None | ||||
or not util.safehasattr(repo, '_wlockref') | ||||
or not util.safehasattr(repo, '_lockref')): | ||||
return | ||||
if mode in (None, 'r', 'rb'): | ||||
return | ||||
if path.startswith(repo.path): | ||||
# truncate name relative to the repository (.hg) | ||||
path = path[len(repo.path) + 1:] | ||||
|
r33538 | if path.startswith('cache/'): | ||
msg = 'accessing cache with vfs instead of cachevfs: "%s"' | ||||
|
r40785 | repo.ui.develwarn(msg % path, stacklevel=3, config="cache-vfs") | ||
|
r40782 | if path.startswith('journal.') or path.startswith('undo.'): | ||
|
r33436 | # journal is covered by 'lock' | ||
if repo._currentlock(repo._lockref) is None: | ||||
repo.ui.develwarn('write with no lock: "%s"' % path, | ||||
|
r40785 | stacklevel=3, config='check-locks') | ||
|
r33436 | elif repo._currentlock(repo._wlockref) is None: | ||
# rest of vfs files are covered by 'wlock' | ||||
# | ||||
# exclude special files | ||||
for prefix in self._wlockfreeprefix: | ||||
if path.startswith(prefix): | ||||
return | ||||
repo.ui.develwarn('write with no wlock: "%s"' % path, | ||||
|
r40785 | stacklevel=3, config='check-locks') | ||
|
r33436 | return ret | ||
return checkvfs | ||||
|
r33437 | def _getsvfsward(self, origfunc): | ||
"""build a ward for self.svfs""" | ||||
rref = weakref.ref(self) | ||||
def checksvfs(path, mode=None): | ||||
ret = origfunc(path, mode=mode) | ||||
repo = rref() | ||||
if repo is None or not util.safehasattr(repo, '_lockref'): | ||||
return | ||||
if mode in (None, 'r', 'rb'): | ||||
return | ||||
if path.startswith(repo.sharedpath): | ||||
# truncate name relative to the repository (.hg) | ||||
path = path[len(repo.sharedpath) + 1:] | ||||
if repo._currentlock(repo._lockref) is None: | ||||
repo.ui.develwarn('write with no lock: "%s"' % path, | ||||
|
r40785 | stacklevel=4) | ||
|
r33437 | return ret | ||
return checksvfs | ||||
|
r17192 | def close(self): | ||
|
r24378 | self._writecaches() | ||
def _writecaches(self): | ||||
if self._revbranchcache: | ||||
self._revbranchcache.write() | ||||
|
r17192 | |||
def _restrictcapabilities(self, caps): | ||||
|
r33499 | if self.ui.configbool('experimental', 'bundle2-advertise'): | ||
|
r20955 | caps = set(caps) | ||
|
r35801 | capsblob = bundle2.encodecaps(bundle2.getrepocaps(self, | ||
role='client')) | ||||
|
r28883 | caps.add('bundle2=' + urlreq.quote(capsblob)) | ||
|
r17192 | return caps | ||
|
r12295 | def _writerequirements(self): | ||
|
r24934 | scmutil.writerequires(self.vfs, self.requirements) | ||
|
r12295 | |||
|
r39348 | # Don't cache auditor/nofsauditor, or you'll end up with reference cycle: | ||
# self -> auditor -> self._checknested -> self | ||||
@property | ||||
def auditor(self): | ||||
# This is only used by context.workingctx.match in order to | ||||
# detect files in subrepos. | ||||
return pathutil.pathauditor(self.root, callback=self._checknested) | ||||
@property | ||||
def nofsauditor(self): | ||||
# This is only used by context.basectx.match in order to detect | ||||
# files in subrepos. | ||||
return pathutil.pathauditor(self.root, callback=self._checknested, | ||||
realfs=False, cached=True) | ||||
|
r12162 | def _checknested(self, path): | ||
"""Determine if path is a legal nested repository.""" | ||||
if not path.startswith(self.root): | ||||
return False | ||||
subpath = path[len(self.root) + 1:] | ||||
|
r15722 | normsubpath = util.pconvert(subpath) | ||
|
r12162 | |||
# XXX: Checking against the current working copy is wrong in | ||||
# the sense that it can reject things like | ||||
# | ||||
# $ hg cat -r 10 sub/x.txt | ||||
# | ||||
# if sub/ is no longer a subrepository in the working copy | ||||
# parent revision. | ||||
# | ||||
# However, it can of course also allow things that would have | ||||
# been rejected before, such as the above cat command if sub/ | ||||
# is a subrepository now, but was a normal directory before. | ||||
# The old path auditor would have rejected by mistake since it | ||||
# panics when it sees sub/.hg/. | ||||
# | ||||
|
r12174 | # All in all, checking against the working copy seems sensible | ||
# since we want to prevent access to nested repositories on | ||||
# the filesystem *now*. | ||||
ctx = self[None] | ||||
|
r12162 | parts = util.splitpath(subpath) | ||
while parts: | ||||
|
r15722 | prefix = '/'.join(parts) | ||
|
r12162 | if prefix in ctx.substate: | ||
|
r15722 | if prefix == normsubpath: | ||
|
r12162 | return True | ||
else: | ||||
sub = ctx.sub(prefix) | ||||
return sub.checknested(subpath[len(prefix) + 1:]) | ||||
else: | ||||
parts.pop() | ||||
return False | ||||
|
r17192 | def peer(self): | ||
return localpeer(self) # not cached to avoid reference cycle | ||||
|
r17993 | def unfiltered(self): | ||
"""Return unfiltered version of the repository | ||||
|
r18644 | Intended to be overwritten by filtered repo.""" | ||
|
r17993 | return self | ||
|
r35508 | def filtered(self, name, visibilityexceptions=None): | ||
r42274 | """Return a filtered version of a repository | |||
The `name` parameter is the identifier of the requested view. This | ||||
will return a repoview object set "exactly" to the specified view. | ||||
This function does not apply recursive filtering to a repository. For | ||||
example calling `repo.filtered("served")` will return a repoview using | ||||
the "served" view, regardless of the initial view used by `repo`. | ||||
In other word, there is always only one level of `repoview` "filtering". | ||||
""" | ||||
r42417 | if self._extrafilterid is not None and '%' not in name: | |||
name = name + '%' + self._extrafilterid | ||||
|
r35248 | cls = repoview.newtype(self.unfiltered().__class__) | ||
|
r35508 | return cls(self, name, visibilityexceptions) | ||
|
r18100 | |||
|
r42613 | @mixedrepostorecache(('bookmarks', 'plain'), ('bookmarks.current', 'plain'), | ||
|
r42614 | ('bookmarks', ''), ('00changelog.i', '')) | ||
|
r13355 | def _bookmarks(self): | ||
r42903 | # Since the multiple files involved in the transaction cannot be | |||
# written atomically (with current repository format), there is a race | ||||
# condition here. | ||||
# | ||||
# 1) changelog content A is read | ||||
# 2) outside transaction update changelog to content B | ||||
# 3) outside transaction update bookmark file referring to content B | ||||
# 4) bookmarks file content is read and filtered against changelog-A | ||||
# | ||||
# When this happens, bookmarks against nodes missing from A are dropped. | ||||
# | ||||
# Having this happening during read is not great, but it become worse | ||||
# when this happen during write because the bookmarks to the "unknown" | ||||
# nodes will be dropped for good. However, writes happen within locks. | ||||
# This locking makes it possible to have a race free consistent read. | ||||
# For this purpose data read from disc before locking are | ||||
# "invalidated" right after the locks are taken. This invalidations are | ||||
# "light", the `filecache` mechanism keep the data in memory and will | ||||
# reuse them if the underlying files did not changed. Not parsing the | ||||
# same data multiple times helps performances. | ||||
# | ||||
# Unfortunately in the case describe above, the files tracked by the | ||||
# bookmarks file cache might not have changed, but the in-memory | ||||
# content is still "wrong" because we used an older changelog content | ||||
# to process the on-disk data. So after locking, the changelog would be | ||||
# refreshed but `_bookmarks` would be preserved. | ||||
# Adding `00changelog.i` to the list of tracked file is not | ||||
# enough, because at the time we build the content for `_bookmarks` in | ||||
# (4), the changelog file has already diverged from the content used | ||||
# for loading `changelog` in (1) | ||||
# | ||||
# To prevent the issue, we force the changelog to be explicitly | ||||
# reloaded while computing `_bookmarks`. The data race can still happen | ||||
# without the lock (with a narrower window), but it would no longer go | ||||
# undetected during the lock time refresh. | ||||
# | ||||
# The new schedule is as follow | ||||
# | ||||
# 1) filecache logic detect that `_bookmarks` needs to be computed | ||||
# 2) cachestat for `bookmarks` and `changelog` are captured (for book) | ||||
# 3) We force `changelog` filecache to be tested | ||||
# 4) cachestat for `changelog` are captured (for changelog) | ||||
# 5) `_bookmarks` is computed and cached | ||||
# | ||||
# The step in (3) ensure we have a changelog at least as recent as the | ||||
# cache stat computed in (1). As a result at locking time: | ||||
# * if the changelog did not changed since (1) -> we can reuse the data | ||||
# * otherwise -> the bookmarks get refreshed. | ||||
self._refreshchangelog() | ||||
|
r17922 | return bookmarks.bmstore(self) | ||
|
r13355 | |||
r42710 | def _refreshchangelog(self): | |||
"""make sure the in memory changelog match the on-disk one""" | ||||
if ('changelog' in vars(self) and self.currenttransaction() is None): | ||||
del self.changelog | ||||
|
r27698 | @property | ||
|
r24947 | def _activebookmark(self): | ||
|
r27698 | return self._bookmarks.active | ||
|
r12162 | |||
|
r35310 | # _phasesets depend on changelog. what we need is to call | ||
# _phasecache.invalidate() if '00changelog.i' was changed, but it | ||||
|
r26405 | # can't be easily expressed in filecache mechanism. | ||
@storecache('phaseroots', '00changelog.i') | ||||
|
r16657 | def _phasecache(self): | ||
return phases.phasecache(self, self._phasedefaults) | ||||
|
r15420 | |||
|
r17070 | @storecache('obsstore') | ||
def obsstore(self): | ||||
|
r32729 | return obsolete.makestore(self.ui, self) | ||
|
r17070 | |||
|
r16198 | @storecache('00changelog.i') | ||
|
r8260 | def changelog(self): | ||
|
r32292 | return changelog.changelog(self.svfs, | ||
trypending=txnutil.mayhavepending(self.root)) | ||||
|
r8260 | |||
|
r30219 | @storecache('00manifest.i') | ||
|
r29825 | def manifestlog(self): | ||
|
r39799 | rootstore = manifest.manifestrevlog(self.svfs) | ||
|
r41067 | return manifest.manifestlog(self.svfs, self, rootstore, | ||
|
r41266 | self._storenarrowmatch) | ||
|
r29825 | |||
|
r18014 | @repofilecache('dirstate') | ||
|
r8260 | def dirstate(self): | ||
|
r38142 | return self._makedirstate() | ||
def _makedirstate(self): | ||||
|
r38147 | """Extension point for wrapping the dirstate per-repo.""" | ||
|
r33373 | sparsematchfn = lambda: sparse.matcher(self) | ||
|
r26155 | return dirstate.dirstate(self.vfs, self.ui, self.root, | ||
|
r33373 | self._dirstatevalidate, sparsematchfn) | ||
|
r13032 | |||
|
r26155 | def _dirstatevalidate(self, node): | ||
try: | ||||
self.changelog.rev(node) | ||||
return node | ||||
except error.LookupError: | ||||
if not self._dirstatevalidatewarned: | ||||
self._dirstatevalidatewarned = True | ||||
self.ui.warn(_("warning: ignoring unknown" | ||||
" working parent %s!\n") % short(node)) | ||||
return nullid | ||||
|
r2155 | |||
|
r38908 | @storecache(narrowspec.FILENAME) | ||
|
r36489 | def narrowpats(self): | ||
"""matcher patterns for this repository's narrowspec | ||||
A tuple of (includes, excludes). | ||||
""" | ||||
|
r39794 | return narrowspec.load(self) | ||
|
r36489 | |||
|
r38908 | @storecache(narrowspec.FILENAME) | ||
|
r41266 | def _storenarrowmatch(self): | ||
if repository.NARROW_REQUIREMENT not in self.requirements: | ||||
|
r41825 | return matchmod.always() | ||
|
r41266 | include, exclude = self.narrowpats | ||
return narrowspec.match(self.root, include=include, exclude=exclude) | ||||
@storecache(narrowspec.FILENAME) | ||||
|
r36489 | def _narrowmatch(self): | ||
|
r38871 | if repository.NARROW_REQUIREMENT not in self.requirements: | ||
|
r41825 | return matchmod.always() | ||
|
r41072 | narrowspec.checkworkingcopynarrowspec(self) | ||
|
r36489 | include, exclude = self.narrowpats | ||
return narrowspec.match(self.root, include=include, exclude=exclude) | ||||
|
r40122 | def narrowmatch(self, match=None, includeexact=False): | ||
|
r40118 | """matcher corresponding the the repo's narrowspec | ||
If `match` is given, then that will be intersected with the narrow | ||||
matcher. | ||||
|
r40122 | |||
If `includeexact` is True, then any exact matches from `match` will | ||||
be included even if they're outside the narrowspec. | ||||
|
r40118 | """ | ||
if match: | ||||
|
r40122 | if includeexact and not self._narrowmatch.always(): | ||
# do not exclude explicitly-specified paths so that they can | ||||
# be warned later on | ||||
|
r41825 | em = matchmod.exact(match.files()) | ||
|
r40122 | nm = matchmod.unionmatcher([self._narrowmatch, em]) | ||
return matchmod.intersectmatchers(match, nm) | ||||
|
r40118 | return matchmod.intersectmatchers(match, self._narrowmatch) | ||
|
r36489 | return self._narrowmatch | ||
def setnarrowpats(self, newincludes, newexcludes): | ||||
|
r39593 | narrowspec.save(self, newincludes, newexcludes) | ||
|
r36489 | self.invalidate(clearfilecache=True) | ||
|
r6747 | def __getitem__(self, changeid): | ||
|
r32658 | if changeid is None: | ||
|
r6747 | return context.workingctx(self) | ||
|
r37191 | if isinstance(changeid, context.basectx): | ||
return changeid | ||||
|
r23630 | if isinstance(changeid, slice): | ||
|
r32658 | # wdirrev isn't contiguous so the slice shouldn't include it | ||
|
r39993 | return [self[i] | ||
|
r38806 | for i in pycompat.xrange(*changeid.indices(len(self))) | ||
|
r23630 | if i not in self.changelog.filteredrevs] | ||
|
r32658 | try: | ||
|
r39994 | if isinstance(changeid, int): | ||
node = self.changelog.node(changeid) | ||||
rev = changeid | ||||
elif changeid == 'null': | ||||
node = nullid | ||||
rev = nullrev | ||||
elif changeid == 'tip': | ||||
node = self.changelog.tip() | ||||
rev = self.changelog.rev(node) | ||||
|
r39995 | elif changeid == '.': | ||
|
r39994 | # this is a hack to delay/avoid loading obsmarkers | ||
# when we know that '.' won't be hidden | ||||
node = self.dirstate.p1() | ||||
rev = self.unfiltered().changelog.rev(node) | ||||
elif len(changeid) == 20: | ||||
try: | ||||
node = changeid | ||||
rev = self.changelog.rev(changeid) | ||||
except error.FilteredLookupError: | ||||
changeid = hex(changeid) # for the error message | ||||
raise | ||||
except LookupError: | ||||
# check if it might have come from damaged dirstate | ||||
# | ||||
# XXX we could avoid the unfiltered if we had a recognizable | ||||
# exception for filtered changeset access | ||||
if (self.local() | ||||
and changeid in self.unfiltered().dirstate.parents()): | ||||
msg = _("working directory has unknown parent '%s'!") | ||||
raise error.Abort(msg % short(changeid)) | ||||
changeid = hex(changeid) # for the error message | ||||
|
r40099 | raise | ||
|
r39994 | |||
elif len(changeid) == 40: | ||||
|
r40099 | node = bin(changeid) | ||
rev = self.changelog.rev(node) | ||||
|
r39994 | else: | ||
raise error.ProgrammingError( | ||||
"unsupported changeid '%s' of type %s" % | ||||
(changeid, type(changeid))) | ||||
|
r40100 | return context.changectx(self, rev, node) | ||
|
r39994 | except (error.FilteredIndexError, error.FilteredLookupError): | ||
raise error.FilteredRepoLookupError(_("filtered revision '%s'") | ||||
% pycompat.bytestr(changeid)) | ||||
|
r40099 | except (IndexError, LookupError): | ||
|
r40389 | raise error.RepoLookupError( | ||
_("unknown revision '%s'") % pycompat.bytestr(changeid)) | ||||
|
r32658 | except error.WdirUnsupported: | ||
return context.workingctx(self) | ||||
|
r6747 | |||
|
r9924 | def __contains__(self, changeid): | ||
|
r32481 | """True if the given changeid exists | ||
|
r38877 | error.AmbiguousPrefixLookupError is raised if an ambiguous node | ||
specified. | ||||
|
r32481 | """ | ||
|
r9924 | try: | ||
|
r24320 | self[changeid] | ||
return True | ||||
|
r37815 | except error.RepoLookupError: | ||
|
r9924 | return False | ||
|
r6750 | def __nonzero__(self): | ||
return True | ||||
|
r31476 | __bool__ = __nonzero__ | ||
|
r6750 | def __len__(self): | ||
|
r35754 | # no need to pay the cost of repoview.changelog | ||
unfi = self.unfiltered() | ||||
return len(unfi.changelog) | ||||
|
r6750 | |||
def __iter__(self): | ||||
|
r17675 | return iter(self.changelog) | ||
|
r2155 | |||
|
r15403 | def revs(self, expr, *args): | ||
|
r27071 | '''Find revisions matching a revset. | ||
The revset is specified as a string ``expr`` that may contain | ||||
|
r31024 | %-formatting to escape certain types. See ``revsetlang.formatspec``. | ||
|
r27071 | |||
|
r29417 | Revset aliases from the configuration are not expanded. To expand | ||
|
r31025 | user aliases, consider calling ``scmutil.revrange()`` or | ||
``repo.anyrevs([expr], user=True)``. | ||||
|
r29417 | |||
Returns a revset.abstractsmartset, which is a list-like interface | ||||
|
r27071 | that contains integer revisions. | ||
''' | ||||
|
r41258 | tree = revsetlang.spectree(expr, *args) | ||
return revset.makematcher(tree)(self) | ||||
|
r15403 | |||
|
r14902 | def set(self, expr, *args): | ||
|
r27071 | '''Find revisions matching a revset and emit changectx instances. | ||
This is a convenience wrapper around ``revs()`` that iterates the | ||||
result and is a generator of changectx instances. | ||||
|
r29417 | |||
Revset aliases from the configuration are not expanded. To expand | ||||
user aliases, consider calling ``scmutil.revrange()``. | ||||
|
r14902 | ''' | ||
|
r15403 | for r in self.revs(expr, *args): | ||
|
r14902 | yield self[r] | ||
|
r33336 | def anyrevs(self, specs, user=False, localalias=None): | ||
|
r31025 | '''Find revisions matching one of the given revsets. | ||
Revset aliases from the configuration are not expanded by default. To | ||||
|
r33336 | expand user aliases, specify ``user=True``. To provide some local | ||
definitions overriding user aliases, set ``localalias`` to | ||||
``{name: definitionstring}``. | ||||
|
r31025 | ''' | ||
if user: | ||||
|
r37692 | m = revset.matchany(self.ui, specs, | ||
lookup=revset.lookupfn(self), | ||||
|
r33336 | localalias=localalias) | ||
|
r31025 | else: | ||
|
r33336 | m = revset.matchany(None, specs, localalias=localalias) | ||
|
r31025 | return m(self) | ||
|
r2673 | def url(self): | ||
return 'file:' + self.root | ||||
|
r1718 | def hook(self, name, throw=False, **args): | ||
|
r21866 | """Call a hook, passing this repo instance. | ||
This a convenience method to aid invoking hooks. Extensions likely | ||||
won't call this unless they have registered a custom hook or are | ||||
replacing code that is expected to call a hook. | ||||
""" | ||||
|
r4622 | return hook.hook(self.ui, self, name, throw, **args) | ||
|
r1089 | |||
|
r18013 | @filteredpropertycache | ||
|
r14936 | def _tagscache(self): | ||
|
r16683 | '''Returns a tagscache object that contains various tags related | ||
caches.''' | ||||
|
r14936 | |||
# This simplifies its cache management by having one decorated | ||||
# function (this one) and the rest simply fetch things from it. | ||||
class tagscache(object): | ||||
def __init__(self): | ||||
# These two define the set of tags for this repository. tags | ||||
# maps tag name to node; tagtypes maps tag name to 'global' or | ||||
# 'local'. (Global tags are defined by .hgtags across all | ||||
# heads, and local tags are defined in .hg/localtags.) | ||||
# They constitute the in-memory cache of tags. | ||||
self.tags = self.tagtypes = None | ||||
self.nodetagscache = self.tagslist = None | ||||
cache = tagscache() | ||||
cache.tags, cache.tagtypes = self._findtags() | ||||
return cache | ||||
|
r1089 | def tags(self): | ||
'''return a mapping of tag to node''' | ||||
|
r16371 | t = {} | ||
|
r17715 | if self.changelog.filteredrevs: | ||
tags, tt = self._findtags() | ||||
else: | ||||
tags = self._tagscache.tags | ||||
|
r40776 | rev = self.changelog.rev | ||
|
r17715 | for k, v in tags.iteritems(): | ||
|
r16371 | try: | ||
# ignore tags to unknown nodes | ||||
|
r40776 | rev(v) | ||
|
r16371 | t[k] = v | ||
|
r16679 | except (error.LookupError, ValueError): | ||
|
r16371 | pass | ||
return t | ||||
|
r4210 | |||
|
r9145 | def _findtags(self): | ||
'''Do the hard work of finding tags. Return a pair of dicts | ||||
(tags, tagtypes) where tags maps tag name to node, and tagtypes | ||||
maps tag name to a string like \'global\' or \'local\'. | ||||
Subclasses or extensions are free to add their own tags, but | ||||
should be aware that the returned dicts will be retained for the | ||||
duration of the localrepo object.''' | ||||
# XXX what tagtype should subclasses/extensions use? Currently | ||||
# mq and bookmarks add tags, but do not set the tagtype at all. | ||||
# Should each extension invent its own tag type? Should there | ||||
# be one tagtype for all such "virtual" tags? Or is the status | ||||
# quo fine? | ||||
|
r4210 | |||
|
r1089 | |||
|
r31709 | # map tag name to (node, hist) | ||
alltags = tagsmod.findglobaltags(self.ui, self) | ||||
# map tag name to tag type | ||||
tagtypes = dict((tag, 'global') for tag in alltags) | ||||
|
r31706 | |||
|
r10651 | tagsmod.readlocaltags(self.ui, self, alltags, tagtypes) | ||
|
r5657 | |||
|
r9152 | # Build the return dicts. Have to re-encode tag names because | ||
# the tags module always uses UTF-8 (in order not to lose info | ||||
# writing to the cache), but the rest of Mercurial wants them in | ||||
# local encoding. | ||||
|
r9145 | tags = {} | ||
|
r9147 | for (name, (node, hist)) in alltags.iteritems(): | ||
if node != nullid: | ||||
|
r16371 | tags[encoding.tolocal(name)] = node | ||
|
r9145 | tags['tip'] = self.changelog.tip() | ||
|
r9152 | tagtypes = dict([(encoding.tolocal(name), value) | ||
for (name, value) in tagtypes.iteritems()]) | ||||
|
r9145 | return (tags, tagtypes) | ||
|
r1089 | |||
|
r5657 | def tagtype(self, tagname): | ||
''' | ||||
return the type of the given tag. result can be: | ||||
'local' : a local tag | ||||
'global' : a global tag | ||||
None : tag does not exist | ||||
''' | ||||
|
r14936 | return self._tagscache.tagtypes.get(tagname) | ||
|
r5657 | |||
|
r1089 | def tagslist(self): | ||
'''return a list of tags ordered by revision''' | ||||
|
r14936 | if not self._tagscache.tagslist: | ||
l = [] | ||||
for t, n in self.tags().iteritems(): | ||||
|
r22201 | l.append((self.changelog.rev(n), t, n)) | ||
|
r14936 | self._tagscache.tagslist = [(t, n) for r, t, n in sorted(l)] | ||
return self._tagscache.tagslist | ||||
|
r1089 | |||
def nodetags(self, node): | ||||
'''return the tags associated with a node''' | ||||
|
r14936 | if not self._tagscache.nodetagscache: | ||
nodetagscache = {} | ||||
|
r16371 | for t, n in self._tagscache.tags.iteritems(): | ||
|
r14936 | nodetagscache.setdefault(n, []).append(t) | ||
for tags in nodetagscache.itervalues(): | ||||
|
r11047 | tags.sort() | ||
|
r14936 | self._tagscache.nodetagscache = nodetagscache | ||
return self._tagscache.nodetagscache.get(node, []) | ||||
|
r1089 | |||
|
r13384 | def nodebookmarks(self, node): | ||
|
r27166 | """return the list of bookmarks pointing to the specified node""" | ||
|
r37867 | return self._bookmarks.names(node) | ||
|
r13384 | |||
|
r12066 | def branchmap(self): | ||
|
r20245 | '''returns a dictionary {branch: [branchheads]} with branchheads | ||
ordered by increasing revision number''' | ||||
|
r41764 | return self._branchcaches[self] | ||
|
r17714 | |||
|
r24373 | @unfilteredmethod | ||
def revbranchcache(self): | ||||
if not self._revbranchcache: | ||||
self._revbranchcache = branchmap.revbranchcache(self.unfiltered()) | ||||
return self._revbranchcache | ||||
|
r23775 | def branchtip(self, branch, ignoremissing=False): | ||
'''return the tip node for a given branch | ||||
If ignoremissing is True, then this method will not raise an error. | ||||
This is helpful for callers that only expect None for a missing branch | ||||
(e.g. namespace). | ||||
''' | ||||
|
r20187 | try: | ||
return self.branchmap().branchtip(branch) | ||||
except KeyError: | ||||
|
r23775 | if not ignoremissing: | ||
raise error.RepoLookupError(_("unknown branch '%s'") % branch) | ||||
else: | ||||
pass | ||||
|
r16719 | |||
|
r1089 | def lookup(self, key): | ||
|
r42248 | node = scmutil.revsymbol(self, key).node() | ||
if node is None: | ||||
raise error.RepoLookupError(_("unknown revision '%s'") % key) | ||||
return node | ||||
|
r1089 | |||
|
r37369 | def lookupbranch(self, key): | ||
|
r42171 | if self.branchmap().hasbranch(key): | ||
|
r10960 | return key | ||
|
r37370 | return scmutil.revsymbol(self, key).branch() | ||
|
r10960 | |||
|
r13723 | def known(self, nodes): | ||
|
r27319 | cl = self.changelog | ||
nm = cl.nodemap | ||||
filtered = cl.filteredrevs | ||||
|
r15889 | result = [] | ||
for n in nodes: | ||||
r = nm.get(n) | ||||
|
r27319 | resp = not (r is None or r in filtered) | ||
|
r15889 | result.append(resp) | ||
return result | ||||
|
r13723 | |||
|
r1089 | def local(self): | ||
|
r14603 | return self | ||
|
r1089 | |||
|
r25623 | def publishing(self): | ||
|
r25625 | # it's safe (and desirable) to trust the publish flag unconditionally | ||
# so that we don't finalize changes shared between users via ssh or nfs | ||||
|
r33499 | return self.ui.configbool('phases', 'publish', untrusted=True) | ||
|
r25623 | |||
|
r17192 | def cancopy(self): | ||
|
r20332 | # so statichttprepo's override of local() works | ||
if not self.local(): | ||||
return False | ||||
|
r25624 | if not self.publishing(): | ||
|
r20332 | return True | ||
# if publishing we can't copy if there is filtered content | ||||
return not self.filtered('visible').changelog.filteredrevs | ||||
|
r17192 | |||
|
r23666 | def shared(self): | ||
'''the type of shared repository (None if not shared)''' | ||||
if self.sharedpath != self.path: | ||||
return 'store' | ||||
return None | ||||
|
r22362 | def wjoin(self, f, *insidef): | ||
|
r23714 | return self.vfs.reljoin(self.root, f, *insidef) | ||
|
r1089 | |||
|
r16551 | def setparents(self, p1, p2=nullid): | ||
|
r32350 | with self.dirstate.parentchange(): | ||
copies = self.dirstate.setparents(p1, p2) | ||||
pctx = self[p1] | ||||
if copies: | ||||
# Adjust copy records, the dirstate cannot do it, it | ||||
# requires access to parents manifests. Preserve them | ||||
# only for entries added to first parent. | ||||
for f in copies: | ||||
if f not in pctx and copies[f] in pctx: | ||||
self.dirstate.copy(copies[f], f) | ||||
if p2 == nullid: | ||||
for f, s in sorted(self.dirstate.copies().items()): | ||||
if f not in pctx and s not in pctx: | ||||
self.dirstate.copy(None, f) | ||||
|
r16551 | |||
|
r37189 | def filectx(self, path, changeid=None, fileid=None, changectx=None): | ||
|
r40754 | """changeid must be a changeset revision, if specified. | ||
|
r2564 | fileid can be a file revision or node.""" | ||
|
r37189 | return context.filectx(self, path, changeid, fileid, | ||
changectx=changectx) | ||||
|
r2564 | |||
|
r1089 | def getcwd(self): | ||
return self.dirstate.getcwd() | ||||
|
r4525 | def pathto(self, f, cwd=None): | ||
return self.dirstate.pathto(f, cwd) | ||||
|
r11698 | def _loadfilter(self, filter): | ||
|
r37155 | if filter not in self._filterpats: | ||
|
r1258 | l = [] | ||
|
r4004 | for pat, cmd in self.ui.configitems(filter): | ||
|
r7226 | if cmd == '!': | ||
continue | ||||
|
r10651 | mf = matchmod.match(self.root, '', [pat]) | ||
|
r5966 | fn = None | ||
|
r6066 | params = cmd | ||
|
r5966 | for name, filterfn in self._datafilters.iteritems(): | ||
|
r6210 | if cmd.startswith(name): | ||
|
r5966 | fn = filterfn | ||
|
r6066 | params = cmd[len(name):].lstrip() | ||
|
r5966 | break | ||
if not fn: | ||||
|
r37138 | fn = lambda s, c, **kwargs: procutil.filter(s, c) | ||
|
r5967 | # Wrap old filters not supporting keyword arguments | ||
|
r36196 | if not pycompat.getargspec(fn)[2]: | ||
|
r5967 | oldfn = fn | ||
fn = lambda s, c, **kwargs: oldfn(s, c) | ||||
|
r6066 | l.append((mf, fn, params)) | ||
|
r37155 | self._filterpats[filter] = l | ||
return self._filterpats[filter] | ||||
|
r1258 | |||
|
r12707 | def _filter(self, filterpats, filename, data): | ||
for mf, fn, cmd in filterpats: | ||||
|
r1258 | if mf(filename): | ||
|
r9467 | self.ui.debug("filtering %s through %s\n" % (filename, cmd)) | ||
|
r5967 | data = fn(data, cmd, ui=self.ui, repo=self, filename=filename) | ||
|
r1258 | break | ||
return data | ||||
|
r1089 | |||
|
r18013 | @unfilteredpropertycache | ||
|
r12708 | def _encodefilterpats(self): | ||
return self._loadfilter('encode') | ||||
|
r18013 | @unfilteredpropertycache | ||
|
r12708 | def _decodefilterpats(self): | ||
return self._loadfilter('decode') | ||||
|
r5966 | def adddatafilter(self, name, filter): | ||
self._datafilters[name] = filter | ||||
|
r4004 | def wread(self, filename): | ||
|
r31428 | if self.wvfs.islink(filename): | ||
|
r18950 | data = self.wvfs.readlink(filename) | ||
|
r4004 | else: | ||
|
r23854 | data = self.wvfs.read(filename) | ||
|
r12708 | return self._filter(self._encodefilterpats, filename, data) | ||
|
r1258 | |||
|
r35743 | def wwrite(self, filename, data, flags, backgroundclose=False, **kwargs): | ||
|
r24843 | """write ``data`` into ``filename`` in the working directory | ||
This returns length of written (maybe decoded) data. | ||||
""" | ||||
|
r12708 | data = self._filter(self._decodefilterpats, filename, data) | ||
|
r6877 | if 'l' in flags: | ||
|
r23854 | self.wvfs.symlink(data, filename) | ||
|
r6877 | else: | ||
|
r35743 | self.wvfs.write(filename, data, backgroundclose=backgroundclose, | ||
**kwargs) | ||||
|
r6877 | if 'x' in flags: | ||
|
r18951 | self.wvfs.setflags(filename, False, True) | ||
|
r35744 | else: | ||
self.wvfs.setflags(filename, False, False) | ||||
|
r24843 | return len(data) | ||
|
r1258 | |||
|
r4005 | def wwritedata(self, filename, data): | ||
|
r12708 | return self._filter(self._decodefilterpats, filename, data) | ||
|
r1089 | |||
|
r23379 | def currenttransaction(self): | ||
"""return the current transaction or None if non exists""" | ||||
|
r24306 | if self._transref: | ||
tr = self._transref() | ||||
else: | ||||
tr = None | ||||
|
r8072 | if tr and tr.running(): | ||
|
r23379 | return tr | ||
return None | ||||
def transaction(self, desc, report=None): | ||||
|
r25290 | if (self.ui.configbool('devel', 'all-warnings') | ||
|
r24388 | or self.ui.configbool('devel', 'check-locks')): | ||
|
r29705 | if self._currentlock(self._lockref) is None: | ||
|
r30574 | raise error.ProgrammingError('transaction requires locking') | ||
|
r23379 | tr = self.currenttransaction() | ||
if tr is not None: | ||||
|
r36837 | return tr.nest(name=desc) | ||
|
r1806 | |||
|
r5865 | # abort here if the journal already exists | ||
|
r18947 | if self.svfs.exists("journal"): | ||
|
r10282 | raise error.RepoError( | ||
|
r21274 | _("abandoned transaction found"), | ||
hint=_("run 'hg recover' to clean up transaction")) | ||||
|
r5865 | |||
|
r25267 | idbase = "%.40f#%f" % (random.random(), time.time()) | ||
|
r31523 | ha = hex(hashlib.sha1(idbase).digest()) | ||
|
r31508 | txnid = 'TXN:' + ha | ||
|
r25268 | self.hook('pretxnopen', throw=True, txnname=desc, txnid=txnid) | ||
|
r24281 | |||
|
r16236 | self._writejournal(desc) | ||
|
r18952 | renames = [(vfs, x, undoname(x)) for vfs, x in self._journalfiles()] | ||
|
r24306 | if report: | ||
rp = report | ||||
else: | ||||
rp = self.ui.warn | ||||
|
r40092 | vfsmap = {'plain': self.vfs, 'store': self.svfs} # root of .hg/ | ||
|
r24284 | # we must avoid cyclic reference between repo and transaction. | ||
reporef = weakref.ref(self) | ||||
|
r31994 | # Code to track tag movement | ||
# | ||||
# Since tags are all handled as file content, it is actually quite hard | ||||
# to track these movement from a code perspective. So we fallback to a | ||||
# tracking at the repository level. One could envision to track changes | ||||
# to the '.hgtags' file through changegroup apply but that fails to | ||||
# cope with case where transaction expose new heads without changegroup | ||||
# being involved (eg: phase movement). | ||||
# | ||||
# For now, We gate the feature behind a flag since this likely comes | ||||
# with performance impacts. The current code run more often than needed | ||||
# and do not use caches as much as it could. The current focus is on | ||||
# the behavior of the feature so we disable it by default. The flag | ||||
# will be removed when we are happy with the performance impact. | ||||
|
r31996 | # | ||
# Once this feature is no longer experimental move the following | ||||
# documentation to the appropriate help section: | ||||
# | ||||
# The ``HG_TAG_MOVED`` variable will be set if the transaction touched | ||||
# tags (new or changed or deleted tags). In addition the details of | ||||
# these changes are made available in a file at: | ||||
# ``REPOROOT/.hg/changes/tags.changes``. | ||||
# Make sure you check for HG_TAG_MOVED before reading that file as it | ||||
# might exist from a previous transaction even if no tag were touched | ||||
# in this one. Changes are recorded in a line base format:: | ||||
# | ||||
# <action> <hex-node> <tag-name>\n | ||||
# | ||||
# Actions are defined as follow: | ||||
# "-R": tag is removed, | ||||
# "+A": tag is added, | ||||
# "-M": tag is moved (old value), | ||||
# "+M": tag is moved (new value), | ||||
|
r31994 | tracktags = lambda x: None | ||
# experimental config: experimental.hook-track-tags | ||||
|
r33499 | shouldtracktags = self.ui.configbool('experimental', 'hook-track-tags') | ||
|
r31994 | if desc != 'strip' and shouldtracktags: | ||
oldheads = self.changelog.headrevs() | ||||
def tracktags(tr2): | ||||
repo = reporef() | ||||
oldfnodes = tagsmod.fnoderevs(repo.ui, repo, oldheads) | ||||
newheads = repo.changelog.headrevs() | ||||
newfnodes = tagsmod.fnoderevs(repo.ui, repo, newheads) | ||||
# notes: we compare lists here. | ||||
# As we do it only once buiding set would not be cheaper | ||||
|
r31995 | changes = tagsmod.difftags(repo.ui, repo, oldfnodes, newfnodes) | ||
if changes: | ||||
|
r31994 | tr2.hookargs['tag_moved'] = '1' | ||
|
r31996 | with repo.vfs('changes/tags.changes', 'w', | ||
atomictemp=True) as changesfile: | ||||
# note: we do not register the file to the transaction | ||||
# because we needs it to still exist on the transaction | ||||
# is close (for txnclose hooks) | ||||
tagsmod.writediff(changesfile, changes) | ||||
|
r31994 | def validate(tr2): | ||
|
r24284 | """will run pre-closing hooks""" | ||
|
r31994 | # XXX the transaction API is a bit lacking here so we take a hacky | ||
# path for now | ||||
# | ||||
# We cannot add this as a "pending" hooks since the 'tr.hookargs' | ||||
# dict is copied before these run. In addition we needs the data | ||||
# available to in memory hooks too. | ||||
# | ||||
# Moreover, we also need to make sure this runs before txnclose | ||||
# hooks and there is no "pending" mechanism that would execute | ||||
# logic only if hooks are about to run. | ||||
# | ||||
# Fixing this limitation of the transaction is also needed to track | ||||
# other families of changes (bookmarks, phases, obsolescence). | ||||
# | ||||
# This will have to be fixed before we remove the experimental | ||||
# gating. | ||||
tracktags(tr2) | ||||
|
r34710 | repo = reporef() | ||
|
r35186 | if repo.ui.configbool('experimental', 'single-head-per-branch'): | ||
scmutil.enforcesinglehead(repo, tr2, desc) | ||||
|
r34710 | if hook.hashook(repo.ui, 'pretxnclose-bookmark'): | ||
for name, (old, new) in sorted(tr.changes['bookmarks'].items()): | ||||
args = tr.hookargs.copy() | ||||
args.update(bookmarks.preparehookargs(name, old, new)) | ||||
repo.hook('pretxnclose-bookmark', throw=True, | ||||
**pycompat.strkwargs(args)) | ||||
|
r34712 | if hook.hashook(repo.ui, 'pretxnclose-phase'): | ||
cl = repo.unfiltered().changelog | ||||
for rev, (old, new) in tr.changes['phases'].items(): | ||||
args = tr.hookargs.copy() | ||||
node = hex(cl.node(rev)) | ||||
args.update(phases.preparehookargs(node, old, new)) | ||||
r42062 | repo.hook('pretxnclose-phase', throw=True, | |||
|
r34712 | **pycompat.strkwargs(args)) | ||
|
r34710 | |||
repo.hook('pretxnclose', throw=True, | ||||
r42062 | **pycompat.strkwargs(tr.hookargs)) | |||
|
r26577 | def releasefn(tr, success): | ||
repo = reporef() | ||||
|
r42894 | if repo is None: | ||
# If the repo has been GC'd (and this release function is being | ||||
# called from transaction.__del__), there's not much we can do, | ||||
# so just leave the unfinished transaction there and let the | ||||
# user run `hg recover`. | ||||
return | ||||
|
r26577 | if success: | ||
|
r26634 | # this should be explicitly invoked here, because | ||
# in-memory changes aren't written out at closing | ||||
# transaction, if tr.addfilegenerator (via | ||||
# dirstate.write or so) isn't invoked while | ||||
# transaction running | ||||
|
r26748 | repo.dirstate.write(None) | ||
|
r26577 | else: | ||
# discard all changes (including ones already written | ||||
# out) in this transaction | ||||
|
r38905 | narrowspec.restorebackup(self, 'journal.narrowspec') | ||
|
r41264 | narrowspec.restorewcbackup(self, 'journal.narrowspec.dirstate') | ||
|
r33440 | repo.dirstate.restorebackup(None, 'journal.dirstate') | ||
|
r24284 | |||
|
r26831 | repo.invalidate(clearfilecache=True) | ||
|
r25667 | tr = transaction.transaction(rp, self.svfs, vfsmap, | ||
|
r20087 | "journal", | ||
|
r23903 | "undo", | ||
|
r14266 | aftertrans(renames), | ||
|
r24284 | self.store.createmode, | ||
|
r26577 | validator=validate, | ||
|
r33278 | releasefn=releasefn, | ||
|
r36837 | checkambigfiles=_cachedfiles, | ||
name=desc) | ||||
|
r39337 | tr.changes['origrepolen'] = len(self) | ||
r33248 | tr.changes['obsmarkers'] = set() | |||
|
r33451 | tr.changes['phases'] = {} | ||
|
r33516 | tr.changes['bookmarks'] = {} | ||
|
r24740 | |||
|
r25267 | tr.hookargs['txnid'] = txnid | ||
r42062 | tr.hookargs['txnname'] = desc | |||
|
r23511 | # note: writing the fncache only during finalize mean that the file is | ||
# outdated when running hooks. As fncache is used for streaming clone, | ||||
# this is not expected to break anything that happen during the hooks. | ||||
tr.addfinalize('flush-fncache', self.store.write) | ||||
|
r24282 | def txnclosehook(tr2): | ||
"""To be run if transaction is successful, will schedule a hook run | ||||
""" | ||||
|
r27907 | # Don't reference tr2 in hook() so we don't hold a reference. | ||
# This reduces memory consumption when there are multiple | ||||
# transactions per lock. This can likely go away if issue5045 | ||||
# fixes the function accumulation. | ||||
hookargs = tr2.hookargs | ||||
|
r34709 | def hookfunc(): | ||
repo = reporef() | ||||
if hook.hashook(repo.ui, 'txnclose-bookmark'): | ||||
bmchanges = sorted(tr.changes['bookmarks'].items()) | ||||
for name, (old, new) in bmchanges: | ||||
args = tr.hookargs.copy() | ||||
args.update(bookmarks.preparehookargs(name, old, new)) | ||||
repo.hook('txnclose-bookmark', throw=False, | ||||
r42062 | **pycompat.strkwargs(args)) | |||
|
r34709 | |||
|
r34711 | if hook.hashook(repo.ui, 'txnclose-phase'): | ||
cl = repo.unfiltered().changelog | ||||
phasemv = sorted(tr.changes['phases'].items()) | ||||
for rev, (old, new) in phasemv: | ||||
args = tr.hookargs.copy() | ||||
node = hex(cl.node(rev)) | ||||
args.update(phases.preparehookargs(node, old, new)) | ||||
r42062 | repo.hook('txnclose-phase', throw=False, | |||
|
r34711 | **pycompat.strkwargs(args)) | ||
r42062 | repo.hook('txnclose', throw=False, | |||
|
r34709 | **pycompat.strkwargs(hookargs)) | ||
reporef()._afterlock(hookfunc) | ||||
|
r24282 | tr.addfinalize('txnclose-hook', txnclosehook) | ||
|
r35767 | # Include a leading "-" to make it happen before the transaction summary | ||
# reports registered via scmutil.registersummarycallback() whose names | ||||
# are 00-txnreport etc. That way, the caches will be warm when the | ||||
# callbacks run. | ||||
tr.addpostclose('-warm-cache', self._buildcacheupdater(tr)) | ||||
|
r24792 | def txnaborthook(tr2): | ||
"""To be run if transaction is aborted | ||||
""" | ||||
r42062 | reporef().hook('txnabort', throw=False, | |||
|
r35858 | **pycompat.strkwargs(tr2.hookargs)) | ||
|
r24792 | tr.addabort('txnabort-hook', txnaborthook) | ||
|
r26251 | # avoid eager cache invalidation. in-memory data should be identical | ||
# to stored data if transaction has no error. | ||||
tr.addpostclose('refresh-filecachestats', self._refreshfilecachestats) | ||||
|
r14266 | self._transref = weakref.ref(tr) | ||
|
r33541 | scmutil.registersummarycallback(self, tr, desc) | ||
|
r14266 | return tr | ||
|
r16236 | def _journalfiles(self): | ||
|
r18952 | return ((self.svfs, 'journal'), | ||
|
r41262 | (self.svfs, 'journal.narrowspec'), | ||
|
r41264 | (self.vfs, 'journal.narrowspec.dirstate'), | ||
|
r18952 | (self.vfs, 'journal.dirstate'), | ||
(self.vfs, 'journal.branch'), | ||||
(self.vfs, 'journal.desc'), | ||||
|
r42512 | (bookmarks.bookmarksvfs(self), 'journal.bookmarks'), | ||
|
r18952 | (self.svfs, 'journal.phaseroots')) | ||
|
r16236 | |||
def undofiles(self): | ||||
|
r20975 | return [(vfs, undoname(x)) for vfs, x in self._journalfiles()] | ||
|
r16236 | |||
r32452 | @unfilteredmethod | |||
|
r14266 | def _writejournal(self, desc): | ||
|
r33440 | self.dirstate.savebackup(None, 'journal.dirstate') | ||
|
r41264 | narrowspec.savewcbackup(self, 'journal.narrowspec.dirstate') | ||
|
r38905 | narrowspec.savebackup(self, 'journal.narrowspec') | ||
|
r23852 | self.vfs.write("journal.branch", | ||
|
r14168 | encoding.fromlocal(self.dirstate.branch())) | ||
|
r23852 | self.vfs.write("journal.desc", | ||
|
r14168 | "%d\n%s\n" % (len(self), desc)) | ||
|
r42512 | bookmarksvfs = bookmarks.bookmarksvfs(self) | ||
bookmarksvfs.write("journal.bookmarks", | ||||
bookmarksvfs.tryread("bookmarks")) | ||||
|
r23853 | self.svfs.write("journal.phaseroots", | ||
self.svfs.tryread("phaseroots")) | ||||
|
r14266 | |||
|
r1089 | def recover(self): | ||
|
r27846 | with self.lock(): | ||
|
r18947 | if self.svfs.exists("journal"): | ||
|
r4915 | self.ui.status(_("rolling back interrupted transaction\n")) | ||
|
r23853 | vfsmap = {'': self.svfs, | ||
|
r23852 | 'plain': self.vfs,} | ||
|
r23853 | transaction.rollback(self.svfs, vfsmap, "journal", | ||
|
r33278 | self.ui.warn, | ||
checkambigfiles=_cachedfiles) | ||||
|
r4915 | self.invalidate() | ||
return True | ||||
else: | ||||
self.ui.warn(_("no interrupted transaction available\n")) | ||||
return False | ||||
|
r1089 | |||
|
r15183 | def rollback(self, dryrun=False, force=False): | ||
|
r26631 | wlock = lock = dsguard = None | ||
|
r4915 | try: | ||
|
r1712 | wlock = self.wlock() | ||
|
r4438 | lock = self.lock() | ||
|
r18947 | if self.svfs.exists("undo"): | ||
|
r30492 | dsguard = dirstateguard.dirstateguard(self, 'rollback') | ||
|
r26631 | |||
return self._rollback(dryrun, force, dsguard) | ||||
|
r4915 | else: | ||
self.ui.warn(_("no rollback information available\n")) | ||||
|
r11177 | return 1 | ||
|
r4915 | finally: | ||
|
r26631 | release(dsguard, lock, wlock) | ||
|
r1089 | |||
|
r18016 | @unfilteredmethod # Until we get smarter cache management | ||
|
r26631 | def _rollback(self, dryrun, force, dsguard): | ||
|
r15130 | ui = self.ui | ||
|
r15097 | try: | ||
|
r23852 | args = self.vfs.read('undo.desc').splitlines() | ||
|
r15130 | (oldlen, desc, detail) = (int(args[0]), args[1], None) | ||
if len(args) >= 3: | ||||
detail = args[2] | ||||
oldtip = oldlen - 1 | ||||
if detail and ui.verbose: | ||||
|
r32895 | msg = (_('repository tip rolled back to revision %d' | ||
|
r15130 | ' (undo %s: %s)\n') | ||
% (oldtip, desc, detail)) | ||||
else: | ||||
|
r32895 | msg = (_('repository tip rolled back to revision %d' | ||
|
r15130 | ' (undo %s)\n') | ||
% (oldtip, desc)) | ||||
|
r15097 | except IOError: | ||
|
r15130 | msg = _('rolling back unknown transaction\n') | ||
|
r15183 | desc = None | ||
if not force and self['.'] != self['tip'] and desc == 'commit': | ||||
|
r26587 | raise error.Abort( | ||
|
r15183 | _('rollback of last commit while not checked out ' | ||
|
r15187 | 'may lose data'), hint=_('use -f to force')) | ||
|
r15183 | |||
|
r15130 | ui.status(msg) | ||
|
r15097 | if dryrun: | ||
return 0 | ||||
|
r15131 | |||
parents = self.dirstate.parents() | ||||
|
r18310 | self.destroying() | ||
|
r23902 | vfsmap = {'plain': self.vfs, '': self.svfs} | ||
|
r33278 | transaction.rollback(self.svfs, vfsmap, 'undo', ui.warn, | ||
checkambigfiles=_cachedfiles) | ||||
|
r42512 | bookmarksvfs = bookmarks.bookmarksvfs(self) | ||
if bookmarksvfs.exists('undo.bookmarks'): | ||||
bookmarksvfs.rename('undo.bookmarks', 'bookmarks', checkambig=True) | ||||
|
r18947 | if self.svfs.exists('undo.phaseroots'): | ||
|
r29352 | self.svfs.rename('undo.phaseroots', 'phaseroots', checkambig=True) | ||
|
r15097 | self.invalidate() | ||
|
r15131 | |||
|
r41417 | parentgone = any(p not in self.changelog.nodemap for p in parents) | ||
|
r15131 | if parentgone: | ||
|
r26631 | # prevent dirstateguard from overwriting already restored one | ||
dsguard.close() | ||||
|
r38905 | narrowspec.restorebackup(self, 'undo.narrowspec') | ||
|
r41264 | narrowspec.restorewcbackup(self, 'undo.narrowspec.dirstate') | ||
|
r33440 | self.dirstate.restorebackup(None, 'undo.dirstate') | ||
|
r15131 | try: | ||
|
r23852 | branch = self.vfs.read('undo.branch') | ||
|
r17360 | self.dirstate.setbranch(encoding.tolocal(branch)) | ||
|
r15131 | except IOError: | ||
ui.warn(_('named branch could not be reset: ' | ||||
'current branch is still \'%s\'\n') | ||||
% self.dirstate.branch()) | ||||
|
r27167 | parents = tuple([p.rev() for p in self[None].parents()]) | ||
|
r15131 | if len(parents) > 1: | ||
ui.status(_('working directory now based on ' | ||||
'revisions %d and %d\n') % parents) | ||||
else: | ||||
ui.status(_('working directory now based on ' | ||||
'revision %d\n') % parents) | ||||
|
r26989 | mergemod.mergestate.clean(self, self['.'].node()) | ||
|
r24784 | |||
|
r17013 | # TODO: if we know which new heads may result from this rollback, pass | ||
# them to destroy(), which will prevent the branchhead cache from being | ||||
# invalidated. | ||||
|
r15604 | self.destroyed() | ||
|
r15097 | return 0 | ||
r32332 | def _buildcacheupdater(self, newtransaction): | |||
"""called during transaction to build the callback updating cache | ||||
Lives on the repository to help extension who might want to augment | ||||
this logic. For this purpose, the created transaction is passed to the | ||||
method. | ||||
""" | ||||
# we must avoid cyclic reference between repo and transaction. | ||||
reporef = weakref.ref(self) | ||||
def updater(tr): | ||||
repo = reporef() | ||||
repo.updatecaches(tr) | ||||
return updater | ||||
|
r32263 | @unfilteredmethod | ||
|
r36970 | def updatecaches(self, tr=None, full=False): | ||
|
r32264 | """warm appropriate caches | ||
If this function is called after a transaction closed. The transaction | ||||
will be available in the 'tr' argument. This can be used to selectively | ||||
update caches relevant to the changes in that transaction. | ||||
|
r36970 | |||
If 'full' is set, make sure all caches the function knows about have | ||||
up-to-date data. Even the ones usually loaded more lazily. | ||||
|
r32264 | """ | ||
if tr is not None and tr.hookargs.get('source') == 'strip': | ||||
|
r32263 | # During strip, many caches are invalid but | ||
# later call to `destroyed` will refresh them. | ||||
return | ||||
|
r39337 | if tr is None or tr.changes['origrepolen'] < len(self): | ||
|
r41764 | # accessing the 'ser ved' branchmap should refresh all the others, | ||
|
r32267 | self.ui.debug('updating the branch cache\n') | ||
|
r41764 | self.filtered('served').branchmap() | ||
r42296 | self.filtered('served.hidden').branchmap() | |||
|
r32263 | |||
|
r36970 | if full: | ||
r42099 | unfi = self.unfiltered() | |||
rbc = unfi.revbranchcache() | ||||
for r in unfi.changelog: | ||||
|
r36970 | rbc.branchinfo(r) | ||
rbc.write() | ||||
|
r38803 | # ensure the working copy parents are in the manifestfulltextcache | ||
for ctx in self['.'].parents(): | ||||
ctx.manifest() # accessing the manifest is enough | ||||
r42424 | # accessing fnode cache warms the cache | |||
tagsmod.fnoderevs(self.ui, unfi, unfi.changelog.revs()) | ||||
r42100 | # accessing tags warm the cache | |||
self.tags() | ||||
self.filtered('served').tags() | ||||
|
r42940 | # The `full` arg is documented as updating even the lazily-loaded | ||
# caches immediately, so we're forcing a write to cause these caches | ||||
# to be warmed up even if they haven't explicitly been requested | ||||
# yet (if they've never been used by hg, they won't ever have been | ||||
# written, even if they're a subset of another kind of cache that | ||||
# *has* been used). | ||||
for filt in repoview.filtertable.keys(): | ||||
filtered = self.filtered(filt) | ||||
filtered.branchmap().write(filtered) | ||||
|
r10547 | def invalidatecaches(self): | ||
|
r15988 | |||
|
r40396 | if r'_tagscache' in vars(self): | ||
|
r18013 | # can't use delattr on proxy | ||
|
r40396 | del self.__dict__[r'_tagscache'] | ||
|
r14936 | |||
|
r41764 | self._branchcaches.clear() | ||
|
r18105 | self.invalidatevolatilesets() | ||
|
r33302 | self._sparsesignaturecache.clear() | ||
|
r18105 | |||
def invalidatevolatilesets(self): | ||||
self.filteredrevcache.clear() | ||||
|
r17469 | obsolete.clearobscaches(self) | ||
|
r1784 | |||
|
r14930 | def invalidatedirstate(self): | ||
'''Invalidates the dirstate, causing the next call to dirstate | ||||
to check if it was modified since the last time it was read, | ||||
rereading it if it has. | ||||
This is different to dirstate.invalidate() that it doesn't always | ||||
rereads the dirstate. Use dirstate.invalidate() if you want to | ||||
explicitly read the dirstate again (i.e. restoring it to a previous | ||||
known good state).''' | ||||
|
r40332 | if hasunfilteredcache(self, r'dirstate'): | ||
|
r16200 | for k in self.dirstate._filecache: | ||
try: | ||||
delattr(self.dirstate, k) | ||||
except AttributeError: | ||||
pass | ||||
|
r40332 | delattr(self.unfiltered(), r'dirstate') | ||
|
r14930 | |||
|
r26831 | def invalidate(self, clearfilecache=False): | ||
|
r29918 | '''Invalidates both store and non-store parts other than dirstate | ||
If a transaction is running, invalidation of store is omitted, | ||||
because discarding in-memory changes might cause inconsistency | ||||
(e.g. incomplete fncache causes unintentional failure, but | ||||
redundant one doesn't). | ||||
''' | ||||
|
r18644 | unfiltered = self.unfiltered() # all file caches are stored unfiltered | ||
|
r31510 | for k in list(self._filecache.keys()): | ||
|
r14935 | # dirstate is invalidated separately in invalidatedirstate() | ||
if k == 'dirstate': | ||||
continue | ||||
|
r33672 | if (k == 'changelog' and | ||
self.currenttransaction() and | ||||
self.changelog._delayed): | ||||
# The changelog object may store unwritten revisions. We don't | ||||
# want to lose them. | ||||
# TODO: Solve the problem instead of working around it. | ||||
continue | ||||
|
r14935 | |||
|
r26831 | if clearfilecache: | ||
del self._filecache[k] | ||||
|
r14935 | try: | ||
|
r17997 | delattr(unfiltered, k) | ||
|
r14935 | except AttributeError: | ||
pass | ||||
|
r10547 | self.invalidatecaches() | ||
|
r29918 | if not self.currenttransaction(): | ||
# TODO: Changing contents of store outside transaction | ||||
# causes inconsistency. We should make in-memory store | ||||
# changes detectable, and abort if changed. | ||||
self.store.invalidatecaches() | ||||
|
r10547 | |||
|
r20627 | def invalidateall(self): | ||
'''Fully invalidates both store and non-store parts, causing the | ||||
subsequent operation to reread any outside changes.''' | ||||
# extension should hook this to invalidate its caches | ||||
self.invalidate() | ||||
self.invalidatedirstate() | ||||
|
r29920 | @unfilteredmethod | ||
|
r26251 | def _refreshfilecachestats(self, tr): | ||
|
r26250 | """Reload stats of cached files so that they are flagged as valid""" | ||
for k, ce in self._filecache.items(): | ||||
|
r35857 | k = pycompat.sysstr(k) | ||
if k == r'dirstate' or k not in self.__dict__: | ||||
|
r26250 | continue | ||
ce.refresh() | ||||
|
r26439 | def _lock(self, vfs, lockname, wait, releasefn, acquirefn, desc, | ||
|
r26499 | inheritchecker=None, parentenvvar=None): | ||
|
r26439 | parentlock = None | ||
|
r26472 | # the contents of parentenvvar are used by the underlying lock to | ||
# determine whether it can be inherited | ||||
|
r26439 | if parentenvvar is not None: | ||
|
r30634 | parentlock = encoding.environ.get(parentenvvar) | ||
|
r35209 | |||
timeout = 0 | ||||
|
r35210 | warntimeout = 0 | ||
|
r35209 | if wait: | ||
timeout = self.ui.configint("ui", "timeout") | ||||
|
r35210 | warntimeout = self.ui.configint("ui", "timeout.warn") | ||
|
r38157 | # internal config: ui.signal-safe-lock | ||
signalsafe = self.ui.configbool('ui', 'signal-safe-lock') | ||||
|
r35209 | |||
|
r35210 | l = lockmod.trylock(self.ui, vfs, lockname, timeout, warntimeout, | ||
|
r35209 | releasefn=releasefn, | ||
acquirefn=acquirefn, desc=desc, | ||||
inheritchecker=inheritchecker, | ||||
|
r38157 | parentlock=parentlock, | ||
signalsafe=signalsafe) | ||||
|
r1751 | return l | ||
|
r15587 | def _afterlock(self, callback): | ||
|
r24821 | """add a callback to be run when the repository is fully unlocked | ||
|
r15583 | |||
|
r24821 | The callback will be executed when the outermost lock is released | ||
(with wlock being higher level than 'lock').""" | ||||
for ref in (self._wlockref, self._lockref): | ||||
l = ref and ref() | ||||
if l and l.held: | ||||
l.postrelease.append(callback) | ||||
break | ||||
else: # no lock have been found. | ||||
|
r16680 | callback() | ||
|
r15583 | |||
|
r4914 | def lock(self, wait=True): | ||
|
r9309 | '''Lock the repository store (.hg/store) and return a weak reference | ||
to the lock. Use this before modifying the store (e.g. committing or | ||||
|
r24746 | stripping). If you are opening a transaction, get a lock as well.) | ||
If both 'lock' and 'wlock' must be acquired, ensure you always acquires | ||||
'wlock' first to avoid a dead-lock hazard.''' | ||||
|
r29705 | l = self._currentlock(self._lockref) | ||
if l is not None: | ||||
|
r8108 | l.lock() | ||
return l | ||||
|
r4917 | |||
r42022 | l = self._lock(vfs=self.svfs, | |||
lockname="lock", | ||||
wait=wait, | ||||
releasefn=None, | ||||
acquirefn=self.invalidate, | ||||
desc=_('repository %s') % self.origroot) | ||||
|
r4917 | self._lockref = weakref.ref(l) | ||
return l | ||||
|
r1751 | |||
|
r26499 | def _wlockchecktransaction(self): | ||
if self.currenttransaction() is not None: | ||||
raise error.LockInheritanceContractViolation( | ||||
'wlock cannot be inherited in the middle of a transaction') | ||||
|
r4914 | def wlock(self, wait=True): | ||
|
r9309 | '''Lock the non-store parts of the repository (everything under | ||
.hg except .hg/store) and return a weak reference to the lock. | ||||
|
r24746 | |||
Use this before modifying files in .hg. | ||||
If both 'lock' and 'wlock' must be acquired, ensure you always acquires | ||||
'wlock' first to avoid a dead-lock hazard.''' | ||||
|
r24744 | l = self._wlockref and self._wlockref() | ||
if l is not None and l.held: | ||||
l.lock() | ||||
return l | ||||
|
r26781 | # We do not need to check for non-waiting lock acquisition. Such | ||
|
r24750 | # acquisition would not cause dead-lock as they would just fail. | ||
|
r25290 | if wait and (self.ui.configbool('devel', 'all-warnings') | ||
|
r24750 | or self.ui.configbool('devel', 'check-locks')): | ||
|
r29705 | if self._currentlock(self._lockref) is not None: | ||
|
r25629 | self.ui.develwarn('"wlock" acquired after "lock"') | ||
|
r1531 | |||
|
r14930 | def unlock(): | ||
|
r22404 | if self.dirstate.pendingparentchange(): | ||
self.dirstate.invalidate() | ||||
else: | ||||
|
r26748 | self.dirstate.write(None) | ||
|
r22404 | |||
|
r18318 | self._filecache['dirstate'].refresh() | ||
|
r14930 | |||
|
r20091 | l = self._lock(self.vfs, "wlock", wait, unlock, | ||
|
r14930 | self.invalidatedirstate, _('working directory of %s') % | ||
|
r26499 | self.origroot, | ||
inheritchecker=self._wlockchecktransaction, | ||||
parentenvvar='HG_WLOCK_LOCKER') | ||||
|
r4917 | self._wlockref = weakref.ref(l) | ||
return l | ||||
|
r1531 | |||
|
r26488 | def _currentlock(self, lockref): | ||
"""Returns the lock if it's held, or None if it's not.""" | ||||
if lockref is None: | ||||
return None | ||||
l = lockref() | ||||
if l is None or not l.held: | ||||
return None | ||||
return l | ||||
|
r26489 | def currentwlock(self): | ||
"""Returns the wlock if it's held, or None if it's not.""" | ||||
return self._currentlock(self._wlockref) | ||||
|
r42317 | def _filecommit(self, fctx, manifest1, manifest2, linkrev, tr, changelist, | ||
includecopymeta): | ||||
|
r3292 | """ | ||
|
r3294 | commit an individual file as part of a larger transaction | ||
""" | ||||
|
r3292 | |||
|
r8244 | fname = fctx.path() | ||
fparent1 = manifest1.get(fname, nullid) | ||||
|
r22492 | fparent2 = manifest2.get(fname, nullid) | ||
|
r24394 | if isinstance(fctx, context.filectx): | ||
node = fctx.filenode() | ||||
if node in [fparent1, fparent2]: | ||||
self.ui.debug('reusing %s filelog entry\n' % fname) | ||||
|
r42526 | if ((fparent1 != nullid and | ||
manifest1.flags(fname) != fctx.flags()) or | ||||
(fparent2 != nullid and | ||||
manifest2.flags(fname) != fctx.flags())): | ||||
|
r29181 | changelist.append(fname) | ||
|
r24394 | return node | ||
|
r1716 | |||
|
r24394 | flog = self.file(fname) | ||
|
r3292 | meta = {} | ||
|
r41940 | cfname = fctx.copysource() | ||
if cfname and cfname != fname: | ||||
|
r4058 | # Mark the new revision of this file as a copy of another | ||
|
r4516 | # file. This copy data will effectively act as a parent | ||
# of this new revision. If this is a merge, the first | ||||
|
r4058 | # parent will be the nullid (meaning "look up the copy data") | ||
# and the second one will be the other parent. For example: | ||||
# | ||||
# 0 --- 1 --- 3 rev1 changes file foo | ||||
# \ / rev2 renames foo to bar and changes it | ||||
# \- 2 -/ rev3 should have bar with all changes and | ||||
# should record that bar descends from | ||||
# bar in rev2 and foo in rev1 | ||||
# | ||||
# this allows this merge to succeed: | ||||
# | ||||
# 0 --- 1 --- 3 rev4 reverts the content change from rev2 | ||||
# \ / merging rev3 and rev4 should use bar@rev2 | ||||
# \- 2 --- 4 as the merge base | ||||
# | ||||
|
r6874 | |||
|
r42229 | cnode = manifest1.get(cfname) | ||
|
r8244 | newfparent = fparent2 | ||
|
r6874 | |||
if manifest2: # branch merge | ||||
|
r42229 | if fparent2 == nullid or cnode is None: # copied on remote side | ||
|
r8244 | if cfname in manifest2: | ||
|
r42229 | cnode = manifest2[cfname] | ||
|
r8244 | newfparent = fparent1 | ||
|
r6874 | |||
|
r23929 | # Here, we used to search backwards through history to try to find | ||
# where the file copy came from if the source of a copy was not in | ||||
|
r24180 | # the parent directory. However, this doesn't actually make sense to | ||
|
r23929 | # do (what does a copy from something not in your working copy even | ||
# mean?) and it causes bugs (eg, issue4476). Instead, we will warn | ||||
# the user that copy information was dropped, so if they didn't | ||||
# expect this outcome it can be fixed, but this is the correct | ||||
# behavior in this circumstance. | ||||
|
r6875 | |||
|
r42229 | if cnode: | ||
self.ui.debug(" %s: copy %s:%s\n" % (fname, cfname, hex(cnode))) | ||||
|
r42317 | if includecopymeta: | ||
meta["copy"] = cfname | ||||
meta["copyrev"] = hex(cnode) | ||||
|
r13000 | fparent1, fparent2 = nullid, newfparent | ||
else: | ||||
self.ui.warn(_("warning: can't find ancestor for '%s' " | ||||
"copied from '%s'!\n") % (fname, cfname)) | ||||
|
r20556 | elif fparent1 == nullid: | ||
fparent1, fparent2 = fparent2, nullid | ||||
|
r8244 | elif fparent2 != nullid: | ||
|
r1716 | # is one parent an ancestor of the other? | ||
|
r21106 | fparentancestors = flog.commonancestorsheads(fparent1, fparent2) | ||
|
r20987 | if fparent1 in fparentancestors: | ||
|
r8244 | fparent1, fparent2 = fparent2, nullid | ||
|
r20987 | elif fparent2 in fparentancestors: | ||
|
r8244 | fparent2 = nullid | ||
|
r1716 | |||
|
r8401 | # is the file changed? | ||
|
r24394 | text = fctx.data() | ||
|
r8401 | if fparent2 != nullid or flog.cmp(fparent1, text) or meta: | ||
changelist.append(fname) | ||||
return flog.add(text, meta, tr, linkrev, fparent1, fparent2) | ||||
# are just the flags changed during merge? | ||||
|
r22492 | elif fname in manifest1 and manifest1.flags(fname) != fctx.flags(): | ||
|
r8401 | changelist.append(fname) | ||
return fparent1 | ||||
|
r1716 | |||
|
r28813 | def checkcommitpatterns(self, wctx, vdirs, match, status, fail): | ||
|
r30332 | """check for commit arguments that aren't committable""" | ||
|
r28814 | if match.isexact() or match.prefix(): | ||
|
r28813 | matched = set(status.modified + status.added + status.removed) | ||
for f in match.files(): | ||||
f = self.dirstate.normalize(f) | ||||
if f == '.' or f in matched or f in wctx.substate: | ||||
continue | ||||
if f in status.deleted: | ||||
fail(f, _('file not found!')) | ||||
if f in vdirs: # visited directory | ||||
d = f + '/' | ||||
for mf in matched: | ||||
if mf.startswith(d): | ||||
break | ||||
else: | ||||
fail(f, _("no match under directory!")) | ||||
elif f not in self.dirstate: | ||||
fail(f, _("file not tracked!")) | ||||
|
r18016 | @unfilteredmethod | ||
|
r8706 | def commit(self, text="", user=None, date=None, match=None, force=False, | ||
|
r26322 | editor=False, extra=None): | ||
|
r8515 | """Add a new revision to current repository. | ||
|
r8706 | Revision information is gathered from the working directory, | ||
match can be used to filter the committed files. If editor is | ||||
supplied, it is called to get a commit message. | ||||
|
r8515 | """ | ||
|
r26322 | if extra is None: | ||
extra = {} | ||||
|
r8709 | |||
|
r8715 | def fail(f, msg): | ||
|
r26587 | raise error.Abort('%s: %s' % (f, msg)) | ||
|
r8715 | |||
if not match: | ||||
|
r41825 | match = matchmod.always() | ||
|
r8715 | |||
if not force: | ||||
vdirs = [] | ||||
|
r19138 | match.explicitdir = vdirs.append | ||
|
r8715 | match.bad = fail | ||
|
r41399 | # lock() for recent changelog (see issue4368) | ||
with self.wlock(), self.lock(): | ||||
|
r8813 | wctx = self[None] | ||
|
r10970 | merge = len(wctx.parents()) > 1 | ||
|
r1089 | |||
|
r32312 | if not force and merge and not match.always(): | ||
|
r26587 | raise error.Abort(_('cannot partially commit a merge ' | ||
|
r8397 | '(do not specify files or patterns)')) | ||
|
r6706 | |||
|
r22928 | status = self.status(match=match, clean=force) | ||
|
r8706 | if force: | ||
|
r22928 | status.modified.extend(status.clean) # mq may commit clean files | ||
|
r3621 | |||
|
r8813 | # check subrepos | ||
|
r36026 | subs, commitsubs, newstate = subrepoutil.precommit( | ||
|
r35018 | self.ui, wctx, status, match, force=force) | ||
|
r8813 | |||
|
r8709 | # make sure all explicit patterns are matched | ||
|
r28813 | if not force: | ||
self.checkcommitpatterns(wctx, vdirs, match, status, fail) | ||||
|
r8709 | |||
|
r23710 | cctx = context.workingcommitctx(self, status, | ||
text, user, date, extra) | ||||
|
r18659 | |||
|
r25840 | # internal config: ui.allowemptycommit | ||
|
r25021 | allowemptycommit = (wctx.branch() != wctx.p1().branch() | ||
|
r25018 | or extra.get('close') or merge or cctx.files() | ||
or self.ui.configbool('ui', 'allowemptycommit')) | ||||
|
r25017 | if not allowemptycommit: | ||
|
r8404 | return None | ||
|
r18660 | if merge and cctx.deleted(): | ||
|
r26587 | raise error.Abort(_("cannot commit merge with missing files")) | ||
|
r16536 | |||
|
r26996 | ms = mergemod.mergestate.read(self) | ||
|
r30496 | mergeutil.checkunresolved(ms) | ||
|
r8496 | |||
if editor: | ||||
|
r8994 | cctx._text = editor(self, cctx, subs) | ||
|
r9935 | edited = (text != cctx._text) | ||
|
r8813 | |||
|
r20765 | # Save commit message in case this transaction gets rolled back | ||
# (e.g. by a pretxncommit hook). Leave the content alone on | ||||
# the assumption that the user will use the same editor again. | ||||
msgfn = self.savecommitmessage(cctx._text) | ||||
|
r16073 | # commit subs and write new state | ||
if subs: | ||||
|
r41837 | uipathfn = scmutil.getuipathfn(self) | ||
|
r16073 | for s in sorted(commitsubs): | ||
|
r11112 | sub = wctx.sub(s) | ||
self.ui.status(_('committing subrepository %s\n') % | ||||
|
r41837 | uipathfn(subrepoutil.subrelpath(sub))) | ||
|
r11112 | sr = sub.commit(cctx._text, user, date) | ||
|
r16073 | newstate[s] = (newstate[s][0], sr) | ||
|
r36026 | subrepoutil.writestate(self, newstate) | ||
|
r8813 | |||
|
r10970 | p1, p2 = self.dirstate.parents() | ||
hookp1, hookp2 = hex(p1), (p2 != nullid and hex(p2) or '') | ||||
|
r9935 | try: | ||
|
r16683 | self.hook("precommit", throw=True, parent1=hookp1, | ||
parent2=hookp2) | ||||
|
r41398 | with self.transaction('commit'): | ||
ret = self.commitctx(cctx, True) | ||||
# update bookmarks, dirstate and mergestate | ||||
bookmarks.update(self, [p1, p2], ret) | ||||
cctx.markcommitted(ret) | ||||
ms.reset() | ||||
|
r16705 | except: # re-raises | ||
|
r9935 | if edited: | ||
self.ui.write( | ||||
_('note: commit message saved in %s\n') % msgfn) | ||||
raise | ||||
|
r6710 | |||
|
r42426 | def commithook(): | ||
|
r23129 | # hack for command that use a temporary commit (eg: histedit) | ||
# temporary commit got stripped before hook release | ||||
|
r24992 | if self.changelog.hasnode(ret): | ||
|
r42426 | self.hook("commit", node=hex(ret), parent1=hookp1, | ||
parent2=hookp2) | ||||
|
r16680 | self._afterlock(commithook) | ||
|
r10492 | return ret | ||
|
r18016 | @unfilteredmethod | ||
|
r42839 | def commitctx(self, ctx, error=False, origctx=None): | ||
|
r7077 | """Add a new revision to current repository. | ||
|
r8410 | Revision information is passed via the context argument. | ||
|
r39147 | |||
ctx.files() should list all files involved in this commit, i.e. | ||||
modified/added/removed files. On merge, it may be wider than the | ||||
ctx.files() to be committed, since any file nodes derived directly | ||||
from p1 or p2 are excluded from the committed ctx.files(). | ||||
|
r42839 | |||
origctx is for convert to work around the problem that bug | ||||
fixes to the files list in changesets change hashes. For | ||||
convert to be the identity, it can pass an origctx and this | ||||
function will use the same files list when it makes sense to | ||||
do so. | ||||
|
r7077 | """ | ||
|
r6715 | |||
|
r8414 | p1, p2 = ctx.p1(), ctx.p2() | ||
|
r8412 | user = ctx.user() | ||
|
r1089 | |||
|
r42317 | writecopiesto = self.ui.config('experimental', 'copies.write-to') | ||
writefilecopymeta = writecopiesto != 'changeset-only' | ||||
|
r42598 | writechangesetcopy = (writecopiesto in | ||
('changeset-only', 'compatibility')) | ||||
|
r42317 | p1copies, p2copies = None, None | ||
|
r42598 | if writechangesetcopy: | ||
|
r42317 | p1copies = ctx.p1copies() | ||
p2copies = ctx.p2copies() | ||||
|
r42598 | filesadded, filesremoved = None, None | ||
|
r41400 | with self.lock(), self.transaction("commit") as tr: | ||
|
r4970 | trp = weakref.proxy(tr) | ||
|
r1089 | |||
|
r30566 | if ctx.manifestnode(): | ||
# reuse an existing manifest revision | ||||
|
r39145 | self.ui.debug('reusing known manifest\n') | ||
|
r30566 | mn = ctx.manifestnode() | ||
files = ctx.files() | ||||
|
r42598 | if writechangesetcopy: | ||
filesadded = ctx.filesadded() | ||||
filesremoved = ctx.filesremoved() | ||||
|
r30566 | elif ctx.files(): | ||
|
r30345 | m1ctx = p1.manifestctx() | ||
m2ctx = p2.manifestctx() | ||||
mctx = m1ctx.copy() | ||||
m = mctx.read() | ||||
m1 = m1ctx.read() | ||||
m2 = m2ctx.read() | ||||
|
r14162 | |||
# check in files | ||||
|
r22910 | added = [] | ||
|
r14162 | changed = [] | ||
|
r22907 | removed = list(ctx.removed()) | ||
|
r14162 | linkrev = len(self) | ||
|
r23749 | self.ui.note(_("committing files:\n")) | ||
|
r41837 | uipathfn = scmutil.getuipathfn(self) | ||
|
r14162 | for f in sorted(ctx.modified() + ctx.added()): | ||
|
r41837 | self.ui.note(uipathfn(f) + "\n") | ||
|
r14162 | try: | ||
fctx = ctx[f] | ||||
|
r22296 | if fctx is None: | ||
removed.append(f) | ||||
else: | ||||
|
r22910 | added.append(f) | ||
m[f] = self._filecommit(fctx, m1, m2, linkrev, | ||||
|
r42317 | trp, changed, | ||
writefilecopymeta) | ||||
|
r22942 | m.setflag(f, fctx.flags()) | ||
|
r41401 | except OSError: | ||
|
r41837 | self.ui.warn(_("trouble committing %s!\n") % | ||
uipathfn(f)) | ||||
|
r4915 | raise | ||
|
r25660 | except IOError as inst: | ||
|
r14162 | errcode = getattr(inst, 'errno', errno.ENOENT) | ||
if error or errcode and errcode != errno.ENOENT: | ||||
|
r41837 | self.ui.warn(_("trouble committing %s!\n") % | ||
uipathfn(f)) | ||||
|
r22296 | raise | ||
|
r1089 | |||
|
r14162 | # update manifest | ||
|
r42534 | removed = [f for f in removed if f in m1 or f in m2] | ||
drop = sorted([f for f in removed if f in m]) | ||||
|
r14162 | for f in drop: | ||
|
r22909 | del m[f] | ||
|
r42840 | if p2.rev() != nullrev: | ||
@util.cachefunc | ||||
def mas(): | ||||
p1n = p1.node() | ||||
p2n = p2.node() | ||||
cahs = self.changelog.commonancestorsheads(p1n, p2n) | ||||
if not cahs: | ||||
cahs = [nullrev] | ||||
return [self[r].manifest() for r in cahs] | ||||
def deletionfromparent(f): | ||||
# When a file is removed relative to p1 in a merge, this | ||||
# function determines whether the absence is due to a | ||||
# deletion from a parent, or whether the merge commit | ||||
# itself deletes the file. We decide this by doing a | ||||
# simplified three way merge of the manifest entry for | ||||
# the file. There are two ways we decide the merge | ||||
# itself didn't delete a file: | ||||
# - neither parent (nor the merge) contain the file | ||||
# - exactly one parent contains the file, and that | ||||
# parent has the same filelog entry as the merge | ||||
# ancestor (or all of them if there two). In other | ||||
# words, that parent left the file unchanged while the | ||||
# other one deleted it. | ||||
# One way to think about this is that deleting a file is | ||||
# similar to emptying it, so the list of changed files | ||||
# should be similar either way. The computation | ||||
# described above is not done directly in _filecommit | ||||
# when creating the list of changed files, however | ||||
# it does something very similar by comparing filelog | ||||
# nodes. | ||||
if f in m1: | ||||
return (f not in m2 | ||||
and all(f in ma and ma.find(f) == m1.find(f) | ||||
for ma in mas())) | ||||
elif f in m2: | ||||
return all(f in ma and ma.find(f) == m2.find(f) | ||||
for ma in mas()) | ||||
else: | ||||
return True | ||||
removed = [f for f in removed if not deletionfromparent(f)] | ||||
|
r14162 | files = changed + removed | ||
|
r39147 | md = None | ||
if not files: | ||||
# if no "files" actually changed in terms of the changelog, | ||||
# try hard to detect unmodified manifest entry so that the | ||||
# exact same commit can be reproduced later on convert. | ||||
md = m1.diff(m, scmutil.matchfiles(self, ctx.files())) | ||||
if not files and md: | ||||
self.ui.debug('not reusing manifest (no file change in ' | ||||
'changelog, but manifest differs)\n') | ||||
if files or md: | ||||
self.ui.note(_("committing manifest\n")) | ||||
|
r39704 | # we're using narrowmatch here since it's already applied at | ||
# other stages (such as dirstate.walk), so we're already | ||||
# ignoring things outside of narrowspec in most cases. The | ||||
# one case where we might have files outside the narrowspec | ||||
# at this point is merges, and we already error out in the | ||||
# case where the merge has files outside of the narrowspec, | ||||
# so this is safe. | ||||
|
r39147 | mn = mctx.write(trp, linkrev, | ||
p1.manifestnode(), p2.manifestnode(), | ||||
|
r39704 | added, drop, match=self.narrowmatch()) | ||
|
r42598 | |||
if writechangesetcopy: | ||||
filesadded = [f for f in changed | ||||
if not (f in m1 or f in m2)] | ||||
filesremoved = removed | ||||
|
r39147 | else: | ||
|
r42472 | self.ui.debug('reusing manifest from p1 (listed files ' | ||
|
r39147 | 'actually unchanged)\n') | ||
mn = p1.manifestnode() | ||||
|
r14162 | else: | ||
|
r39145 | self.ui.debug('reusing manifest from p1 (no file change)\n') | ||
|
r14162 | mn = p1.manifestnode() | ||
files = [] | ||||
|
r1089 | |||
|
r42486 | if writecopiesto == 'changeset-only': | ||
# If writing only to changeset extras, use None to indicate that | ||||
# no entry should be written. If writing to both, write an empty | ||||
# entry to prevent the reader from falling back to reading | ||||
# filelogs. | ||||
p1copies = p1copies or None | ||||
p2copies = p2copies or None | ||||
|
r42598 | filesadded = filesadded or None | ||
filesremoved = filesremoved or None | ||||
|
r42486 | |||
|
r42839 | if origctx and origctx.manifestnode() == mn: | ||
files = origctx.files() | ||||
|
r8499 | # update changelog | ||
|
r23749 | self.ui.note(_("committing changelog\n")) | ||
|
r23203 | self.changelog.delayupdate(tr) | ||
|
r14162 | n = self.changelog.add(mn, files, ctx.description(), | ||
|
r8499 | trp, p1.node(), p2.node(), | ||
|
r42317 | user, ctx.date(), ctx.extra().copy(), | ||
|
r42598 | p1copies, p2copies, filesadded, filesremoved) | ||
|
r10492 | xp1, xp2 = p1.hex(), p2 and p2.hex() or '' | ||
|
r4915 | self.hook('pretxncommit', throw=True, node=hex(n), parent1=xp1, | ||
|
r26751 | parent2=xp2) | ||
|
r15706 | # set the new commit is proper phase | ||
|
r36026 | targetphase = subrepoutil.newcommitphase(self.ui, ctx) | ||
|
r15706 | if targetphase: | ||
# retract boundary do not alter parent changeset. | ||||
# if a parent have higher the resulting phase will | ||||
# be compliant anyway | ||||
# | ||||
# if minimal phase was 0 we don't need to retract anything | ||||
|
r33454 | phases.registernew(self, tr, targetphase, [n]) | ||
|
r4915 | return n | ||
|
r1089 | |||
|
r18016 | @unfilteredmethod | ||
|
r18310 | def destroying(self): | ||
'''Inform the repository that nodes are about to be destroyed. | ||||
Intended for use by strip and rollback, so there's a common | ||||
place for anything that has to be done before destroying history. | ||||
This is mostly useful for saving state that is in memory and waiting | ||||
to be flushed when the current lock is released. Because a call to | ||||
destroyed is imminent, the repo will be invalidated causing those | ||||
changes to stay in memory (waiting for the next unlock), or vanish | ||||
completely. | ||||
''' | ||||
|
r18312 | # When using the same lock to commit and strip, the phasecache is left | ||
# dirty after committing. Then when we strip, the repo is invalidated, | ||||
# causing those changes to disappear. | ||||
if '_phasecache' in vars(self): | ||||
self._phasecache.write() | ||||
|
r18310 | @unfilteredmethod | ||
|
r18395 | def destroyed(self): | ||
|
r9150 | '''Inform the repository that nodes have been destroyed. | ||
Intended for use by strip and rollback, so there's a common | ||||
|
r17013 | place for anything that has to be done after destroying history. | ||
''' | ||||
|
r18221 | # When one tries to: | ||
# 1) destroy nodes thus calling this method (e.g. strip) | ||||
# 2) use phasecache somewhere (e.g. commit) | ||||
# | ||||
# then 2) will fail because the phasecache contains nodes that were | ||||
# removed. We can either remove phasecache from the filecache, | ||||
# causing it to reload next time it is accessed, or simply filter | ||||
# the removed nodes now and write the updated cache. | ||||
|
r18757 | self._phasecache.filterunknown(self) | ||
self._phasecache.write() | ||||
|
r18221 | |||
|
r32264 | # refresh all repository caches | ||
self.updatecaches() | ||||
|
r18223 | |||
|
r9151 | # Ensure the persistent tag cache is updated. Doing it now | ||
# means that the tag cache only has to worry about destroyed | ||||
# heads immediately after a strip/rollback. That in turn | ||||
# guarantees that "cachetip == currenttip" (comparing both rev | ||||
# and node) always means no nodes have been added or destroyed. | ||||
# XXX this is suboptimal when qrefresh'ing: we strip the current | ||||
# head, refresh the tag cache, then immediately add a new head. | ||||
# But I think doing it this way is necessary for the "instant | ||||
# tag cache retrieval" case to work. | ||||
|
r18313 | self.invalidate() | ||
|
r17324 | |||
|
r6769 | def status(self, node1='.', node2=None, match=None, | ||
|
r12166 | ignored=False, clean=False, unknown=False, | ||
listsubrepos=False): | ||||
|
r21596 | '''a convenience method that calls node1.status(node2)''' | ||
return self[node1].status(node2, match, ignored, clean, unknown, | ||||
listsubrepos) | ||||
|
r2661 | |||
|
r32814 | def addpostdsstatus(self, ps): | ||
"""Add a callback to run within the wlock, at the point at which status | ||||
fixups happen. | ||||
On status completion, callback(wctx, status) will be called with the | ||||
wlock held, unless the dirstate has changed from underneath or the wlock | ||||
couldn't be grabbed. | ||||
Callbacks should not capture and use a cached copy of the dirstate -- | ||||
it might change in the meanwhile. Instead, they should access the | ||||
dirstate via wctx.repo().dirstate. | ||||
This list is emptied out after each status run -- extensions should | ||||
make sure it adds to this list each time dirstate.status is called. | ||||
Extensions should also make sure they don't call this for statuses | ||||
that don't involve the dirstate. | ||||
""" | ||||
# The list is located here for uniqueness reasons -- it is actually | ||||
# managed by the workingctx, but that isn't unique per-repo. | ||||
self._postdsstatus.append(ps) | ||||
def postdsstatus(self): | ||||
"""Used by workingctx to get the list of post-dirstate-status hooks.""" | ||||
return self._postdsstatus | ||||
def clearpostdsstatus(self): | ||||
"""Used by workingctx to clear post-dirstate-status hooks.""" | ||||
del self._postdsstatus[:] | ||||
|
r8796 | def heads(self, start=None): | ||
|
r30875 | if start is None: | ||
|
r30905 | cl = self.changelog | ||
|
r30906 | headrevs = reversed(cl.headrevs()) | ||
|
r30905 | return [cl.node(rev) for rev in headrevs] | ||
|
r30875 | |||
|
r1550 | heads = self.changelog.heads(start) | ||
# sort the output in rev descending order | ||||
|
r13075 | return sorted(heads, key=self.changelog.rev, reverse=True) | ||
|
r1089 | |||
|
r8694 | def branchheads(self, branch=None, start=None, closed=False): | ||
|
r9475 | '''return a (possibly filtered) list of heads for the given branch | ||
Heads are returned in topological order, from newest to oldest. | ||||
If branch is None, use the dirstate branch. | ||||
If start is not None, return only heads reachable from start. | ||||
If closed is True, return heads that are marked as closed as well. | ||||
''' | ||||
|
r6747 | if branch is None: | ||
branch = self[None].branch() | ||||
|
r9675 | branches = self.branchmap() | ||
|
r42171 | if not branches.hasbranch(branch): | ||
|
r4648 | return [] | ||
|
r7654 | # the cache returns heads ordered lowest to highest | ||
|
r20189 | bheads = list(reversed(branches.branchheads(branch, closed=closed))) | ||
|
r4648 | if start is not None: | ||
|
r7654 | # filter out the heads that cannot be reached from startrev | ||
|
r9475 | fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) | ||
bheads = [h for h in bheads if h in fbheads] | ||||
|
r7654 | return bheads | ||
|
r4648 | |||
|
r1089 | def branches(self, nodes): | ||
|
r1615 | if not nodes: | ||
nodes = [self.changelog.tip()] | ||||
|
r1089 | b = [] | ||
for n in nodes: | ||||
t = n | ||||
|
r14494 | while True: | ||
|
r1089 | p = self.changelog.parents(n) | ||
if p[1] != nullid or p[0] == nullid: | ||||
b.append((t, n, p[0], p[1])) | ||||
break | ||||
n = p[0] | ||||
return b | ||||
def between(self, pairs): | ||||
r = [] | ||||
for top, bottom in pairs: | ||||
n, l, i = top, [], 0 | ||||
f = 1 | ||||
|
r7708 | while n != bottom and n != nullid: | ||
|
r1089 | p = self.changelog.parents(n)[0] | ||
if i == f: | ||||
l.append(n) | ||||
f = f * 2 | ||||
n = p | ||||
i += 1 | ||||
r.append(l) | ||||
return r | ||||
|
r20924 | def checkpush(self, pushop): | ||
|
r13327 | """Extensions can override this function if additional checks have | ||
to be performed before pushing, or call it if they override push | ||||
command. | ||||
""" | ||||
|
r21043 | @unfilteredpropertycache | ||
def prepushoutgoinghooks(self): | ||||
|
r28876 | """Return util.hooks consists of a pushop with repo, remote, outgoing | ||
methods, which are called before pushing changesets. | ||||
|
r21043 | """ | ||
return util.hooks() | ||||
|
r11368 | def pushkey(self, namespace, key, old, new): | ||
|
r23416 | try: | ||
|
r24824 | tr = self.currenttransaction() | ||
hookargs = {} | ||||
if tr is not None: | ||||
hookargs.update(tr.hookargs) | ||||
|
r36418 | hookargs = pycompat.strkwargs(hookargs) | ||
hookargs[r'namespace'] = namespace | ||||
hookargs[r'key'] = key | ||||
hookargs[r'old'] = old | ||||
hookargs[r'new'] = new | ||||
|
r24824 | self.hook('prepushkey', throw=True, **hookargs) | ||
|
r25660 | except error.HookAbort as exc: | ||
|
r23416 | self.ui.write_err(_("pushkey-abort: %s\n") % exc) | ||
if exc.hint: | ||||
self.ui.write_err(_("(%s)\n") % exc.hint) | ||||
return False | ||||
|
r17293 | self.ui.debug('pushing key for "%s:%s"\n' % (namespace, key)) | ||
|
r14102 | ret = pushkey.push(self, namespace, key, old, new) | ||
|
r23648 | def runhook(): | ||
self.hook('pushkey', namespace=namespace, key=key, old=old, new=new, | ||||
ret=ret) | ||||
self._afterlock(runhook) | ||||
|
r14102 | return ret | ||
|
r11368 | |||
def listkeys(self, namespace): | ||||
|
r14102 | self.hook('prelistkeys', throw=True, namespace=namespace) | ||
|
r17293 | self.ui.debug('listing keys for "%s"\n' % namespace) | ||
|
r14102 | values = pushkey.list(self, namespace) | ||
self.hook('listkeys', namespace=namespace, values=values) | ||||
return values | ||||
|
r11368 | |||
|
r14048 | def debugwireargs(self, one, two, three=None, four=None, five=None): | ||
|
r13720 | '''used to test argument passing over the wire''' | ||
|
r36572 | return "%s %s %s %s %s" % (one, two, pycompat.bytestr(three), | ||
pycompat.bytestr(four), | ||||
pycompat.bytestr(five)) | ||||
|
r11368 | |||
|
r14529 | def savecommitmessage(self, text): | ||
|
r23852 | fp = self.vfs('last-message.txt', 'wb') | ||
|
r14529 | try: | ||
fp.write(text) | ||||
finally: | ||||
fp.close() | ||||
|
r18054 | return self.pathto(fp.name[len(self.root) + 1:]) | ||
|
r14529 | |||
|
r1806 | # used to avoid circular references so destructors work | ||
|
r3790 | def aftertrans(files): | ||
renamefiles = [tuple(t) for t in files] | ||||
|
r1806 | def a(): | ||
|
r18952 | for vfs, src, dest in renamefiles: | ||
|
r31550 | # if src and dest refer to a same file, vfs.rename is a no-op, | ||
# leaving both src and dest on disk. delete dest to make sure | ||||
# the rename couldn't be such a no-op. | ||||
vfs.tryunlink(dest) | ||||
|
r31209 | try: | ||
|
r18952 | vfs.rename(src, dest) | ||
|
r16441 | except OSError: # journal file does not yet exist | ||
pass | ||||
|
r1806 | return a | ||
|
r14266 | def undoname(fn): | ||
base, name = os.path.split(fn) | ||||
assert name.startswith('journal') | ||||
return os.path.join(base, name.replace('journal', 'undo', 1)) | ||||
|
r39585 | def instance(ui, path, create, intents=None, createopts=None): | ||
|
r39627 | localpath = util.urllocalpath(path) | ||
|
r39584 | if create: | ||
|
r39627 | createrepository(ui, localpath, createopts=createopts) | ||
|
r39584 | |||
|
r39723 | return makelocalrepository(ui, localpath, intents=intents) | ||
|
r3223 | |||
|
r2740 | def islocal(path): | ||
return True | ||||
|
r28164 | |||
|
r40032 | def defaultcreateopts(ui, createopts=None): | ||
"""Populate the default creation options for a repository. | ||||
A dictionary of explicitly requested creation options can be passed | ||||
in. Missing keys will be populated. | ||||
""" | ||||
createopts = dict(createopts or {}) | ||||
if 'backend' not in createopts: | ||||
# experimental config: storage.new-repo-backend | ||||
createopts['backend'] = ui.config('storage', 'new-repo-backend') | ||||
return createopts | ||||
def newreporequirements(ui, createopts): | ||||
|
r28164 | """Determine the set of requirements for a new local repository. | ||
Extensions can wrap this function to specify custom requirements for | ||||
new repositories. | ||||
""" | ||||
|
r39884 | # If the repo is being created from a shared repository, we copy | ||
# its requirements. | ||||
if 'sharedrepo' in createopts: | ||||
requirements = set(createopts['sharedrepo'].requirements) | ||||
if createopts.get('sharedrelative'): | ||||
requirements.add('relshared') | ||||
else: | ||||
requirements.add('shared') | ||||
return requirements | ||||
|
r40032 | if 'backend' not in createopts: | ||
raise error.ProgrammingError('backend key not present in createopts; ' | ||||
'was defaultcreateopts() called?') | ||||
if createopts['backend'] != 'revlogv1': | ||||
raise error.Abort(_('unable to determine repository requirements for ' | ||||
'storage backend: %s') % createopts['backend']) | ||||
|
r32291 | requirements = {'revlogv1'} | ||
r33244 | if ui.configbool('format', 'usestore'): | |||
|
r28164 | requirements.add('store') | ||
r33242 | if ui.configbool('format', 'usefncache'): | |||
|
r28164 | requirements.add('fncache') | ||
r33234 | if ui.configbool('format', 'dotencode'): | |||
|
r28164 | requirements.add('dotencode') | ||
r42213 | compengine = ui.config('format', 'revlog-compression') | |||
|
r30818 | if compengine not in util.compengines: | ||
raise error.Abort(_('compression engine %s defined by ' | ||||
r42213 | 'format.revlog-compression not available') % | |||
|
r30818 | compengine, | ||
hint=_('run "hg debuginstall" to list available ' | ||||
'compression engines')) | ||||
# zlib is the historical default and doesn't need an explicit requirement. | ||||
r42305 | elif compengine == 'zstd': | |||
requirements.add('revlog-compression-zstd') | ||||
elif compengine != 'zlib': | ||||
|
r30818 | requirements.add('exp-compression-%s' % compengine) | ||
|
r28164 | if scmutil.gdinitconfig(ui): | ||
requirements.add('generaldelta') | ||||
|
r40920 | if ui.configbool('format', 'sparse-revlog'): | ||
requirements.add(SPARSEREVLOG_REQUIREMENT) | ||||
|
r33499 | if ui.configbool('experimental', 'treemanifest'): | ||
|
r28164 | requirements.add('treemanifest') | ||
|
r32697 | revlogv2 = ui.config('experimental', 'revlogv2') | ||
if revlogv2 == 'enable-unstable-format-and-corrupt-my-data': | ||||
requirements.remove('revlogv1') | ||||
# generaldelta is implied by revlogv2. | ||||
requirements.discard('generaldelta') | ||||
requirements.add(REVLOGV2_REQUIREMENT) | ||||
|
r39334 | # experimental config: format.internal-phase | ||
|
r39583 | if ui.configbool('format', 'internal-phase'): | ||
|
r39334 | requirements.add('internal-phase') | ||
|
r32697 | |||
|
r39587 | if createopts.get('narrowfiles'): | ||
requirements.add(repository.NARROW_REQUIREMENT) | ||||
|
r40360 | if createopts.get('lfs'): | ||
requirements.add('lfs') | ||||
|
r42512 | if ui.configbool('format', 'bookmarks-in-store'): | ||
requirements.add(bookmarks.BOOKMARKS_IN_STORE_REQUIREMENT) | ||||
|
r28164 | return requirements | ||
|
r39584 | |||
|
r39585 | def filterknowncreateopts(ui, createopts): | ||
"""Filters a dict of repo creation options against options that are known. | ||||
Receives a dict of repo creation options and returns a dict of those | ||||
options that we don't know how to handle. | ||||
This function is called as part of repository creation. If the | ||||
returned dict contains any items, repository creation will not | ||||
be allowed, as it means there was a request to create a repository | ||||
with options not recognized by loaded code. | ||||
Extensions can wrap this function to filter out creation options | ||||
they know how to handle. | ||||
""" | ||||
|
r39884 | known = { | ||
|
r40032 | 'backend', | ||
|
r40360 | 'lfs', | ||
|
r39884 | 'narrowfiles', | ||
'sharedrepo', | ||||
'sharedrelative', | ||||
|
r39885 | 'shareditems', | ||
|
r40426 | 'shallowfilestore', | ||
|
r39884 | } | ||
|
r39587 | |||
return {k: v for k, v in createopts.items() if k not in known} | ||||
|
r39585 | |||
|
r39626 | def createrepository(ui, path, createopts=None): | ||
|
r39584 | """Create a new repository in a vfs. | ||
|
r39626 | ``path`` path to the new repo's working directory. | ||
|
r39616 | ``createopts`` options for the new repository. | ||
|
r39884 | |||
The following keys for ``createopts`` are recognized: | ||||
|
r40032 | backend | ||
The storage backend to use. | ||||
|
r40360 | lfs | ||
Repository will be created with ``lfs`` requirement. The lfs extension | ||||
will automatically be loaded when the repository is accessed. | ||||
|
r39884 | narrowfiles | ||
Set up repository to support narrow file storage. | ||||
sharedrepo | ||||
Repository object from which storage should be shared. | ||||
sharedrelative | ||||
Boolean indicating if the path to the shared repo should be | ||||
stored as relative. By default, the pointer to the "parent" repo | ||||
is stored as an absolute path. | ||||
|
r39885 | shareditems | ||
Set of items to share to the new repository (in addition to storage). | ||||
|
r40426 | shallowfilestore | ||
Indicates that storage for files should be shallow (not all ancestor | ||||
revisions are known). | ||||
|
r39584 | """ | ||
|
r40032 | createopts = defaultcreateopts(ui, createopts=createopts) | ||
|
r39585 | |||
unknownopts = filterknowncreateopts(ui, createopts) | ||||
if not isinstance(unknownopts, dict): | ||||
raise error.ProgrammingError('filterknowncreateopts() did not return ' | ||||
'a dict') | ||||
if unknownopts: | ||||
raise error.Abort(_('unable to create repository because of unknown ' | ||||
'creation option: %s') % | ||||
|
r39882 | ', '.join(sorted(unknownopts)), | ||
|
r39585 | hint=_('is a required extension not loaded?')) | ||
requirements = newreporequirements(ui, createopts=createopts) | ||||
|
r39584 | |||
|
r39626 | wdirvfs = vfsmod.vfs(path, expandpath=True, realpath=True) | ||
|
r39584 | |||
hgvfs = vfsmod.vfs(wdirvfs.join(b'.hg')) | ||||
|
r39626 | if hgvfs.exists(): | ||
raise error.RepoError(_('repository %s already exists') % path) | ||||
|
r39884 | if 'sharedrepo' in createopts: | ||
sharedpath = createopts['sharedrepo'].sharedpath | ||||
if createopts.get('sharedrelative'): | ||||
try: | ||||
sharedpath = os.path.relpath(sharedpath, hgvfs.base) | ||||
except (IOError, ValueError) as e: | ||||
# ValueError is raised on Windows if the drive letters differ | ||||
# on each path. | ||||
raise error.Abort(_('cannot calculate relative path'), | ||||
hint=stringutil.forcebytestr(e)) | ||||
|
r39883 | if not wdirvfs.exists(): | ||
wdirvfs.makedirs() | ||||
|
r39584 | hgvfs.makedir(notindexed=True) | ||
|
r40824 | if 'sharedrepo' not in createopts: | ||
hgvfs.mkdir(b'cache') | ||||
|
r40825 | hgvfs.mkdir(b'wcache') | ||
|
r39584 | |||
|
r39884 | if b'store' in requirements and 'sharedrepo' not in createopts: | ||
|
r39584 | hgvfs.mkdir(b'store') | ||
# We create an invalid changelog outside the store so very old | ||||
# Mercurial versions (which didn't know about the requirements | ||||
# file) encounter an error on reading the changelog. This | ||||
# effectively locks out old clients and prevents them from | ||||
# mucking with a repo in an unknown format. | ||||
# | ||||
# The revlog header has version 2, which won't be recognized by | ||||
# such old clients. | ||||
hgvfs.append(b'00changelog.i', | ||||
b'\0\0\0\2 dummy changelog to prevent using the old repo ' | ||||
b'layout') | ||||
scmutil.writerequires(hgvfs, requirements) | ||||
|
r39642 | |||
|
r39884 | # Write out file telling readers where to find the shared store. | ||
if 'sharedrepo' in createopts: | ||||
hgvfs.write(b'sharedpath', sharedpath) | ||||
|
r39885 | if createopts.get('shareditems'): | ||
shared = b'\n'.join(sorted(createopts['shareditems'])) + b'\n' | ||||
hgvfs.write(b'shared', shared) | ||||
|
r39642 | def poisonrepository(repo): | ||
"""Poison a repository instance so it can no longer be used.""" | ||||
# Perform any cleanup on the instance. | ||||
repo.close() | ||||
# Our strategy is to replace the type of the object with one that | ||||
# has all attribute lookups result in error. | ||||
# | ||||
# But we have to allow the close() method because some constructors | ||||
# of repos call close() on repo references. | ||||
class poisonedrepository(object): | ||||
def __getattribute__(self, item): | ||||
if item == r'close': | ||||
return object.__getattribute__(self, item) | ||||
raise error.ProgrammingError('repo instances should not be used ' | ||||
'after unshare') | ||||
def close(self): | ||||
pass | ||||
# We may have a repoview, which intercepts __setattr__. So be sure | ||||
# we operate at the lowest level possible. | ||||
object.__setattr__(repo, r'__class__', poisonedrepository) | ||||