filelog.py
90 lines
| 2.6 KiB
| text/x-python
|
PythonLexer
/ mercurial / filelog.py
|
r1089 | # filelog.py - file history class for mercurial | ||
# | ||||
|
r4635 | # Copyright 2005-2007 Matt Mackall <mpm@selenic.com> | ||
|
r1089 | # | ||
|
r8225 | # This software may be used and distributed according to the terms of the | ||
|
r10263 | # GNU General Public License version 2 or any later version. | ||
|
r1089 | |||
|
r7634 | import revlog | ||
|
r14074 | import re | ||
|
r1089 | |||
|
r14074 | _mdre = re.compile('\1\n') | ||
|
r22421 | def parsemeta(text): | ||
|
r14074 | """return (metadatadict, keylist, metadatasize)""" | ||
# text can be buffer, so we can't use .startswith or .index | ||||
if text[:2] != '\1\n': | ||||
|
r22422 | return None, None | ||
|
r14074 | s = _mdre.search(text, 2).start() | ||
mtext = text[2:s] | ||||
meta = {} | ||||
for l in mtext.splitlines(): | ||||
|
r13240 | k, v = l.split(": ", 1) | ||
|
r14074 | meta[k] = v | ||
|
r22422 | return meta, (s + 2) | ||
|
r14074 | |||
|
r22420 | def packmeta(meta, text): | ||
keys = sorted(meta.iterkeys()) | ||||
metatext = "".join("%s: %s\n" % (k, meta[k]) for k in keys) | ||||
return "\1\n%s\1\n%s" % (metatext, text) | ||||
|
r13240 | |||
|
r7634 | class filelog(revlog.revlog): | ||
|
r4258 | def __init__(self, opener, path): | ||
|
r19148 | super(filelog, self).__init__(opener, | ||
|
r8531 | "/".join(("data", path + ".i"))) | ||
|
r1089 | |||
def read(self, node): | ||||
t = self.revision(node) | ||||
if not t.startswith('\1\n'): | ||||
return t | ||||
|
r2579 | s = t.index('\1\n', 2) | ||
|
r10282 | return t[s + 2:] | ||
|
r1089 | |||
def add(self, text, meta, transaction, link, p1=None, p2=None): | ||||
if meta or text.startswith('\1\n'): | ||||
|
r22420 | text = packmeta(meta, text) | ||
|
r1089 | return self.addrevision(text, transaction, link, p1, p2) | ||
|
r1116 | def renamed(self, node): | ||
|
r7634 | if self.parents(node)[0] != revlog.nullid: | ||
|
r1116 | return False | ||
|
r13240 | t = self.revision(node) | ||
|
r22421 | m = parsemeta(t)[0] | ||
|
r5915 | if m and "copy" in m: | ||
|
r7634 | return (m["copy"], revlog.bin(m["copyrev"])) | ||
|
r1116 | return False | ||
|
r2898 | def size(self, rev): | ||
"""return the size of a given revision""" | ||||
# for revisions with renames, we have to go the slow way | ||||
node = self.node(rev) | ||||
if self.renamed(node): | ||||
return len(self.read(node)) | ||||
|
r11540 | # XXX if self.read(node).startswith("\1\n"), this returns (size+4) | ||
|
r19148 | return super(filelog, self).size(rev) | ||
|
r2898 | |||
|
r2887 | def cmp(self, node, text): | ||
|
r11539 | """compare text with a given file revision | ||
returns True if text is different than what is stored. | ||||
""" | ||||
|
r2887 | |||
|
r11541 | t = text | ||
if text.startswith('\1\n'): | ||||
t = '\1\n\1\n' + text | ||||
|
r19148 | samehashes = not super(filelog, self).cmp(node, t) | ||
|
r11541 | if samehashes: | ||
return False | ||||
# renaming a file produces a different hash, even if the data | ||||
# remains unchanged. Check if it's the case (slow): | ||||
if self.renamed(node): | ||||
|
r2887 | t2 = self.read(node) | ||
|
r2895 | return t2 != text | ||
|
r2887 | |||
|
r11541 | return True | ||
|
r14287 | |||
def _file(self, f): | ||||
return filelog(self.opener, f) | ||||