mirror of
https://github.com/facebook/sapling.git
synced 2024-10-10 08:47:12 +03:00
847ef8adf9
Summary: We don't really support files larger than 2G with files larger than 4G remotefilelog crashes badly. Reviewed By: markbt Differential Revision: D7066855 fbshipit-source-id: 40cdebbe703a7b3f13ce84174bf6f96565e8c3b7
431 lines
15 KiB
Python
431 lines
15 KiB
Python
# remotefilelog.py - filelog implementation where filelog history is stored
|
|
# remotely
|
|
#
|
|
# Copyright 2013 Facebook, Inc.
|
|
#
|
|
# This software may be used and distributed according to the terms of the
|
|
# GNU General Public License version 2 or any later version.
|
|
from __future__ import absolute_import
|
|
|
|
from . import (
|
|
constants,
|
|
fileserverclient,
|
|
shallowutil,
|
|
)
|
|
import collections, os
|
|
from mercurial.node import bin, nullid
|
|
from mercurial import filelog, revlog, mdiff, ancestor, error, util
|
|
from mercurial.i18n import _
|
|
|
|
# corresponds to uncompressed length of revlog's indexformatng (2 gigs, 4-byte
|
|
# signed integer)
|
|
_maxentrysize = 0x7fffffff
|
|
|
|
class remotefilelognodemap(object):
|
|
def __init__(self, filename, store):
|
|
self._filename = filename
|
|
self._store = store
|
|
|
|
def __contains__(self, node):
|
|
missing = self._store.getmissing([(self._filename, node)])
|
|
return not bool(missing)
|
|
|
|
def __get__(self, node):
|
|
if node not in self:
|
|
raise KeyError(node)
|
|
return node
|
|
|
|
class remotefilelog(object):
|
|
def __init__(self, opener, path, repo):
|
|
self.opener = opener
|
|
self.filename = path
|
|
self.repo = repo
|
|
self.nodemap = remotefilelognodemap(self.filename, repo.contentstore)
|
|
|
|
self.version = 1
|
|
|
|
def read(self, node):
|
|
"""returns the file contents at this node"""
|
|
t = self.revision(node)
|
|
if not t.startswith('\1\n'):
|
|
return t
|
|
s = t.index('\1\n', 2)
|
|
return t[s + 2:]
|
|
|
|
def add(self, text, meta, transaction, linknode, p1=None, p2=None):
|
|
hashtext = text
|
|
|
|
# hash with the metadata, like in vanilla filelogs
|
|
hashtext = shallowutil.createrevlogtext(text, meta.get('copy'),
|
|
meta.get('copyrev'))
|
|
node = revlog.hash(hashtext, p1, p2)
|
|
return self.addrevision(hashtext, transaction, linknode, p1, p2,
|
|
node=node)
|
|
|
|
def _createfileblob(self, text, meta, flags, p1, p2, node, linknode):
|
|
# text passed to "_createfileblob" does not include filelog metadata
|
|
header = shallowutil.buildfileblobheader(len(text), flags)
|
|
data = "%s\0%s" % (header, text)
|
|
|
|
realp1 = p1
|
|
copyfrom = ""
|
|
if meta and 'copy' in meta:
|
|
copyfrom = meta['copy']
|
|
realp1 = bin(meta['copyrev'])
|
|
|
|
data += "%s%s%s%s%s\0" % (node, realp1, p2, linknode, copyfrom)
|
|
|
|
visited = set()
|
|
|
|
pancestors = {}
|
|
queue = []
|
|
if realp1 != nullid:
|
|
p1flog = self
|
|
if copyfrom:
|
|
p1flog = remotefilelog(self.opener, copyfrom, self.repo)
|
|
|
|
pancestors.update(p1flog.ancestormap(realp1))
|
|
queue.append(realp1)
|
|
visited.add(realp1)
|
|
if p2 != nullid:
|
|
pancestors.update(self.ancestormap(p2))
|
|
queue.append(p2)
|
|
visited.add(p2)
|
|
|
|
ancestortext = ""
|
|
|
|
# add the ancestors in topological order
|
|
while queue:
|
|
c = queue.pop(0)
|
|
pa1, pa2, ancestorlinknode, pacopyfrom = pancestors[c]
|
|
|
|
pacopyfrom = pacopyfrom or ''
|
|
ancestortext += "%s%s%s%s%s\0" % (
|
|
c, pa1, pa2, ancestorlinknode, pacopyfrom)
|
|
|
|
if pa1 != nullid and pa1 not in visited:
|
|
queue.append(pa1)
|
|
visited.add(pa1)
|
|
if pa2 != nullid and pa2 not in visited:
|
|
queue.append(pa2)
|
|
visited.add(pa2)
|
|
|
|
data += ancestortext
|
|
|
|
return data
|
|
|
|
def addrevision(self, text, transaction, linknode, p1, p2, cachedelta=None,
|
|
node=None, flags=revlog.REVIDX_DEFAULT_FLAGS):
|
|
# text passed to "addrevision" includes hg filelog metadata header
|
|
if node is None:
|
|
node = revlog.hash(text, p1, p2)
|
|
|
|
meta, metaoffset = filelog.parsemeta(text)
|
|
rawtext, validatehash = self._processflags(text, flags, 'write')
|
|
|
|
if len(rawtext) > _maxentrysize:
|
|
raise revlog.RevlogError(
|
|
_("%s: size of %s exceeds maximum size of %s")
|
|
% (self.filename, util.bytecount(len(rawtext)),
|
|
util.bytecount(_maxentrysize)))
|
|
|
|
return self.addrawrevision(rawtext, transaction, linknode, p1, p2,
|
|
node, flags, cachedelta,
|
|
_metatuple=(meta, metaoffset))
|
|
|
|
def addrawrevision(self, rawtext, transaction, linknode, p1, p2, node,
|
|
flags, cachedelta=None, _metatuple=None):
|
|
if _metatuple:
|
|
# _metatuple: used by "addrevision" internally by remotefilelog
|
|
# meta was parsed confidently
|
|
meta, metaoffset = _metatuple
|
|
if flags == revlog.REVIDX_DEFAULT_FLAGS:
|
|
# For non-LFS text, remove hg filelog metadata
|
|
blobtext = rawtext[metaoffset:]
|
|
else:
|
|
# For LFS text, which does not contain the filelog metadata,
|
|
# do not mangle it.
|
|
blobtext = rawtext
|
|
else:
|
|
# Not from self.addrevision, but something else (repo._filecommit)
|
|
# calls addrawrevision directly. remotefilelog needs to get and
|
|
# strip filelog metadata.
|
|
meta, blobtext = shallowutil.parsemeta(rawtext, flags)
|
|
data = self._createfileblob(blobtext, meta, flags, p1, p2, node,
|
|
linknode)
|
|
self.repo.contentstore.addremotefilelognode(self.filename, node, data)
|
|
|
|
return node
|
|
|
|
def renamed(self, node):
|
|
ancestors = self.repo.metadatastore.getancestors(self.filename, node)
|
|
p1, p2, linknode, copyfrom = ancestors[node]
|
|
if copyfrom:
|
|
return (copyfrom, p1)
|
|
|
|
return False
|
|
|
|
def size(self, node):
|
|
"""return the size of a given revision"""
|
|
return len(self.read(node))
|
|
|
|
rawsize = size
|
|
|
|
def candelta(self, basenode, node):
|
|
# Do not use delta if either node is LFS. Avoids issues if clients have
|
|
# the delta base stored in different forms: one LFS, one non-LFS.
|
|
if self.flags(basenode) or self.flags(node):
|
|
return False
|
|
# Do not use delta if "node" is a copy. This avoids cycles (in a graph
|
|
# where edges are node -> deltabase, and node -> copyfrom). The cycle
|
|
# could make remotefilelog cgunpacker enter an infinite loop.
|
|
if self.renamed(node):
|
|
return False
|
|
return True
|
|
|
|
def cmp(self, node, text):
|
|
"""compare text with a given file revision
|
|
|
|
returns True if text is different than what is stored.
|
|
"""
|
|
|
|
if node == nullid:
|
|
return True
|
|
|
|
nodetext = self.read(node)
|
|
return nodetext != text
|
|
|
|
def __nonzero__(self):
|
|
return True
|
|
|
|
def __len__(self):
|
|
if self.filename == '.hgtags':
|
|
# The length of .hgtags is used to fast path tag checking.
|
|
# remotefilelog doesn't support .hgtags since the entire .hgtags
|
|
# history is needed. Use the excludepattern setting to make
|
|
# .hgtags a normal filelog.
|
|
return 0
|
|
|
|
raise RuntimeError("len not supported")
|
|
|
|
def empty(self):
|
|
return False
|
|
|
|
def flags(self, node):
|
|
if isinstance(node, int):
|
|
raise error.ProgrammingError(
|
|
'remotefilelog does not accept integer rev for flags')
|
|
if node == nullid:
|
|
return revlog.REVIDX_DEFAULT_FLAGS
|
|
store = self.repo.contentstore
|
|
return store.getmeta(self.filename, node).get(constants.METAKEYFLAG, 0)
|
|
|
|
def parents(self, node):
|
|
if node == nullid:
|
|
return nullid, nullid
|
|
|
|
ancestormap = self.repo.metadatastore.getancestors(self.filename, node)
|
|
p1, p2, linknode, copyfrom = ancestormap[node]
|
|
if copyfrom:
|
|
p1 = nullid
|
|
|
|
return p1, p2
|
|
|
|
def linknode(self, node):
|
|
ancestormap = self.repo.metadatastore.getancestors(self.filename, node)
|
|
p1, p2, linknode, copyfrom = ancestormap[node]
|
|
return linknode
|
|
|
|
def revdiff(self, node1, node2):
|
|
if node1 != nullid and (self.flags(node1) or self.flags(node2)):
|
|
raise error.ProgrammingError(
|
|
'cannot revdiff revisions with non-zero flags')
|
|
return mdiff.textdiff(self.revision(node1, raw=True),
|
|
self.revision(node2, raw=True))
|
|
|
|
def lookup(self, node):
|
|
if len(node) == 40:
|
|
node = bin(node)
|
|
if len(node) != 20:
|
|
raise error.LookupError(node, self.filename,
|
|
_('invalid lookup input'))
|
|
|
|
return node
|
|
|
|
def rev(self, node):
|
|
# This is a hack to make TortoiseHG work.
|
|
return node
|
|
|
|
def node(self, rev):
|
|
# This is a hack.
|
|
if isinstance(rev, int):
|
|
raise error.ProgrammingError(
|
|
'remotefilelog does not convert integer rev to node')
|
|
return rev
|
|
|
|
def revision(self, node, raw=False):
|
|
"""returns the revlog contents at this node.
|
|
this includes the meta data traditionally included in file revlogs.
|
|
this is generally only used for bundling and communicating with vanilla
|
|
hg clients.
|
|
"""
|
|
if node == nullid:
|
|
return ""
|
|
if len(node) != 20:
|
|
raise error.LookupError(node, self.filename,
|
|
_('invalid revision input'))
|
|
|
|
store = self.repo.contentstore
|
|
rawtext = store.get(self.filename, node)
|
|
if raw:
|
|
return rawtext
|
|
flags = store.getmeta(self.filename, node).get(constants.METAKEYFLAG, 0)
|
|
if flags == 0:
|
|
return rawtext
|
|
text, verifyhash = self._processflags(rawtext, flags, 'read')
|
|
return text
|
|
|
|
def _deltachain(self, node):
|
|
"""Obtain the delta chain for a revision.
|
|
|
|
Return (chain, False), chain is a list of nodes. This is to be
|
|
compatible with revlog API.
|
|
"""
|
|
store = self.repo.contentstore
|
|
chain = store.getdeltachain(self.filename, node)
|
|
return ([x[1] for x in chain], False)
|
|
|
|
def _processflags(self, text, flags, operation, raw=False):
|
|
# mostly copied from hg/mercurial/revlog.py
|
|
validatehash = True
|
|
orderedflags = revlog.REVIDX_FLAGS_ORDER
|
|
if operation == 'write':
|
|
orderedflags = reversed(orderedflags)
|
|
for flag in orderedflags:
|
|
if flag & flags:
|
|
vhash = True
|
|
if flag not in revlog._flagprocessors:
|
|
message = _("missing processor for flag '%#x'") % (flag)
|
|
raise revlog.RevlogError(message)
|
|
readfunc, writefunc, rawfunc = revlog._flagprocessors[flag]
|
|
if raw:
|
|
vhash = rawfunc(self, text)
|
|
elif operation == 'read':
|
|
text, vhash = readfunc(self, text)
|
|
elif operation == 'write':
|
|
text, vhash = writefunc(self, text)
|
|
validatehash = validatehash and vhash
|
|
return text, validatehash
|
|
|
|
def _read(self, id):
|
|
"""reads the raw file blob from disk, cache, or server"""
|
|
fileservice = self.repo.fileservice
|
|
localcache = fileservice.localcache
|
|
cachekey = fileserverclient.getcachekey(self.repo.name, self.filename,
|
|
id)
|
|
try:
|
|
return localcache.read(cachekey)
|
|
except KeyError:
|
|
pass
|
|
|
|
localkey = fileserverclient.getlocalkey(self.filename, id)
|
|
localpath = os.path.join(self.localpath, localkey)
|
|
try:
|
|
return shallowutil.readfile(localpath)
|
|
except IOError:
|
|
pass
|
|
|
|
fileservice.prefetch([(self.filename, id)])
|
|
try:
|
|
return localcache.read(cachekey)
|
|
except KeyError:
|
|
pass
|
|
|
|
raise error.LookupError(id, self.filename, _('no node'))
|
|
|
|
def ancestormap(self, node):
|
|
return self.repo.metadatastore.getancestors(self.filename, node)
|
|
|
|
def ancestor(self, a, b):
|
|
if a == nullid or b == nullid:
|
|
return nullid
|
|
|
|
revmap, parentfunc = self._buildrevgraph(a, b)
|
|
nodemap = dict(((v, k) for (k, v) in revmap.iteritems()))
|
|
|
|
ancs = ancestor.ancestors(parentfunc, revmap[a], revmap[b])
|
|
if ancs:
|
|
# choose a consistent winner when there's a tie
|
|
return min(map(nodemap.__getitem__, ancs))
|
|
return nullid
|
|
|
|
def commonancestorsheads(self, a, b):
|
|
"""calculate all the heads of the common ancestors of nodes a and b"""
|
|
|
|
if a == nullid or b == nullid:
|
|
return nullid
|
|
|
|
revmap, parentfunc = self._buildrevgraph(a, b)
|
|
nodemap = dict(((v, k) for (k, v) in revmap.iteritems()))
|
|
|
|
ancs = ancestor.commonancestorsheads(parentfunc, revmap[a], revmap[b])
|
|
return map(nodemap.__getitem__, ancs)
|
|
|
|
def _buildrevgraph(self, a, b):
|
|
"""Builds a numeric revision graph for the given two nodes.
|
|
Returns a node->rev map and a rev->[revs] parent function.
|
|
"""
|
|
amap = self.ancestormap(a)
|
|
bmap = self.ancestormap(b)
|
|
|
|
# Union the two maps
|
|
parentsmap = collections.defaultdict(list)
|
|
allparents = set()
|
|
for mapping in (amap, bmap):
|
|
for node, pdata in mapping.iteritems():
|
|
parents = parentsmap[node]
|
|
p1, p2, linknode, copyfrom = pdata
|
|
# Don't follow renames (copyfrom).
|
|
# remotefilectx.ancestor does that.
|
|
if p1 != nullid and not copyfrom:
|
|
parents.append(p1)
|
|
allparents.add(p1)
|
|
if p2 != nullid:
|
|
parents.append(p2)
|
|
allparents.add(p2)
|
|
|
|
# Breadth first traversal to build linkrev graph
|
|
parentrevs = collections.defaultdict(list)
|
|
revmap = {}
|
|
queue = collections.deque(((None, n) for n in parentsmap.iterkeys()
|
|
if n not in allparents))
|
|
while queue:
|
|
prevrev, current = queue.pop()
|
|
if current in revmap:
|
|
if prevrev:
|
|
parentrevs[prevrev].append(revmap[current])
|
|
continue
|
|
|
|
# Assign linkrevs in reverse order, so start at
|
|
# len(parentsmap) and work backwards.
|
|
currentrev = len(parentsmap) - len(revmap) - 1
|
|
revmap[current] = currentrev
|
|
|
|
if prevrev:
|
|
parentrevs[prevrev].append(currentrev)
|
|
|
|
for parent in parentsmap.get(current):
|
|
queue.appendleft((currentrev, parent))
|
|
|
|
return revmap, parentrevs.__getitem__
|
|
|
|
def strip(self, minlink, transaction):
|
|
pass
|
|
|
|
# misc unused things
|
|
def files(self):
|
|
return []
|
|
|
|
def checksize(self):
|
|
return 0, 0
|