revlog.py
1781 lines
| 62.1 KiB
| text/x-python
|
PythonLexer
/ mercurial / revlog.py
|
r8226 | # revlog.py - storage back-end for mercurial | ||
# | ||||
# Copyright 2005-2007 Matt Mackall <mpm@selenic.com> | ||||
# | ||||
# This software may be used and distributed according to the terms of the | ||||
|
r10263 | # GNU General Public License version 2 or any later version. | ||
|
r0 | |||
|
r8227 | """Storage back-end for Mercurial. | ||
This provides efficient delta storage with O(1) retrieve and append | ||||
and O(changes) merge between branches. | ||||
""" | ||||
|
r27361 | from __future__ import absolute_import | ||
|
r25113 | import collections | ||
|
r27361 | import errno | ||
|
r29339 | import hashlib | ||
|
r27430 | import os | ||
|
r27361 | import struct | ||
import zlib | ||||
# import stuff from node for others to import from revlog | ||||
from .node import ( | ||||
bin, | ||||
hex, | ||||
nullid, | ||||
nullrev, | ||||
) | ||||
from .i18n import _ | ||||
from . import ( | ||||
ancestor, | ||||
error, | ||||
mdiff, | ||||
parsers, | ||||
templatefilters, | ||||
util, | ||||
) | ||||
|
r36 | |||
|
r5007 | _pack = struct.pack | ||
_unpack = struct.unpack | ||||
_compress = zlib.compress | ||||
_decompress = zlib.decompress | ||||
|
r11746 | # revlog header flags | ||
|
r2072 | REVLOGV0 = 0 | ||
REVLOGNG = 1 | ||||
|
r2073 | REVLOGNGINLINEDATA = (1 << 16) | ||
|
r14253 | REVLOGGENERALDELTA = (1 << 17) | ||
|
r2222 | REVLOG_DEFAULT_FLAGS = REVLOGNGINLINEDATA | ||
REVLOG_DEFAULT_FORMAT = REVLOGNG | ||||
REVLOG_DEFAULT_VERSION = REVLOG_DEFAULT_FORMAT | REVLOG_DEFAULT_FLAGS | ||||
|
r14253 | REVLOGNG_FLAGS = REVLOGNGINLINEDATA | REVLOGGENERALDELTA | ||
|
r11746 | |||
# revlog index flags | ||||
|
r23855 | REVIDX_ISCENSORED = (1 << 15) # revision has censor metadata, must be verified | ||
REVIDX_DEFAULT_FLAGS = 0 | ||||
REVIDX_KNOWN_FLAGS = REVIDX_ISCENSORED | ||||
|
r2073 | |||
|
r10916 | # max size of revlog with inline data | ||
_maxinline = 131072 | ||||
|
r13253 | _chunksize = 1048576 | ||
|
r10913 | |||
|
r7633 | RevlogError = error.RevlogError | ||
LookupError = error.LookupError | ||||
|
r22934 | CensoredNodeError = error.CensoredNodeError | ||
|
r6703 | |||
|
r4987 | def getoffset(q): | ||
return int(q >> 16) | ||||
def gettype(q): | ||||
return int(q & 0xFFFF) | ||||
def offset_type(offset, type): | ||||
return long(long(offset) << 16 | type) | ||||
|
r29339 | _nullhash = hashlib.sha1(nullid) | ||
|
r7883 | |||
|
r1091 | def hash(text, p1, p2): | ||
"""generate a hash from the given text and its parent hashes | ||||
This hash combines both the current file contents and its history | ||||
in a manner that makes it easy to distinguish nodes with the same | ||||
content in the revision graph. | ||||
""" | ||||
|
r7883 | # As of now, if one of the parent node is null, p2 is null | ||
if p2 == nullid: | ||||
# deep copy of a hash is faster than creating one | ||||
|
r22784 | s = _nullhash.copy() | ||
|
r7883 | s.update(p1) | ||
else: | ||||
# none of the parent nodes are nullid | ||||
l = [p1, p2] | ||||
l.sort() | ||||
|
r29339 | s = hashlib.sha1(l[0]) | ||
|
r7883 | s.update(l[1]) | ||
|
r1091 | s.update(text) | ||
return s.digest() | ||||
|
r0 | def decompress(bin): | ||
|
r1083 | """ decompress the given input """ | ||
|
r4980 | if not bin: | ||
return bin | ||||
|
r112 | t = bin[0] | ||
|
r4980 | if t == '\0': | ||
return bin | ||||
if t == 'x': | ||||
|
r16883 | try: | ||
return _decompress(bin) | ||||
|
r25660 | except zlib.error as e: | ||
|
r16883 | raise RevlogError(_("revlog decompress error: %s") % str(e)) | ||
|
r4980 | if t == 'u': | ||
|
r27475 | return util.buffer(bin, 1) | ||
|
r1853 | raise RevlogError(_("unknown compression type %r") % t) | ||
|
r0 | |||
|
r18585 | # index v0: | ||
# 4 bytes: offset | ||||
# 4 bytes: compressed length | ||||
# 4 bytes: base rev | ||||
# 4 bytes: link rev | ||||
|
r25891 | # 20 bytes: parent 1 nodeid | ||
# 20 bytes: parent 2 nodeid | ||||
# 20 bytes: nodeid | ||||
|
r4987 | indexformatv0 = ">4l20s20s20s" | ||
|
r4918 | |||
|
r4972 | class revlogoldio(object): | ||
def __init__(self): | ||||
|
r4977 | self.size = struct.calcsize(indexformatv0) | ||
|
r4972 | |||
|
r13264 | def parseindex(self, data, inline): | ||
|
r4977 | s = self.size | ||
|
r4972 | index = [] | ||
|
r27637 | nodemap = {nullid: nullrev} | ||
|
r4973 | n = off = 0 | ||
l = len(data) | ||||
while off + s <= l: | ||||
cur = data[off:off + s] | ||||
off += s | ||||
|
r5007 | e = _unpack(indexformatv0, cur) | ||
|
r4977 | # transform to revlogv1 format | ||
e2 = (offset_type(e[0], 0), e[1], -1, e[2], e[3], | ||||
|
r5544 | nodemap.get(e[4], nullrev), nodemap.get(e[5], nullrev), e[6]) | ||
|
r4977 | index.append(e2) | ||
nodemap[e[6]] = n | ||||
|
r4973 | n += 1 | ||
|
r4972 | |||
|
r13265 | # add the magic null revision at -1 | ||
index.append((0, 0, 0, -1, -1, -1, -1, nullid)) | ||||
|
r4983 | return index, nodemap, None | ||
|
r4972 | |||
|
r5338 | def packentry(self, entry, node, version, rev): | ||
|
r10395 | if gettype(entry[0]): | ||
raise RevlogError(_("index entry flags need RevlogNG")) | ||||
|
r4986 | e2 = (getoffset(entry[0]), entry[1], entry[3], entry[4], | ||
node(entry[5]), node(entry[6]), entry[7]) | ||||
|
r5007 | return _pack(indexformatv0, *e2) | ||
|
r4986 | |||
|
r4987 | # index ng: | ||
|
r11323 | # 6 bytes: offset | ||
# 2 bytes: flags | ||||
# 4 bytes: compressed length | ||||
# 4 bytes: uncompressed length | ||||
# 4 bytes: base rev | ||||
# 4 bytes: link rev | ||||
# 4 bytes: parent 1 rev | ||||
# 4 bytes: parent 2 rev | ||||
|
r4987 | # 32 bytes: nodeid | ||
indexformatng = ">Qiiiiii20s12x" | ||||
versionformat = ">I" | ||||
|
r25410 | # corresponds to uncompressed length of indexformatng (2 gigs, 4-byte | ||
# signed integer) | ||||
_maxentrysize = 0x7fffffff | ||||
|
r4972 | class revlogio(object): | ||
def __init__(self): | ||||
|
r4977 | self.size = struct.calcsize(indexformatng) | ||
|
r4972 | |||
|
r13264 | def parseindex(self, data, inline): | ||
|
r7109 | # call the C implementation to parse the index data | ||
|
r13254 | index, cache = parsers.parse_index2(data, inline) | ||
|
r16414 | return index, getattr(index, 'nodemap', None), cache | ||
|
r4972 | |||
|
r5338 | def packentry(self, entry, node, version, rev): | ||
|
r5007 | p = _pack(indexformatng, *entry) | ||
|
r5338 | if rev == 0: | ||
|
r5007 | p = _pack(versionformat, version) + p[4:] | ||
|
r4986 | return p | ||
|
r1559 | class revlog(object): | ||
|
r1083 | """ | ||
the underlying revision storage object | ||||
A revlog consists of two parts, an index and the revision data. | ||||
The index is a file with a fixed record size containing | ||||
|
r6912 | information on each revision, including its nodeid (hash), the | ||
|
r1083 | nodeids of its parents, the position and offset of its data within | ||
the data file, and the revision it's based on. Finally, each entry | ||||
contains a linkrev entry that can serve as a pointer to external | ||||
data. | ||||
The revision data itself is a linear collection of data chunks. | ||||
Each chunk represents a revision and is usually represented as a | ||||
delta against the previous chunk. To bound lookup time, runs of | ||||
deltas are limited to about 2 times the length of the original | ||||
version data. This makes retrieval of a version proportional to | ||||
its size, or O(1) relative to the number of revisions. | ||||
Both pieces of the revlog are written to in an append-only | ||||
fashion, which means we never need to rewrite a file to insert or | ||||
remove data, and can use some simple techniques to avoid the need | ||||
for locking while reading. | ||||
""" | ||||
|
r14251 | def __init__(self, opener, indexfile): | ||
|
r1083 | """ | ||
create a revlog object | ||||
opener is a function that abstracts the file opening operation | ||||
and can be used to implement COW semantics or the like. | ||||
""" | ||||
|
r0 | self.indexfile = indexfile | ||
|
r4257 | self.datafile = indexfile[:-2] + ".d" | ||
|
r0 | self.opener = opener | ||
|
r27070 | # 3-tuple of (node, rev, text) for a raw revision. | ||
|
r4984 | self._cache = None | ||
|
r29830 | # Maps rev to chain base rev. | ||
self._chainbasecache = util.lrucachedict(100) | ||||
|
r27070 | # 2-tuple of (offset, data) of raw data from the revlog at an offset. | ||
|
r8316 | self._chunkcache = (0, '') | ||
|
r27070 | # How much data to read and cache into the raw revlog data cache. | ||
|
r20180 | self._chunkcachesize = 65536 | ||
|
r23255 | self._maxchainlen = None | ||
|
r26118 | self._aggressivemergedeltas = False | ||
|
r4985 | self.index = [] | ||
|
r27070 | # Mapping of partial identifiers to full nodes. | ||
|
r13258 | self._pcache = {} | ||
|
r27070 | # Mapping of revision integer to full node. | ||
|
r13275 | self._nodecache = {nullid: nullrev} | ||
self._nodepos = None | ||||
|
r4985 | |||
v = REVLOG_DEFAULT_VERSION | ||||
|
r14960 | opts = getattr(opener, 'options', None) | ||
if opts is not None: | ||||
if 'revlogv1' in opts: | ||||
if 'generaldelta' in opts: | ||||
|
r14333 | v |= REVLOGGENERALDELTA | ||
else: | ||||
v = 0 | ||||
|
r20180 | if 'chunkcachesize' in opts: | ||
self._chunkcachesize = opts['chunkcachesize'] | ||||
|
r23255 | if 'maxchainlen' in opts: | ||
self._maxchainlen = opts['maxchainlen'] | ||||
|
r26118 | if 'aggressivemergedeltas' in opts: | ||
self._aggressivemergedeltas = opts['aggressivemergedeltas'] | ||||
|
r26907 | self._lazydeltabase = bool(opts.get('lazydeltabase', False)) | ||
|
r20180 | |||
if self._chunkcachesize <= 0: | ||||
raise RevlogError(_('revlog chunk cache size %r is not greater ' | ||||
'than 0') % self._chunkcachesize) | ||||
elif self._chunkcachesize & (self._chunkcachesize - 1): | ||||
raise RevlogError(_('revlog chunk cache size %r is not a power ' | ||||
'of 2') % self._chunkcachesize) | ||||
|
r11928 | |||
|
r26241 | indexdata = '' | ||
|
r14334 | self._initempty = True | ||
|
r0 | try: | ||
|
r1784 | f = self.opener(self.indexfile) | ||
|
r26241 | indexdata = f.read() | ||
|
r13400 | f.close() | ||
|
r26241 | if len(indexdata) > 0: | ||
v = struct.unpack(versionformat, indexdata[:4])[0] | ||||
|
r14334 | self._initempty = False | ||
|
r25660 | except IOError as inst: | ||
|
r1322 | if inst.errno != errno.ENOENT: | ||
raise | ||||
|
r4985 | |||
self.version = v | ||||
self._inline = v & REVLOGNGINLINEDATA | ||||
|
r14253 | self._generaldelta = v & REVLOGGENERALDELTA | ||
|
r2073 | flags = v & ~0xFFFF | ||
fmt = v & 0xFFFF | ||||
|
r4985 | if fmt == REVLOGV0 and flags: | ||
raise RevlogError(_("index %s unknown flags %#04x for format v0") | ||||
% (self.indexfile, flags >> 16)) | ||||
|
r11746 | elif fmt == REVLOGNG and flags & ~REVLOGNG_FLAGS: | ||
|
r4985 | raise RevlogError(_("index %s unknown flags %#04x for revlogng") | ||
% (self.indexfile, flags >> 16)) | ||||
elif fmt > REVLOGNG: | ||||
|
r3743 | raise RevlogError(_("index %s unknown format %d") | ||
|
r3680 | % (self.indexfile, fmt)) | ||
|
r4985 | |||
|
r4972 | self._io = revlogio() | ||
|
r4971 | if self.version == REVLOGV0: | ||
|
r4972 | self._io = revlogoldio() | ||
|
r13265 | try: | ||
|
r26241 | d = self._io.parseindex(indexdata, self._inline) | ||
|
r13265 | except (ValueError, IndexError): | ||
raise RevlogError(_("index %s is corrupted") % (self.indexfile)) | ||||
|
r13268 | self.index, nodemap, self._chunkcache = d | ||
if nodemap is not None: | ||||
|
r13275 | self.nodemap = self._nodecache = nodemap | ||
|
r13265 | if not self._chunkcache: | ||
self._chunkclear() | ||||
|
r23306 | # revnum -> (chain-length, sum-delta-length) | ||
self._chaininfocache = {} | ||||
|
r116 | |||
|
r4980 | def tip(self): | ||
return self.node(len(self.index) - 2) | ||||
|
r24030 | def __contains__(self, rev): | ||
return 0 <= rev < len(self) | ||||
|
r6750 | def __len__(self): | ||
|
r4980 | return len(self.index) - 1 | ||
|
r6750 | def __iter__(self): | ||
|
r17951 | return iter(xrange(len(self))) | ||
|
r17672 | def revs(self, start=0, stop=None): | ||
"""iterate over all rev in this revlog (from start to stop)""" | ||||
|
r17975 | step = 1 | ||
if stop is not None: | ||||
if start > stop: | ||||
step = -1 | ||||
stop += step | ||||
|
r17672 | else: | ||
|
r17975 | stop = len(self) | ||
return xrange(start, stop, step) | ||||
|
r13275 | |||
@util.propertycache | ||||
def nodemap(self): | ||||
|
r14064 | self.rev(self.node(0)) | ||
|
r13275 | return self._nodecache | ||
|
r13259 | |||
|
r16374 | def hasnode(self, node): | ||
try: | ||||
self.rev(node) | ||||
return True | ||||
except KeyError: | ||||
return False | ||||
|
r16414 | def clearcaches(self): | ||
|
r27465 | self._cache = None | ||
|
r29830 | self._chainbasecache.clear() | ||
|
r27465 | self._chunkcache = (0, '') | ||
self._pcache = {} | ||||
|
r16414 | try: | ||
self._nodecache.clearcaches() | ||||
except AttributeError: | ||||
self._nodecache = {nullid: nullrev} | ||||
self._nodepos = None | ||||
|
r13259 | def rev(self, node): | ||
|
r13275 | try: | ||
return self._nodecache[node] | ||||
|
r22282 | except TypeError: | ||
raise | ||||
|
r16414 | except RevlogError: | ||
# parsers.c radix tree lookup failed | ||||
raise LookupError(node, self.indexfile, _('no node')) | ||||
|
r13275 | except KeyError: | ||
|
r16414 | # pure python cache lookup failed | ||
|
r13275 | n = self._nodecache | ||
i = self.index | ||||
p = self._nodepos | ||||
if p is None: | ||||
p = len(i) - 2 | ||||
for r in xrange(p, -1, -1): | ||||
v = i[r][7] | ||||
n[v] = r | ||||
if v == node: | ||||
self._nodepos = r - 1 | ||||
return r | ||||
raise LookupError(node, self.indexfile, _('no node')) | ||||
|
r4980 | def node(self, rev): | ||
return self.index[rev][7] | ||||
|
r7361 | def linkrev(self, rev): | ||
return self.index[rev][4] | ||||
|
r2 | def parents(self, node): | ||
|
r7363 | i = self.index | ||
d = i[self.rev(node)] | ||||
return i[d[5]][7], i[d[6]][7] # map revisions to nodes inline | ||||
|
r2489 | def parentrevs(self, rev): | ||
|
r4979 | return self.index[rev][5:7] | ||
|
r2072 | def start(self, rev): | ||
|
r5006 | return int(self.index[rev][0] >> 16) | ||
|
r4980 | def end(self, rev): | ||
return self.start(rev) + self.length(rev) | ||||
def length(self, rev): | ||||
return self.index[rev][1] | ||||
|
r14252 | def chainbase(self, rev): | ||
|
r29830 | base = self._chainbasecache.get(rev) | ||
if base is not None: | ||||
return base | ||||
|
r14252 | index = self.index | ||
base = index[rev][3] | ||||
while base != rev: | ||||
rev = base | ||||
base = index[rev][3] | ||||
|
r29830 | |||
self._chainbasecache[rev] = base | ||||
|
r14252 | return base | ||
|
r23254 | def chainlen(self, rev): | ||
|
r23286 | return self._chaininfo(rev)[0] | ||
|
r23306 | |||
|
r23286 | def _chaininfo(self, rev): | ||
|
r23306 | chaininfocache = self._chaininfocache | ||
if rev in chaininfocache: | ||||
return chaininfocache[rev] | ||||
|
r23254 | index = self.index | ||
generaldelta = self._generaldelta | ||||
iterrev = rev | ||||
e = index[iterrev] | ||||
clen = 0 | ||||
|
r23286 | compresseddeltalen = 0 | ||
|
r23254 | while iterrev != e[3]: | ||
clen += 1 | ||||
|
r23286 | compresseddeltalen += e[1] | ||
|
r23254 | if generaldelta: | ||
iterrev = e[3] | ||||
else: | ||||
iterrev -= 1 | ||||
|
r23306 | if iterrev in chaininfocache: | ||
t = chaininfocache[iterrev] | ||||
clen += t[0] | ||||
compresseddeltalen += t[1] | ||||
break | ||||
|
r23254 | e = index[iterrev] | ||
|
r23306 | else: | ||
# Add text length of base since decompressing that also takes | ||||
# work. For cache hits the length is already included. | ||||
compresseddeltalen += e[1] | ||||
r = (clen, compresseddeltalen) | ||||
chaininfocache[rev] = r | ||||
return r | ||||
|
r27468 | def _deltachain(self, rev, stoprev=None): | ||
"""Obtain the delta chain for a revision. | ||||
``stoprev`` specifies a revision to stop at. If not specified, we | ||||
stop at the base of the chain. | ||||
Returns a 2-tuple of (chain, stopped) where ``chain`` is a list of | ||||
revs in ascending order and ``stopped`` is a bool indicating whether | ||||
``stoprev`` was hit. | ||||
""" | ||||
chain = [] | ||||
# Alias to prevent attribute lookup in tight loop. | ||||
index = self.index | ||||
generaldelta = self._generaldelta | ||||
iterrev = rev | ||||
e = index[iterrev] | ||||
while iterrev != e[3] and iterrev != stoprev: | ||||
chain.append(iterrev) | ||||
if generaldelta: | ||||
iterrev = e[3] | ||||
else: | ||||
iterrev -= 1 | ||||
e = index[iterrev] | ||||
if iterrev == stoprev: | ||||
stopped = True | ||||
else: | ||||
chain.append(iterrev) | ||||
stopped = False | ||||
chain.reverse() | ||||
return chain, stopped | ||||
|
r11693 | def flags(self, rev): | ||
return self.index[rev][0] & 0xFFFF | ||||
|
r12024 | def rawsize(self, rev): | ||
|
r2078 | """return the length of the uncompressed text for a given revision""" | ||
|
r4977 | l = self.index[rev][2] | ||
|
r2078 | if l >= 0: | ||
return l | ||||
t = self.revision(self.node(rev)) | ||||
return len(t) | ||||
|
r12024 | size = rawsize | ||
|
r2078 | |||
|
r18081 | def ancestors(self, revs, stoprev=0, inclusive=False): | ||
|
r10047 | """Generate the ancestors of 'revs' in reverse topological order. | ||
|
r16868 | Does not generate revs lower than stoprev. | ||
|
r10047 | |||
|
r18090 | See the documentation for ancestor.lazyancestors for more details.""" | ||
|
r18081 | |||
|
r23328 | return ancestor.lazyancestors(self.parentrevs, revs, stoprev=stoprev, | ||
|
r18090 | inclusive=inclusive) | ||
|
r6872 | |||
|
r16867 | def descendants(self, revs): | ||
|
r10047 | """Generate the descendants of 'revs' in revision order. | ||
Yield a sequence of revision numbers starting with a child of | ||||
some rev in revs, i.e., each revision is *not* considered a | ||||
descendant of itself. Results are ordered by revision number (a | ||||
topological sort).""" | ||||
|
r12950 | first = min(revs) | ||
if first == nullrev: | ||||
for i in self: | ||||
yield i | ||||
return | ||||
|
r8150 | seen = set(revs) | ||
|
r17672 | for i in self.revs(start=first + 1): | ||
|
r6872 | for x in self.parentrevs(i): | ||
if x != nullrev and x in seen: | ||||
seen.add(i) | ||||
yield i | ||||
break | ||||
|
r13741 | def findcommonmissing(self, common=None, heads=None): | ||
"""Return a tuple of the ancestors of common and the ancestors of heads | ||||
|
r15835 | that are not ancestors of common. In revset terminology, we return the | ||
tuple: | ||||
|
r10047 | |||
|
r15835 | ::common, (::heads) - (::common) | ||
|
r7233 | |||
|
r10047 | The list is sorted by revision number, meaning it is | ||
topologically sorted. | ||||
'heads' and 'common' are both lists of node IDs. If heads is | ||||
not supplied, uses all of the revlog's heads. If common is not | ||||
supplied, uses nullid.""" | ||||
|
r7233 | if common is None: | ||
common = [nullid] | ||||
if heads is None: | ||||
heads = self.heads() | ||||
common = [self.rev(n) for n in common] | ||||
heads = [self.rev(n) for n in heads] | ||||
# we want the ancestors, but inclusive | ||||
|
r20073 | class lazyset(object): | ||
def __init__(self, lazyvalues): | ||||
self.addedvalues = set() | ||||
self.lazyvalues = lazyvalues | ||||
def __contains__(self, value): | ||||
return value in self.addedvalues or value in self.lazyvalues | ||||
def __iter__(self): | ||||
added = self.addedvalues | ||||
for r in added: | ||||
yield r | ||||
for r in self.lazyvalues: | ||||
if not r in added: | ||||
yield r | ||||
def add(self, value): | ||||
self.addedvalues.add(value) | ||||
def update(self, values): | ||||
self.addedvalues.update(values) | ||||
has = lazyset(self.ancestors(common)) | ||||
|
r8152 | has.add(nullrev) | ||
has.update(common) | ||||
|
r7233 | |||
# take all ancestors from heads that aren't in has | ||||
|
r8453 | missing = set() | ||
|
r25113 | visit = collections.deque(r for r in heads if r not in has) | ||
|
r7233 | while visit: | ||
|
r16803 | r = visit.popleft() | ||
|
r7233 | if r in missing: | ||
continue | ||||
else: | ||||
|
r8453 | missing.add(r) | ||
|
r7233 | for p in self.parentrevs(r): | ||
if p not in has: | ||||
visit.append(p) | ||||
|
r8453 | missing = list(missing) | ||
|
r7233 | missing.sort() | ||
|
r13741 | return has, [self.node(r) for r in missing] | ||
|
r23337 | def incrementalmissingrevs(self, common=None): | ||
"""Return an object that can be used to incrementally compute the | ||||
revision numbers of the ancestors of arbitrary sets that are not | ||||
ancestors of common. This is an ancestor.incrementalmissingancestors | ||||
object. | ||||
'common' is a list of revision numbers. If common is not supplied, uses | ||||
nullrev. | ||||
""" | ||||
if common is None: | ||||
common = [nullrev] | ||||
return ancestor.incrementalmissingancestors(self.parentrevs, common) | ||||
|
r17972 | def findmissingrevs(self, common=None, heads=None): | ||
"""Return the revision numbers of the ancestors of heads that | ||||
are not ancestors of common. | ||||
More specifically, return a list of revision numbers corresponding to | ||||
nodes N such that every N satisfies the following constraints: | ||||
1. N is an ancestor of some node in 'heads' | ||||
2. N is not an ancestor of any node in 'common' | ||||
The list is sorted by revision number, meaning it is | ||||
topologically sorted. | ||||
'heads' and 'common' are both lists of revision numbers. If heads is | ||||
not supplied, uses all of the revlog's heads. If common is not | ||||
supplied, uses nullid.""" | ||||
if common is None: | ||||
common = [nullrev] | ||||
if heads is None: | ||||
heads = self.headrevs() | ||||
|
r23338 | inc = self.incrementalmissingrevs(common=common) | ||
return inc.missingancestors(heads) | ||||
|
r17972 | |||
|
r13741 | def findmissing(self, common=None, heads=None): | ||
"""Return the ancestors of heads that are not ancestors of common. | ||||
More specifically, return a list of nodes N such that every N | ||||
satisfies the following constraints: | ||||
1. N is an ancestor of some node in 'heads' | ||||
2. N is not an ancestor of any node in 'common' | ||||
The list is sorted by revision number, meaning it is | ||||
topologically sorted. | ||||
'heads' and 'common' are both lists of node IDs. If heads is | ||||
not supplied, uses all of the revlog's heads. If common is not | ||||
supplied, uses nullid.""" | ||||
|
r17971 | if common is None: | ||
common = [nullid] | ||||
if heads is None: | ||||
heads = self.heads() | ||||
common = [self.rev(n) for n in common] | ||||
heads = [self.rev(n) for n in heads] | ||||
|
r23338 | inc = self.incrementalmissingrevs(common=common) | ||
return [self.node(r) for r in inc.missingancestors(heads)] | ||||
|
r7233 | |||
|
r1457 | def nodesbetween(self, roots=None, heads=None): | ||
|
r10047 | """Return a topological path from 'roots' to 'heads'. | ||
Return a tuple (nodes, outroots, outheads) where 'nodes' is a | ||||
topologically sorted list of all nodes N that satisfy both of | ||||
these constraints: | ||||
1. N is a descendant of some node in 'roots' | ||||
2. N is an ancestor of some node in 'heads' | ||||
|
r1457 | |||
|
r10047 | Every node is considered to be both a descendant and an ancestor | ||
of itself, so every reachable node in 'roots' and 'heads' will be | ||||
included in 'nodes'. | ||||
|
r1457 | |||
|
r10047 | 'outroots' is the list of reachable nodes in 'roots', i.e., the | ||
subset of 'roots' that is returned in 'nodes'. Likewise, | ||||
'outheads' is the subset of 'heads' that is also in 'nodes'. | ||||
'roots' and 'heads' are both lists of node IDs. If 'roots' is | ||||
unspecified, uses nullid as the only root. If 'heads' is | ||||
unspecified, uses list of all of the revlog's heads.""" | ||||
|
r1463 | nonodes = ([], [], []) | ||
|
r1457 | if roots is not None: | ||
roots = list(roots) | ||||
|
r1463 | if not roots: | ||
return nonodes | ||||
|
r1457 | lowestrev = min([self.rev(n) for n in roots]) | ||
else: | ||||
|
r14549 | roots = [nullid] # Everybody's a descendant of nullid | ||
|
r3578 | lowestrev = nullrev | ||
if (lowestrev == nullrev) and (heads is None): | ||||
|
r1457 | # We want _all_ the nodes! | ||
|
r6750 | return ([self.node(r) for r in self], [nullid], list(self.heads())) | ||
|
r1457 | if heads is None: | ||
# All nodes are ancestors, so the latest ancestor is the last | ||||
# node. | ||||
|
r6750 | highestrev = len(self) - 1 | ||
|
r1457 | # Set ancestors to None to signal that every node is an ancestor. | ||
ancestors = None | ||||
# Set heads to an empty dictionary for later discovery of heads | ||||
heads = {} | ||||
else: | ||||
|
r1463 | heads = list(heads) | ||
if not heads: | ||||
return nonodes | ||||
|
r8464 | ancestors = set() | ||
|
r1457 | # Turn heads into a dictionary so we can remove 'fake' heads. | ||
# Also, later we will be using it to filter out the heads we can't | ||||
# find from roots. | ||||
|
r14219 | heads = dict.fromkeys(heads, False) | ||
|
r3360 | # Start at the top and keep marking parents until we're done. | ||
|
r8163 | nodestotag = set(heads) | ||
|
r1457 | # Remember where the top was so we can use it as a limit later. | ||
highestrev = max([self.rev(n) for n in nodestotag]) | ||||
while nodestotag: | ||||
# grab a node to tag | ||||
n = nodestotag.pop() | ||||
# Never tag nullid | ||||
if n == nullid: | ||||
continue | ||||
# A node's revision number represents its place in a | ||||
# topologically sorted list of nodes. | ||||
r = self.rev(n) | ||||
if r >= lowestrev: | ||||
if n not in ancestors: | ||||
|
r14549 | # If we are possibly a descendant of one of the roots | ||
|
r1457 | # and we haven't already been marked as an ancestor | ||
|
r8464 | ancestors.add(n) # Mark as ancestor | ||
|
r1457 | # Add non-nullid parents to list of nodes to tag. | ||
|
r8153 | nodestotag.update([p for p in self.parents(n) if | ||
|
r1457 | p != nullid]) | ||
elif n in heads: # We've seen it before, is it a fake head? | ||||
# So it is, real heads should not be the ancestors of | ||||
# any other heads. | ||||
heads.pop(n) | ||||
|
r1459 | if not ancestors: | ||
|
r1463 | return nonodes | ||
|
r1457 | # Now that we have our set of ancestors, we want to remove any | ||
# roots that are not ancestors. | ||||
# If one of the roots was nullid, everything is included anyway. | ||||
|
r3578 | if lowestrev > nullrev: | ||
|
r1457 | # But, since we weren't, let's recompute the lowest rev to not | ||
# include roots that aren't ancestors. | ||||
# Filter out roots that aren't ancestors of heads | ||||
roots = [n for n in roots if n in ancestors] | ||||
# Recompute the lowest revision | ||||
if roots: | ||||
lowestrev = min([self.rev(n) for n in roots]) | ||||
else: | ||||
# No more roots? Return empty list | ||||
|
r1463 | return nonodes | ||
|
r1457 | else: | ||
# We are descending from nullid, and don't need to care about | ||||
# any other roots. | ||||
|
r3578 | lowestrev = nullrev | ||
|
r1457 | roots = [nullid] | ||
|
r8152 | # Transform our roots list into a set. | ||
|
r14549 | descendants = set(roots) | ||
|
r1457 | # Also, keep the original roots so we can filter out roots that aren't | ||
# 'real' roots (i.e. are descended from other roots). | ||||
|
r14549 | roots = descendants.copy() | ||
|
r1457 | # Our topologically sorted list of output nodes. | ||
orderedout = [] | ||||
# Don't start at nullid since we don't want nullid in our output list, | ||||
|
r17483 | # and if nullid shows up in descendants, empty parents will look like | ||
|
r14549 | # they're descendants. | ||
|
r17672 | for r in self.revs(start=max(lowestrev, 0), stop=highestrev + 1): | ||
|
r1457 | n = self.node(r) | ||
|
r14549 | isdescendant = False | ||
if lowestrev == nullrev: # Everybody is a descendant of nullid | ||||
isdescendant = True | ||||
elif n in descendants: | ||||
# n is already a descendant | ||||
isdescendant = True | ||||
|
r1457 | # This check only needs to be done here because all the roots | ||
|
r14549 | # will start being marked is descendants before the loop. | ||
|
r1457 | if n in roots: | ||
# If n was a root, check if it's a 'real' root. | ||||
p = tuple(self.parents(n)) | ||||
|
r14549 | # If any of its parents are descendants, it's not a root. | ||
if (p[0] in descendants) or (p[1] in descendants): | ||||
|
r8152 | roots.remove(n) | ||
|
r1457 | else: | ||
p = tuple(self.parents(n)) | ||||
|
r14549 | # A node is a descendant if either of its parents are | ||
# descendants. (We seeded the dependents list with the roots | ||||
|
r1457 | # up there, remember?) | ||
|
r14549 | if (p[0] in descendants) or (p[1] in descendants): | ||
descendants.add(n) | ||||
isdescendant = True | ||||
if isdescendant and ((ancestors is None) or (n in ancestors)): | ||||
# Only include nodes that are both descendants and ancestors. | ||||
|
r1457 | orderedout.append(n) | ||
if (ancestors is not None) and (n in heads): | ||||
# We're trying to figure out which heads are reachable | ||||
# from roots. | ||||
# Mark this head as having been reached | ||||
|
r14219 | heads[n] = True | ||
|
r1457 | elif ancestors is None: | ||
# Otherwise, we're trying to discover the heads. | ||||
# Assume this is a head because if it isn't, the next step | ||||
# will eventually remove it. | ||||
|
r14219 | heads[n] = True | ||
|
r1457 | # But, obviously its parents aren't. | ||
for p in self.parents(n): | ||||
heads.pop(p, None) | ||||
|
r14219 | heads = [n for n, flag in heads.iteritems() if flag] | ||
|
r8152 | roots = list(roots) | ||
|
r1457 | assert orderedout | ||
assert roots | ||||
assert heads | ||||
return (orderedout, roots, heads) | ||||
|
r14164 | def headrevs(self): | ||
|
r16786 | try: | ||
return self.index.headrevs() | ||||
except AttributeError: | ||||
|
r17674 | return self._headrevs() | ||
|
r24444 | def computephases(self, roots): | ||
|
r25361 | return self.index.computephasesmapsets(roots) | ||
|
r24444 | |||
|
r17674 | def _headrevs(self): | ||
|
r14164 | count = len(self) | ||
if not count: | ||||
return [nullrev] | ||||
|
r17673 | # we won't iter over filtered rev so nobody is a head at start | ||
ishead = [0] * (count + 1) | ||||
|
r14164 | index = self.index | ||
|
r17672 | for r in self: | ||
|
r17673 | ishead[r] = 1 # I may be an head | ||
|
r14164 | e = index[r] | ||
|
r17673 | ishead[e[5]] = ishead[e[6]] = 0 # my parent are not | ||
return [r for r, val in enumerate(ishead) if val] | ||||
|
r14164 | |||
|
r3923 | def heads(self, start=None, stop=None): | ||
|
r1550 | """return the list of all nodes that have no children | ||
|
r1551 | |||
if start is specified, only heads that are descendants of | ||||
start will be returned | ||||
|
r3923 | if stop is specified, it will consider all the revs from stop | ||
as if they had no children | ||||
|
r1551 | """ | ||
|
r4991 | if start is None and stop is None: | ||
|
r14164 | if not len(self): | ||
|
r4991 | return [nullid] | ||
|
r14164 | return [self.node(r) for r in self.headrevs()] | ||
|
r4991 | |||
|
r1551 | if start is None: | ||
start = nullid | ||||
|
r3923 | if stop is None: | ||
stop = [] | ||||
|
r8152 | stoprevs = set([self.rev(n) for n in stop]) | ||
|
r1550 | startrev = self.rev(start) | ||
|
r8464 | reachable = set((startrev,)) | ||
heads = set((startrev,)) | ||||
|
r1083 | |||
|
r2490 | parentrevs = self.parentrevs | ||
|
r17672 | for r in self.revs(start=startrev + 1): | ||
|
r2490 | for p in parentrevs(r): | ||
if p in reachable: | ||||
|
r3923 | if r not in stoprevs: | ||
|
r8464 | reachable.add(r) | ||
heads.add(r) | ||||
|
r3923 | if p in heads and p not in stoprevs: | ||
|
r8464 | heads.remove(p) | ||
|
r3923 | |||
|
r2490 | return [self.node(r) for r in heads] | ||
|
r370 | |||
def children(self, node): | ||||
|
r1083 | """find the children of a given node""" | ||
|
r370 | c = [] | ||
p = self.rev(node) | ||||
|
r17672 | for r in self.revs(start=p + 1): | ||
|
r4746 | prevs = [pr for pr in self.parentrevs(r) if pr != nullrev] | ||
if prevs: | ||||
for pr in prevs: | ||||
if pr == p: | ||||
c.append(self.node(r)) | ||||
elif p == nullrev: | ||||
c.append(self.node(r)) | ||||
|
r370 | return c | ||
|
r515 | |||
|
r10897 | def descendant(self, start, end): | ||
|
r12949 | if start == nullrev: | ||
return True | ||||
|
r16867 | for i in self.descendants([start]): | ||
|
r10897 | if i == end: | ||
return True | ||||
elif i > end: | ||||
break | ||||
return False | ||||
|
r21104 | def commonancestorsheads(self, a, b): | ||
"""calculate all the heads of the common ancestors of nodes a and b""" | ||||
a, b = self.rev(a), self.rev(b) | ||||
try: | ||||
ancs = self.index.commonancestorsheads(a, b) | ||||
except (AttributeError, OverflowError): # C implementation failed | ||||
ancs = ancestor.commonancestorsheads(self.parentrevs, a, b) | ||||
return map(self.node, ancs) | ||||
|
r22381 | def isancestor(self, a, b): | ||
"""return True if node a is an ancestor of node b | ||||
The implementation of this is trivial but the use of | ||||
commonancestorsheads is not.""" | ||||
return a in self.commonancestorsheads(a, b) | ||||
|
r21107 | def ancestor(self, a, b): | ||
|
r22389 | """calculate the "best" common ancestor of nodes a and b""" | ||
|
r21107 | |||
|
r10897 | a, b = self.rev(a), self.rev(b) | ||
|
r18988 | try: | ||
ancs = self.index.ancestors(a, b) | ||||
|
r21107 | except (AttributeError, OverflowError): | ||
|
r18988 | ancs = ancestor.ancestors(self.parentrevs, a, b) | ||
|
r18987 | if ancs: | ||
# choose a consistent winner when there's a tie | ||||
|
r21107 | return min(map(self.node, ancs)) | ||
|
r18987 | return nullid | ||
|
r10897 | |||
|
r3453 | def _match(self, id): | ||
|
r16762 | if isinstance(id, int): | ||
|
r3156 | # rev | ||
|
r2641 | return self.node(id) | ||
|
r3438 | if len(id) == 20: | ||
# possibly a binary node | ||||
# odds of a binary node being all hex in ASCII are 1 in 10**25 | ||||
try: | ||||
node = id | ||||
|
r7874 | self.rev(node) # quick search the index | ||
|
r3438 | return node | ||
|
r3930 | except LookupError: | ||
|
r3438 | pass # may be partial hex id | ||
|
r36 | try: | ||
|
r3156 | # str(rev) | ||
|
r36 | rev = int(id) | ||
|
r4980 | if str(rev) != id: | ||
raise ValueError | ||||
if rev < 0: | ||||
|
r6750 | rev = len(self) + rev | ||
if rev < 0 or rev >= len(self): | ||||
|
r4980 | raise ValueError | ||
|
r36 | return self.node(rev) | ||
|
r469 | except (ValueError, OverflowError): | ||
|
r3156 | pass | ||
|
r3453 | if len(id) == 40: | ||
try: | ||||
|
r3438 | # a full hex nodeid? | ||
node = bin(id) | ||||
|
r7874 | self.rev(node) | ||
|
r3157 | return node | ||
|
r7062 | except (TypeError, LookupError): | ||
|
r3453 | pass | ||
def _partialmatch(self, id): | ||||
|
r16665 | try: | ||
|
r19471 | n = self.index.partialmatch(id) | ||
if n and self.hasnode(n): | ||||
return n | ||||
return None | ||||
|
r16665 | except RevlogError: | ||
# parsers.c radix tree lookup gave multiple matches | ||||
|
r29396 | # fast path: for unfiltered changelog, radix tree is accurate | ||
if not getattr(self, 'filteredrevs', None): | ||||
raise LookupError(id, self.indexfile, | ||||
_('ambiguous identifier')) | ||||
|
r19471 | # fall through to slow path that filters hidden revisions | ||
|
r16665 | except (AttributeError, ValueError): | ||
# we are pure python, or key was too short to search radix tree | ||||
pass | ||||
|
r13258 | if id in self._pcache: | ||
return self._pcache[id] | ||||
|
r3453 | if len(id) < 40: | ||
try: | ||||
|
r3438 | # hex(node)[:...] | ||
|
r9029 | l = len(id) // 2 # grab an even number of digits | ||
|
r13259 | prefix = bin(id[:l * 2]) | ||
nl = [e[7] for e in self.index if e[7].startswith(prefix)] | ||||
|
r19471 | nl = [n for n in nl if hex(n).startswith(id) and | ||
self.hasnode(n)] | ||||
|
r7365 | if len(nl) > 0: | ||
if len(nl) == 1: | ||||
|
r13258 | self._pcache[id] = nl[0] | ||
|
r7365 | return nl[0] | ||
raise LookupError(id, self.indexfile, | ||||
_('ambiguous identifier')) | ||||
return None | ||||
|
r3453 | except TypeError: | ||
pass | ||||
def lookup(self, id): | ||||
"""locate a node based on: | ||||
- revision number or str(revision number) | ||||
- nodeid or subset of hex nodeid | ||||
""" | ||||
n = self._match(id) | ||||
if n is not None: | ||||
return n | ||||
n = self._partialmatch(id) | ||||
if n: | ||||
return n | ||||
|
r515 | |||
|
r6228 | raise LookupError(id, self.indexfile, _('no match found')) | ||
|
r36 | |||
|
r2890 | def cmp(self, node, text): | ||
|
r11539 | """compare text with a given file revision | ||
returns True if text is different than what is stored. | ||||
""" | ||||
|
r2890 | p1, p2 = self.parents(node) | ||
return hash(text, p1, p2) != node | ||||
|
r8316 | def _addchunk(self, offset, data): | ||
|
r27070 | """Add a segment to the revlog cache. | ||
Accepts an absolute offset and the data that is at that location. | ||||
""" | ||||
|
r8316 | o, d = self._chunkcache | ||
# try to add to existing cache | ||||
|
r13253 | if o + len(d) == offset and len(d) + len(data) < _chunksize: | ||
|
r8316 | self._chunkcache = o, d + data | ||
else: | ||||
self._chunkcache = offset, data | ||||
|
r26377 | def _loadchunk(self, offset, length, df=None): | ||
|
r27070 | """Load a segment of raw data from the revlog. | ||
|
r26377 | |||
|
r27070 | Accepts an absolute offset, length to read, and an optional existing | ||
|
r26377 | file handle to read from. | ||
If an existing file handle is passed, it will be seeked and the | ||||
original seek position will NOT be restored. | ||||
|
r27070 | |||
Returns a str or buffer of raw byte data. | ||||
|
r26377 | """ | ||
if df is not None: | ||||
closehandle = False | ||||
|
r8650 | else: | ||
|
r26377 | if self._inline: | ||
df = self.opener(self.indexfile) | ||||
else: | ||||
df = self.opener(self.datafile) | ||||
closehandle = True | ||||
|
r8316 | |||
|
r20179 | # Cache data both forward and backward around the requested | ||
# data, in a fixed size window. This helps speed up operations | ||||
# involving reading the revlog backwards. | ||||
|
r20180 | cachesize = self._chunkcachesize | ||
realoffset = offset & ~(cachesize - 1) | ||||
reallength = (((offset + length + cachesize) & ~(cachesize - 1)) | ||||
- realoffset) | ||||
|
r20179 | df.seek(realoffset) | ||
d = df.read(reallength) | ||||
|
r26377 | if closehandle: | ||
df.close() | ||||
|
r20179 | self._addchunk(realoffset, d) | ||
if offset != realoffset or reallength != length: | ||||
return util.buffer(d, offset - realoffset, length) | ||||
|
r8316 | return d | ||
|
r26377 | def _getchunk(self, offset, length, df=None): | ||
|
r27070 | """Obtain a segment of raw data from the revlog. | ||
Accepts an absolute offset, length of bytes to obtain, and an | ||||
optional file handle to the already-opened revlog. If the file | ||||
handle is used, it's original seek position will not be preserved. | ||||
Requests for data may be returned from a cache. | ||||
Returns a str or a buffer instance of raw byte data. | ||||
""" | ||||
|
r8316 | o, d = self._chunkcache | ||
l = len(d) | ||||
# is it in the cache? | ||||
cachestart = offset - o | ||||
cacheend = cachestart + length | ||||
if cachestart >= 0 and cacheend <= l: | ||||
if cachestart == 0 and cacheend == l: | ||||
return d # avoid a copy | ||||
|
r16423 | return util.buffer(d, cachestart, cacheend - cachestart) | ||
|
r8316 | |||
|
r26377 | return self._loadchunk(offset, length, df=df) | ||
|
r8316 | |||
|
r26377 | def _chunkraw(self, startrev, endrev, df=None): | ||
|
r27070 | """Obtain a segment of raw data corresponding to a range of revisions. | ||
Accepts the start and end revisions and an optional already-open | ||||
file handle to be used for reading. If the file handle is read, its | ||||
seek position will not be preserved. | ||||
Requests for data may be satisfied by a cache. | ||||
|
r27649 | Returns a 2-tuple of (offset, data) for the requested range of | ||
revisions. Offset is the integer offset from the beginning of the | ||||
revlog and data is a str or buffer of the raw byte data. | ||||
Callers will need to call ``self.start(rev)`` and ``self.length(rev)`` | ||||
to determine where each revision's data begins and ends. | ||||
|
r27070 | """ | ||
|
r8318 | start = self.start(startrev) | ||
|
r19714 | end = self.end(endrev) | ||
|
r8318 | if self._inline: | ||
start += (startrev + 1) * self._io.size | ||||
|
r19714 | end += (endrev + 1) * self._io.size | ||
length = end - start | ||||
|
r27649 | |||
return start, self._getchunk(start, length, df=df) | ||||
|
r8318 | |||
|
r26377 | def _chunk(self, rev, df=None): | ||
|
r27070 | """Obtain a single decompressed chunk for a revision. | ||
Accepts an integer revision and an optional already-open file handle | ||||
to be used for reading. If used, the seek position of the file will not | ||||
be preserved. | ||||
Returns a str holding uncompressed data for the requested revision. | ||||
""" | ||||
|
r27649 | return decompress(self._chunkraw(rev, rev, df=df)[1]) | ||
|
r8650 | |||
|
r26377 | def _chunks(self, revs, df=None): | ||
|
r27070 | """Obtain decompressed chunks for the specified revisions. | ||
|
r19713 | |||
|
r27070 | Accepts an iterable of numeric revisions that are assumed to be in | ||
ascending order. Also accepts an optional already-open file handle | ||||
to be used for reading. If used, the seek position of the file will | ||||
not be preserved. | ||||
This function is similar to calling ``self._chunk()`` multiple times, | ||||
but is faster. | ||||
Returns a list with decompressed data for each requested revision. | ||||
""" | ||||
|
r19716 | if not revs: | ||
return [] | ||||
|
r19713 | start = self.start | ||
length = self.length | ||||
inline = self._inline | ||||
iosize = self._io.size | ||||
|
r19715 | buffer = util.buffer | ||
|
r19713 | |||
l = [] | ||||
ladd = l.append | ||||
|
r20957 | try: | ||
|
r27650 | offset, data = self._chunkraw(revs[0], revs[-1], df=df) | ||
|
r20957 | except OverflowError: | ||
# issue4215 - we can't cache a run of chunks greater than | ||||
# 2G on Windows | ||||
|
r26377 | return [self._chunk(rev, df=df) for rev in revs] | ||
|
r19715 | |||
|
r19713 | for rev in revs: | ||
chunkstart = start(rev) | ||||
if inline: | ||||
chunkstart += (rev + 1) * iosize | ||||
chunklength = length(rev) | ||||
|
r19715 | ladd(decompress(buffer(data, chunkstart - offset, chunklength))) | ||
|
r19713 | |||
return l | ||||
|
r14075 | |||
|
r8650 | def _chunkclear(self): | ||
|
r27070 | """Clear the raw chunk cache.""" | ||
|
r8650 | self._chunkcache = (0, '') | ||
|
r1598 | |||
|
r11929 | def deltaparent(self, rev): | ||
|
r14195 | """return deltaparent of the given revision""" | ||
|
r14253 | base = self.index[rev][3] | ||
if base == rev: | ||||
|
r14208 | return nullrev | ||
|
r14253 | elif self._generaldelta: | ||
return base | ||||
|
r14208 | else: | ||
return rev - 1 | ||||
|
r11929 | |||
|
r1941 | def revdiff(self, rev1, rev2): | ||
"""return or calculate a delta between two revisions""" | ||||
|
r14208 | if rev1 != nullrev and self.deltaparent(rev2) == rev1: | ||
|
r16423 | return str(self._chunk(rev2)) | ||
|
r5005 | |||
|
r16424 | return mdiff.textdiff(self.revision(rev1), | ||
self.revision(rev2)) | ||||
|
r119 | |||
|
r26377 | def revision(self, nodeorrev, _df=None): | ||
|
r16435 | """return an uncompressed revision of a given node or revision | ||
number. | ||||
|
r26377 | |||
_df is an existing file handle to read from. It is meant to only be | ||||
used internally. | ||||
|
r16435 | """ | ||
|
r16375 | if isinstance(nodeorrev, int): | ||
rev = nodeorrev | ||||
node = self.node(rev) | ||||
else: | ||||
node = nodeorrev | ||||
rev = None | ||||
|
r11996 | cachedrev = None | ||
|
r4980 | if node == nullid: | ||
return "" | ||||
|
r26242 | if self._cache: | ||
if self._cache[0] == node: | ||||
return self._cache[2] | ||||
cachedrev = self._cache[1] | ||||
|
r0 | |||
|
r1083 | # look up what we need to read | ||
|
r0 | text = None | ||
|
r16375 | if rev is None: | ||
rev = self.rev(node) | ||||
|
r0 | |||
|
r5004 | # check rev flags | ||
|
r11745 | if self.flags(rev) & ~REVIDX_KNOWN_FLAGS: | ||
|
r5312 | raise RevlogError(_('incompatible revision flag %x') % | ||
|
r11745 | (self.flags(rev) & ~REVIDX_KNOWN_FLAGS)) | ||
|
r5004 | |||
|
r27468 | chain, stopped = self._deltachain(rev, stoprev=cachedrev) | ||
if stopped: | ||||
|
r26242 | text = self._cache[2] | ||
|
r0 | |||
|
r11754 | # drop cache to save memory | ||
self._cache = None | ||||
|
r26377 | bins = self._chunks(chain, df=_df) | ||
|
r8650 | if text is None: | ||
|
r19716 | text = str(bins[0]) | ||
bins = bins[1:] | ||||
|
r8650 | |||
|
r4989 | text = mdiff.patches(text, bins) | ||
|
r13239 | |||
|
r13276 | text = self._checkhash(text, node, rev) | ||
|
r13239 | |||
self._cache = (node, rev, text) | ||||
return text | ||||
|
r22785 | def hash(self, text, p1, p2): | ||
"""Compute a node hash. | ||||
Available as a function so that subclasses can replace the hash | ||||
as needed. | ||||
""" | ||||
return hash(text, p1, p2) | ||||
|
r13276 | def _checkhash(self, text, node, rev): | ||
|
r1598 | p1, p2 = self.parents(node) | ||
|
r19624 | self.checkhash(text, p1, p2, node, rev) | ||
return text | ||||
def checkhash(self, text, p1, p2, node, rev=None): | ||||
|
r22785 | if node != self.hash(text, p1, p2): | ||
|
r19624 | revornode = rev | ||
if revornode is None: | ||||
revornode = templatefilters.short(hex(node)) | ||||
raise RevlogError(_("integrity check failed on %s:%s") | ||||
% (self.indexfile, revornode)) | ||||
|
r0 | |||
|
r2075 | def checkinlinesize(self, tr, fp=None): | ||
|
r26376 | """Check if the revlog is too big for inline and convert if so. | ||
This should be called after revisions are added to the revlog. If the | ||||
revlog has grown too large to be an inline revlog, it will convert it | ||||
to use multiple index and data files. | ||||
""" | ||||
|
r10913 | if not self._inline or (self.start(-2) + self.length(-2)) < _maxinline: | ||
|
r2073 | return | ||
|
r8315 | |||
|
r2084 | trinfo = tr.find(self.indexfile) | ||
|
r8527 | if trinfo is None: | ||
|
r3680 | raise RevlogError(_("%s not found in the transaction") | ||
% self.indexfile) | ||||
|
r2084 | |||
trindex = trinfo[2] | ||||
|
r24454 | if trindex is not None: | ||
dataoff = self.start(trindex) | ||||
else: | ||||
# revlog was stripped at start of transaction, use all leftover data | ||||
trindex = len(self) - 1 | ||||
dataoff = self.end(-2) | ||||
|
r2084 | |||
tr.add(self.datafile, dataoff) | ||||
|
r8315 | |||
|
r8317 | if fp: | ||
fp.flush() | ||||
fp.close() | ||||
|
r8315 | |||
|
r2073 | df = self.opener(self.datafile, 'w') | ||
|
r6261 | try: | ||
|
r6750 | for r in self: | ||
|
r27649 | df.write(self._chunkraw(r, r)[1]) | ||
|
r6261 | finally: | ||
df.close() | ||||
|
r2076 | fp = self.opener(self.indexfile, 'w', atomictemp=True) | ||
|
r2073 | self.version &= ~(REVLOGNGINLINEDATA) | ||
|
r4982 | self._inline = False | ||
|
r6750 | for i in self: | ||
|
r5338 | e = self._io.packentry(self.index[i], self.node, self.version, i) | ||
|
r2073 | fp.write(e) | ||
|
r15057 | # if we don't call close, the temp file will never replace the | ||
|
r2076 | # real index | ||
|
r15057 | fp.close() | ||
|
r2084 | |||
|
r8650 | tr.replace(self.indexfile, trindex * self._io.size) | ||
self._chunkclear() | ||||
|
r2073 | |||
|
r19625 | def addrevision(self, text, transaction, link, p1, p2, cachedelta=None, | ||
node=None): | ||||
|
r1083 | """add a revision to the log | ||
text - the revision data to add | ||||
transaction - the transaction object used for rollback | ||||
link - the linkrev data to add | ||||
p1, p2 - the parent nodeids of the revision | ||||
|
r12012 | cachedelta - an optional precomputed delta | ||
|
r19625 | node - nodeid of revision; typically node is not specified, and it is | ||
computed by default as hash(text, p1, p2), however subclasses might | ||||
use different hashing method (and override checkhash() in such case) | ||||
|
r1083 | """ | ||
|
r19326 | if link == nullrev: | ||
raise RevlogError(_("attempted to add linkrev -1 to %s") | ||||
% self.indexfile) | ||||
|
r25459 | |||
if len(text) > _maxentrysize: | ||||
raise RevlogError( | ||||
_("%s: size of %d bytes exceeds maximum revlog storage of 2GiB") | ||||
% (self.indexfile, len(text))) | ||||
|
r22785 | node = node or self.hash(text, p1, p2) | ||
|
r14196 | if node in self.nodemap: | ||
|
r12023 | return node | ||
|
r4981 | dfh = None | ||
|
r4982 | if not self._inline: | ||
|
r26378 | dfh = self.opener(self.datafile, "a+") | ||
|
r3390 | ifh = self.opener(self.indexfile, "a+") | ||
|
r6261 | try: | ||
|
r12023 | return self._addrevision(node, text, transaction, link, p1, p2, | ||
|
r23856 | REVIDX_DEFAULT_FLAGS, cachedelta, ifh, dfh) | ||
|
r6261 | finally: | ||
if dfh: | ||||
dfh.close() | ||||
ifh.close() | ||||
|
r3390 | |||
|
r17128 | def compress(self, text): | ||
""" generate a possibly-compressed representation of text """ | ||||
if not text: | ||||
return ("", text) | ||||
l = len(text) | ||||
bin = None | ||||
if l < 44: | ||||
pass | ||||
elif l > 1000000: | ||||
# zlib makes an internal copy, thus doubling memory usage for | ||||
# large files, so lets do this in pieces | ||||
z = zlib.compressobj() | ||||
p = [] | ||||
pos = 0 | ||||
while pos < l: | ||||
pos2 = pos + 2**20 | ||||
p.append(z.compress(text[pos:pos2])) | ||||
pos = pos2 | ||||
p.append(z.flush()) | ||||
if sum(map(len, p)) < l: | ||||
bin = "".join(p) | ||||
else: | ||||
bin = _compress(text) | ||||
if bin is None or len(bin) > l: | ||||
if text[0] == '\0': | ||||
return ("", text) | ||||
return ('u', text) | ||||
return ("", bin) | ||||
|
r26115 | def _isgooddelta(self, d, textlen): | ||
"""Returns True if the given delta is good. Good means that it is within | ||||
the disk span, disk size, and chain length bounds that we know to be | ||||
performant.""" | ||||
if d is None: | ||||
return False | ||||
# - 'dist' is the distance from the base revision -- bounding it limits | ||||
# the amount of I/O we need to do. | ||||
# - 'compresseddeltalen' is the sum of the total size of deltas we need | ||||
# to apply -- bounding it limits the amount of CPU we consume. | ||||
dist, l, data, base, chainbase, chainlen, compresseddeltalen = d | ||||
if (dist > textlen * 4 or l > textlen or | ||||
compresseddeltalen > textlen * 2 or | ||||
(self._maxchainlen and chainlen > self._maxchainlen)): | ||||
return False | ||||
return True | ||||
|
r23856 | def _addrevision(self, node, text, transaction, link, p1, p2, flags, | ||
|
r26243 | cachedelta, ifh, dfh, alwayscache=False): | ||
|
r14292 | """internal function to add revisions to the log | ||
|
r12623 | |||
|
r14292 | see addrevision for argument descriptions. | ||
invariants: | ||||
- text is optional (can be None); if not set, cachedelta must be set. | ||||
|
r17424 | if both are set, they must correspond to each other. | ||
|
r14292 | """ | ||
|
r12886 | btext = [text] | ||
def buildtext(): | ||||
if btext[0] is not None: | ||||
return btext[0] | ||||
|
r24122 | baserev = cachedelta[0] | ||
delta = cachedelta[1] | ||||
# special case deltas which replace entire base; no need to decode | ||||
# base revision. this neatly avoids censored bases, which throw when | ||||
# they're decoded. | ||||
hlen = struct.calcsize(">lll") | ||||
if delta[:hlen] == mdiff.replacediffheader(self.rawsize(baserev), | ||||
len(delta) - hlen): | ||||
btext[0] = delta[hlen:] | ||||
else: | ||||
|
r26379 | if self._inline: | ||
fh = ifh | ||||
else: | ||||
fh = dfh | ||||
basetext = self.revision(self.node(baserev), _df=fh) | ||||
|
r24122 | btext[0] = mdiff.patch(basetext, delta) | ||
|
r22934 | try: | ||
self.checkhash(btext[0], p1, p2, node) | ||||
|
r23857 | if flags & REVIDX_ISCENSORED: | ||
raise RevlogError(_('node %s is not censored') % node) | ||||
|
r22934 | except CensoredNodeError: | ||
|
r23857 | # must pass the censored index flag to add censored revisions | ||
if not flags & REVIDX_ISCENSORED: | ||||
raise | ||||
|
r12886 | return btext[0] | ||
|
r12623 | |||
|
r12888 | def builddelta(rev): | ||
# can we use the cached delta? | ||||
if cachedelta and cachedelta[0] == rev: | ||||
delta = cachedelta[1] | ||||
else: | ||||
t = buildtext() | ||||
|
r24123 | if self.iscensored(rev): | ||
# deltas based on a censored revision must replace the | ||||
# full content in one patch, so delta works everywhere | ||||
header = mdiff.replacediffheader(self.rawsize(rev), len(t)) | ||||
delta = header + t | ||||
else: | ||||
|
r26379 | if self._inline: | ||
fh = ifh | ||||
else: | ||||
fh = dfh | ||||
ptext = self.revision(self.node(rev), _df=fh) | ||||
|
r24123 | delta = mdiff.textdiff(ptext, t) | ||
|
r17128 | data = self.compress(delta) | ||
|
r12888 | l = len(data[1]) + len(data[0]) | ||
|
r29830 | chainbase = self.chainbase(rev) | ||
|
r17150 | dist = l + offset - self.start(chainbase) | ||
|
r14270 | if self._generaldelta: | ||
base = rev | ||||
else: | ||||
base = chainbase | ||||
|
r23287 | chainlen, compresseddeltalen = self._chaininfo(rev) | ||
chainlen += 1 | ||||
compresseddeltalen += l | ||||
return dist, l, data, base, chainbase, chainlen, compresseddeltalen | ||||
|
r12888 | |||
|
r6750 | curr = len(self) | ||
|
r4981 | prev = curr - 1 | ||
offset = self.end(prev) | ||||
|
r27178 | delta = None | ||
|
r12889 | p1r, p2r = self.rev(p1), self.rev(p2) | ||
|
r0 | |||
|
r26116 | # full versions are inserted when the needed deltas | ||
# become comparable to the uncompressed text | ||||
if text is None: | ||||
textlen = mdiff.patchedsize(self.rawsize(cachedelta[0]), | ||||
cachedelta[1]) | ||||
else: | ||||
textlen = len(text) | ||||
|
r11963 | # should we try to build a delta? | ||
|
r12890 | if prev != nullrev: | ||
|
r27191 | tested = set() | ||
|
r26907 | if cachedelta and self._generaldelta and self._lazydeltabase: | ||
# Assume what we received from the server is a good choice | ||||
# build delta will reuse the cache | ||||
|
r27180 | candidatedelta = builddelta(cachedelta[0]) | ||
|
r27249 | tested.add(cachedelta[0]) | ||
|
r27180 | if self._isgooddelta(candidatedelta, textlen): | ||
delta = candidatedelta | ||||
|
r27191 | if delta is None and self._generaldelta: | ||
# exclude already lazy tested base if any | ||||
|
r27251 | parents = [p for p in (p1r, p2r) | ||
if p != nullrev and p not in tested] | ||||
|
r27191 | if parents and not self._aggressivemergedeltas: | ||
|
r26118 | # Pick whichever parent is closer to us (to minimize the | ||
|
r27191 | # chance of having to build a fulltext). | ||
|
r27189 | parents = [max(parents)] | ||
|
r27191 | tested.update(parents) | ||
|
r27189 | pdeltas = [] | ||
for p in parents: | ||||
pd = builddelta(p) | ||||
if self._isgooddelta(pd, textlen): | ||||
pdeltas.append(pd) | ||||
if pdeltas: | ||||
delta = min(pdeltas, key=lambda x: x[1]) | ||||
|
r27191 | if delta is None and prev not in tested: | ||
# other approach failed try against prev to hopefully save us a | ||||
# fulltext. | ||||
|
r27250 | candidatedelta = builddelta(prev) | ||
if self._isgooddelta(candidatedelta, textlen): | ||||
delta = candidatedelta | ||||
|
r27179 | if delta is not None: | ||
|
r27178 | dist, l, data, base, chainbase, chainlen, compresseddeltalen = delta | ||
|
r27250 | else: | ||
|
r12886 | text = buildtext() | ||
|
r17128 | data = self.compress(text) | ||
|
r1533 | l = len(data[1]) + len(data[0]) | ||
|
r14296 | base = chainbase = curr | ||
|
r0 | |||
|
r12623 | e = (offset_type(offset, flags), l, textlen, | ||
|
r12889 | base, link, p1r, p2r, node) | ||
|
r4979 | self.index.insert(-1, e) | ||
|
r4981 | self.nodemap[node] = curr | ||
|
r4977 | |||
|
r5338 | entry = self._io.packentry(e, self.node, self.version, curr) | ||
|
r20217 | self._writeentry(transaction, ifh, dfh, entry, data, link, offset) | ||
|
r26243 | if alwayscache and text is None: | ||
text = buildtext() | ||||
|
r20217 | if type(text) == str: # only accept immutable objects | ||
self._cache = (node, curr, text) | ||||
|
r29830 | self._chainbasecache[curr] = chainbase | ||
|
r20217 | return node | ||
def _writeentry(self, transaction, ifh, dfh, entry, data, link, offset): | ||||
|
r27430 | # Files opened in a+ mode have inconsistent behavior on various | ||
# platforms. Windows requires that a file positioning call be made | ||||
# when the file handle transitions between reads and writes. See | ||||
# 3686fa2b8eee and the mixedfilemodewrapper in windows.py. On other | ||||
# platforms, Python or the platform itself can be buggy. Some versions | ||||
# of Solaris have been observed to not append at the end of the file | ||||
# if the file was seeked to before the end. See issue4943 for more. | ||||
# | ||||
# We work around this issue by inserting a seek() before writing. | ||||
# Note: This is likely not necessary on Python 3. | ||||
ifh.seek(0, os.SEEK_END) | ||||
|
r27441 | if dfh: | ||
|
r27430 | dfh.seek(0, os.SEEK_END) | ||
|
r20217 | curr = len(self) - 1 | ||
|
r4982 | if not self._inline: | ||
|
r2073 | transaction.add(self.datafile, offset) | ||
|
r4981 | transaction.add(self.indexfile, curr * len(entry)) | ||
|
r2073 | if data[0]: | ||
|
r3390 | dfh.write(data[0]) | ||
dfh.write(data[1]) | ||||
|
r4981 | ifh.write(entry) | ||
|
r2073 | else: | ||
|
r4996 | offset += curr * self._io.size | ||
|
r5324 | transaction.add(self.indexfile, offset, curr) | ||
|
r4981 | ifh.write(entry) | ||
|
r3390 | ifh.write(data[0]) | ||
ifh.write(data[1]) | ||||
self.checkinlinesize(transaction, ifh) | ||||
|
r2073 | |||
|
r26705 | def addgroup(self, cg, linkmapper, transaction, addrevisioncb=None): | ||
|
r1083 | """ | ||
add a delta group | ||||
|
r46 | |||
|
r1083 | given a set of deltas, add them to the revision log. the | ||
first delta is against its parent, which should be in our | ||||
log, the rest are against the previous delta. | ||||
|
r25822 | |||
If ``addrevisioncb`` is defined, it will be called with arguments of | ||||
this revlog and the node that was added. | ||||
|
r1083 | """ | ||
|
r12624 | # track the base of the current delta log | ||
|
r15890 | content = [] | ||
|
r2002 | node = None | ||
|
r515 | |||
|
r12624 | r = len(self) | ||
end = 0 | ||||
|
r46 | if r: | ||
|
r12624 | end = self.end(r - 1) | ||
|
r2072 | ifh = self.opener(self.indexfile, "a+") | ||
|
r4996 | isize = r * self._io.size | ||
|
r4982 | if self._inline: | ||
|
r4996 | transaction.add(self.indexfile, end + isize, r) | ||
|
r2073 | dfh = None | ||
else: | ||||
|
r4996 | transaction.add(self.indexfile, isize, r) | ||
|
r2073 | transaction.add(self.datafile, end) | ||
|
r26378 | dfh = self.opener(self.datafile, "a+") | ||
|
r24255 | def flush(): | ||
if dfh: | ||||
dfh.flush() | ||||
ifh.flush() | ||||
|
r6261 | try: | ||
# loop through our set of deltas | ||||
chain = None | ||||
|
r29732 | for chunkdata in iter(lambda: cg.deltachunk(chain), {}): | ||
|
r12336 | node = chunkdata['node'] | ||
p1 = chunkdata['p1'] | ||||
p2 = chunkdata['p2'] | ||||
cs = chunkdata['cs'] | ||||
|
r14141 | deltabase = chunkdata['deltabase'] | ||
delta = chunkdata['delta'] | ||||
|
r27433 | flags = chunkdata['flags'] or REVIDX_DEFAULT_FLAGS | ||
|
r12336 | |||
|
r15890 | content.append(node) | ||
|
r6261 | link = linkmapper(cs) | ||
|
r14196 | if node in self.nodemap: | ||
|
r6261 | # this can happen if two branches make the same change | ||
chain = node | ||||
continue | ||||
|
r192 | |||
|
r6261 | for p in (p1, p2): | ||
|
r16686 | if p not in self.nodemap: | ||
|
r14196 | raise LookupError(p, self.indexfile, | ||
_('unknown parent')) | ||||
|
r46 | |||
|
r14141 | if deltabase not in self.nodemap: | ||
raise LookupError(deltabase, self.indexfile, | ||||
_('unknown delta base')) | ||||
|
r46 | |||
|
r14141 | baserev = self.rev(deltabase) | ||
|
r24120 | |||
if baserev != nullrev and self.iscensored(baserev): | ||||
# if base is censored, delta must be full replacement in a | ||||
# single patch operation | ||||
hlen = struct.calcsize(">lll") | ||||
oldlen = self.rawsize(baserev) | ||||
newlen = len(delta) - hlen | ||||
if delta[:hlen] != mdiff.replacediffheader(oldlen, newlen): | ||||
raise error.CensoredBaseError(self.indexfile, | ||||
self.node(baserev)) | ||||
|
r27433 | if not flags and self._peek_iscensored(baserev, delta, flush): | ||
|
r24255 | flags |= REVIDX_ISCENSORED | ||
|
r26243 | # We assume consumers of addrevisioncb will want to retrieve | ||
# the added revision, which will require a call to | ||||
# revision(). revision() will fast path if there is a cache | ||||
# hit. So, we tell _addrevision() to always cache in this case. | ||||
|
r12624 | chain = self._addrevision(node, None, transaction, link, | ||
|
r24255 | p1, p2, flags, (baserev, delta), | ||
|
r26243 | ifh, dfh, | ||
alwayscache=bool(addrevisioncb)) | ||||
|
r25822 | |||
if addrevisioncb: | ||||
addrevisioncb(self, chain) | ||||
|
r12624 | if not dfh and not self._inline: | ||
# addrevision switched from inline to conventional | ||||
# reopen the index | ||||
|
r13400 | ifh.close() | ||
|
r26378 | dfh = self.opener(self.datafile, "a+") | ||
ifh = self.opener(self.indexfile, "a+") | ||||
|
r6261 | finally: | ||
if dfh: | ||||
dfh.close() | ||||
ifh.close() | ||||
|
r46 | |||
|
r15890 | return content | ||
|
r1493 | |||
|
r24118 | def iscensored(self, rev): | ||
"""Check if a file revision is censored.""" | ||||
return False | ||||
|
r24255 | def _peek_iscensored(self, baserev, delta, flush): | ||
"""Quickly check if a delta produces a censored revision.""" | ||||
return False | ||||
|
r20074 | def getstrippoint(self, minlink): | ||
"""find the minimum rev that must be stripped to strip the linkrev | ||||
Returns a tuple containing the minimum rev and a set of all revs that | ||||
have linkrevs that will be broken by this strip. | ||||
""" | ||||
brokenrevs = set() | ||||
strippoint = len(self) | ||||
heads = {} | ||||
futurelargelinkrevs = set() | ||||
for head in self.headrevs(): | ||||
headlinkrev = self.linkrev(head) | ||||
heads[head] = headlinkrev | ||||
if headlinkrev >= minlink: | ||||
futurelargelinkrevs.add(headlinkrev) | ||||
# This algorithm involves walking down the rev graph, starting at the | ||||
# heads. Since the revs are topologically sorted according to linkrev, | ||||
# once all head linkrevs are below the minlink, we know there are | ||||
# no more revs that could have a linkrev greater than minlink. | ||||
# So we can stop walking. | ||||
while futurelargelinkrevs: | ||||
strippoint -= 1 | ||||
linkrev = heads.pop(strippoint) | ||||
if linkrev < minlink: | ||||
brokenrevs.add(strippoint) | ||||
else: | ||||
futurelargelinkrevs.remove(linkrev) | ||||
for p in self.parentrevs(strippoint): | ||||
if p != nullrev: | ||||
plinkrev = self.linkrev(p) | ||||
heads[p] = plinkrev | ||||
if plinkrev >= minlink: | ||||
futurelargelinkrevs.add(plinkrev) | ||||
return strippoint, brokenrevs | ||||
|
r8073 | def strip(self, minlink, transaction): | ||
|
r5910 | """truncate the revlog on the first revision with a linkrev >= minlink | ||
This function is called when we're stripping revision minlink and | ||||
its descendants from the repository. | ||||
We have to remove all revisions with linkrev >= minlink, because | ||||
the equivalent changelog revisions will be renumbered after the | ||||
strip. | ||||
So we truncate the revlog on the first of these revisions, and | ||||
trust that the caller has saved the revisions that shouldn't be | ||||
|
r15827 | removed and that it'll re-add them after this truncation. | ||
|
r5910 | """ | ||
|
r6750 | if len(self) == 0: | ||
|
r1535 | return | ||
|
r20074 | rev, _ = self.getstrippoint(minlink) | ||
if rev == len(self): | ||||
|
r5909 | return | ||
|
r1535 | |||
# first truncate the files on disk | ||||
end = self.start(rev) | ||||
|
r4982 | if not self._inline: | ||
|
r8073 | transaction.add(self.datafile, end) | ||
|
r4977 | end = rev * self._io.size | ||
|
r2073 | else: | ||
|
r4977 | end += rev * self._io.size | ||
|
r2072 | |||
|
r8073 | transaction.add(self.indexfile, end) | ||
|
r1535 | |||
# then reset internal state in memory to forget those revisions | ||||
|
r4984 | self._cache = None | ||
|
r23306 | self._chaininfocache = {} | ||
|
r8650 | self._chunkclear() | ||
|
r6750 | for x in xrange(rev, len(self)): | ||
|
r2072 | del self.nodemap[self.node(x)] | ||
|
r1535 | |||
|
r4979 | del self.index[rev:-1] | ||
|
r1535 | |||
|
r1493 | def checksize(self): | ||
expected = 0 | ||||
|
r6750 | if len(self): | ||
expected = max(0, self.end(len(self) - 1)) | ||||
|
r1667 | |||
|
r1494 | try: | ||
f = self.opener(self.datafile) | ||||
f.seek(0, 2) | ||||
actual = f.tell() | ||||
|
r13400 | f.close() | ||
|
r1667 | dd = actual - expected | ||
|
r25660 | except IOError as inst: | ||
|
r1667 | if inst.errno != errno.ENOENT: | ||
raise | ||||
dd = 0 | ||||
try: | ||||
f = self.opener(self.indexfile) | ||||
f.seek(0, 2) | ||||
actual = f.tell() | ||||
|
r13400 | f.close() | ||
|
r4977 | s = self._io.size | ||
|
r9029 | i = max(0, actual // s) | ||
|
r1667 | di = actual - (i * s) | ||
|
r4982 | if self._inline: | ||
|
r2073 | databytes = 0 | ||
|
r6750 | for r in self: | ||
|
r5312 | databytes += max(0, self.length(r)) | ||
|
r2073 | dd = 0 | ||
|
r6750 | di = actual - len(self) * s - databytes | ||
|
r25660 | except IOError as inst: | ||
|
r1667 | if inst.errno != errno.ENOENT: | ||
raise | ||||
di = 0 | ||||
return (dd, di) | ||||
|
r6891 | |||
def files(self): | ||||
|
r10282 | res = [self.indexfile] | ||
|
r6891 | if not self._inline: | ||
res.append(self.datafile) | ||||
return res | ||||