parsers.py
87 lines
| 2.1 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 | |||
|
r7945 | from mercurial.node import bin, nullid, nullrev | ||
from mercurial import util | ||||
import struct, zlib | ||||
|
r7700 | |||
_pack = struct.pack | ||||
_unpack = struct.unpack | ||||
_compress = zlib.compress | ||||
_decompress = zlib.decompress | ||||
_sha = util.sha1 | ||||
def parse_manifest(mfdict, fdict, lines): | ||||
for l in lines.splitlines(): | ||||
f, n = l.split('\0') | ||||
if len(n) > 40: | ||||
fdict[f] = n[40:] | ||||
mfdict[f] = bin(n[:40]) | ||||
else: | ||||
mfdict[f] = bin(n) | ||||
|
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 | ||||
n = 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) | ||||
n += 1 | ||||
if e[1] < 0: | ||||
break | ||||
off += e[1] + s | ||||
else: | ||||
while off <= l: | ||||
e = _unpack(indexformatng, data[off:off + s]) | ||||
append(e) | ||||
n += 1 | ||||
off += s | ||||
e = list(index[0]) | ||||
|
r7945 | type = gettype(e[0]) | ||
e[0] = offset_type(0, type) | ||||
|
r7700 | index[0] = tuple(e) | ||
# 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]] | ||||
# deref 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 | ||||