localrepo.py
2134 lines
| 79.9 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 | # | ||
# This software may be used and distributed according to the terms | ||||
# of the GNU General Public License, incorporated herein by reference. | ||||
|
r6211 | from node import bin, hex, nullid, nullrev, short | ||
|
r3891 | from i18n import _ | ||
|
r4261 | import repo, changegroup | ||
|
r4916 | import changelog, dirstate, filelog, manifest, context, weakref | ||
|
r6212 | import lock, transaction, stat, errno, ui | ||
|
r5967 | import os, revlog, time, util, extensions, hook, inspect | ||
|
r6603 | import match as match_ | ||
|
r1089 | |||
|
r2612 | class localrepository(repo.repository): | ||
|
r5258 | capabilities = util.set(('lookup', 'changegroupsubset')) | ||
|
r3853 | supported = ('revlogv1', 'store') | ||
|
r2439 | |||
|
r1839 | def __init__(self, parentui, path=None, create=0): | ||
|
r2612 | repo.repository.__init__(self) | ||
|
r3850 | self.root = os.path.realpath(path) | ||
|
r4170 | self.path = os.path.join(self.root, ".hg") | ||
|
r3850 | self.origroot = path | ||
self.opener = util.opener(self.path) | ||||
self.wopener = util.opener(self.root) | ||||
|
r1089 | |||
|
r3035 | if not os.path.isdir(self.path): | ||
if create: | ||||
if not os.path.exists(path): | ||||
os.mkdir(path) | ||||
os.mkdir(self.path) | ||||
|
r4166 | requirements = ["revlogv1"] | ||
if parentui.configbool('format', 'usestore', True): | ||||
|
r4163 | os.mkdir(os.path.join(self.path, "store")) | ||
|
r4166 | requirements.append("store") | ||
# create an invalid changelog | ||||
self.opener("00changelog.i", "a").write( | ||||
'\0\0\0\2' # represents revlogv2 | ||||
' dummy changelog to prevent using the old repo layout' | ||||
) | ||||
|
r3851 | reqfile = self.opener("requires", "w") | ||
for r in requirements: | ||||
reqfile.write("%s\n" % r) | ||||
reqfile.close() | ||||
|
r3035 | else: | ||
raise repo.RepoError(_("repository %s not found") % path) | ||||
elif create: | ||||
raise repo.RepoError(_("repository %s already exists") % path) | ||||
|
r3851 | else: | ||
# find requirements | ||||
try: | ||||
requirements = self.opener("requires").read().splitlines() | ||||
except IOError, inst: | ||||
if inst.errno != errno.ENOENT: | ||||
raise | ||||
requirements = [] | ||||
# check them | ||||
for r in requirements: | ||||
if r not in self.supported: | ||||
raise repo.RepoError(_("requirement '%s' not supported") % r) | ||||
|
r1089 | |||
|
r3850 | # setup store | ||
|
r3853 | if "store" in requirements: | ||
self.encodefn = util.encodefilename | ||||
self.decodefn = util.decodefilename | ||||
self.spath = os.path.join(self.path, "store") | ||||
else: | ||||
self.encodefn = lambda x: x | ||||
self.decodefn = lambda x: x | ||||
self.spath = self.path | ||||
|
r6062 | |||
try: | ||||
# files in .hg/ will be created using this mode | ||||
mode = os.stat(self.spath).st_mode | ||||
# avoid some useless chmods | ||||
if (0777 & ~util._umask) == (0777 & mode): | ||||
mode = None | ||||
except OSError: | ||||
mode = None | ||||
|
r6065 | self._createmode = mode | ||
|
r6062 | self.opener.createmode = mode | ||
sopener = util.opener(self.spath) | ||||
sopener.createmode = mode | ||||
self.sopener = util.encodedopener(sopener, self.encodefn) | ||||
|
r3850 | |||
|
r1839 | self.ui = ui.ui(parentui=parentui) | ||
|
r2072 | try: | ||
self.ui.readconfig(self.join("hgrc"), self.root) | ||||
|
r4618 | extensions.loadall(self.ui) | ||
|
r2072 | except IOError: | ||
pass | ||||
|
r1089 | self.tagscache = None | ||
|
r5657 | self._tagstypecache = None | ||
|
r3417 | self.branchcache = None | ||
|
r6119 | self._ubranchcache = None # UTF-8 version of branchcache | ||
|
r6121 | self._branchcachetip = None | ||
|
r1089 | self.nodetagscache = None | ||
|
r4004 | self.filterpats = {} | ||
|
r5966 | self._datafilters = {} | ||
|
r4916 | self._transref = self._lockref = self._wlockref = None | ||
|
r1089 | |||
|
r4559 | def __getattr__(self, name): | ||
if name == 'changelog': | ||||
self.changelog = changelog.changelog(self.sopener) | ||||
self.sopener.defversion = self.changelog.version | ||||
return self.changelog | ||||
if name == 'manifest': | ||||
self.changelog | ||||
self.manifest = manifest.manifest(self.sopener) | ||||
return self.manifest | ||||
if name == 'dirstate': | ||||
self.dirstate = dirstate.dirstate(self.opener, self.ui, self.root) | ||||
return self.dirstate | ||||
else: | ||||
raise AttributeError, name | ||||
|
r2155 | |||
|
r2673 | def url(self): | ||
return 'file:' + self.root | ||||
|
r1718 | def hook(self, name, throw=False, **args): | ||
|
r4622 | return hook.hook(self.ui, self, name, throw, **args) | ||
|
r1089 | |||
|
r2601 | tag_disallowed = ':\r\n' | ||
|
r6321 | def _tag(self, names, node, message, local, user, date, parent=None, | ||
|
r4864 | extra={}): | ||
|
r4118 | use_dirstate = parent is None | ||
|
r6321 | if isinstance(names, str): | ||
allchars = names | ||||
names = (names,) | ||||
else: | ||||
allchars = ''.join(names) | ||||
|
r4118 | for c in self.tag_disallowed: | ||
|
r6321 | if c in allchars: | ||
|
r4118 | raise util.Abort(_('%r cannot be used in a tag name') % c) | ||
|
r6321 | for name in names: | ||
self.hook('pretag', throw=True, node=hex(node), tag=name, | ||||
local=local) | ||||
|
r4118 | |||
|
r6321 | def writetags(fp, names, munge, prevtags): | ||
|
r5985 | fp.seek(0, 2) | ||
|
r4932 | if prevtags and prevtags[-1] != '\n': | ||
fp.write('\n') | ||||
|
r6321 | for name in names: | ||
fp.write('%s %s\n' % (hex(node), munge and munge(name) or name)) | ||||
|
r4932 | fp.close() | ||
|
r5081 | |||
|
r4932 | prevtags = '' | ||
|
r4118 | if local: | ||
|
r4932 | try: | ||
fp = self.opener('localtags', 'r+') | ||||
except IOError, err: | ||||
fp = self.opener('localtags', 'a') | ||||
else: | ||||
prevtags = fp.read() | ||||
|
r4118 | # local tags are stored in the current charset | ||
|
r6321 | writetags(fp, names, None, prevtags) | ||
for name in names: | ||||
self.hook('tag', node=hex(node), tag=name, local=local) | ||||
|
r4118 | return | ||
|
r4932 | if use_dirstate: | ||
try: | ||||
fp = self.wfile('.hgtags', 'rb+') | ||||
except IOError, err: | ||||
fp = self.wfile('.hgtags', 'ab') | ||||
else: | ||||
prevtags = fp.read() | ||||
else: | ||||
try: | ||||
prevtags = self.filectx('.hgtags', parent).data() | ||||
except revlog.LookupError: | ||||
pass | ||||
fp = self.wfile('.hgtags', 'wb') | ||||
|
r5211 | if prevtags: | ||
fp.write(prevtags) | ||||
|
r4932 | |||
|
r4118 | # committed tags are stored in UTF-8 | ||
|
r6321 | writetags(fp, names, util.fromlocal, prevtags) | ||
|
r4932 | |||
|
r4906 | if use_dirstate and '.hgtags' not in self.dirstate: | ||
|
r4118 | self.add(['.hgtags']) | ||
|
r4864 | tagnode = self.commit(['.hgtags'], message, user, date, p1=parent, | ||
extra=extra) | ||||
|
r4118 | |||
|
r6321 | for name in names: | ||
self.hook('tag', node=hex(node), tag=name, local=local) | ||||
|
r4118 | |||
return tagnode | ||||
|
r6321 | def tag(self, names, node, message, local, user, date): | ||
'''tag a revision with one or more symbolic names. | ||||
|
r2601 | |||
|
r6321 | names is a list of strings or, when adding a single tag, names may be a | ||
string. | ||||
|
r6334 | |||
|
r6321 | if local is True, the tags are stored in a per-repository file. | ||
otherwise, they are stored in the .hgtags file, and a new | ||||
|
r2601 | changeset is committed with the change. | ||
keyword arguments: | ||||
|
r6321 | local: whether to store tags in non-version-controlled file | ||
|
r2601 | (default False) | ||
message: commit message to use if committing | ||||
user: name of user to use if committing | ||||
date: date tuple to use if committing''' | ||||
|
r2875 | for x in self.status()[:5]: | ||
|
r2601 | if '.hgtags' in x: | ||
raise util.Abort(_('working copy of .hgtags is changed ' | ||||
'(please commit .hgtags manually)')) | ||||
|
r6321 | self._tag(names, node, message, local, user, date) | ||
|
r2601 | |||
|
r1089 | def tags(self): | ||
'''return a mapping of tag to node''' | ||||
|
r4210 | if self.tagscache: | ||
return self.tagscache | ||||
|
r4211 | globaltags = {} | ||
|
r5657 | tagtypes = {} | ||
|
r1089 | |||
|
r5657 | def readtags(lines, fn, tagtype): | ||
|
r4210 | filetags = {} | ||
count = 0 | ||||
def warn(msg): | ||||
self.ui.warn(_("%s, line %s: %s\n") % (fn, count, msg)) | ||||
for l in lines: | ||||
count += 1 | ||||
if not l: | ||||
continue | ||||
|
r1986 | s = l.split(" ", 1) | ||
if len(s) != 2: | ||||
|
r4210 | warn(_("cannot parse entry")) | ||
continue | ||||
|
r1986 | node, key = s | ||
|
r3772 | key = util.tolocal(key.strip()) # stored in UTF-8 | ||
|
r1986 | try: | ||
bin_n = bin(node) | ||||
except TypeError: | ||||
|
r4210 | warn(_("node '%s' is not well formed") % node) | ||
continue | ||||
|
r1986 | if bin_n not in self.changelog.nodemap: | ||
|
r4210 | warn(_("tag '%s' refers to unknown node") % key) | ||
continue | ||||
|
r4211 | |||
|
r4266 | h = [] | ||
|
r4211 | if key in filetags: | ||
n, h = filetags[key] | ||||
|
r4266 | h.append(n) | ||
|
r4211 | filetags[key] = (bin_n, h) | ||
|
r1986 | |||
|
r4633 | for k, nh in filetags.items(): | ||
|
r4211 | if k not in globaltags: | ||
globaltags[k] = nh | ||||
|
r5657 | tagtypes[k] = tagtype | ||
|
r4211 | continue | ||
|
r5657 | |||
|
r4211 | # we prefer the global tag if: | ||
# it supercedes us OR | ||||
# mutual supercedes and it has a higher rank | ||||
# otherwise we win because we're tip-most | ||||
an, ah = nh | ||||
bn, bh = globaltags[k] | ||||
|
r4633 | if (bn != an and an in bh and | ||
(bn not in ah or len(bh) > len(ah))): | ||||
|
r4211 | an = bn | ||
|
r4482 | ah.extend([n for n in bh if n not in ah]) | ||
|
r4211 | globaltags[k] = an, ah | ||
|
r5657 | tagtypes[k] = tagtype | ||
|
r4211 | |||
# read the tags file from each head, ending with the tip | ||||
|
r4210 | f = None | ||
for rev, node, fnode in self._hgtagsnodes(): | ||||
f = (f and f.filectx(fnode) or | ||||
self.filectx('.hgtags', fileid=fnode)) | ||||
|
r5657 | readtags(f.data().splitlines(), f, "global") | ||
|
r3456 | |||
|
r4210 | try: | ||
data = util.fromlocal(self.opener("localtags").read()) | ||||
# localtags are stored in the local character set | ||||
# while the internal tag table is stored in UTF-8 | ||||
|
r5657 | readtags(data.splitlines(), "localtags", "local") | ||
|
r4210 | except IOError: | ||
pass | ||||
|
r1089 | |||
|
r4211 | self.tagscache = {} | ||
|
r5657 | self._tagstypecache = {} | ||
|
r4211 | for k,nh in globaltags.items(): | ||
n = nh[0] | ||||
|
r4213 | if n != nullid: | ||
self.tagscache[k] = n | ||||
|
r5657 | self._tagstypecache[k] = tagtypes[k] | ||
|
r4210 | self.tagscache['tip'] = self.changelog.tip() | ||
|
r1089 | |||
return self.tagscache | ||||
|
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 | ||||
''' | ||||
self.tags() | ||||
|
r5760 | |||
|
r5657 | return self._tagstypecache.get(tagname) | ||
|
r3577 | def _hgtagsnodes(self): | ||
heads = self.heads() | ||||
heads.reverse() | ||||
last = {} | ||||
ret = [] | ||||
for node in heads: | ||||
c = self.changectx(node) | ||||
rev = c.rev() | ||||
try: | ||||
fnode = c.filenode('.hgtags') | ||||
|
r3930 | except revlog.LookupError: | ||
|
r3577 | continue | ||
ret.append((rev, node, fnode)) | ||||
if fnode in last: | ||||
ret[last[fnode]] = None | ||||
last[fnode] = len(ret) - 1 | ||||
return [item for item in ret if item] | ||||
|
r1089 | def tagslist(self): | ||
'''return a list of tags ordered by revision''' | ||||
l = [] | ||||
for t, n in self.tags().items(): | ||||
try: | ||||
r = self.changelog.rev(n) | ||||
except: | ||||
r = -2 # sort to the beginning of the list if unknown | ||||
|
r1615 | l.append((r, t, n)) | ||
|
r1089 | l.sort() | ||
|
r1615 | return [(t, n) for r, t, n in l] | ||
|
r1089 | |||
def nodetags(self, node): | ||||
'''return the tags associated with a node''' | ||||
if not self.nodetagscache: | ||||
self.nodetagscache = {} | ||||
|
r1615 | for t, n in self.tags().items(): | ||
self.nodetagscache.setdefault(n, []).append(t) | ||||
|
r1089 | return self.nodetagscache.get(node, []) | ||
|
r6120 | def _branchtags(self, partial, lrev): | ||
|
r3491 | tiprev = self.changelog.count() - 1 | ||
if lrev != tiprev: | ||||
self._updatebranchcache(partial, lrev+1, tiprev+1) | ||||
self._writebranchcache(partial, self.changelog.tip(), tiprev) | ||||
|
r3826 | return partial | ||
def branchtags(self): | ||||
|
r6121 | tip = self.changelog.tip() | ||
if self.branchcache is not None and self._branchcachetip == tip: | ||||
|
r3826 | return self.branchcache | ||
|
r6121 | oldtip = self._branchcachetip | ||
self._branchcachetip = tip | ||||
if self.branchcache is None: | ||||
self.branchcache = {} # avoid recursion in changectx | ||||
else: | ||||
self.branchcache.clear() # keep using the same dict | ||||
if oldtip is None or oldtip not in self.changelog.nodemap: | ||||
partial, last, lrev = self._readbranchcache() | ||||
else: | ||||
lrev = self.changelog.rev(oldtip) | ||||
partial = self._ubranchcache | ||||
|
r6120 | self._branchtags(partial, lrev) | ||
|
r3826 | |||
|
r3773 | # the branch cache is stored on disk as UTF-8, but in the local | ||
# charset internally | ||||
for k, v in partial.items(): | ||||
self.branchcache[util.tolocal(k)] = v | ||||
|
r6119 | self._ubranchcache = partial | ||
|
r3491 | return self.branchcache | ||
def _readbranchcache(self): | ||||
partial = {} | ||||
|
r3417 | try: | ||
|
r4177 | f = self.opener("branch.cache") | ||
|
r3668 | lines = f.read().split('\n') | ||
f.close() | ||||
|
r4415 | except (IOError, OSError): | ||
return {}, nullid, nullrev | ||||
try: | ||||
|
r4167 | last, lrev = lines.pop(0).split(" ", 1) | ||
|
r3417 | last, lrev = bin(last), int(lrev) | ||
|
r3761 | if not (lrev < self.changelog.count() and | ||
self.changelog.node(lrev) == last): # sanity check | ||||
# invalidate the cache | ||||
|
r6056 | raise ValueError('invalidating branch cache (tip differs)') | ||
|
r3761 | for l in lines: | ||
if not l: continue | ||||
|
r4167 | node, label = l.split(" ", 1) | ||
partial[label.strip()] = bin(node) | ||||
|
r3761 | except (KeyboardInterrupt, util.SignalInterrupt): | ||
raise | ||||
except Exception, inst: | ||||
if self.ui.debugflag: | ||||
self.ui.warn(str(inst), '\n') | ||||
partial, last, lrev = {}, nullid, nullrev | ||||
|
r3491 | return partial, last, lrev | ||
|
r3417 | |||
|
r3491 | def _writebranchcache(self, branches, tip, tiprev): | ||
|
r3452 | try: | ||
|
r4329 | f = self.opener("branch.cache", "w", atomictemp=True) | ||
|
r3491 | f.write("%s %s\n" % (hex(tip), tiprev)) | ||
for label, node in branches.iteritems(): | ||||
|
r3452 | f.write("%s %s\n" % (hex(node), label)) | ||
|
r4329 | f.rename() | ||
|
r4415 | except (IOError, OSError): | ||
|
r3452 | pass | ||
|
r3417 | |||
|
r3491 | def _updatebranchcache(self, partial, start, end): | ||
for r in xrange(start, end): | ||||
c = self.changectx(r) | ||||
b = c.branch() | ||||
|
r4167 | partial[b] = c.node() | ||
|
r3491 | |||
|
r1089 | def lookup(self, key): | ||
|
r3418 | if key == '.': | ||
|
r4510 | key, second = self.dirstate.parents() | ||
|
r3418 | if key == nullid: | ||
raise repo.RepoError(_("no revision checked out")) | ||||
|
r4510 | if second != nullid: | ||
self.ui.warn(_("warning: working directory has two parents, " | ||||
"tag '.' uses the first\n")) | ||||
|
r3801 | elif key == 'null': | ||
return nullid | ||||
|
r3453 | n = self.changelog._match(key) | ||
if n: | ||||
return n | ||||
|
r3418 | if key in self.tags(): | ||
|
r1089 | return self.tags()[key] | ||
|
r3418 | if key in self.branchtags(): | ||
return self.branchtags()[key] | ||||
|
r3453 | n = self.changelog._partialmatch(key) | ||
if n: | ||||
return n | ||||
|
r4916 | try: | ||
if len(key) == 20: | ||||
key = hex(key) | ||||
except: | ||||
pass | ||||
|
r3453 | raise repo.RepoError(_("unknown revision '%s'") % key) | ||
|
r1089 | |||
def local(self): | ||||
|
r1101 | return True | ||
|
r1089 | |||
def join(self, f): | ||||
return os.path.join(self.path, f) | ||||
|
r3457 | def sjoin(self, f): | ||
|
r3853 | f = self.encodefn(f) | ||
|
r3791 | return os.path.join(self.spath, f) | ||
|
r3457 | |||
|
r1089 | def wjoin(self, f): | ||
return os.path.join(self.root, f) | ||||
|
r6526 | def rjoin(self, f): | ||
return os.path.join(self.root, util.pconvert(f)) | ||||
|
r6528 | |||
|
r1089 | def file(self, f): | ||
|
r1615 | if f[0] == '/': | ||
f = f[1:] | ||||
|
r4258 | return filelog.filelog(self.sopener, f) | ||
|
r1089 | |||
|
r3132 | def changectx(self, changeid=None): | ||
|
r2564 | return context.changectx(self, changeid) | ||
|
r3218 | def workingctx(self): | ||
return context.workingctx(self) | ||||
|
r3163 | def parents(self, changeid=None): | ||
''' | ||||
get list of changectxs for parents of changeid or working directory | ||||
''' | ||||
if changeid is None: | ||||
pl = self.dirstate.parents() | ||||
else: | ||||
n = self.changelog.lookup(changeid) | ||||
pl = self.changelog.parents(n) | ||||
|
r3164 | if pl[1] == nullid: | ||
return [self.changectx(pl[0])] | ||||
return [self.changectx(pl[0]), self.changectx(pl[1])] | ||||
|
r3163 | |||
|
r2564 | def filectx(self, path, changeid=None, fileid=None): | ||
"""changeid can be a changeset revision, node, or tag. | ||||
fileid can be a file revision or node.""" | ||||
return context.filectx(self, path, changeid, fileid) | ||||
|
r1089 | def getcwd(self): | ||
return self.dirstate.getcwd() | ||||
|
r4525 | def pathto(self, f, cwd=None): | ||
return self.dirstate.pathto(f, cwd) | ||||
|
r1089 | def wfile(self, f, mode='r'): | ||
return self.wopener(f, mode) | ||||
|
r4275 | def _link(self, f): | ||
return os.path.islink(self.wjoin(f)) | ||||
|
r4004 | def _filter(self, filter, filename, data): | ||
if filter not in self.filterpats: | ||||
|
r1258 | l = [] | ||
|
r4004 | for pat, cmd in self.ui.configitems(filter): | ||
|
r1947 | mf = util.matcher(self.root, "", [pat], [], [])[1] | ||
|
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: | ||||
|
r5967 | fn = lambda s, c, **kwargs: util.filter(s, c) | ||
# Wrap old filters not supporting keyword arguments | ||||
if not inspect.getargspec(fn)[2]: | ||||
oldfn = fn | ||||
fn = lambda s, c, **kwargs: oldfn(s, c) | ||||
|
r6066 | l.append((mf, fn, params)) | ||
|
r4004 | self.filterpats[filter] = l | ||
|
r1258 | |||
|
r5966 | for mf, fn, cmd in self.filterpats[filter]: | ||
|
r1258 | if mf(filename): | ||
|
r1402 | 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 | |||
|
r5966 | def adddatafilter(self, name, filter): | ||
self._datafilters[name] = filter | ||||
|
r4004 | def wread(self, filename): | ||
if self._link(filename): | ||||
data = os.readlink(self.wjoin(filename)) | ||||
else: | ||||
data = self.wopener(filename, 'r').read() | ||||
return self._filter("encode", filename, data) | ||||
|
r1258 | |||
|
r4006 | def wwrite(self, filename, data, flags): | ||
|
r4004 | data = self._filter("decode", filename, data) | ||
|
r5703 | try: | ||
os.unlink(self.wjoin(filename)) | ||||
except OSError: | ||||
pass | ||||
self.wopener(filename, 'w').write(data) | ||||
util.set_flags(self.wjoin(filename), flags) | ||||
|
r1258 | |||
|
r4005 | def wwritedata(self, filename, data): | ||
return self._filter("decode", filename, data) | ||||
|
r1089 | |||
def transaction(self): | ||||
|
r4916 | if self._transref and self._transref(): | ||
return self._transref().nest() | ||||
|
r1806 | |||
|
r5865 | # abort here if the journal already exists | ||
if os.path.exists(self.sjoin("journal")): | ||||
raise repo.RepoError(_("journal already exists - run hg recover")) | ||||
|
r2362 | # save dirstate for rollback | ||
|
r1089 | try: | ||
ds = self.opener("dirstate").read() | ||||
except IOError: | ||||
ds = "" | ||||
self.opener("journal.dirstate", "w").write(ds) | ||||
|
r5814 | self.opener("journal.branch", "w").write(self.dirstate.branch()) | ||
|
r1089 | |||
|
r3790 | renames = [(self.sjoin("journal"), self.sjoin("undo")), | ||
|
r5814 | (self.join("journal.dirstate"), self.join("undo.dirstate")), | ||
(self.join("journal.branch"), self.join("undo.branch"))] | ||||
|
r3457 | tr = transaction.transaction(self.ui.warn, self.sopener, | ||
|
r6065 | self.sjoin("journal"), | ||
aftertrans(renames), | ||||
self._createmode) | ||||
|
r4916 | self._transref = weakref.ref(tr) | ||
|
r1806 | return tr | ||
|
r1089 | |||
def recover(self): | ||||
|
r1749 | l = self.lock() | ||
|
r4915 | try: | ||
if os.path.exists(self.sjoin("journal")): | ||||
self.ui.status(_("rolling back interrupted transaction\n")) | ||||
transaction.rollback(self.sopener, self.sjoin("journal")) | ||||
self.invalidate() | ||||
return True | ||||
else: | ||||
self.ui.warn(_("no interrupted transaction available\n")) | ||||
return False | ||||
finally: | ||||
del l | ||||
|
r1089 | |||
|
r4917 | def rollback(self): | ||
wlock = lock = None | ||||
|
r4915 | try: | ||
|
r1712 | wlock = self.wlock() | ||
|
r4438 | lock = self.lock() | ||
|
r4915 | if os.path.exists(self.sjoin("undo")): | ||
self.ui.status(_("rolling back last transaction\n")) | ||||
transaction.rollback(self.sopener, self.sjoin("undo")) | ||||
util.rename(self.join("undo.dirstate"), self.join("dirstate")) | ||||
|
r6058 | try: | ||
branch = self.opener("undo.branch").read() | ||||
self.dirstate.setbranch(branch) | ||||
except IOError: | ||||
self.ui.warn(_("Named branch could not be reset, " | ||||
"current branch still is: %s\n") | ||||
% util.tolocal(self.dirstate.branch())) | ||||
|
r4915 | self.invalidate() | ||
self.dirstate.invalidate() | ||||
else: | ||||
self.ui.warn(_("no rollback information available\n")) | ||||
finally: | ||||
|
r5053 | del lock, wlock | ||
|
r1089 | |||
|
r4613 | def invalidate(self): | ||
for a in "changelog manifest".split(): | ||||
|
r6371 | if a in self.__dict__: | ||
delattr(self, a) | ||||
|
r1784 | self.tagscache = None | ||
|
r5657 | self._tagstypecache = None | ||
|
r1784 | self.nodetagscache = None | ||
|
r6118 | self.branchcache = None | ||
|
r6119 | self._ubranchcache = None | ||
|
r6121 | self._branchcachetip = None | ||
|
r1784 | |||
|
r4913 | def _lock(self, lockname, wait, releasefn, acquirefn, desc): | ||
|
r1089 | try: | ||
|
r3457 | l = lock.lock(lockname, 0, releasefn, desc=desc) | ||
|
r1531 | except lock.LockHeld, inst: | ||
if not wait: | ||||
|
r2016 | raise | ||
|
r3688 | self.ui.warn(_("waiting for lock on %s held by %r\n") % | ||
(desc, inst.locker)) | ||||
|
r2016 | # default to 600 seconds timeout | ||
|
r3457 | l = lock.lock(lockname, int(self.ui.config("ui", "timeout", "600")), | ||
|
r2016 | releasefn, desc=desc) | ||
|
r1751 | if acquirefn: | ||
acquirefn() | ||||
return l | ||||
|
r4914 | def lock(self, wait=True): | ||
|
r4917 | if self._lockref and self._lockref(): | ||
return self._lockref() | ||||
l = self._lock(self.sjoin("lock"), wait, None, self.invalidate, | ||||
_('repository %s') % self.origroot) | ||||
self._lockref = weakref.ref(l) | ||||
return l | ||||
|
r1751 | |||
|
r4914 | def wlock(self, wait=True): | ||
|
r4917 | if self._wlockref and self._wlockref(): | ||
return self._wlockref() | ||||
|
r1531 | |||
|
r4917 | l = self._lock(self.join("wlock"), wait, self.dirstate.write, | ||
self.dirstate.invalidate, _('working directory of %s') % | ||||
self.origroot) | ||||
self._wlockref = weakref.ref(l) | ||||
return l | ||||
|
r1531 | |||
|
r4970 | def filecommit(self, fn, manifest1, manifest2, linkrev, tr, changelist): | ||
|
r3292 | """ | ||
|
r3294 | commit an individual file as part of a larger transaction | ||
""" | ||||
|
r3292 | |||
|
r3294 | t = self.wread(fn) | ||
fl = self.file(fn) | ||||
fp1 = manifest1.get(fn, nullid) | ||||
fp2 = manifest2.get(fn, nullid) | ||||
|
r1716 | |||
|
r3292 | meta = {} | ||
|
r3294 | cp = self.dirstate.copied(fn) | ||
|
r3292 | if cp: | ||
|
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 | ||||
# | ||||
|
r3292 | meta["copy"] = cp | ||
if not manifest2: # not a branch merge | ||||
|
r6535 | meta["copyrev"] = hex(manifest1[cp]) | ||
|
r3292 | fp2 = nullid | ||
elif fp2 != nullid: # copied on remote side | ||||
|
r6535 | meta["copyrev"] = hex(manifest1[cp]) | ||
|
r3733 | elif fp1 != nullid: # copied on local side, reversed | ||
|
r6535 | meta["copyrev"] = hex(manifest2[cp]) | ||
|
r4058 | fp2 = fp1 | ||
|
r5229 | elif cp in manifest2: # directory rename on local side | ||
meta["copyrev"] = hex(manifest2[cp]) | ||||
else: # directory rename on remote side | ||||
|
r6535 | meta["copyrev"] = hex(manifest1[cp]) | ||
|
r3292 | self.ui.debug(_(" %s: copy %s:%s\n") % | ||
|
r3294 | (fn, cp, meta["copyrev"])) | ||
|
r3292 | fp1 = nullid | ||
elif fp2 != nullid: | ||||
|
r1716 | # is one parent an ancestor of the other? | ||
|
r3294 | fpa = fl.ancestor(fp1, fp2) | ||
|
r1716 | if fpa == fp1: | ||
fp1, fp2 = fp2, nullid | ||||
elif fpa == fp2: | ||||
fp2 = nullid | ||||
|
r4531 | # is the file unmodified from the parent? report existing entry | ||
|
r5228 | if fp2 == nullid and not fl.cmp(fp1, t) and not meta: | ||
|
r4531 | return fp1 | ||
|
r1716 | |||
|
r3294 | changelist.append(fn) | ||
|
r4970 | return fl.add(t, meta, tr, linkrev, fp1, fp2) | ||
|
r1716 | |||
|
r4917 | def rawcommit(self, files, text, user, date, p1=None, p2=None, extra={}): | ||
|
r3621 | if p1 is None: | ||
p1, p2 = self.dirstate.parents() | ||||
return self.commit(files=files, text=text, user=user, date=date, | ||||
|
r5041 | p1=p1, p2=p2, extra=extra, empty_ok=True) | ||
|
r1089 | |||
|
r1615 | def commit(self, files=None, text="", user=None, date=None, | ||
|
r6603 | match=None, force=False, force_editor=False, | ||
|
r5041 | p1=None, p2=None, extra={}, empty_ok=False): | ||
|
r4917 | wlock = lock = tr = None | ||
|
r5637 | valid = 0 # don't save the dirstate if this isn't set | ||
|
r5882 | if files: | ||
files = util.unique(files) | ||||
|
r4915 | try: | ||
|
r6370 | wlock = self.wlock() | ||
lock = self.lock() | ||||
|
r4915 | commit = [] | ||
remove = [] | ||||
changed = [] | ||||
use_dirstate = (p1 is None) # not rawcommit | ||||
extra = extra.copy() | ||||
|
r1089 | |||
|
r4915 | if use_dirstate: | ||
if files: | ||||
for f in files: | ||||
s = self.dirstate[f] | ||||
if s in 'nma': | ||||
commit.append(f) | ||||
elif s == 'r': | ||||
remove.append(f) | ||||
else: | ||||
self.ui.warn(_("%s not tracked!\n") % f) | ||||
else: | ||||
changes = self.status(match=match)[:5] | ||||
modified, added, removed, deleted, unknown = changes | ||||
commit = modified + added | ||||
remove = removed | ||||
|
r3621 | else: | ||
|
r4915 | commit = files | ||
|
r1089 | |||
|
r4915 | if use_dirstate: | ||
p1, p2 = self.dirstate.parents() | ||||
update_dirstate = True | ||||
|
r6385 | |||
if (not force and p2 != nullid and | ||||
|
r6639 | (match and (match.files() or match.anypats()))): | ||
|
r6385 | raise util.Abort(_('cannot partially commit a merge ' | ||
'(do not specify files or patterns)')) | ||||
|
r4915 | else: | ||
p1, p2 = p1, p2 or nullid | ||||
update_dirstate = (self.dirstate.parents()[0] == p1) | ||||
|
r3621 | |||
|
r4915 | c1 = self.changelog.read(p1) | ||
c2 = self.changelog.read(p2) | ||||
m1 = self.manifest.read(c1[0]).copy() | ||||
m2 = self.manifest.read(c2[0]) | ||||
|
r1089 | |||
|
r4915 | if use_dirstate: | ||
branchname = self.workingctx().branch() | ||||
try: | ||||
branchname = branchname.decode('UTF-8').encode('UTF-8') | ||||
except UnicodeDecodeError: | ||||
raise util.Abort(_('branch name not in UTF-8!')) | ||||
else: | ||||
branchname = "" | ||||
|
r3419 | |||
|
r4915 | if use_dirstate: | ||
oldname = c1[5].get("branch") # stored in UTF-8 | ||||
if (not commit and not remove and not force and p2 == nullid | ||||
and branchname == oldname): | ||||
self.ui.status(_("nothing changed\n")) | ||||
return None | ||||
|
r1089 | |||
|
r4915 | xp1 = hex(p1) | ||
if p2 == nullid: xp2 = '' | ||||
else: xp2 = hex(p2) | ||||
|
r1089 | |||
|
r4915 | self.hook("precommit", throw=True, parent1=xp1, parent2=xp2) | ||
|
r1089 | |||
|
r4915 | tr = self.transaction() | ||
|
r4970 | trp = weakref.proxy(tr) | ||
|
r1089 | |||
|
r4915 | # check in files | ||
new = {} | ||||
linkrev = self.changelog.count() | ||||
commit.sort() | ||||
is_exec = util.execfunc(self.root, m1.execf) | ||||
is_link = util.linkfunc(self.root, m1.linkf) | ||||
for f in commit: | ||||
self.ui.note(f + "\n") | ||||
try: | ||||
|
r4970 | new[f] = self.filecommit(f, m1, m2, linkrev, trp, changed) | ||
|
r4915 | new_exec = is_exec(f) | ||
new_link = is_link(f) | ||||
|
r5249 | if ((not changed or changed[-1] != f) and | ||
m2.get(f) != new[f]): | ||||
|
r4915 | # mention the file in the changelog if some | ||
# flag changed, even if there was no content | ||||
# change. | ||||
old_exec = m1.execf(f) | ||||
old_link = m1.linkf(f) | ||||
if old_exec != new_exec or old_link != new_link: | ||||
changed.append(f) | ||||
m1.set(f, new_exec, new_link) | ||||
|
r5637 | if use_dirstate: | ||
self.dirstate.normal(f) | ||||
|
r4915 | except (OSError, IOError): | ||
if use_dirstate: | ||||
self.ui.warn(_("trouble committing %s!\n") % f) | ||||
raise | ||||
else: | ||||
remove.append(f) | ||||
|
r1089 | |||
|
r4915 | # update manifest | ||
m1.update(new) | ||||
remove.sort() | ||||
removed = [] | ||||
|
r3620 | |||
|
r4915 | for f in remove: | ||
if f in m1: | ||||
del m1[f] | ||||
removed.append(f) | ||||
elif f in m2: | ||||
removed.append(f) | ||||
|
r4970 | mn = self.manifest.add(m1, trp, linkrev, c1[0], c2[0], | ||
|
r4915 | (new, removed)) | ||
|
r1089 | |||
|
r4915 | # add changeset | ||
new = new.keys() | ||||
new.sort() | ||||
|
r3675 | |||
|
r4915 | user = user or self.ui.username() | ||
|
r5041 | if (not empty_ok and not text) or force_editor: | ||
|
r4915 | edittext = [] | ||
if text: | ||||
edittext.append(text) | ||||
edittext.append("") | ||||
|
r5757 | edittext.append(_("HG: Enter commit message." | ||
" Lines beginning with 'HG:' are removed.")) | ||||
|
r5754 | edittext.append("HG: --") | ||
|
r4915 | edittext.append("HG: user: %s" % user) | ||
if p2 != nullid: | ||||
edittext.append("HG: branch merge") | ||||
if branchname: | ||||
|
r5757 | edittext.append("HG: branch '%s'" % util.tolocal(branchname)) | ||
|
r4915 | edittext.extend(["HG: changed %s" % f for f in changed]) | ||
edittext.extend(["HG: removed %s" % f for f in removed]) | ||||
if not changed and not remove: | ||||
edittext.append("HG: no files changed") | ||||
edittext.append("") | ||||
# run editor in the repository root | ||||
olddir = os.getcwd() | ||||
os.chdir(self.root) | ||||
text = self.ui.edit("\n".join(edittext), user) | ||||
os.chdir(olddir) | ||||
|
r1089 | |||
|
r4020 | if branchname: | ||
|
r4915 | extra["branch"] = branchname | ||
|
r1089 | |||
|
r6254 | lines = [line.rstrip() for line in text.rstrip().splitlines()] | ||
while lines and not lines[0]: | ||||
del lines[0] | ||||
if not lines and use_dirstate: | ||||
raise util.Abort(_("empty commit message")) | ||||
text = '\n'.join(lines) | ||||
|
r5023 | |||
|
r4970 | n = self.changelog.add(mn, changed + removed, text, trp, p1, p2, | ||
|
r4915 | user, date, extra) | ||
self.hook('pretxncommit', throw=True, node=hex(n), parent1=xp1, | ||||
parent2=xp2) | ||||
tr.close() | ||||
|
r1089 | |||
|
r6121 | if self.branchcache: | ||
self.branchtags() | ||||
|
r4019 | |||
|
r4915 | if use_dirstate or update_dirstate: | ||
self.dirstate.setparents(n) | ||||
if use_dirstate: | ||||
for f in removed: | ||||
self.dirstate.forget(f) | ||||
|
r5637 | valid = 1 # our dirstate updates are complete | ||
|
r1089 | |||
|
r4915 | self.hook("commit", node=hex(n), parent1=xp1, parent2=xp2) | ||
return n | ||||
finally: | ||||
|
r5637 | if not valid: # don't save our updated dirstate | ||
self.dirstate.invalidate() | ||||
|
r5053 | del tr, lock, wlock | ||
|
r1089 | |||
|
r6585 | def walk(self, match, node=None): | ||
|
r3532 | ''' | ||
walk recursively through the directory tree or a given | ||||
changeset, finding all files matched by the match | ||||
function | ||||
''' | ||||
|
r1089 | if node: | ||
|
r6577 | fdict = dict.fromkeys(match.files()) | ||
|
r4195 | # for dirstate.walk, files=['.'] means "walk the whole tree". | ||
# follow that here, too | ||||
fdict.pop('.', None) | ||||
|
r4194 | mdict = self.manifest.read(self.changelog.read(node)[0]) | ||
mfiles = mdict.keys() | ||||
mfiles.sort() | ||||
for fn in mfiles: | ||||
|
r3019 | for ffn in fdict: | ||
# match if the file is the exact name or a directory | ||||
if ffn == fn or fn.startswith("%s/" % ffn): | ||||
del fdict[ffn] | ||||
break | ||||
|
r1582 | if match(fn): | ||
|
r6586 | yield fn | ||
|
r4194 | ffiles = fdict.keys() | ||
ffiles.sort() | ||||
for fn in ffiles: | ||||
|
r6578 | if match.bad(fn, 'No such file in rev ' + short(node)) \ | ||
and match(fn): | ||||
|
r6586 | yield fn | ||
|
r1089 | else: | ||
|
r6587 | for fn in self.dirstate.walk(match): | ||
|
r6586 | yield fn | ||
|
r1089 | |||
|
r6603 | def status(self, node1=None, node2=None, match=None, | ||
|
r6201 | list_ignored=False, list_clean=False, list_unknown=True): | ||
|
r2661 | """return status of files between two nodes or node and working directory | ||
|
r1616 | |||
If node1 is None, use the first dirstate parent instead. | ||||
If node2 is None, compare node1 with working directory. | ||||
""" | ||||
|
r1089 | |||
|
r4160 | def fcmp(fn, getnode): | ||
|
r1089 | t1 = self.wread(fn) | ||
|
r4160 | return self.file(fn).cmp(getnode(fn), t1) | ||
|
r1089 | |||
def mfmatches(node): | ||||
|
r1616 | change = self.changelog.read(node) | ||
|
r3322 | mf = self.manifest.read(change[0]).copy() | ||
|
r1089 | for fn in mf.keys(): | ||
if not match(fn): | ||||
del mf[fn] | ||||
return mf | ||||
|
r6603 | if not match: | ||
match = match_.always(self.root, self.getcwd()) | ||||
|
r2661 | modified, added, removed, deleted, unknown = [], [], [], [], [] | ||
ignored, clean = [], [] | ||||
|
r2474 | compareworking = False | ||
|
r2491 | if not node1 or (not node2 and node1 == self.dirstate.parents()[0]): | ||
|
r2474 | compareworking = True | ||
if not compareworking: | ||||
|
r1802 | # read the manifest from node1 before the manifest from node2, | ||
# so that we'll hit the manifest cache if we're going through | ||||
# all the revisions in parent->child order. | ||||
mf1 = mfmatches(node1) | ||||
|
r1089 | # are we comparing the working directory? | ||
if not node2: | ||||
|
r2661 | (lookup, modified, added, removed, deleted, unknown, | ||
|
r6603 | ignored, clean) = self.dirstate.status(match, list_ignored, | ||
list_clean, list_unknown) | ||||
|
r1089 | # are we comparing working dir against its parent? | ||
|
r2474 | if compareworking: | ||
|
r1616 | if lookup: | ||
|
r4912 | fixup = [] | ||
|
r1089 | # do a full compare of any files that might have changed | ||
|
r4910 | ctx = self.changectx() | ||
|
r6158 | mexec = lambda f: 'x' in ctx.fileflags(f) | ||
mlink = lambda f: 'l' in ctx.fileflags(f) | ||||
is_exec = util.execfunc(self.root, mexec) | ||||
is_link = util.linkfunc(self.root, mlink) | ||||
def flags(f): | ||||
return is_link(f) and 'l' or is_exec(f) and 'x' or '' | ||||
|
r1616 | for f in lookup: | ||
|
r6158 | if (f not in ctx or flags(f) != ctx.fileflags(f) | ||
or ctx[f].cmp(self.wread(f))): | ||||
|
r1616 | modified.append(f) | ||
|
r2961 | else: | ||
|
r4912 | fixup.append(f) | ||
|
r4579 | if list_clean: | ||
clean.append(f) | ||||
|
r4912 | |||
# update dirstate for files that are actually clean | ||||
if fixup: | ||||
|
r4917 | wlock = None | ||
|
r4915 | try: | ||
|
r4917 | try: | ||
wlock = self.wlock(False) | ||||
except lock.LockException: | ||||
pass | ||||
|
r4372 | if wlock: | ||
|
r4915 | for f in fixup: | ||
self.dirstate.normal(f) | ||||
finally: | ||||
|
r4917 | del wlock | ||
|
r1616 | else: | ||
# we are comparing working dir against non-parent | ||||
# generate a pseudo-manifest for the working dir | ||||
|
r3322 | # XXX: create it in dirstate.py ? | ||
|
r1616 | mf2 = mfmatches(self.dirstate.parents()[0]) | ||
|
r3996 | is_exec = util.execfunc(self.root, mf2.execf) | ||
|
r4002 | is_link = util.linkfunc(self.root, mf2.linkf) | ||
|
r1616 | for f in lookup + modified + added: | ||
mf2[f] = "" | ||||
|
r4002 | mf2.set(f, is_exec(f), is_link(f)) | ||
|
r1617 | for f in removed: | ||
|
r1616 | if f in mf2: | ||
del mf2[f] | ||||
|
r4372 | |||
|
r1089 | else: | ||
|
r1616 | # we are comparing two revisions | ||
mf2 = mfmatches(node2) | ||||
|
r1089 | |||
|
r2474 | if not compareworking: | ||
|
r1616 | # flush lists from dirstate before comparing manifests | ||
|
r2661 | modified, added, clean = [], [], [] | ||
|
r1089 | |||
|
r2474 | # make sure to sort the files so we talk to the disk in a | ||
# reasonable order | ||||
mf2keys = mf2.keys() | ||||
mf2keys.sort() | ||||
|
r4160 | getnode = lambda fn: mf1.get(fn, nullid) | ||
|
r2474 | for fn in mf2keys: | ||
|
r5915 | if fn in mf1: | ||
|
r4633 | if (mf1.flags(fn) != mf2.flags(fn) or | ||
(mf1[fn] != mf2[fn] and | ||||
(mf2[fn] != "" or fcmp(fn, getnode)))): | ||||
|
r1616 | modified.append(fn) | ||
|
r2661 | elif list_clean: | ||
clean.append(fn) | ||||
|
r1616 | del mf1[fn] | ||
else: | ||||
added.append(fn) | ||||
|
r1089 | |||
|
r1617 | removed = mf1.keys() | ||
|
r1616 | # sort and return results: | ||
|
r2661 | for l in modified, added, removed, deleted, unknown, ignored, clean: | ||
|
r1089 | l.sort() | ||
|
r2661 | return (modified, added, removed, deleted, unknown, ignored, clean) | ||
|
r4917 | def add(self, list): | ||
wlock = self.wlock() | ||||
|
r4915 | try: | ||
|
r5688 | rejected = [] | ||
|
r1415 | for f in list: | ||
|
r4915 | p = self.wjoin(f) | ||
|
r1415 | try: | ||
|
r4915 | st = os.lstat(p) | ||
except: | ||||
self.ui.warn(_("%s does not exist!\n") % f) | ||||
|
r5688 | rejected.append(f) | ||
|
r4915 | continue | ||
if st.st_size > 10000000: | ||||
self.ui.warn(_("%s: files over 10MB may cause memory and" | ||||
" performance problems\n" | ||||
"(use 'hg revert %s' to unadd the file)\n") | ||||
% (f, f)) | ||||
if not (stat.S_ISREG(st.st_mode) or stat.S_ISLNK(st.st_mode)): | ||||
self.ui.warn(_("%s not added: only files and symlinks " | ||||
"supported currently\n") % f) | ||||
|
r5688 | rejected.append(p) | ||
|
r5206 | elif self.dirstate[f] in 'amn': | ||
|
r4915 | self.ui.warn(_("%s already tracked!\n") % f) | ||
|
r5207 | elif self.dirstate[f] == 'r': | ||
|
r5210 | self.dirstate.normallookup(f) | ||
|
r4915 | else: | ||
self.dirstate.add(f) | ||||
|
r5688 | return rejected | ||
|
r4915 | finally: | ||
del wlock | ||||
|
r1089 | |||
|
r4917 | def forget(self, list): | ||
wlock = self.wlock() | ||||
|
r4915 | try: | ||
for f in list: | ||||
if self.dirstate[f] != 'a': | ||||
self.ui.warn(_("%s not added!\n") % f) | ||||
else: | ||||
self.dirstate.forget(f) | ||||
finally: | ||||
del wlock | ||||
|
r1089 | |||
|
r4917 | def remove(self, list, unlink=False): | ||
wlock = None | ||||
|
r4915 | try: | ||
if unlink: | ||||
for f in list: | ||||
try: | ||||
util.unlink(self.wjoin(f)) | ||||
except OSError, inst: | ||||
if inst.errno != errno.ENOENT: | ||||
raise | ||||
|
r1712 | wlock = self.wlock() | ||
|
r1415 | for f in list: | ||
|
r4915 | if unlink and os.path.exists(self.wjoin(f)): | ||
self.ui.warn(_("%s still exists!\n") % f) | ||||
elif self.dirstate[f] == 'a': | ||||
self.dirstate.forget(f) | ||||
elif f not in self.dirstate: | ||||
self.ui.warn(_("%s not tracked!\n") % f) | ||||
else: | ||||
self.dirstate.remove(f) | ||||
finally: | ||||
del wlock | ||||
|
r1447 | |||
|
r4917 | def undelete(self, list): | ||
wlock = None | ||||
|
r4915 | try: | ||
|
r5323 | manifests = [self.manifest.read(self.changelog.read(p)[0]) | ||
for p in self.dirstate.parents() if p != nullid] | ||||
|
r4917 | wlock = self.wlock() | ||
|
r4915 | for f in list: | ||
if self.dirstate[f] != 'r': | ||||
self.ui.warn("%s not removed!\n" % f) | ||||
else: | ||||
|
r5323 | m = f in manifests[0] and manifests[0] or manifests[1] | ||
|
r4915 | t = self.file(f).read(m[f]) | ||
self.wwrite(f, t, m.flags(f)) | ||||
self.dirstate.normal(f) | ||||
finally: | ||||
del wlock | ||||
|
r1447 | |||
|
r4917 | def copy(self, source, dest): | ||
wlock = None | ||||
|
r4915 | try: | ||
p = self.wjoin(dest) | ||||
if not (os.path.exists(p) or os.path.islink(p)): | ||||
self.ui.warn(_("%s does not exist!\n") % dest) | ||||
elif not (os.path.isfile(p) or os.path.islink(p)): | ||||
self.ui.warn(_("copy failed: %s is not a file or a " | ||||
"symbolic link\n") % dest) | ||||
else: | ||||
|
r1712 | wlock = self.wlock() | ||
|
r4915 | if dest not in self.dirstate: | ||
self.dirstate.add(dest) | ||||
self.dirstate.copy(source, dest) | ||||
finally: | ||||
del wlock | ||||
|
r1089 | |||
|
r1551 | def heads(self, start=None): | ||
|
r1550 | heads = self.changelog.heads(start) | ||
# sort the output in rev descending order | ||||
heads = [(-self.changelog.rev(h), h) for h in heads] | ||||
heads.sort() | ||||
return [n for (r, n) in heads] | ||||
|
r1089 | |||
|
r4648 | def branchheads(self, branch, start=None): | ||
branches = self.branchtags() | ||||
if branch not in branches: | ||||
return [] | ||||
# The basic algorithm is this: | ||||
# | ||||
# Start from the branch tip since there are no later revisions that can | ||||
# possibly be in this branch, and the tip is a guaranteed head. | ||||
# | ||||
# Remember the tip's parents as the first ancestors, since these by | ||||
# definition are not heads. | ||||
# | ||||
# Step backwards from the brach tip through all the revisions. We are | ||||
# guaranteed by the rules of Mercurial that we will now be visiting the | ||||
# nodes in reverse topological order (children before parents). | ||||
# | ||||
# If a revision is one of the ancestors of a head then we can toss it | ||||
# out of the ancestors set (we've already found it and won't be | ||||
# visiting it again) and put its parents in the ancestors set. | ||||
# | ||||
# Otherwise, if a revision is in the branch it's another head, since it | ||||
# wasn't in the ancestor list of an existing head. So add it to the | ||||
# head list, and add its parents to the ancestor list. | ||||
# | ||||
# If it is not in the branch ignore it. | ||||
# | ||||
# Once we have a list of heads, use nodesbetween to filter out all the | ||||
# heads that cannot be reached from startrev. There may be a more | ||||
# efficient way to do this as part of the previous algorithm. | ||||
set = util.set | ||||
heads = [self.changelog.rev(branches[branch])] | ||||
# Don't care if ancestors contains nullrev or not. | ||||
ancestors = set(self.changelog.parentrevs(heads[0])) | ||||
for rev in xrange(heads[0] - 1, nullrev, -1): | ||||
if rev in ancestors: | ||||
ancestors.update(self.changelog.parentrevs(rev)) | ||||
ancestors.remove(rev) | ||||
elif self.changectx(rev).branch() == branch: | ||||
heads.append(rev) | ||||
ancestors.update(self.changelog.parentrevs(rev)) | ||||
heads = [self.changelog.node(rev) for rev in heads] | ||||
if start is not None: | ||||
heads = self.changelog.nodesbetween([start], heads)[2] | ||||
return heads | ||||
|
r1089 | def branches(self, nodes): | ||
|
r1615 | if not nodes: | ||
nodes = [self.changelog.tip()] | ||||
|
r1089 | b = [] | ||
for n in nodes: | ||||
t = n | ||||
|
r2345 | while 1: | ||
|
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 | ||||
while n != bottom: | ||||
p = self.changelog.parents(n)[0] | ||||
if i == f: | ||||
l.append(n) | ||||
f = f * 2 | ||||
n = p | ||||
i += 1 | ||||
r.append(l) | ||||
return r | ||||
|
r1959 | def findincoming(self, remote, base=None, heads=None, force=False): | ||
|
r2339 | """Return list of roots of the subsets of missing nodes from remote | ||
If base dict is specified, assume that these nodes and their parents | ||||
exist on the remote side and that no child of a node of base exists | ||||
in both remote and self. | ||||
Furthermore base will be updated to include the nodes that exists | ||||
in self and remote but no children exists in self and remote. | ||||
If a list of heads is specified, return only nodes which are heads | ||||
or ancestors of these heads. | ||||
All the ancestors of base are in self and in remote. | ||||
All the descendants of the list returned are missing in self. | ||||
(and so we know that the rest of the nodes are missing in remote, see | ||||
outgoing) | ||||
""" | ||||
|
r1089 | m = self.changelog.nodemap | ||
search = [] | ||||
fetch = {} | ||||
seen = {} | ||||
seenbranch = {} | ||||
if base == None: | ||||
base = {} | ||||
|
r2108 | if not heads: | ||
heads = remote.heads() | ||||
if self.changelog.tip() == nullid: | ||||
|
r2339 | base[nullid] = 1 | ||
|
r2108 | if heads != [nullid]: | ||
return [nullid] | ||||
return [] | ||||
|
r1089 | # assume we're closer to the tip than the root | ||
# and start by examining the heads | ||||
|
r1402 | self.ui.status(_("searching for changes\n")) | ||
|
r1089 | |||
unknown = [] | ||||
for h in heads: | ||||
if h not in m: | ||||
unknown.append(h) | ||||
else: | ||||
base[h] = 1 | ||||
if not unknown: | ||||
|
r1895 | return [] | ||
|
r1089 | |||
|
r2339 | req = dict.fromkeys(unknown) | ||
|
r1089 | reqcnt = 0 | ||
# search through remote branches | ||||
# a 'branch' here is a linear segment of history, with four parts: | ||||
# head, root, first parent, second parent | ||||
# (a branch always has two parents (or none) by definition) | ||||
unknown = remote.branches(unknown) | ||||
while unknown: | ||||
r = [] | ||||
while unknown: | ||||
n = unknown.pop(0) | ||||
if n[0] in seen: | ||||
continue | ||||
|
r1615 | self.ui.debug(_("examining %s:%s\n") | ||
% (short(n[0]), short(n[1]))) | ||||
|
r2339 | if n[0] == nullid: # found the end of the branch | ||
pass | ||||
elif n in seenbranch: | ||||
|
r1402 | self.ui.debug(_("branch already found\n")) | ||
|
r1089 | continue | ||
|
r2339 | elif n[1] and n[1] in m: # do we know the base? | ||
|
r1402 | self.ui.debug(_("found incomplete branch %s:%s\n") | ||
|
r1089 | % (short(n[0]), short(n[1]))) | ||
search.append(n) # schedule branch range for scanning | ||||
seenbranch[n] = 1 | ||||
else: | ||||
if n[1] not in seen and n[1] not in fetch: | ||||
if n[2] in m and n[3] in m: | ||||
|
r1402 | self.ui.debug(_("found new changeset %s\n") % | ||
|
r1089 | short(n[1])) | ||
fetch[n[1]] = 1 # earliest unknown | ||||
|
r2339 | for p in n[2:4]: | ||
if p in m: | ||||
base[p] = 1 # latest known | ||||
|
r1089 | |||
|
r2339 | for p in n[2:4]: | ||
if p not in req and p not in m: | ||||
r.append(p) | ||||
req[p] = 1 | ||||
|
r1089 | seen[n[0]] = 1 | ||
if r: | ||||
reqcnt += 1 | ||||
|
r1402 | self.ui.debug(_("request %d: %s\n") % | ||
|
r1089 | (reqcnt, " ".join(map(short, r)))) | ||
|
r3473 | for p in xrange(0, len(r), 10): | ||
|
r1089 | for b in remote.branches(r[p:p+10]): | ||
|
r1402 | self.ui.debug(_("received %s:%s\n") % | ||
|
r1089 | (short(b[0]), short(b[1]))) | ||
|
r2339 | unknown.append(b) | ||
|
r1089 | |||
# do binary search on the branches we found | ||||
while search: | ||||
n = search.pop(0) | ||||
reqcnt += 1 | ||||
l = remote.between([(n[0], n[1])])[0] | ||||
l.append(n[1]) | ||||
p = n[0] | ||||
f = 1 | ||||
for i in l: | ||||
|
r1402 | self.ui.debug(_("narrowing %d:%d %s\n") % (f, len(l), short(i))) | ||
|
r1089 | if i in m: | ||
if f <= 2: | ||||
|
r1402 | self.ui.debug(_("found new branch changeset %s\n") % | ||
|
r1089 | short(p)) | ||
fetch[p] = 1 | ||||
base[i] = 1 | ||||
else: | ||||
|
r1402 | self.ui.debug(_("narrowed branch search to %s:%s\n") | ||
|
r1089 | % (short(p), short(i))) | ||
search.append((p, i)) | ||||
break | ||||
p, f = i, f * 2 | ||||
# sanity check our fetch list | ||||
for f in fetch.keys(): | ||||
if f in m: | ||||
|
r1402 | raise repo.RepoError(_("already have changeset ") + short(f[:4])) | ||
|
r1089 | |||
if base.keys() == [nullid]: | ||||
|
r1959 | if force: | ||
self.ui.warn(_("warning: repository is unrelated\n")) | ||||
else: | ||||
raise util.Abort(_("repository is unrelated")) | ||||
|
r1089 | |||
|
r2965 | self.ui.debug(_("found new changesets starting at ") + | ||
|
r1089 | " ".join([short(f) for f in fetch]) + "\n") | ||
|
r1402 | self.ui.debug(_("%d total queries\n") % reqcnt) | ||
|
r1089 | |||
return fetch.keys() | ||||
|
r1959 | def findoutgoing(self, remote, base=None, heads=None, force=False): | ||
|
r2021 | """Return list of nodes that are roots of subsets not in remote | ||
If base dict is specified, assume that these nodes and their parents | ||||
exist on the remote side. | ||||
If a list of heads is specified, return only nodes which are heads | ||||
or ancestors of these heads, and return a second element which | ||||
contains all remote heads which get new children. | ||||
""" | ||||
|
r1089 | if base == None: | ||
base = {} | ||||
|
r1959 | self.findincoming(remote, base, heads, force=force) | ||
|
r1089 | |||
|
r1402 | self.ui.debug(_("common changesets up to ") | ||
|
r1089 | + " ".join(map(short, base.keys())) + "\n") | ||
remain = dict.fromkeys(self.changelog.nodemap) | ||||
# prune everything remote has from the tree | ||||
del remain[nullid] | ||||
remove = base.keys() | ||||
while remove: | ||||
n = remove.pop(0) | ||||
if n in remain: | ||||
del remain[n] | ||||
for p in self.changelog.parents(n): | ||||
remove.append(p) | ||||
# find every node whose parents have been pruned | ||||
subset = [] | ||||
|
r2021 | # find every remote head that will get new children | ||
updated_heads = {} | ||||
|
r1089 | for n in remain: | ||
p1, p2 = self.changelog.parents(n) | ||||
if p1 not in remain and p2 not in remain: | ||||
subset.append(n) | ||||
|
r2021 | if heads: | ||
if p1 in heads: | ||||
updated_heads[p1] = True | ||||
if p2 in heads: | ||||
updated_heads[p2] = True | ||||
|
r1089 | |||
# this is the set of all roots we have to push | ||||
|
r2021 | if heads: | ||
return subset, updated_heads.keys() | ||||
else: | ||||
return subset | ||||
|
r1089 | |||
|
r4917 | def pull(self, remote, heads=None, force=False): | ||
lock = self.lock() | ||||
|
r2827 | try: | ||
|
r5221 | fetch = self.findincoming(remote, heads=heads, force=force) | ||
|
r2827 | if fetch == [nullid]: | ||
self.ui.status(_("requesting all changes\n")) | ||||
|
r1089 | |||
|
r2827 | if not fetch: | ||
self.ui.status(_("no changes found\n")) | ||||
return 0 | ||||
|
r1089 | |||
|
r2827 | if heads is None: | ||
cg = remote.changegroup(fetch, 'pull') | ||||
else: | ||||
|
r3448 | if 'changegroupsubset' not in remote.capabilities: | ||
raise util.Abort(_("Partial pull cannot be done because other repository doesn't support changegroupsubset.")) | ||||
|
r2827 | cg = remote.changegroupsubset(fetch, heads, 'pull') | ||
return self.addchangegroup(cg, 'pull', remote.url()) | ||||
finally: | ||||
|
r4915 | del lock | ||
|
r1089 | |||
|
r1781 | def push(self, remote, force=False, revs=None): | ||
|
r2439 | # there are two ways to push to remote repo: | ||
# | ||||
# addchangegroup assumes local user can lock remote | ||||
# repo (local filesystem, old ssh servers). | ||||
# | ||||
# unbundle assumes local user cannot lock remote repo (new ssh | ||||
# servers, http servers). | ||||
|
r1089 | |||
|
r2612 | if remote.capable('unbundle'): | ||
|
r2463 | return self.push_unbundle(remote, force, revs) | ||
return self.push_addchangegroup(remote, force, revs) | ||||
|
r2439 | |||
def prepush(self, remote, force, revs): | ||||
|
r1089 | base = {} | ||
|
r2021 | remote_heads = remote.heads() | ||
inc = self.findincoming(remote, base, remote_heads, force=force) | ||||
|
r1089 | |||
|
r2021 | update, updated_heads = self.findoutgoing(remote, base, remote_heads) | ||
|
r1781 | if revs is not None: | ||
msng_cl, bases, heads = self.changelog.nodesbetween(update, revs) | ||||
else: | ||||
bases, heads = update, self.changelog.heads() | ||||
if not bases: | ||||
|
r1402 | self.ui.status(_("no changes found\n")) | ||
|
r2439 | return None, 1 | ||
|
r1089 | elif not force: | ||
|
r3684 | # check if we're creating new remote heads | ||
# to be a remote head after push, node must be either | ||||
# - unknown locally | ||||
# - a local outgoing head descended from update | ||||
# - a remote head that's known locally and not | ||||
# ancestral to an outgoing head | ||||
warn = 0 | ||||
if remote_heads == [nullid]: | ||||
warn = 0 | ||||
elif not revs and len(heads) > len(remote_heads): | ||||
warn = 1 | ||||
else: | ||||
newheads = list(heads) | ||||
for r in remote_heads: | ||||
if r in self.changelog.nodemap: | ||||
|
r3923 | desc = self.changelog.heads(r, heads) | ||
|
r3684 | l = [h for h in heads if h in desc] | ||
if not l: | ||||
newheads.append(r) | ||||
else: | ||||
newheads.append(r) | ||||
if len(newheads) > len(remote_heads): | ||||
warn = 1 | ||||
if warn: | ||||
|
r6181 | self.ui.warn(_("abort: push creates new remote heads!\n")) | ||
|
r1402 | self.ui.status(_("(did you forget to merge?" | ||
" use push -f to force)\n")) | ||||
|
r6098 | return None, 0 | ||
|
r3684 | elif inc: | ||
self.ui.warn(_("note: unsynced remote changes!\n")) | ||||
|
r1089 | |||
|
r3682 | |||
|
r1781 | if revs is None: | ||
|
r1782 | cg = self.changegroup(update, 'push') | ||
|
r1781 | else: | ||
|
r1782 | cg = self.changegroupsubset(update, revs, 'push') | ||
|
r2439 | return cg, remote_heads | ||
def push_addchangegroup(self, remote, force, revs): | ||||
lock = remote.lock() | ||||
|
r4915 | try: | ||
ret = self.prepush(remote, force, revs) | ||||
if ret[0] is not None: | ||||
cg, remote_heads = ret | ||||
return remote.addchangegroup(cg, 'push', self.url()) | ||||
return ret[1] | ||||
finally: | ||||
del lock | ||||
|
r2439 | |||
def push_unbundle(self, remote, force, revs): | ||||
# local repo finds heads on server, finds out what revs it | ||||
# must push. once revs transferred, if server finds it has | ||||
# different heads (someone else won commit/push race), server | ||||
# aborts. | ||||
ret = self.prepush(remote, force, revs) | ||||
if ret[0] is not None: | ||||
cg, remote_heads = ret | ||||
if force: remote_heads = ['force'] | ||||
return remote.unbundle(cg, remote_heads, 'push') | ||||
return ret[1] | ||||
|
r1089 | |||
|
r5763 | def changegroupinfo(self, nodes, source): | ||
if self.ui.verbose or source == 'bundle': | ||||
self.ui.status(_("%d changesets found\n") % len(nodes)) | ||||
|
r3513 | if self.ui.debugflag: | ||
self.ui.debug(_("List of changesets:\n")) | ||||
for node in nodes: | ||||
self.ui.debug("%s\n" % hex(node)) | ||||
|
r5908 | def changegroupsubset(self, bases, heads, source, extranodes=None): | ||
|
r1466 | """This function generates a changegroup consisting of all the nodes | ||
that are descendents of any of the bases, and ancestors of any of | ||||
the heads. | ||||
It is fairly complex as determining which filenodes and which | ||||
manifest nodes need to be included for the changeset to be complete | ||||
is non-trivial. | ||||
Another wrinkle is doing the reverse, figuring out which changeset in | ||||
|
r5908 | the changegroup a particular filenode or manifestnode belongs to. | ||
|
r6210 | |||
|
r5908 | The caller can specify some nodes that must be included in the | ||
changegroup using the extranodes argument. It should be a dict | ||||
where the keys are the filenames (or 1 for the manifest), and the | ||||
values are lists of (node, linknode) tuples, where node is a wanted | ||||
node and linknode is the changelog node that should be transmitted as | ||||
the linkrev. | ||||
""" | ||||
|
r1466 | |||
|
r1736 | self.hook('preoutgoing', throw=True, source=source) | ||
|
r1466 | # Set up some initial variables | ||
# Make it easy to refer to self.changelog | ||||
|
r1458 | cl = self.changelog | ||
|
r1466 | # msng is short for missing - compute the list of changesets in this | ||
# changegroup. | ||||
|
r1460 | msng_cl_lst, bases, heads = cl.nodesbetween(bases, heads) | ||
|
r5763 | self.changegroupinfo(msng_cl_lst, source) | ||
|
r1466 | # Some bases may turn out to be superfluous, and some heads may be | ||
# too. nodesbetween will return the minimal set of bases and heads | ||||
# necessary to re-create the changegroup. | ||||
# Known heads are the list of heads that it is assumed the recipient | ||||
# of this changegroup will know about. | ||||
|
r1458 | knownheads = {} | ||
|
r1466 | # We assume that all parents of bases are known heads. | ||
|
r1460 | for n in bases: | ||
|
r1458 | for p in cl.parents(n): | ||
if p != nullid: | ||||
knownheads[p] = 1 | ||||
knownheads = knownheads.keys() | ||||
|
r1460 | if knownheads: | ||
|
r1466 | # Now that we know what heads are known, we can compute which | ||
# changesets are known. The recipient must know about all | ||||
# changesets required to reach the known heads from the null | ||||
# changeset. | ||||
|
r1460 | has_cl_set, junk, junk = cl.nodesbetween(None, knownheads) | ||
|
r1466 | junk = None | ||
# Transform the list into an ersatz set. | ||||
|
r1464 | has_cl_set = dict.fromkeys(has_cl_set) | ||
|
r1460 | else: | ||
|
r1466 | # If there were no known heads, the recipient cannot be assumed to | ||
# know about any changesets. | ||||
|
r1460 | has_cl_set = {} | ||
|
r1458 | |||
|
r1466 | # Make it easy to refer to self.manifest | ||
|
r1458 | mnfst = self.manifest | ||
|
r1466 | # We don't know which manifests are missing yet | ||
|
r1458 | msng_mnfst_set = {} | ||
|
r1466 | # Nor do we know which filenodes are missing. | ||
|
r1458 | msng_filenode_set = {} | ||
|
r1460 | junk = mnfst.index[mnfst.count() - 1] # Get around a bug in lazyindex | ||
junk = None | ||||
|
r1466 | # A changeset always belongs to itself, so the changenode lookup | ||
# function for a changenode is identity. | ||||
|
r1458 | def identity(x): | ||
return x | ||||
|
r1466 | # A function generating function. Sets up an environment for the | ||
# inner function. | ||||
|
r1458 | def cmp_by_rev_func(revlog): | ||
|
r1466 | # Compare two nodes by their revision number in the environment's | ||
# revision history. Since the revision number both represents the | ||||
# most efficient order to read the nodes in, and represents a | ||||
# topological sorting of the nodes, this function is often useful. | ||||
def cmp_by_rev(a, b): | ||||
|
r1458 | return cmp(revlog.rev(a), revlog.rev(b)) | ||
|
r1466 | return cmp_by_rev | ||
|
r1458 | |||
|
r1466 | # If we determine that a particular file or manifest node must be a | ||
# node that the recipient of the changegroup will already have, we can | ||||
# also assume the recipient will have all the parents. This function | ||||
# prunes them from the set of missing nodes. | ||||
|
r1458 | def prune_parents(revlog, hasset, msngset): | ||
haslst = hasset.keys() | ||||
haslst.sort(cmp_by_rev_func(revlog)) | ||||
for node in haslst: | ||||
parentlst = [p for p in revlog.parents(node) if p != nullid] | ||||
while parentlst: | ||||
n = parentlst.pop() | ||||
if n not in hasset: | ||||
hasset[n] = 1 | ||||
p = [p for p in revlog.parents(n) if p != nullid] | ||||
parentlst.extend(p) | ||||
for n in hasset: | ||||
msngset.pop(n, None) | ||||
|
r1466 | # This is a function generating function used to set up an environment | ||
# for the inner function to execute in. | ||||
|
r1458 | def manifest_and_file_collector(changedfileset): | ||
|
r1466 | # This is an information gathering function that gathers | ||
# information from each changeset node that goes out as part of | ||||
# the changegroup. The information gathered is a list of which | ||||
# manifest nodes are potentially required (the recipient may | ||||
# already have them) and total list of all files which were | ||||
# changed in any changeset in the changegroup. | ||||
# | ||||
# We also remember the first changenode we saw any manifest | ||||
# referenced by so we can later determine which changenode 'owns' | ||||
# the manifest. | ||||
|
r1458 | def collect_manifests_and_files(clnode): | ||
c = cl.read(clnode) | ||||
for f in c[3]: | ||||
# This is to make sure we only have one instance of each | ||||
# filename string for each filename. | ||||
|
r1460 | changedfileset.setdefault(f, f) | ||
msng_mnfst_set.setdefault(c[0], clnode) | ||||
|
r1458 | return collect_manifests_and_files | ||
|
r1466 | # Figure out which manifest nodes (of the ones we think might be part | ||
# of the changegroup) the recipient must know about and remove them | ||||
# from the changegroup. | ||||
|
r1458 | def prune_manifests(): | ||
has_mnfst_set = {} | ||||
for n in msng_mnfst_set: | ||||
|
r1466 | # If a 'missing' manifest thinks it belongs to a changenode | ||
# the recipient is assumed to have, obviously the recipient | ||||
# must have that manifest. | ||||
|
r1458 | linknode = cl.node(mnfst.linkrev(n)) | ||
if linknode in has_cl_set: | ||||
has_mnfst_set[n] = 1 | ||||
prune_parents(mnfst, has_mnfst_set, msng_mnfst_set) | ||||
|
r1466 | # Use the information collected in collect_manifests_and_files to say | ||
# which changenode any manifestnode belongs to. | ||||
|
r1458 | def lookup_manifest_link(mnfstnode): | ||
return msng_mnfst_set[mnfstnode] | ||||
|
r1466 | # A function generating function that sets up the initial environment | ||
# the inner function. | ||||
|
r1458 | def filenode_collector(changedfiles): | ||
|
r1462 | next_rev = [0] | ||
|
r1466 | # This gathers information from each manifestnode included in the | ||
# changegroup about which filenodes the manifest node references | ||||
# so we can include those in the changegroup too. | ||||
# | ||||
# It also remembers which changenode each filenode belongs to. It | ||||
# does this by assuming the a filenode belongs to the changenode | ||||
# the first manifest that references it belongs to. | ||||
|
r1458 | def collect_msng_filenodes(mnfstnode): | ||
|
r1462 | r = mnfst.rev(mnfstnode) | ||
if r == next_rev[0]: | ||||
# If the last rev we looked at was the one just previous, | ||||
# we only need to see a diff. | ||||
|
r5175 | deltamf = mnfst.readdelta(mnfstnode) | ||
|
r1466 | # For each line in the delta | ||
|
r5175 | for f, fnode in deltamf.items(): | ||
|
r1462 | f = changedfiles.get(f, None) | ||
|
r1466 | # And if the file is in the list of files we care | ||
# about. | ||||
|
r1462 | if f is not None: | ||
|
r1466 | # Get the changenode this manifest belongs to | ||
clnode = msng_mnfst_set[mnfstnode] | ||||
# Create the set of filenodes for the file if | ||||
# there isn't one already. | ||||
ndset = msng_filenode_set.setdefault(f, {}) | ||||
# And set the filenode's changelog node to the | ||||
# manifest's if it hasn't been set already. | ||||
ndset.setdefault(fnode, clnode) | ||||
else: | ||||
# Otherwise we need a full manifest. | ||||
m = mnfst.read(mnfstnode) | ||||
# For every file in we care about. | ||||
for f in changedfiles: | ||||
fnode = m.get(f, None) | ||||
# If it's in the manifest | ||||
if fnode is not None: | ||||
# See comments above. | ||||
|
r1462 | clnode = msng_mnfst_set[mnfstnode] | ||
ndset = msng_filenode_set.setdefault(f, {}) | ||||
ndset.setdefault(fnode, clnode) | ||||
|
r1466 | # Remember the revision we hope to see next. | ||
|
r1462 | next_rev[0] = r + 1 | ||
|
r1460 | return collect_msng_filenodes | ||
|
r1458 | |||
|
r1466 | # We have a list of filenodes we think we need for a file, lets remove | ||
# all those we now the recipient must have. | ||||
|
r1458 | def prune_filenodes(f, filerevlog): | ||
msngset = msng_filenode_set[f] | ||||
hasset = {} | ||||
|
r1466 | # If a 'missing' filenode thinks it belongs to a changenode we | ||
# assume the recipient must have, then the recipient must have | ||||
# that filenode. | ||||
|
r1458 | for n in msngset: | ||
clnode = cl.node(filerevlog.linkrev(n)) | ||||
if clnode in has_cl_set: | ||||
hasset[n] = 1 | ||||
prune_parents(filerevlog, hasset, msngset) | ||||
|
r1466 | # A function generator function that sets up the a context for the | ||
# inner function. | ||||
|
r1458 | def lookup_filenode_link_func(fname): | ||
msngset = msng_filenode_set[fname] | ||||
|
r1466 | # Lookup the changenode the filenode belongs to. | ||
|
r1458 | def lookup_filenode_link(fnode): | ||
return msngset[fnode] | ||||
return lookup_filenode_link | ||||
|
r1089 | |||
|
r5908 | # Add the nodes that were explicitly requested. | ||
def add_extra_nodes(name, nodes): | ||||
if not extranodes or name not in extranodes: | ||||
return | ||||
for node, linknode in extranodes[name]: | ||||
if node not in nodes: | ||||
nodes[node] = linknode | ||||
|
r1466 | # Now that we have all theses utility functions to help out and | ||
# logically divide up the task, generate the group. | ||||
|
r1089 | def gengroup(): | ||
|
r1466 | # The set of changed files starts empty. | ||
|
r1458 | changedfiles = {} | ||
|
r1466 | # Create a changenode group generator that will call our functions | ||
# back to lookup the owning changenode and collect information. | ||||
|
r1458 | group = cl.group(msng_cl_lst, identity, | ||
manifest_and_file_collector(changedfiles)) | ||||
for chnk in group: | ||||
yield chnk | ||||
|
r1466 | |||
# The list of manifests has been collected by the generator | ||||
# calling our functions back. | ||||
|
r1458 | prune_manifests() | ||
|
r5908 | add_extra_nodes(1, msng_mnfst_set) | ||
|
r1458 | msng_mnfst_lst = msng_mnfst_set.keys() | ||
|
r1466 | # Sort the manifestnodes by revision number. | ||
|
r1458 | msng_mnfst_lst.sort(cmp_by_rev_func(mnfst)) | ||
|
r1466 | # Create a generator for the manifestnodes that calls our lookup | ||
# and data collection functions back. | ||||
|
r1460 | group = mnfst.group(msng_mnfst_lst, lookup_manifest_link, | ||
|
r1458 | filenode_collector(changedfiles)) | ||
for chnk in group: | ||||
yield chnk | ||||
|
r1466 | |||
# These are no longer needed, dereference and toss the memory for | ||||
# them. | ||||
|
r1458 | msng_mnfst_lst = None | ||
msng_mnfst_set.clear() | ||||
|
r1466 | |||
|
r5908 | if extranodes: | ||
for fname in extranodes: | ||||
if isinstance(fname, int): | ||||
continue | ||||
add_extra_nodes(fname, | ||||
msng_filenode_set.setdefault(fname, {})) | ||||
changedfiles[fname] = 1 | ||||
|
r1462 | changedfiles = changedfiles.keys() | ||
changedfiles.sort() | ||||
|
r1466 | # Go through all our files in order sorted by name. | ||
|
r1458 | for fname in changedfiles: | ||
filerevlog = self.file(fname) | ||||
|
r5543 | if filerevlog.count() == 0: | ||
|
r5666 | raise util.Abort(_("empty or missing revlog for %s") % fname) | ||
|
r1466 | # Toss out the filenodes that the recipient isn't really | ||
# missing. | ||||
|
r5915 | if fname in msng_filenode_set: | ||
|
r1630 | prune_filenodes(fname, filerevlog) | ||
msng_filenode_lst = msng_filenode_set[fname].keys() | ||||
else: | ||||
msng_filenode_lst = [] | ||||
|
r1466 | # If any filenodes are left, generate the group for them, | ||
# otherwise don't bother. | ||||
|
r1458 | if len(msng_filenode_lst) > 0: | ||
|
r5368 | yield changegroup.chunkheader(len(fname)) | ||
yield fname | ||||
|
r1466 | # Sort the filenodes by their revision # | ||
|
r1458 | msng_filenode_lst.sort(cmp_by_rev_func(filerevlog)) | ||
|
r1466 | # Create a group generator and only pass in a changenode | ||
# lookup function as we need to collect no information | ||||
# from filenodes. | ||||
|
r1458 | group = filerevlog.group(msng_filenode_lst, | ||
|
r1460 | lookup_filenode_link_func(fname)) | ||
|
r1458 | for chnk in group: | ||
yield chnk | ||||
|
r5915 | if fname in msng_filenode_set: | ||
|
r1630 | # Don't need this anymore, toss it to free memory. | ||
del msng_filenode_set[fname] | ||||
|
r1466 | # Signal that no more groups are left. | ||
|
r1981 | yield changegroup.closechunk() | ||
|
r1089 | |||
|
r2150 | if msng_cl_lst: | ||
|
r2149 | self.hook('outgoing', node=hex(msng_cl_lst[0]), source=source) | ||
|
r1736 | |||
|
r1458 | return util.chunkbuffer(gengroup()) | ||
|
r1736 | def changegroup(self, basenodes, source): | ||
|
r1466 | """Generate a changegroup of all nodes that we have that a recipient | ||
doesn't. | ||||
This is much easier than the previous function as we can assume that | ||||
the recipient has any changenode we aren't sending them.""" | ||||
|
r1736 | |||
self.hook('preoutgoing', throw=True, source=source) | ||||
|
r1458 | cl = self.changelog | ||
nodes = cl.nodesbetween(basenodes, None)[0] | ||||
revset = dict.fromkeys([cl.rev(n) for n in nodes]) | ||||
|
r5763 | self.changegroupinfo(nodes, source) | ||
|
r1458 | |||
def identity(x): | ||||
return x | ||||
|
r1089 | |||
|
r1458 | def gennodelst(revlog): | ||
for r in xrange(0, revlog.count()): | ||||
n = revlog.node(r) | ||||
if revlog.linkrev(n) in revset: | ||||
yield n | ||||
def changed_file_collector(changedfileset): | ||||
def collect_changed_files(clnode): | ||||
c = cl.read(clnode) | ||||
for fname in c[3]: | ||||
changedfileset[fname] = 1 | ||||
return collect_changed_files | ||||
def lookuprevlink_func(revlog): | ||||
def lookuprevlink(n): | ||||
return cl.node(revlog.linkrev(n)) | ||||
return lookuprevlink | ||||
def gengroup(): | ||||
|
r1089 | # construct a list of all changed files | ||
|
r1458 | changedfiles = {} | ||
for chnk in cl.group(nodes, identity, | ||||
changed_file_collector(changedfiles)): | ||||
yield chnk | ||||
changedfiles = changedfiles.keys() | ||||
changedfiles.sort() | ||||
|
r1089 | |||
|
r1458 | mnfst = self.manifest | ||
nodeiter = gennodelst(mnfst) | ||||
for chnk in mnfst.group(nodeiter, lookuprevlink_func(mnfst)): | ||||
yield chnk | ||||
|
r1089 | |||
|
r1458 | for fname in changedfiles: | ||
filerevlog = self.file(fname) | ||||
|
r5543 | if filerevlog.count() == 0: | ||
|
r5666 | raise util.Abort(_("empty or missing revlog for %s") % fname) | ||
|
r1458 | nodeiter = gennodelst(filerevlog) | ||
nodeiter = list(nodeiter) | ||||
if nodeiter: | ||||
|
r5368 | yield changegroup.chunkheader(len(fname)) | ||
yield fname | ||||
|
r1458 | lookup = lookuprevlink_func(filerevlog) | ||
for chnk in filerevlog.group(nodeiter, lookup): | ||||
yield chnk | ||||
|
r1089 | |||
|
r1981 | yield changegroup.closechunk() | ||
|
r2107 | |||
if nodes: | ||||
self.hook('outgoing', node=hex(nodes[0]), source=source) | ||||
|
r1089 | |||
|
r1458 | return util.chunkbuffer(gengroup()) | ||
|
r1089 | |||
|
r5907 | def addchangegroup(self, source, srctype, url, emptyok=False): | ||
|
r2019 | """add changegroup to repo. | ||
|
r1089 | |||
|
r3803 | return values: | ||
- nothing changed or no source: 0 | ||||
- more heads than before: 1+added heads (2..n) | ||||
- less heads than before: -1-removed heads (-2..-n) | ||||
- number of heads stays the same: 1 | ||||
""" | ||||
|
r1089 | def csmap(x): | ||
|
r1402 | self.ui.debug(_("add changeset %s\n") % short(x)) | ||
|
r1998 | return cl.count() | ||
|
r1089 | |||
def revmap(x): | ||||
|
r1998 | return cl.rev(x) | ||
|
r1089 | |||
|
r1615 | if not source: | ||
|
r2019 | return 0 | ||
|
r1730 | |||
|
r2673 | self.hook('prechangegroup', throw=True, source=srctype, url=url) | ||
|
r1730 | |||
|
r1089 | changesets = files = revisions = 0 | ||
|
r2395 | # write changelog data to temp files so concurrent readers will not see | ||
# inconsistent view | ||||
|
r4261 | cl = self.changelog | ||
cl.delayupdate() | ||||
oldheads = len(cl.heads()) | ||||
|
r1998 | |||
|
r4915 | tr = self.transaction() | ||
try: | ||||
|
r4970 | trp = weakref.proxy(tr) | ||
|
r4915 | # pull off the changeset group | ||
self.ui.status(_("adding changesets\n")) | ||||
cor = cl.count() - 1 | ||||
chunkiter = changegroup.chunkiter(source) | ||||
|
r5907 | if cl.addgroup(chunkiter, csmap, trp, 1) is None and not emptyok: | ||
|
r4915 | raise util.Abort(_("received changelog group is empty")) | ||
cnr = cl.count() - 1 | ||||
changesets = cnr - cor | ||||
|
r1089 | |||
|
r4915 | # pull off the manifest group | ||
self.ui.status(_("adding manifests\n")) | ||||
chunkiter = changegroup.chunkiter(source) | ||||
# no need to check for empty manifest group here: | ||||
# if the result of the merge of 1 and 2 is the same in 3 and 4, | ||||
# no new manifest will be created and the manifest group will | ||||
# be empty during the pull | ||||
|
r4970 | self.manifest.addgroup(chunkiter, revmap, trp) | ||
|
r1089 | |||
|
r4915 | # process the files | ||
self.ui.status(_("adding file changes\n")) | ||||
while 1: | ||||
f = changegroup.getchunk(source) | ||||
if not f: | ||||
break | ||||
self.ui.debug(_("adding %s revisions\n") % f) | ||||
fl = self.file(f) | ||||
o = fl.count() | ||||
chunkiter = changegroup.chunkiter(source) | ||||
|
r4970 | if fl.addgroup(chunkiter, revmap, trp) is None: | ||
|
r4915 | raise util.Abort(_("received file revlog group is empty")) | ||
revisions += fl.count() - o | ||||
files += 1 | ||||
# make changelog see real files again | ||||
|
r4970 | cl.finalize(trp) | ||
|
r1998 | |||
|
r4915 | newheads = len(self.changelog.heads()) | ||
heads = "" | ||||
if oldheads and newheads != oldheads: | ||||
heads = _(" (%+d heads)") % (newheads - oldheads) | ||||
|
r1998 | |||
|
r4915 | self.ui.status(_("added %d changesets" | ||
" with %d changes to %d files%s\n") | ||||
% (changesets, revisions, files, heads)) | ||||
|
r1089 | |||
|
r4915 | if changesets > 0: | ||
self.hook('pretxnchangegroup', throw=True, | ||||
node=hex(self.changelog.node(cor+1)), source=srctype, | ||||
url=url) | ||||
|
r1089 | |||
|
r4915 | tr.close() | ||
finally: | ||||
del tr | ||||
|
r1089 | |||
|
r1375 | if changesets > 0: | ||
|
r5988 | # forcefully update the on-disk branch cache | ||
self.ui.debug(_("updating the branch cache\n")) | ||||
self.branchtags() | ||||
|
r2229 | self.hook("changegroup", node=hex(self.changelog.node(cor+1)), | ||
|
r2673 | source=srctype, url=url) | ||
|
r1089 | |||
|
r3473 | for i in xrange(cor + 1, cnr + 1): | ||
|
r2229 | self.hook("incoming", node=hex(self.changelog.node(i)), | ||
|
r2673 | source=srctype, url=url) | ||
|
r1316 | |||
|
r3803 | # never return 0 here: | ||
if newheads < oldheads: | ||||
return newheads - oldheads - 1 | ||||
else: | ||||
return newheads - oldheads + 1 | ||||
|
r2019 | |||
|
r1089 | |||
|
r2612 | def stream_in(self, remote): | ||
|
r2621 | fp = remote.stream_out() | ||
|
r3564 | l = fp.readline() | ||
try: | ||||
resp = int(l) | ||||
except ValueError: | ||||
raise util.UnexpectedOutput( | ||||
_('Unexpected response from remote server:'), l) | ||||
|
r3687 | if resp == 1: | ||
|
r2621 | raise util.Abort(_('operation forbidden by server')) | ||
|
r3687 | elif resp == 2: | ||
raise util.Abort(_('locking the remote repository failed')) | ||||
elif resp != 0: | ||||
raise util.Abort(_('the server sent an unknown error code')) | ||||
|
r2612 | self.ui.status(_('streaming all changes\n')) | ||
|
r3564 | l = fp.readline() | ||
try: | ||||
total_files, total_bytes = map(int, l.split(' ', 1)) | ||||
|
r6407 | except (ValueError, TypeError): | ||
|
r3564 | raise util.UnexpectedOutput( | ||
_('Unexpected response from remote server:'), l) | ||||
|
r2612 | self.ui.status(_('%d files to transfer, %s of data\n') % | ||
(total_files, util.bytecount(total_bytes))) | ||||
start = time.time() | ||||
for i in xrange(total_files): | ||||
|
r3720 | # XXX doesn't support '\n' or '\r' in filenames | ||
|
r3564 | l = fp.readline() | ||
try: | ||||
name, size = l.split('\0', 1) | ||||
size = int(size) | ||||
except ValueError, TypeError: | ||||
raise util.UnexpectedOutput( | ||||
_('Unexpected response from remote server:'), l) | ||||
|
r2612 | self.ui.debug('adding %s (%s)\n' % (name, util.bytecount(size))) | ||
|
r3457 | ofp = self.sopener(name, 'w') | ||
|
r2612 | for chunk in util.filechunkiter(fp, limit=size): | ||
ofp.write(chunk) | ||||
ofp.close() | ||||
elapsed = time.time() - start | ||||
|
r4128 | if elapsed <= 0: | ||
elapsed = 0.001 | ||||
|
r2612 | self.ui.status(_('transferred %s in %.1f seconds (%s/sec)\n') % | ||
(util.bytecount(total_bytes), elapsed, | ||||
util.bytecount(total_bytes / elapsed))) | ||||
|
r4613 | self.invalidate() | ||
|
r2612 | return len(self.heads()) + 1 | ||
|
r1089 | |||
|
r2613 | def clone(self, remote, heads=[], stream=False): | ||
|
r2612 | '''clone remote repository. | ||
|
r1382 | |||
|
r2612 | keyword arguments: | ||
heads: list of revs to clone (forces use of pull) | ||||
|
r2621 | stream: use streaming clone if possible''' | ||
|
r1089 | |||
|
r2621 | # now, all clients that can request uncompressed clones can | ||
# read repo formats supported by all servers that can serve | ||||
# them. | ||||
|
r1089 | |||
|
r2612 | # if revlog format changes, client will have to check version | ||
|
r2621 | # and format flags on "stream" capability, and use | ||
# uncompressed only if compatible. | ||||
|
r1089 | |||
|
r2613 | if stream and not heads and remote.capable('stream'): | ||
|
r2612 | return self.stream_in(remote) | ||
return self.pull(remote, heads) | ||||
|
r1806 | |||
# used to avoid circular references so destructors work | ||||
|
r3790 | def aftertrans(files): | ||
renamefiles = [tuple(t) for t in files] | ||||
|
r1806 | def a(): | ||
|
r3790 | for src, dest in renamefiles: | ||
util.rename(src, dest) | ||||
|
r1806 | return a | ||
|
r2740 | def instance(ui, path, create): | ||
return localrepository(ui, util.drop_scheme('file', path), create) | ||||
|
r3223 | |||
|
r2740 | def islocal(path): | ||
return True | ||||