parsers.py
181 lines
| 5.5 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 | |||
|
r31220 | if pycompat.ispy3: | ||
long = int | ||||
|
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 | ||||
|
r29133 | indexformatng = ">Qiiiiii20s12x" | ||
indexfirst = struct.calcsize('Q') | ||||
sizeint = struct.calcsize('i') | ||||
indexsize = struct.calcsize(indexformatng) | ||||
def gettype(q): | ||||
return int(q & 0xFFFF) | ||||
|
r7945 | |||
|
r29133 | def offset_type(offset, type): | ||
return long(long(offset) << 16 | type) | ||||
class BaseIndexObject(object): | ||||
def __len__(self): | ||||
return self._lgt + len(self._extra) + 1 | ||||
def insert(self, i, tup): | ||||
assert i == -1 | ||||
self._extra.append(tup) | ||||
|
r7945 | |||
|
r29133 | def _fix_index(self, i): | ||
if not isinstance(i, int): | ||||
raise TypeError("expecting int indexes") | ||||
if i < 0: | ||||
i = len(self) + i | ||||
if i < 0 or i >= len(self): | ||||
raise IndexError | ||||
return i | ||||
|
r7945 | |||
|
r29133 | def __getitem__(self, i): | ||
i = self._fix_index(i) | ||||
if i == len(self) - 1: | ||||
return (0, 0, 0, -1, -1, -1, -1, nullid) | ||||
if i >= self._lgt: | ||||
return self._extra[i - self._lgt] | ||||
index = self._calculate_index(i) | ||||
r = struct.unpack(indexformatng, self._data[index:index + indexsize]) | ||||
if i == 0: | ||||
e = list(r) | ||||
type = gettype(e[0]) | ||||
e[0] = offset_type(0, type) | ||||
return tuple(e) | ||||
return r | ||||
class IndexObject(BaseIndexObject): | ||||
def __init__(self, data): | ||||
assert len(data) % indexsize == 0 | ||||
self._data = data | ||||
self._lgt = len(data) // indexsize | ||||
self._extra = [] | ||||
def _calculate_index(self, i): | ||||
return i * indexsize | ||||
|
r13253 | |||
|
r29133 | def __delitem__(self, i): | ||
if not isinstance(i, slice) or not i.stop == -1 or not i.step is None: | ||||
raise ValueError("deleting slices only supports a:-1 with step 1") | ||||
i = self._fix_index(i.start) | ||||
if i < self._lgt: | ||||
self._data = self._data[:i * indexsize] | ||||
self._lgt = i | ||||
self._extra = [] | ||||
else: | ||||
self._extra = self._extra[:i - self._lgt] | ||||
class InlinedIndexObject(BaseIndexObject): | ||||
def __init__(self, data, inline=0): | ||||
self._data = data | ||||
self._lgt = self._inline_scan(None) | ||||
self._inline_scan(self._lgt) | ||||
self._extra = [] | ||||
|
r7700 | |||
|
r29133 | def _inline_scan(self, lgt): | ||
off = 0 | ||||
if lgt is not None: | ||||
self._offsets = [0] * lgt | ||||
count = 0 | ||||
while off <= len(self._data) - indexsize: | ||||
s, = struct.unpack('>i', | ||||
self._data[off + indexfirst:off + sizeint + indexfirst]) | ||||
if lgt is not None: | ||||
self._offsets[count] = off | ||||
count += 1 | ||||
off += indexsize + s | ||||
if off != len(self._data): | ||||
raise ValueError("corrupted data") | ||||
return count | ||||
|
r14421 | |||
|
r29133 | def __delitem__(self, i): | ||
if not isinstance(i, slice) or not i.stop == -1 or not i.step is None: | ||||
raise ValueError("deleting slices only supports a:-1 with step 1") | ||||
i = self._fix_index(i.start) | ||||
if i < self._lgt: | ||||
self._offsets = self._offsets[:i] | ||||
self._lgt = i | ||||
self._extra = [] | ||||
else: | ||||
self._extra = self._extra[:i - self._lgt] | ||||
|
r7700 | |||
|
r29133 | def _calculate_index(self, i): | ||
return self._offsets[i] | ||||
|
r7700 | |||
|
r29133 | def parse_index2(data, inline): | ||
if not inline: | ||||
return IndexObject(data), None | ||||
return InlinedIndexObject(data, inline), (0, data) | ||||
|
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() | ||||