##// END OF EJS Templates
pure parsers: properly detect corrupt index files...
Augie Fackler -
r14421:639f26ca default
parent child Browse files
Show More
@@ -1,88 +1,91
1 1 # parsers.py - Python implementation of parsers.c
2 2 #
3 3 # Copyright 2009 Matt Mackall <mpm@selenic.com> and others
4 4 #
5 5 # This software may be used and distributed according to the terms of the
6 6 # GNU General Public License version 2 or any later version.
7 7
8 8 from mercurial.node import bin, nullid
9 9 from mercurial import util
10 10 import struct, zlib
11 11
12 12 _pack = struct.pack
13 13 _unpack = struct.unpack
14 14 _compress = zlib.compress
15 15 _decompress = zlib.decompress
16 16 _sha = util.sha1
17 17
18 18 def parse_manifest(mfdict, fdict, lines):
19 19 for l in lines.splitlines():
20 20 f, n = l.split('\0')
21 21 if len(n) > 40:
22 22 fdict[f] = n[40:]
23 23 mfdict[f] = bin(n[:40])
24 24 else:
25 25 mfdict[f] = bin(n)
26 26
27 27 def parse_index2(data, inline):
28 28 def gettype(q):
29 29 return int(q & 0xFFFF)
30 30
31 31 def offset_type(offset, type):
32 32 return long(long(offset) << 16 | type)
33 33
34 34 indexformatng = ">Qiiiiii20s12x"
35 35
36 36 s = struct.calcsize(indexformatng)
37 37 index = []
38 38 cache = None
39 39 n = off = 0
40 40
41 41 l = len(data) - s
42 42 append = index.append
43 43 if inline:
44 44 cache = (0, data)
45 45 while off <= l:
46 46 e = _unpack(indexformatng, data[off:off + s])
47 47 append(e)
48 48 n += 1
49 49 if e[1] < 0:
50 50 break
51 51 off += e[1] + s
52 52 else:
53 53 while off <= l:
54 54 e = _unpack(indexformatng, data[off:off + s])
55 55 append(e)
56 56 n += 1
57 57 off += s
58 58
59 if off != len(data):
60 raise ValueError('corrupt index file')
61
59 62 if index:
60 63 e = list(index[0])
61 64 type = gettype(e[0])
62 65 e[0] = offset_type(0, type)
63 66 index[0] = tuple(e)
64 67
65 68 # add the magic null revision at -1
66 69 index.append((0, 0, 0, -1, -1, -1, -1, nullid))
67 70
68 71 return index, cache
69 72
70 73 def parse_dirstate(dmap, copymap, st):
71 74 parents = [st[:20], st[20: 40]]
72 75 # deref fields so they will be local in loop
73 76 format = ">cllll"
74 77 e_size = struct.calcsize(format)
75 78 pos1 = 40
76 79 l = len(st)
77 80
78 81 # the inner loop
79 82 while pos1 < l:
80 83 pos2 = pos1 + e_size
81 84 e = _unpack(">cllll", st[pos1:pos2]) # a literal here is faster
82 85 pos1 = pos2 + e[4]
83 86 f = st[pos2:pos1]
84 87 if '\0' in f:
85 88 f, c = f.split('\0')
86 89 copymap[f] = c
87 90 dmap[f] = e[:4]
88 91 return parents
General Comments 0
You need to be logged in to leave comments. Login now