Show More
@@ -1,1209 +1,1218 b'' | |||
|
1 | 1 | /* |
|
2 | 2 | parsers.c - efficient content parsing |
|
3 | 3 | |
|
4 | 4 | Copyright 2008 Matt Mackall <mpm@selenic.com> and others |
|
5 | 5 | |
|
6 | 6 | This software may be used and distributed according to the terms of |
|
7 | 7 | the GNU General Public License, incorporated herein by reference. |
|
8 | 8 | */ |
|
9 | 9 | |
|
10 | 10 | #include <Python.h> |
|
11 | 11 | #include <ctype.h> |
|
12 | 12 | #include <string.h> |
|
13 | 13 | |
|
14 | 14 | #include "util.h" |
|
15 | 15 | |
|
16 | 16 | static inline int hexdigit(const char *p, Py_ssize_t off) |
|
17 | 17 | { |
|
18 | 18 | char c = p[off]; |
|
19 | 19 | |
|
20 | 20 | if (c >= '0' && c <= '9') |
|
21 | 21 | return c - '0'; |
|
22 | 22 | if (c >= 'a' && c <= 'f') |
|
23 | 23 | return c - 'a' + 10; |
|
24 | 24 | if (c >= 'A' && c <= 'F') |
|
25 | 25 | return c - 'A' + 10; |
|
26 | 26 | |
|
27 | 27 | PyErr_SetString(PyExc_ValueError, "input contains non-hex character"); |
|
28 | 28 | return 0; |
|
29 | 29 | } |
|
30 | 30 | |
|
31 | 31 | /* |
|
32 | 32 | * Turn a hex-encoded string into binary. |
|
33 | 33 | */ |
|
34 | 34 | static PyObject *unhexlify(const char *str, int len) |
|
35 | 35 | { |
|
36 | 36 | PyObject *ret; |
|
37 | 37 | char *d; |
|
38 | 38 | int i; |
|
39 | 39 | |
|
40 | 40 | ret = PyBytes_FromStringAndSize(NULL, len / 2); |
|
41 | 41 | |
|
42 | 42 | if (!ret) |
|
43 | 43 | return NULL; |
|
44 | 44 | |
|
45 | 45 | d = PyBytes_AsString(ret); |
|
46 | 46 | |
|
47 | 47 | for (i = 0; i < len;) { |
|
48 | 48 | int hi = hexdigit(str, i++); |
|
49 | 49 | int lo = hexdigit(str, i++); |
|
50 | 50 | *d++ = (hi << 4) | lo; |
|
51 | 51 | } |
|
52 | 52 | |
|
53 | 53 | return ret; |
|
54 | 54 | } |
|
55 | 55 | |
|
56 | 56 | /* |
|
57 | 57 | * This code assumes that a manifest is stitched together with newline |
|
58 | 58 | * ('\n') characters. |
|
59 | 59 | */ |
|
60 | 60 | static PyObject *parse_manifest(PyObject *self, PyObject *args) |
|
61 | 61 | { |
|
62 | 62 | PyObject *mfdict, *fdict; |
|
63 | 63 | char *str, *cur, *start, *zero; |
|
64 | 64 | int len; |
|
65 | 65 | |
|
66 | 66 | if (!PyArg_ParseTuple(args, "O!O!s#:parse_manifest", |
|
67 | 67 | &PyDict_Type, &mfdict, |
|
68 | 68 | &PyDict_Type, &fdict, |
|
69 | 69 | &str, &len)) |
|
70 | 70 | goto quit; |
|
71 | 71 | |
|
72 | 72 | for (start = cur = str, zero = NULL; cur < str + len; cur++) { |
|
73 | 73 | PyObject *file = NULL, *node = NULL; |
|
74 | 74 | PyObject *flags = NULL; |
|
75 | 75 | int nlen; |
|
76 | 76 | |
|
77 | 77 | if (!*cur) { |
|
78 | 78 | zero = cur; |
|
79 | 79 | continue; |
|
80 | 80 | } |
|
81 | 81 | else if (*cur != '\n') |
|
82 | 82 | continue; |
|
83 | 83 | |
|
84 | 84 | if (!zero) { |
|
85 | 85 | PyErr_SetString(PyExc_ValueError, |
|
86 | 86 | "manifest entry has no separator"); |
|
87 | 87 | goto quit; |
|
88 | 88 | } |
|
89 | 89 | |
|
90 | 90 | file = PyBytes_FromStringAndSize(start, zero - start); |
|
91 | 91 | |
|
92 | 92 | if (!file) |
|
93 | 93 | goto bail; |
|
94 | 94 | |
|
95 | 95 | nlen = cur - zero - 1; |
|
96 | 96 | |
|
97 | 97 | node = unhexlify(zero + 1, nlen > 40 ? 40 : nlen); |
|
98 | 98 | if (!node) |
|
99 | 99 | goto bail; |
|
100 | 100 | |
|
101 | 101 | if (nlen > 40) { |
|
102 | 102 | flags = PyBytes_FromStringAndSize(zero + 41, |
|
103 | 103 | nlen - 40); |
|
104 | 104 | if (!flags) |
|
105 | 105 | goto bail; |
|
106 | 106 | |
|
107 | 107 | if (PyDict_SetItem(fdict, file, flags) == -1) |
|
108 | 108 | goto bail; |
|
109 | 109 | } |
|
110 | 110 | |
|
111 | 111 | if (PyDict_SetItem(mfdict, file, node) == -1) |
|
112 | 112 | goto bail; |
|
113 | 113 | |
|
114 | 114 | start = cur + 1; |
|
115 | 115 | zero = NULL; |
|
116 | 116 | |
|
117 | 117 | Py_XDECREF(flags); |
|
118 | 118 | Py_XDECREF(node); |
|
119 | 119 | Py_XDECREF(file); |
|
120 | 120 | continue; |
|
121 | 121 | bail: |
|
122 | 122 | Py_XDECREF(flags); |
|
123 | 123 | Py_XDECREF(node); |
|
124 | 124 | Py_XDECREF(file); |
|
125 | 125 | goto quit; |
|
126 | 126 | } |
|
127 | 127 | |
|
128 | 128 | if (len > 0 && *(cur - 1) != '\n') { |
|
129 | 129 | PyErr_SetString(PyExc_ValueError, |
|
130 | 130 | "manifest contains trailing garbage"); |
|
131 | 131 | goto quit; |
|
132 | 132 | } |
|
133 | 133 | |
|
134 | 134 | Py_INCREF(Py_None); |
|
135 | 135 | return Py_None; |
|
136 | 136 | quit: |
|
137 | 137 | return NULL; |
|
138 | 138 | } |
|
139 | 139 | |
|
140 | 140 | static PyObject *parse_dirstate(PyObject *self, PyObject *args) |
|
141 | 141 | { |
|
142 | 142 | PyObject *dmap, *cmap, *parents = NULL, *ret = NULL; |
|
143 | 143 | PyObject *fname = NULL, *cname = NULL, *entry = NULL; |
|
144 | 144 | char *str, *cur, *end, *cpos; |
|
145 | 145 | int state, mode, size, mtime; |
|
146 | 146 | unsigned int flen; |
|
147 | 147 | int len; |
|
148 | 148 | |
|
149 | 149 | if (!PyArg_ParseTuple(args, "O!O!s#:parse_dirstate", |
|
150 | 150 | &PyDict_Type, &dmap, |
|
151 | 151 | &PyDict_Type, &cmap, |
|
152 | 152 | &str, &len)) |
|
153 | 153 | goto quit; |
|
154 | 154 | |
|
155 | 155 | /* read parents */ |
|
156 | 156 | if (len < 40) |
|
157 | 157 | goto quit; |
|
158 | 158 | |
|
159 | 159 | parents = Py_BuildValue("s#s#", str, 20, str + 20, 20); |
|
160 | 160 | if (!parents) |
|
161 | 161 | goto quit; |
|
162 | 162 | |
|
163 | 163 | /* read filenames */ |
|
164 | 164 | cur = str + 40; |
|
165 | 165 | end = str + len; |
|
166 | 166 | |
|
167 | 167 | while (cur < end - 17) { |
|
168 | 168 | /* unpack header */ |
|
169 | 169 | state = *cur; |
|
170 | 170 | mode = getbe32(cur + 1); |
|
171 | 171 | size = getbe32(cur + 5); |
|
172 | 172 | mtime = getbe32(cur + 9); |
|
173 | 173 | flen = getbe32(cur + 13); |
|
174 | 174 | cur += 17; |
|
175 | 175 | if (cur + flen > end || cur + flen < cur) { |
|
176 | 176 | PyErr_SetString(PyExc_ValueError, "overflow in dirstate"); |
|
177 | 177 | goto quit; |
|
178 | 178 | } |
|
179 | 179 | |
|
180 | 180 | entry = Py_BuildValue("ciii", state, mode, size, mtime); |
|
181 | 181 | if (!entry) |
|
182 | 182 | goto quit; |
|
183 | 183 | PyObject_GC_UnTrack(entry); /* don't waste time with this */ |
|
184 | 184 | |
|
185 | 185 | cpos = memchr(cur, 0, flen); |
|
186 | 186 | if (cpos) { |
|
187 | 187 | fname = PyBytes_FromStringAndSize(cur, cpos - cur); |
|
188 | 188 | cname = PyBytes_FromStringAndSize(cpos + 1, |
|
189 | 189 | flen - (cpos - cur) - 1); |
|
190 | 190 | if (!fname || !cname || |
|
191 | 191 | PyDict_SetItem(cmap, fname, cname) == -1 || |
|
192 | 192 | PyDict_SetItem(dmap, fname, entry) == -1) |
|
193 | 193 | goto quit; |
|
194 | 194 | Py_DECREF(cname); |
|
195 | 195 | } else { |
|
196 | 196 | fname = PyBytes_FromStringAndSize(cur, flen); |
|
197 | 197 | if (!fname || |
|
198 | 198 | PyDict_SetItem(dmap, fname, entry) == -1) |
|
199 | 199 | goto quit; |
|
200 | 200 | } |
|
201 | 201 | cur += flen; |
|
202 | 202 | Py_DECREF(fname); |
|
203 | 203 | Py_DECREF(entry); |
|
204 | 204 | fname = cname = entry = NULL; |
|
205 | 205 | } |
|
206 | 206 | |
|
207 | 207 | ret = parents; |
|
208 | 208 | Py_INCREF(ret); |
|
209 | 209 | quit: |
|
210 | 210 | Py_XDECREF(fname); |
|
211 | 211 | Py_XDECREF(cname); |
|
212 | 212 | Py_XDECREF(entry); |
|
213 | 213 | Py_XDECREF(parents); |
|
214 | 214 | return ret; |
|
215 | 215 | } |
|
216 | 216 | |
|
217 | 217 | /* |
|
218 | 218 | * A base-16 trie for fast node->rev mapping. |
|
219 | 219 | * |
|
220 | 220 | * Positive value is index of the next node in the trie |
|
221 | 221 | * Negative value is a leaf: -(rev + 1) |
|
222 | 222 | * Zero is empty |
|
223 | 223 | */ |
|
224 | 224 | typedef struct { |
|
225 | 225 | int children[16]; |
|
226 | 226 | } nodetree; |
|
227 | 227 | |
|
228 | 228 | /* |
|
229 | 229 | * This class has two behaviours. |
|
230 | 230 | * |
|
231 | 231 | * When used in a list-like way (with integer keys), we decode an |
|
232 | 232 | * entry in a RevlogNG index file on demand. Our last entry is a |
|
233 | 233 | * sentinel, always a nullid. We have limited support for |
|
234 | 234 | * integer-keyed insert and delete, only at elements right before the |
|
235 | 235 | * sentinel. |
|
236 | 236 | * |
|
237 | 237 | * With string keys, we lazily perform a reverse mapping from node to |
|
238 | 238 | * rev, using a base-16 trie. |
|
239 | 239 | */ |
|
240 | 240 | typedef struct { |
|
241 | 241 | PyObject_HEAD |
|
242 | 242 | /* Type-specific fields go here. */ |
|
243 | 243 | PyObject *data; /* raw bytes of index */ |
|
244 | 244 | PyObject **cache; /* cached tuples */ |
|
245 | 245 | const char **offsets; /* populated on demand */ |
|
246 | 246 | Py_ssize_t raw_length; /* original number of elements */ |
|
247 | 247 | Py_ssize_t length; /* current number of elements */ |
|
248 | 248 | PyObject *added; /* populated on demand */ |
|
249 | 249 | nodetree *nt; /* base-16 trie */ |
|
250 | 250 | int ntlength; /* # nodes in use */ |
|
251 | 251 | int ntcapacity; /* # nodes allocated */ |
|
252 | 252 | int ntdepth; /* maximum depth of tree */ |
|
253 | 253 | int ntsplits; /* # splits performed */ |
|
254 | 254 | int ntrev; /* last rev scanned */ |
|
255 | 255 | int ntlookups; /* # lookups */ |
|
256 | 256 | int ntmisses; /* # lookups that miss the cache */ |
|
257 | 257 | int inlined; |
|
258 | 258 | } indexObject; |
|
259 | 259 | |
|
260 | 260 | static Py_ssize_t index_length(const indexObject *self) |
|
261 | 261 | { |
|
262 | 262 | if (self->added == NULL) |
|
263 | 263 | return self->length; |
|
264 | 264 | return self->length + PyList_GET_SIZE(self->added); |
|
265 | 265 | } |
|
266 | 266 | |
|
267 | 267 | static PyObject *nullentry; |
|
268 | 268 | static const char nullid[20]; |
|
269 | 269 | |
|
270 | 270 | static long inline_scan(indexObject *self, const char **offsets); |
|
271 | 271 | |
|
272 | 272 | #if LONG_MAX == 0x7fffffffL |
|
273 | 273 | static char *tuple_format = "Kiiiiiis#"; |
|
274 | 274 | #else |
|
275 | 275 | static char *tuple_format = "kiiiiiis#"; |
|
276 | 276 | #endif |
|
277 | 277 | |
|
278 | 278 | /* |
|
279 | 279 | * Return a pointer to the beginning of a RevlogNG record. |
|
280 | 280 | */ |
|
281 | 281 | static const char *index_deref(indexObject *self, Py_ssize_t pos) |
|
282 | 282 | { |
|
283 | 283 | if (self->inlined && pos > 0) { |
|
284 | 284 | if (self->offsets == NULL) { |
|
285 | 285 | self->offsets = malloc(self->raw_length * |
|
286 | 286 | sizeof(*self->offsets)); |
|
287 | 287 | if (self->offsets == NULL) |
|
288 | 288 | return (const char *)PyErr_NoMemory(); |
|
289 | 289 | inline_scan(self, self->offsets); |
|
290 | 290 | } |
|
291 | 291 | return self->offsets[pos]; |
|
292 | 292 | } |
|
293 | 293 | |
|
294 | 294 | return PyString_AS_STRING(self->data) + pos * 64; |
|
295 | 295 | } |
|
296 | 296 | |
|
297 | 297 | /* |
|
298 | 298 | * RevlogNG format (all in big endian, data may be inlined): |
|
299 | 299 | * 6 bytes: offset |
|
300 | 300 | * 2 bytes: flags |
|
301 | 301 | * 4 bytes: compressed length |
|
302 | 302 | * 4 bytes: uncompressed length |
|
303 | 303 | * 4 bytes: base revision |
|
304 | 304 | * 4 bytes: link revision |
|
305 | 305 | * 4 bytes: parent 1 revision |
|
306 | 306 | * 4 bytes: parent 2 revision |
|
307 | 307 | * 32 bytes: nodeid (only 20 bytes used) |
|
308 | 308 | */ |
|
309 | 309 | static PyObject *index_get(indexObject *self, Py_ssize_t pos) |
|
310 | 310 | { |
|
311 | 311 | uint64_t offset_flags; |
|
312 | 312 | int comp_len, uncomp_len, base_rev, link_rev, parent_1, parent_2; |
|
313 | 313 | const char *c_node_id; |
|
314 | 314 | const char *data; |
|
315 | 315 | Py_ssize_t length = index_length(self); |
|
316 | 316 | PyObject *entry; |
|
317 | 317 | |
|
318 | 318 | if (pos < 0) |
|
319 | 319 | pos += length; |
|
320 | 320 | |
|
321 | 321 | if (pos < 0 || pos >= length) { |
|
322 | 322 | PyErr_SetString(PyExc_IndexError, "revlog index out of range"); |
|
323 | 323 | return NULL; |
|
324 | 324 | } |
|
325 | 325 | |
|
326 | 326 | if (pos == length - 1) { |
|
327 | 327 | Py_INCREF(nullentry); |
|
328 | 328 | return nullentry; |
|
329 | 329 | } |
|
330 | 330 | |
|
331 | 331 | if (pos >= self->length - 1) { |
|
332 | 332 | PyObject *obj; |
|
333 | 333 | obj = PyList_GET_ITEM(self->added, pos - self->length + 1); |
|
334 | 334 | Py_INCREF(obj); |
|
335 | 335 | return obj; |
|
336 | 336 | } |
|
337 | 337 | |
|
338 | 338 | if (self->cache) { |
|
339 | 339 | if (self->cache[pos]) { |
|
340 | 340 | Py_INCREF(self->cache[pos]); |
|
341 | 341 | return self->cache[pos]; |
|
342 | 342 | } |
|
343 | 343 | } else { |
|
344 | 344 | self->cache = calloc(self->raw_length, sizeof(PyObject *)); |
|
345 | 345 | if (self->cache == NULL) |
|
346 | 346 | return PyErr_NoMemory(); |
|
347 | 347 | } |
|
348 | 348 | |
|
349 | 349 | data = index_deref(self, pos); |
|
350 | 350 | if (data == NULL) |
|
351 | 351 | return NULL; |
|
352 | 352 | |
|
353 | 353 | offset_flags = getbe32(data + 4); |
|
354 | 354 | if (pos == 0) /* mask out version number for the first entry */ |
|
355 | 355 | offset_flags &= 0xFFFF; |
|
356 | 356 | else { |
|
357 | 357 | uint32_t offset_high = getbe32(data); |
|
358 | 358 | offset_flags |= ((uint64_t)offset_high) << 32; |
|
359 | 359 | } |
|
360 | 360 | |
|
361 | 361 | comp_len = getbe32(data + 8); |
|
362 | 362 | uncomp_len = getbe32(data + 12); |
|
363 | 363 | base_rev = getbe32(data + 16); |
|
364 | 364 | link_rev = getbe32(data + 20); |
|
365 | 365 | parent_1 = getbe32(data + 24); |
|
366 | 366 | parent_2 = getbe32(data + 28); |
|
367 | 367 | c_node_id = data + 32; |
|
368 | 368 | |
|
369 | 369 | entry = Py_BuildValue(tuple_format, offset_flags, comp_len, |
|
370 | 370 | uncomp_len, base_rev, link_rev, |
|
371 | 371 | parent_1, parent_2, c_node_id, 20); |
|
372 | 372 | |
|
373 | 373 | if (entry) |
|
374 | 374 | PyObject_GC_UnTrack(entry); |
|
375 | 375 | |
|
376 | 376 | self->cache[pos] = entry; |
|
377 | 377 | Py_INCREF(entry); |
|
378 | 378 | |
|
379 | 379 | return entry; |
|
380 | 380 | } |
|
381 | 381 | |
|
382 | 382 | /* |
|
383 | 383 | * Return the 20-byte SHA of the node corresponding to the given rev. |
|
384 | 384 | */ |
|
385 | 385 | static const char *index_node(indexObject *self, Py_ssize_t pos) |
|
386 | 386 | { |
|
387 | 387 | Py_ssize_t length = index_length(self); |
|
388 | 388 | const char *data; |
|
389 | 389 | |
|
390 | 390 | if (pos == length - 1) |
|
391 | 391 | return nullid; |
|
392 | 392 | |
|
393 | 393 | if (pos >= length) |
|
394 | 394 | return NULL; |
|
395 | 395 | |
|
396 | 396 | if (pos >= self->length - 1) { |
|
397 | 397 | PyObject *tuple, *str; |
|
398 | 398 | tuple = PyList_GET_ITEM(self->added, pos - self->length + 1); |
|
399 | 399 | str = PyTuple_GetItem(tuple, 7); |
|
400 | 400 | return str ? PyString_AS_STRING(str) : NULL; |
|
401 | 401 | } |
|
402 | 402 | |
|
403 | 403 | data = index_deref(self, pos); |
|
404 | 404 | return data ? data + 32 : NULL; |
|
405 | 405 | } |
|
406 | 406 | |
|
407 | 407 | static int nt_insert(indexObject *self, const char *node, int rev); |
|
408 | 408 | |
|
409 | 409 | static int node_check(PyObject *obj, char **node, Py_ssize_t *nodelen) |
|
410 | 410 | { |
|
411 | 411 | if (PyString_AsStringAndSize(obj, node, nodelen) == -1) |
|
412 | 412 | return -1; |
|
413 | 413 | if (*nodelen == 20) |
|
414 | 414 | return 0; |
|
415 | 415 | PyErr_SetString(PyExc_ValueError, "20-byte hash required"); |
|
416 | 416 | return -1; |
|
417 | 417 | } |
|
418 | 418 | |
|
419 | 419 | static PyObject *index_insert(indexObject *self, PyObject *args) |
|
420 | 420 | { |
|
421 | 421 | PyObject *obj; |
|
422 | 422 | char *node; |
|
423 | 423 | long offset; |
|
424 | 424 | Py_ssize_t len, nodelen; |
|
425 | 425 | |
|
426 | 426 | if (!PyArg_ParseTuple(args, "lO", &offset, &obj)) |
|
427 | 427 | return NULL; |
|
428 | 428 | |
|
429 | 429 | if (!PyTuple_Check(obj) || PyTuple_GET_SIZE(obj) != 8) { |
|
430 | 430 | PyErr_SetString(PyExc_TypeError, "8-tuple required"); |
|
431 | 431 | return NULL; |
|
432 | 432 | } |
|
433 | 433 | |
|
434 | 434 | if (node_check(PyTuple_GET_ITEM(obj, 7), &node, &nodelen) == -1) |
|
435 | 435 | return NULL; |
|
436 | 436 | |
|
437 | 437 | len = index_length(self); |
|
438 | 438 | |
|
439 | 439 | if (offset < 0) |
|
440 | 440 | offset += len; |
|
441 | 441 | |
|
442 | 442 | if (offset != len - 1) { |
|
443 | 443 | PyErr_SetString(PyExc_IndexError, |
|
444 | 444 | "insert only supported at index -1"); |
|
445 | 445 | return NULL; |
|
446 | 446 | } |
|
447 | 447 | |
|
448 | 448 | if (offset > INT_MAX) { |
|
449 | 449 | PyErr_SetString(PyExc_ValueError, |
|
450 | 450 | "currently only 2**31 revs supported"); |
|
451 | 451 | return NULL; |
|
452 | 452 | } |
|
453 | 453 | |
|
454 | 454 | if (self->added == NULL) { |
|
455 | 455 | self->added = PyList_New(0); |
|
456 | 456 | if (self->added == NULL) |
|
457 | 457 | return NULL; |
|
458 | 458 | } |
|
459 | 459 | |
|
460 | 460 | if (PyList_Append(self->added, obj) == -1) |
|
461 | 461 | return NULL; |
|
462 | 462 | |
|
463 | 463 | if (self->nt) |
|
464 | 464 | nt_insert(self, node, (int)offset); |
|
465 | 465 | |
|
466 | 466 | Py_RETURN_NONE; |
|
467 | 467 | } |
|
468 | 468 | |
|
469 | 469 | static void _index_clearcaches(indexObject *self) |
|
470 | 470 | { |
|
471 | 471 | if (self->cache) { |
|
472 | 472 | Py_ssize_t i; |
|
473 | 473 | |
|
474 | 474 | for (i = 0; i < self->raw_length; i++) { |
|
475 | 475 | if (self->cache[i]) { |
|
476 | 476 | Py_DECREF(self->cache[i]); |
|
477 | 477 | self->cache[i] = NULL; |
|
478 | 478 | } |
|
479 | 479 | } |
|
480 | 480 | free(self->cache); |
|
481 | 481 | self->cache = NULL; |
|
482 | 482 | } |
|
483 | 483 | if (self->offsets) { |
|
484 | 484 | free(self->offsets); |
|
485 | 485 | self->offsets = NULL; |
|
486 | 486 | } |
|
487 | 487 | if (self->nt) { |
|
488 | 488 | free(self->nt); |
|
489 | 489 | self->nt = NULL; |
|
490 | 490 | } |
|
491 | 491 | } |
|
492 | 492 | |
|
493 | 493 | static PyObject *index_clearcaches(indexObject *self) |
|
494 | 494 | { |
|
495 | 495 | _index_clearcaches(self); |
|
496 | 496 | self->ntlength = self->ntcapacity = 0; |
|
497 | 497 | self->ntdepth = self->ntsplits = 0; |
|
498 | 498 | self->ntrev = -1; |
|
499 | 499 | self->ntlookups = self->ntmisses = 0; |
|
500 | 500 | Py_RETURN_NONE; |
|
501 | 501 | } |
|
502 | 502 | |
|
503 | 503 | static PyObject *index_stats(indexObject *self) |
|
504 | 504 | { |
|
505 | 505 | PyObject *obj = PyDict_New(); |
|
506 | 506 | |
|
507 | 507 | if (obj == NULL) |
|
508 | 508 | return NULL; |
|
509 | 509 | |
|
510 | 510 | #define istat(__n, __d) \ |
|
511 | 511 | if (PyDict_SetItemString(obj, __d, PyInt_FromSsize_t(self->__n)) == -1) \ |
|
512 | 512 | goto bail; |
|
513 | 513 | |
|
514 | 514 | if (self->added) { |
|
515 | 515 | Py_ssize_t len = PyList_GET_SIZE(self->added); |
|
516 | 516 | if (PyDict_SetItemString(obj, "index entries added", |
|
517 | 517 | PyInt_FromSsize_t(len)) == -1) |
|
518 | 518 | goto bail; |
|
519 | 519 | } |
|
520 | 520 | |
|
521 | 521 | if (self->raw_length != self->length - 1) |
|
522 | 522 | istat(raw_length, "revs on disk"); |
|
523 | 523 | istat(length, "revs in memory"); |
|
524 | 524 | istat(ntcapacity, "node trie capacity"); |
|
525 | 525 | istat(ntdepth, "node trie depth"); |
|
526 | 526 | istat(ntlength, "node trie count"); |
|
527 | 527 | istat(ntlookups, "node trie lookups"); |
|
528 | 528 | istat(ntmisses, "node trie misses"); |
|
529 | 529 | istat(ntrev, "node trie last rev scanned"); |
|
530 | 530 | istat(ntsplits, "node trie splits"); |
|
531 | 531 | |
|
532 | 532 | #undef istat |
|
533 | 533 | |
|
534 | 534 | return obj; |
|
535 | 535 | |
|
536 | 536 | bail: |
|
537 | 537 | Py_XDECREF(obj); |
|
538 | 538 | return NULL; |
|
539 | 539 | } |
|
540 | 540 | |
|
541 | 541 | static inline int nt_level(const char *node, Py_ssize_t level) |
|
542 | 542 | { |
|
543 | 543 | int v = node[level>>1]; |
|
544 | 544 | if (!(level & 1)) |
|
545 | 545 | v >>= 4; |
|
546 | 546 | return v & 0xf; |
|
547 | 547 | } |
|
548 | 548 | |
|
549 | 549 | /* |
|
550 | 550 | * Return values: |
|
551 | 551 | * |
|
552 | 552 | * -4: match is ambiguous (multiple candidates) |
|
553 | 553 | * -2: not found |
|
554 | 554 | * rest: valid rev |
|
555 | 555 | */ |
|
556 |
static int nt_find(indexObject *self, const char *node, Py_ssize_t nodelen |
|
|
556 | static int nt_find(indexObject *self, const char *node, Py_ssize_t nodelen, | |
|
557 | int hex) | |
|
557 | 558 | { |
|
559 | int (*getnybble)(const char *, Py_ssize_t) = hex ? hexdigit : nt_level; | |
|
558 | 560 | int level, maxlevel, off; |
|
559 | 561 | |
|
560 | 562 | if (nodelen == 20 && node[0] == '\0' && memcmp(node, nullid, 20) == 0) |
|
561 | 563 | return -1; |
|
562 | 564 | |
|
563 | 565 | if (self->nt == NULL) |
|
564 | 566 | return -2; |
|
565 | 567 | |
|
566 | maxlevel = nodelen > 20 ? 40 : ((int)nodelen * 2); | |
|
568 | if (hex) | |
|
569 | maxlevel = nodelen > 40 ? 40 : nodelen; | |
|
570 | else | |
|
571 | maxlevel = nodelen > 20 ? 40 : ((int)nodelen * 2); | |
|
567 | 572 | |
|
568 | 573 | for (level = off = 0; level < maxlevel; level++) { |
|
569 |
int k = |
|
|
574 | int k = getnybble(node, level); | |
|
570 | 575 | nodetree *n = &self->nt[off]; |
|
571 | 576 | int v = n->children[k]; |
|
572 | 577 | |
|
573 | 578 | if (v < 0) { |
|
574 | 579 | const char *n; |
|
580 | Py_ssize_t i; | |
|
581 | ||
|
575 | 582 | v = -v - 1; |
|
576 | 583 | n = index_node(self, v); |
|
577 | 584 | if (n == NULL) |
|
578 | 585 | return -2; |
|
579 | return memcmp(node, n, nodelen > 20 ? 20 : nodelen) | |
|
580 | ? -2 : v; | |
|
586 | for (i = level; i < maxlevel; i++) | |
|
587 | if (getnybble(node, i) != nt_level(n, i)) | |
|
588 | return -2; | |
|
589 | return v; | |
|
581 | 590 | } |
|
582 | 591 | if (v == 0) |
|
583 | 592 | return -2; |
|
584 | 593 | off = v; |
|
585 | 594 | } |
|
586 | 595 | /* multiple matches against an ambiguous prefix */ |
|
587 | 596 | return -4; |
|
588 | 597 | } |
|
589 | 598 | |
|
590 | 599 | static int nt_new(indexObject *self) |
|
591 | 600 | { |
|
592 | 601 | if (self->ntlength == self->ntcapacity) { |
|
593 | 602 | self->ntcapacity *= 2; |
|
594 | 603 | self->nt = realloc(self->nt, |
|
595 | 604 | self->ntcapacity * sizeof(nodetree)); |
|
596 | 605 | if (self->nt == NULL) { |
|
597 | 606 | PyErr_SetString(PyExc_MemoryError, "out of memory"); |
|
598 | 607 | return -1; |
|
599 | 608 | } |
|
600 | 609 | memset(&self->nt[self->ntlength], 0, |
|
601 | 610 | sizeof(nodetree) * (self->ntcapacity - self->ntlength)); |
|
602 | 611 | } |
|
603 | 612 | return self->ntlength++; |
|
604 | 613 | } |
|
605 | 614 | |
|
606 | 615 | static int nt_insert(indexObject *self, const char *node, int rev) |
|
607 | 616 | { |
|
608 | 617 | int level = 0; |
|
609 | 618 | int off = 0; |
|
610 | 619 | |
|
611 | 620 | while (level < 40) { |
|
612 | 621 | int k = nt_level(node, level); |
|
613 | 622 | nodetree *n; |
|
614 | 623 | int v; |
|
615 | 624 | |
|
616 | 625 | n = &self->nt[off]; |
|
617 | 626 | v = n->children[k]; |
|
618 | 627 | |
|
619 | 628 | if (v == 0) { |
|
620 | 629 | n->children[k] = -rev - 1; |
|
621 | 630 | return 0; |
|
622 | 631 | } |
|
623 | 632 | if (v < 0) { |
|
624 | 633 | const char *oldnode = index_node(self, -v - 1); |
|
625 | 634 | int noff; |
|
626 | 635 | |
|
627 | 636 | if (!oldnode || !memcmp(oldnode, node, 20)) { |
|
628 | 637 | n->children[k] = -rev - 1; |
|
629 | 638 | return 0; |
|
630 | 639 | } |
|
631 | 640 | noff = nt_new(self); |
|
632 | 641 | if (noff == -1) |
|
633 | 642 | return -1; |
|
634 | 643 | /* self->nt may have been changed by realloc */ |
|
635 | 644 | self->nt[off].children[k] = noff; |
|
636 | 645 | off = noff; |
|
637 | 646 | n = &self->nt[off]; |
|
638 | 647 | n->children[nt_level(oldnode, ++level)] = v; |
|
639 | 648 | if (level > self->ntdepth) |
|
640 | 649 | self->ntdepth = level; |
|
641 | 650 | self->ntsplits += 1; |
|
642 | 651 | } else { |
|
643 | 652 | level += 1; |
|
644 | 653 | off = v; |
|
645 | 654 | } |
|
646 | 655 | } |
|
647 | 656 | |
|
648 | 657 | return -1; |
|
649 | 658 | } |
|
650 | 659 | |
|
651 | 660 | static int nt_init(indexObject *self) |
|
652 | 661 | { |
|
653 | 662 | if (self->nt == NULL) { |
|
654 | 663 | self->ntcapacity = self->raw_length < 4 |
|
655 | 664 | ? 4 : self->raw_length / 2; |
|
656 | 665 | self->nt = calloc(self->ntcapacity, sizeof(nodetree)); |
|
657 | 666 | if (self->nt == NULL) { |
|
658 | 667 | PyErr_NoMemory(); |
|
659 | 668 | return -1; |
|
660 | 669 | } |
|
661 | 670 | self->ntlength = 1; |
|
662 | 671 | self->ntrev = (int)index_length(self) - 1; |
|
663 | 672 | self->ntlookups = 1; |
|
664 | 673 | self->ntmisses = 0; |
|
665 | 674 | } |
|
666 | 675 | return 0; |
|
667 | 676 | } |
|
668 | 677 | |
|
669 | 678 | /* |
|
670 | 679 | * Return values: |
|
671 | 680 | * |
|
672 | 681 | * -3: error (exception set) |
|
673 | 682 | * -2: not found (no exception set) |
|
674 | 683 | * rest: valid rev |
|
675 | 684 | */ |
|
676 | 685 | static int index_find_node(indexObject *self, |
|
677 | 686 | const char *node, Py_ssize_t nodelen) |
|
678 | 687 | { |
|
679 | 688 | int rev; |
|
680 | 689 | |
|
681 | 690 | self->ntlookups++; |
|
682 | rev = nt_find(self, node, nodelen); | |
|
691 | rev = nt_find(self, node, nodelen, 0); | |
|
683 | 692 | if (rev >= -1) |
|
684 | 693 | return rev; |
|
685 | 694 | |
|
686 | 695 | if (nt_init(self) == -1) |
|
687 | 696 | return -3; |
|
688 | 697 | |
|
689 | 698 | /* |
|
690 | 699 | * For the first handful of lookups, we scan the entire index, |
|
691 | 700 | * and cache only the matching nodes. This optimizes for cases |
|
692 | 701 | * like "hg tip", where only a few nodes are accessed. |
|
693 | 702 | * |
|
694 | 703 | * After that, we cache every node we visit, using a single |
|
695 | 704 | * scan amortized over multiple lookups. This gives the best |
|
696 | 705 | * bulk performance, e.g. for "hg log". |
|
697 | 706 | */ |
|
698 | 707 | if (self->ntmisses++ < 4) { |
|
699 | 708 | for (rev = self->ntrev - 1; rev >= 0; rev--) { |
|
700 | 709 | const char *n = index_node(self, rev); |
|
701 | 710 | if (n == NULL) |
|
702 | 711 | return -2; |
|
703 | 712 | if (memcmp(node, n, nodelen > 20 ? 20 : nodelen) == 0) { |
|
704 | 713 | if (nt_insert(self, n, rev) == -1) |
|
705 | 714 | return -3; |
|
706 | 715 | break; |
|
707 | 716 | } |
|
708 | 717 | } |
|
709 | 718 | } else { |
|
710 | 719 | for (rev = self->ntrev - 1; rev >= 0; rev--) { |
|
711 | 720 | const char *n = index_node(self, rev); |
|
712 | 721 | if (n == NULL) { |
|
713 | 722 | self->ntrev = rev + 1; |
|
714 | 723 | return -2; |
|
715 | 724 | } |
|
716 | 725 | if (nt_insert(self, n, rev) == -1) { |
|
717 | 726 | self->ntrev = rev + 1; |
|
718 | 727 | return -3; |
|
719 | 728 | } |
|
720 | 729 | if (memcmp(node, n, nodelen > 20 ? 20 : nodelen) == 0) { |
|
721 | 730 | break; |
|
722 | 731 | } |
|
723 | 732 | } |
|
724 | 733 | self->ntrev = rev; |
|
725 | 734 | } |
|
726 | 735 | |
|
727 | 736 | if (rev >= 0) |
|
728 | 737 | return rev; |
|
729 | 738 | return -2; |
|
730 | 739 | } |
|
731 | 740 | |
|
732 | 741 | static PyObject *raise_revlog_error(void) |
|
733 | 742 | { |
|
734 | 743 | static PyObject *errclass; |
|
735 | 744 | PyObject *mod = NULL, *errobj; |
|
736 | 745 | |
|
737 | 746 | if (errclass == NULL) { |
|
738 | 747 | PyObject *dict; |
|
739 | 748 | |
|
740 | 749 | mod = PyImport_ImportModule("mercurial.error"); |
|
741 | 750 | if (mod == NULL) |
|
742 | 751 | goto classfail; |
|
743 | 752 | |
|
744 | 753 | dict = PyModule_GetDict(mod); |
|
745 | 754 | if (dict == NULL) |
|
746 | 755 | goto classfail; |
|
747 | 756 | |
|
748 | 757 | errclass = PyDict_GetItemString(dict, "RevlogError"); |
|
749 | 758 | if (errclass == NULL) { |
|
750 | 759 | PyErr_SetString(PyExc_SystemError, |
|
751 | 760 | "could not find RevlogError"); |
|
752 | 761 | goto classfail; |
|
753 | 762 | } |
|
754 | 763 | Py_INCREF(errclass); |
|
755 | 764 | } |
|
756 | 765 | |
|
757 | 766 | errobj = PyObject_CallFunction(errclass, NULL); |
|
758 | 767 | if (errobj == NULL) |
|
759 | 768 | return NULL; |
|
760 | 769 | PyErr_SetObject(errclass, errobj); |
|
761 | 770 | return errobj; |
|
762 | 771 | |
|
763 | 772 | classfail: |
|
764 | 773 | Py_XDECREF(mod); |
|
765 | 774 | return NULL; |
|
766 | 775 | } |
|
767 | 776 | |
|
768 | 777 | static PyObject *index_getitem(indexObject *self, PyObject *value) |
|
769 | 778 | { |
|
770 | 779 | char *node; |
|
771 | 780 | Py_ssize_t nodelen; |
|
772 | 781 | int rev; |
|
773 | 782 | |
|
774 | 783 | if (PyInt_Check(value)) |
|
775 | 784 | return index_get(self, PyInt_AS_LONG(value)); |
|
776 | 785 | |
|
777 | 786 | if (PyString_AsStringAndSize(value, &node, &nodelen) == -1) |
|
778 | 787 | return NULL; |
|
779 | 788 | rev = index_find_node(self, node, nodelen); |
|
780 | 789 | if (rev >= -1) |
|
781 | 790 | return PyInt_FromLong(rev); |
|
782 | 791 | if (rev == -2) |
|
783 | 792 | raise_revlog_error(); |
|
784 | 793 | return NULL; |
|
785 | 794 | } |
|
786 | 795 | |
|
787 | 796 | static PyObject *index_m_get(indexObject *self, PyObject *args) |
|
788 | 797 | { |
|
789 | 798 | char *node; |
|
790 | 799 | int nodelen, rev; |
|
791 | 800 | |
|
792 | 801 | if (!PyArg_ParseTuple(args, "s#", &node, &nodelen)) |
|
793 | 802 | return NULL; |
|
794 | 803 | |
|
795 | 804 | rev = index_find_node(self, node, nodelen); |
|
796 | 805 | if (rev == -3) |
|
797 | 806 | return NULL; |
|
798 | 807 | if (rev == -2) |
|
799 | 808 | Py_RETURN_NONE; |
|
800 | 809 | return PyInt_FromLong(rev); |
|
801 | 810 | } |
|
802 | 811 | |
|
803 | 812 | static int index_contains(indexObject *self, PyObject *value) |
|
804 | 813 | { |
|
805 | 814 | char *node; |
|
806 | 815 | Py_ssize_t nodelen; |
|
807 | 816 | |
|
808 | 817 | if (PyInt_Check(value)) { |
|
809 | 818 | long rev = PyInt_AS_LONG(value); |
|
810 | 819 | return rev >= -1 && rev < index_length(self); |
|
811 | 820 | } |
|
812 | 821 | |
|
813 | 822 | if (!PyString_Check(value)) |
|
814 | 823 | return 0; |
|
815 | 824 | |
|
816 | 825 | node = PyString_AS_STRING(value); |
|
817 | 826 | nodelen = PyString_GET_SIZE(value); |
|
818 | 827 | |
|
819 | 828 | switch (index_find_node(self, node, nodelen)) { |
|
820 | 829 | case -3: |
|
821 | 830 | return -1; |
|
822 | 831 | case -2: |
|
823 | 832 | return 0; |
|
824 | 833 | default: |
|
825 | 834 | return 1; |
|
826 | 835 | } |
|
827 | 836 | } |
|
828 | 837 | |
|
829 | 838 | /* |
|
830 | 839 | * Invalidate any trie entries introduced by added revs. |
|
831 | 840 | */ |
|
832 | 841 | static void nt_invalidate_added(indexObject *self, Py_ssize_t start) |
|
833 | 842 | { |
|
834 | 843 | Py_ssize_t i, len = PyList_GET_SIZE(self->added); |
|
835 | 844 | |
|
836 | 845 | for (i = start; i < len; i++) { |
|
837 | 846 | PyObject *tuple = PyList_GET_ITEM(self->added, i); |
|
838 | 847 | PyObject *node = PyTuple_GET_ITEM(tuple, 7); |
|
839 | 848 | |
|
840 | 849 | nt_insert(self, PyString_AS_STRING(node), -1); |
|
841 | 850 | } |
|
842 | 851 | |
|
843 | 852 | if (start == 0) { |
|
844 | 853 | Py_DECREF(self->added); |
|
845 | 854 | self->added = NULL; |
|
846 | 855 | } |
|
847 | 856 | } |
|
848 | 857 | |
|
849 | 858 | /* |
|
850 | 859 | * Delete a numeric range of revs, which must be at the end of the |
|
851 | 860 | * range, but exclude the sentinel nullid entry. |
|
852 | 861 | */ |
|
853 | 862 | static int index_slice_del(indexObject *self, PyObject *item) |
|
854 | 863 | { |
|
855 | 864 | Py_ssize_t start, stop, step, slicelength; |
|
856 | 865 | Py_ssize_t length = index_length(self); |
|
857 | 866 | |
|
858 | 867 | if (PySlice_GetIndicesEx((PySliceObject*)item, length, |
|
859 | 868 | &start, &stop, &step, &slicelength) < 0) |
|
860 | 869 | return -1; |
|
861 | 870 | |
|
862 | 871 | if (slicelength <= 0) |
|
863 | 872 | return 0; |
|
864 | 873 | |
|
865 | 874 | if ((step < 0 && start < stop) || (step > 0 && start > stop)) |
|
866 | 875 | stop = start; |
|
867 | 876 | |
|
868 | 877 | if (step < 0) { |
|
869 | 878 | stop = start + 1; |
|
870 | 879 | start = stop + step*(slicelength - 1) - 1; |
|
871 | 880 | step = -step; |
|
872 | 881 | } |
|
873 | 882 | |
|
874 | 883 | if (step != 1) { |
|
875 | 884 | PyErr_SetString(PyExc_ValueError, |
|
876 | 885 | "revlog index delete requires step size of 1"); |
|
877 | 886 | return -1; |
|
878 | 887 | } |
|
879 | 888 | |
|
880 | 889 | if (stop != length - 1) { |
|
881 | 890 | PyErr_SetString(PyExc_IndexError, |
|
882 | 891 | "revlog index deletion indices are invalid"); |
|
883 | 892 | return -1; |
|
884 | 893 | } |
|
885 | 894 | |
|
886 | 895 | if (start < self->length - 1) { |
|
887 | 896 | if (self->nt) { |
|
888 | 897 | Py_ssize_t i; |
|
889 | 898 | |
|
890 | 899 | for (i = start + 1; i < self->length - 1; i++) { |
|
891 | 900 | const char *node = index_node(self, i); |
|
892 | 901 | |
|
893 | 902 | if (node) |
|
894 | 903 | nt_insert(self, node, -1); |
|
895 | 904 | } |
|
896 | 905 | if (self->added) |
|
897 | 906 | nt_invalidate_added(self, 0); |
|
898 | 907 | if (self->ntrev > start) |
|
899 | 908 | self->ntrev = (int)start; |
|
900 | 909 | } |
|
901 | 910 | self->length = start + 1; |
|
902 | 911 | return 0; |
|
903 | 912 | } |
|
904 | 913 | |
|
905 | 914 | if (self->nt) { |
|
906 | 915 | nt_invalidate_added(self, start - self->length + 1); |
|
907 | 916 | if (self->ntrev > start) |
|
908 | 917 | self->ntrev = (int)start; |
|
909 | 918 | } |
|
910 | 919 | return self->added |
|
911 | 920 | ? PyList_SetSlice(self->added, start - self->length + 1, |
|
912 | 921 | PyList_GET_SIZE(self->added), NULL) |
|
913 | 922 | : 0; |
|
914 | 923 | } |
|
915 | 924 | |
|
916 | 925 | /* |
|
917 | 926 | * Supported ops: |
|
918 | 927 | * |
|
919 | 928 | * slice deletion |
|
920 | 929 | * string assignment (extend node->rev mapping) |
|
921 | 930 | * string deletion (shrink node->rev mapping) |
|
922 | 931 | */ |
|
923 | 932 | static int index_assign_subscript(indexObject *self, PyObject *item, |
|
924 | 933 | PyObject *value) |
|
925 | 934 | { |
|
926 | 935 | char *node; |
|
927 | 936 | Py_ssize_t nodelen; |
|
928 | 937 | long rev; |
|
929 | 938 | |
|
930 | 939 | if (PySlice_Check(item) && value == NULL) |
|
931 | 940 | return index_slice_del(self, item); |
|
932 | 941 | |
|
933 | 942 | if (node_check(item, &node, &nodelen) == -1) |
|
934 | 943 | return -1; |
|
935 | 944 | |
|
936 | 945 | if (value == NULL) |
|
937 | 946 | return self->nt ? nt_insert(self, node, -1) : 0; |
|
938 | 947 | rev = PyInt_AsLong(value); |
|
939 | 948 | if (rev > INT_MAX || rev < 0) { |
|
940 | 949 | if (!PyErr_Occurred()) |
|
941 | 950 | PyErr_SetString(PyExc_ValueError, "rev out of range"); |
|
942 | 951 | return -1; |
|
943 | 952 | } |
|
944 | 953 | return nt_insert(self, node, (int)rev); |
|
945 | 954 | } |
|
946 | 955 | |
|
947 | 956 | /* |
|
948 | 957 | * Find all RevlogNG entries in an index that has inline data. Update |
|
949 | 958 | * the optional "offsets" table with those entries. |
|
950 | 959 | */ |
|
951 | 960 | static long inline_scan(indexObject *self, const char **offsets) |
|
952 | 961 | { |
|
953 | 962 | const char *data = PyString_AS_STRING(self->data); |
|
954 | 963 | const char *end = data + PyString_GET_SIZE(self->data); |
|
955 | 964 | const long hdrsize = 64; |
|
956 | 965 | long incr = hdrsize; |
|
957 | 966 | Py_ssize_t len = 0; |
|
958 | 967 | |
|
959 | 968 | while (data + hdrsize <= end) { |
|
960 | 969 | uint32_t comp_len; |
|
961 | 970 | const char *old_data; |
|
962 | 971 | /* 3rd element of header is length of compressed inline data */ |
|
963 | 972 | comp_len = getbe32(data + 8); |
|
964 | 973 | incr = hdrsize + comp_len; |
|
965 | 974 | if (incr < hdrsize) |
|
966 | 975 | break; |
|
967 | 976 | if (offsets) |
|
968 | 977 | offsets[len] = data; |
|
969 | 978 | len++; |
|
970 | 979 | old_data = data; |
|
971 | 980 | data += incr; |
|
972 | 981 | if (data <= old_data) |
|
973 | 982 | break; |
|
974 | 983 | } |
|
975 | 984 | |
|
976 | 985 | if (data != end && data + hdrsize != end) { |
|
977 | 986 | if (!PyErr_Occurred()) |
|
978 | 987 | PyErr_SetString(PyExc_ValueError, "corrupt index file"); |
|
979 | 988 | return -1; |
|
980 | 989 | } |
|
981 | 990 | |
|
982 | 991 | return len; |
|
983 | 992 | } |
|
984 | 993 | |
|
985 | 994 | static int index_init(indexObject *self, PyObject *args) |
|
986 | 995 | { |
|
987 | 996 | PyObject *data_obj, *inlined_obj; |
|
988 | 997 | Py_ssize_t size; |
|
989 | 998 | |
|
990 | 999 | if (!PyArg_ParseTuple(args, "OO", &data_obj, &inlined_obj)) |
|
991 | 1000 | return -1; |
|
992 | 1001 | if (!PyString_Check(data_obj)) { |
|
993 | 1002 | PyErr_SetString(PyExc_TypeError, "data is not a string"); |
|
994 | 1003 | return -1; |
|
995 | 1004 | } |
|
996 | 1005 | size = PyString_GET_SIZE(data_obj); |
|
997 | 1006 | |
|
998 | 1007 | self->inlined = inlined_obj && PyObject_IsTrue(inlined_obj); |
|
999 | 1008 | self->data = data_obj; |
|
1000 | 1009 | self->cache = NULL; |
|
1001 | 1010 | |
|
1002 | 1011 | self->added = NULL; |
|
1003 | 1012 | self->offsets = NULL; |
|
1004 | 1013 | self->nt = NULL; |
|
1005 | 1014 | self->ntlength = self->ntcapacity = 0; |
|
1006 | 1015 | self->ntdepth = self->ntsplits = 0; |
|
1007 | 1016 | self->ntlookups = self->ntmisses = 0; |
|
1008 | 1017 | self->ntrev = -1; |
|
1009 | 1018 | Py_INCREF(self->data); |
|
1010 | 1019 | |
|
1011 | 1020 | if (self->inlined) { |
|
1012 | 1021 | long len = inline_scan(self, NULL); |
|
1013 | 1022 | if (len == -1) |
|
1014 | 1023 | goto bail; |
|
1015 | 1024 | self->raw_length = len; |
|
1016 | 1025 | self->length = len + 1; |
|
1017 | 1026 | } else { |
|
1018 | 1027 | if (size % 64) { |
|
1019 | 1028 | PyErr_SetString(PyExc_ValueError, "corrupt index file"); |
|
1020 | 1029 | goto bail; |
|
1021 | 1030 | } |
|
1022 | 1031 | self->raw_length = size / 64; |
|
1023 | 1032 | self->length = self->raw_length + 1; |
|
1024 | 1033 | } |
|
1025 | 1034 | |
|
1026 | 1035 | return 0; |
|
1027 | 1036 | bail: |
|
1028 | 1037 | return -1; |
|
1029 | 1038 | } |
|
1030 | 1039 | |
|
1031 | 1040 | static PyObject *index_nodemap(indexObject *self) |
|
1032 | 1041 | { |
|
1033 | 1042 | Py_INCREF(self); |
|
1034 | 1043 | return (PyObject *)self; |
|
1035 | 1044 | } |
|
1036 | 1045 | |
|
1037 | 1046 | static void index_dealloc(indexObject *self) |
|
1038 | 1047 | { |
|
1039 | 1048 | _index_clearcaches(self); |
|
1040 | 1049 | Py_DECREF(self->data); |
|
1041 | 1050 | Py_XDECREF(self->added); |
|
1042 | 1051 | PyObject_Del(self); |
|
1043 | 1052 | } |
|
1044 | 1053 | |
|
1045 | 1054 | static PySequenceMethods index_sequence_methods = { |
|
1046 | 1055 | (lenfunc)index_length, /* sq_length */ |
|
1047 | 1056 | 0, /* sq_concat */ |
|
1048 | 1057 | 0, /* sq_repeat */ |
|
1049 | 1058 | (ssizeargfunc)index_get, /* sq_item */ |
|
1050 | 1059 | 0, /* sq_slice */ |
|
1051 | 1060 | 0, /* sq_ass_item */ |
|
1052 | 1061 | 0, /* sq_ass_slice */ |
|
1053 | 1062 | (objobjproc)index_contains, /* sq_contains */ |
|
1054 | 1063 | }; |
|
1055 | 1064 | |
|
1056 | 1065 | static PyMappingMethods index_mapping_methods = { |
|
1057 | 1066 | (lenfunc)index_length, /* mp_length */ |
|
1058 | 1067 | (binaryfunc)index_getitem, /* mp_subscript */ |
|
1059 | 1068 | (objobjargproc)index_assign_subscript, /* mp_ass_subscript */ |
|
1060 | 1069 | }; |
|
1061 | 1070 | |
|
1062 | 1071 | static PyMethodDef index_methods[] = { |
|
1063 | 1072 | {"clearcaches", (PyCFunction)index_clearcaches, METH_NOARGS, |
|
1064 | 1073 | "clear the index caches"}, |
|
1065 | 1074 | {"get", (PyCFunction)index_m_get, METH_VARARGS, |
|
1066 | 1075 | "get an index entry"}, |
|
1067 | 1076 | {"insert", (PyCFunction)index_insert, METH_VARARGS, |
|
1068 | 1077 | "insert an index entry"}, |
|
1069 | 1078 | {"stats", (PyCFunction)index_stats, METH_NOARGS, |
|
1070 | 1079 | "stats for the index"}, |
|
1071 | 1080 | {NULL} /* Sentinel */ |
|
1072 | 1081 | }; |
|
1073 | 1082 | |
|
1074 | 1083 | static PyGetSetDef index_getset[] = { |
|
1075 | 1084 | {"nodemap", (getter)index_nodemap, NULL, "nodemap", NULL}, |
|
1076 | 1085 | {NULL} /* Sentinel */ |
|
1077 | 1086 | }; |
|
1078 | 1087 | |
|
1079 | 1088 | static PyTypeObject indexType = { |
|
1080 | 1089 | PyObject_HEAD_INIT(NULL) |
|
1081 | 1090 | 0, /* ob_size */ |
|
1082 | 1091 | "parsers.index", /* tp_name */ |
|
1083 | 1092 | sizeof(indexObject), /* tp_basicsize */ |
|
1084 | 1093 | 0, /* tp_itemsize */ |
|
1085 | 1094 | (destructor)index_dealloc, /* tp_dealloc */ |
|
1086 | 1095 | 0, /* tp_print */ |
|
1087 | 1096 | 0, /* tp_getattr */ |
|
1088 | 1097 | 0, /* tp_setattr */ |
|
1089 | 1098 | 0, /* tp_compare */ |
|
1090 | 1099 | 0, /* tp_repr */ |
|
1091 | 1100 | 0, /* tp_as_number */ |
|
1092 | 1101 | &index_sequence_methods, /* tp_as_sequence */ |
|
1093 | 1102 | &index_mapping_methods, /* tp_as_mapping */ |
|
1094 | 1103 | 0, /* tp_hash */ |
|
1095 | 1104 | 0, /* tp_call */ |
|
1096 | 1105 | 0, /* tp_str */ |
|
1097 | 1106 | 0, /* tp_getattro */ |
|
1098 | 1107 | 0, /* tp_setattro */ |
|
1099 | 1108 | 0, /* tp_as_buffer */ |
|
1100 | 1109 | Py_TPFLAGS_DEFAULT, /* tp_flags */ |
|
1101 | 1110 | "revlog index", /* tp_doc */ |
|
1102 | 1111 | 0, /* tp_traverse */ |
|
1103 | 1112 | 0, /* tp_clear */ |
|
1104 | 1113 | 0, /* tp_richcompare */ |
|
1105 | 1114 | 0, /* tp_weaklistoffset */ |
|
1106 | 1115 | 0, /* tp_iter */ |
|
1107 | 1116 | 0, /* tp_iternext */ |
|
1108 | 1117 | index_methods, /* tp_methods */ |
|
1109 | 1118 | 0, /* tp_members */ |
|
1110 | 1119 | index_getset, /* tp_getset */ |
|
1111 | 1120 | 0, /* tp_base */ |
|
1112 | 1121 | 0, /* tp_dict */ |
|
1113 | 1122 | 0, /* tp_descr_get */ |
|
1114 | 1123 | 0, /* tp_descr_set */ |
|
1115 | 1124 | 0, /* tp_dictoffset */ |
|
1116 | 1125 | (initproc)index_init, /* tp_init */ |
|
1117 | 1126 | 0, /* tp_alloc */ |
|
1118 | 1127 | }; |
|
1119 | 1128 | |
|
1120 | 1129 | /* |
|
1121 | 1130 | * returns a tuple of the form (index, index, cache) with elements as |
|
1122 | 1131 | * follows: |
|
1123 | 1132 | * |
|
1124 | 1133 | * index: an index object that lazily parses RevlogNG records |
|
1125 | 1134 | * cache: if data is inlined, a tuple (index_file_content, 0), else None |
|
1126 | 1135 | * |
|
1127 | 1136 | * added complications are for backwards compatibility |
|
1128 | 1137 | */ |
|
1129 | 1138 | static PyObject *parse_index2(PyObject *self, PyObject *args) |
|
1130 | 1139 | { |
|
1131 | 1140 | PyObject *tuple = NULL, *cache = NULL; |
|
1132 | 1141 | indexObject *idx; |
|
1133 | 1142 | int ret; |
|
1134 | 1143 | |
|
1135 | 1144 | idx = PyObject_New(indexObject, &indexType); |
|
1136 | 1145 | if (idx == NULL) |
|
1137 | 1146 | goto bail; |
|
1138 | 1147 | |
|
1139 | 1148 | ret = index_init(idx, args); |
|
1140 | 1149 | if (ret == -1) |
|
1141 | 1150 | goto bail; |
|
1142 | 1151 | |
|
1143 | 1152 | if (idx->inlined) { |
|
1144 | 1153 | cache = Py_BuildValue("iO", 0, idx->data); |
|
1145 | 1154 | if (cache == NULL) |
|
1146 | 1155 | goto bail; |
|
1147 | 1156 | } else { |
|
1148 | 1157 | cache = Py_None; |
|
1149 | 1158 | Py_INCREF(cache); |
|
1150 | 1159 | } |
|
1151 | 1160 | |
|
1152 | 1161 | tuple = Py_BuildValue("NN", idx, cache); |
|
1153 | 1162 | if (!tuple) |
|
1154 | 1163 | goto bail; |
|
1155 | 1164 | return tuple; |
|
1156 | 1165 | |
|
1157 | 1166 | bail: |
|
1158 | 1167 | Py_XDECREF(idx); |
|
1159 | 1168 | Py_XDECREF(cache); |
|
1160 | 1169 | Py_XDECREF(tuple); |
|
1161 | 1170 | return NULL; |
|
1162 | 1171 | } |
|
1163 | 1172 | |
|
1164 | 1173 | static char parsers_doc[] = "Efficient content parsing."; |
|
1165 | 1174 | |
|
1166 | 1175 | static PyMethodDef methods[] = { |
|
1167 | 1176 | {"parse_manifest", parse_manifest, METH_VARARGS, "parse a manifest\n"}, |
|
1168 | 1177 | {"parse_dirstate", parse_dirstate, METH_VARARGS, "parse a dirstate\n"}, |
|
1169 | 1178 | {"parse_index2", parse_index2, METH_VARARGS, "parse a revlog index\n"}, |
|
1170 | 1179 | {NULL, NULL} |
|
1171 | 1180 | }; |
|
1172 | 1181 | |
|
1173 | 1182 | static void module_init(PyObject *mod) |
|
1174 | 1183 | { |
|
1175 | 1184 | indexType.tp_new = PyType_GenericNew; |
|
1176 | 1185 | if (PyType_Ready(&indexType) < 0) |
|
1177 | 1186 | return; |
|
1178 | 1187 | Py_INCREF(&indexType); |
|
1179 | 1188 | |
|
1180 | 1189 | PyModule_AddObject(mod, "index", (PyObject *)&indexType); |
|
1181 | 1190 | |
|
1182 | 1191 | nullentry = Py_BuildValue("iiiiiiis#", 0, 0, 0, |
|
1183 | 1192 | -1, -1, -1, -1, nullid, 20); |
|
1184 | 1193 | if (nullentry) |
|
1185 | 1194 | PyObject_GC_UnTrack(nullentry); |
|
1186 | 1195 | } |
|
1187 | 1196 | |
|
1188 | 1197 | #ifdef IS_PY3K |
|
1189 | 1198 | static struct PyModuleDef parsers_module = { |
|
1190 | 1199 | PyModuleDef_HEAD_INIT, |
|
1191 | 1200 | "parsers", |
|
1192 | 1201 | parsers_doc, |
|
1193 | 1202 | -1, |
|
1194 | 1203 | methods |
|
1195 | 1204 | }; |
|
1196 | 1205 | |
|
1197 | 1206 | PyMODINIT_FUNC PyInit_parsers(void) |
|
1198 | 1207 | { |
|
1199 | 1208 | PyObject *mod = PyModule_Create(&parsers_module); |
|
1200 | 1209 | module_init(mod); |
|
1201 | 1210 | return mod; |
|
1202 | 1211 | } |
|
1203 | 1212 | #else |
|
1204 | 1213 | PyMODINIT_FUNC initparsers(void) |
|
1205 | 1214 | { |
|
1206 | 1215 | PyObject *mod = Py_InitModule3("parsers", methods, parsers_doc); |
|
1207 | 1216 | module_init(mod); |
|
1208 | 1217 | } |
|
1209 | 1218 | #endif |
General Comments 0
You need to be logged in to leave comments.
Login now