parsers.py
116 lines
| 3.3 KiB
| text/x-python
|
PythonLexer
|
r7700 | # parsers.py - Python implementation of parsers.c | ||
# | ||||
# Copyright 2009 Matt Mackall <mpm@selenic.com> and others | ||||
# | ||||
|
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. | ||
|
r7700 | |||
|
r27339 | from __future__ import absolute_import | ||
import struct | ||||
import zlib | ||||
from .node import nullid | ||||
|
r28861 | from . import pycompat | ||
stringio = pycompat.stringio | ||||
|
r7700 | |||
_pack = struct.pack | ||||
_unpack = struct.unpack | ||||
_compress = zlib.compress | ||||
_decompress = zlib.decompress | ||||
|
r21809 | # Some code below makes tuples directly because it's more convenient. However, | ||
# code outside this module should always use dirstatetuple. | ||||
def dirstatetuple(*x): | ||||
# x is a tuple | ||||
return x | ||||
|
r13261 | def parse_index2(data, inline): | ||
|
r7945 | def gettype(q): | ||
return int(q & 0xFFFF) | ||||
def offset_type(offset, type): | ||||
return long(long(offset) << 16 | type) | ||||
indexformatng = ">Qiiiiii20s12x" | ||||
|
r7700 | s = struct.calcsize(indexformatng) | ||
index = [] | ||||
cache = None | ||||
|
r14995 | off = 0 | ||
|
r13253 | |||
|
r7700 | l = len(data) - s | ||
append = index.append | ||||
if inline: | ||||
cache = (0, data) | ||||
while off <= l: | ||||
e = _unpack(indexformatng, data[off:off + s]) | ||||
append(e) | ||||
if e[1] < 0: | ||||
break | ||||
off += e[1] + s | ||||
else: | ||||
while off <= l: | ||||
e = _unpack(indexformatng, data[off:off + s]) | ||||
append(e) | ||||
off += s | ||||
|
r14421 | if off != len(data): | ||
raise ValueError('corrupt index file') | ||||
|
r13435 | if index: | ||
e = list(index[0]) | ||||
type = gettype(e[0]) | ||||
e[0] = offset_type(0, type) | ||||
index[0] = tuple(e) | ||||
|
r7700 | |||
# add the magic null revision at -1 | ||||
index.append((0, 0, 0, -1, -1, -1, -1, nullid)) | ||||
|
r13261 | return index, cache | ||
|
r7700 | |||
def parse_dirstate(dmap, copymap, st): | ||||
parents = [st[:20], st[20: 40]] | ||||
|
r17425 | # dereference fields so they will be local in loop | ||
|
r7945 | format = ">cllll" | ||
e_size = struct.calcsize(format) | ||||
|
r7700 | pos1 = 40 | ||
l = len(st) | ||||
# the inner loop | ||||
while pos1 < l: | ||||
pos2 = pos1 + e_size | ||||
e = _unpack(">cllll", st[pos1:pos2]) # a literal here is faster | ||||
pos1 = pos2 + e[4] | ||||
f = st[pos2:pos1] | ||||
if '\0' in f: | ||||
f, c = f.split('\0') | ||||
copymap[f] = c | ||||
dmap[f] = e[:4] | ||||
return parents | ||||
|
r18567 | |||
def pack_dirstate(dmap, copymap, pl, now): | ||||
now = int(now) | ||||
|
r28861 | cs = stringio() | ||
|
r18567 | write = cs.write | ||
write("".join(pl)) | ||||
for f, e in dmap.iteritems(): | ||||
if e[0] == 'n' and e[3] == now: | ||||
# The file was last modified "simultaneously" with the current | ||||
# write to dirstate (i.e. within the same second for file- | ||||
# systems with a granularity of 1 sec). This commonly happens | ||||
# for at least a couple of files on 'update'. | ||||
# The user could change the file without changing its size | ||||
|
r19652 | # within the same second. Invalidate the file's mtime in | ||
|
r18567 | # dirstate, forcing future 'status' calls to compare the | ||
|
r19652 | # contents of the file if the size is the same. This prevents | ||
# mistakenly treating such files as clean. | ||||
|
r21809 | e = dirstatetuple(e[0], e[1], e[2], -1) | ||
|
r18567 | dmap[f] = e | ||
if f in copymap: | ||||
f = "%s\0%s" % (f, copymap[f]) | ||||
e = _pack(">cllll", e[0], e[1], e[2], e[3], len(f)) | ||||
write(e) | ||||
write(f) | ||||
return cs.getvalue() | ||||