bdiff.c
453 lines
| 9.1 KiB
| text/x-c
|
CLexer
/ mercurial / bdiff.c
|
r400 | /* | ||
bdiff.c - efficient binary diff extension for Mercurial | ||||
|
r2859 | Copyright 2005, 2006 Matt Mackall <mpm@selenic.com> | ||
|
r400 | |||
This software may be used and distributed according to the terms of | ||||
the GNU General Public License, incorporated herein by reference. | ||||
Based roughly on Python difflib | ||||
*/ | ||||
#include <Python.h> | ||||
#include <stdlib.h> | ||||
#include <string.h> | ||||
|
r5341 | #include <limits.h> | ||
|
r867 | |||
|
r3561 | #if defined __hpux || defined __SUNPRO_C || defined _AIX | ||
|
r10282 | #define inline | ||
|
r2600 | #endif | ||
|
r1759 | |||
|
r8858 | #ifdef __linux | ||
|
r10282 | #define inline __inline | ||
|
r8858 | #endif | ||
|
r411 | #ifdef _WIN32 | ||
|
r551 | #ifdef _MSC_VER | ||
#define inline __inline | ||||
typedef unsigned long uint32_t; | ||||
#else | ||||
|
r510 | #include <stdint.h> | ||
|
r551 | #endif | ||
|
r411 | static uint32_t htonl(uint32_t x) | ||
{ | ||||
return ((x & 0x000000ffUL) << 24) | | ||||
((x & 0x0000ff00UL) << 8) | | ||||
((x & 0x00ff0000UL) >> 8) | | ||||
((x & 0xff000000UL) >> 24); | ||||
} | ||||
#else | ||||
|
r510 | #include <sys/types.h> | ||
|
r7036 | #if defined __BEOS__ && !defined __HAIKU__ | ||
|
r4073 | #include <ByteOrder.h> | ||
#else | ||||
|
r597 | #include <arpa/inet.h> | ||
|
r4073 | #endif | ||
|
r2543 | #include <inttypes.h> | ||
|
r411 | #endif | ||
|
r400 | |||
|
r11364 | #include "util.h" | ||
|
r400 | struct line { | ||
|
r433 | int h, len, n, e; | ||
|
r400 | const char *l; | ||
}; | ||||
|
r474 | struct pos { | ||
int pos, len; | ||||
}; | ||||
|
r13089 | struct hunk; | ||
|
r400 | struct hunk { | ||
int a1, a2, b1, b2; | ||||
|
r13089 | struct hunk *next; | ||
|
r400 | }; | ||
int splitlines(const char *a, int len, struct line **lr) | ||||
{ | ||||
|
r5342 | int h, i; | ||
|
r400 | const char *p, *b = a; | ||
|
r5340 | const char * const plast = a + len - 1; | ||
|
r400 | struct line *l; | ||
/* count the lines */ | ||||
i = 1; /* extra line for sentinel */ | ||||
for (p = a; p < a + len; p++) | ||||
|
r5340 | if (*p == '\n' || p == plast) | ||
|
r400 | i++; | ||
|
r1978 | *lr = l = (struct line *)malloc(sizeof(struct line) * i); | ||
|
r400 | if (!l) | ||
return -1; | ||||
/* build the line array and calculate hashes */ | ||||
h = 0; | ||||
for (p = a; p < a + len; p++) { | ||||
|
r5342 | /* Leonid Yuriev's hash */ | ||
|
r7187 | h = (h * 1664525) + *p + 1013904223; | ||
|
r5342 | |||
|
r5340 | if (*p == '\n' || p == plast) { | ||
|
r5342 | l->h = h; | ||
h = 0; | ||||
|
r400 | l->len = p - b + 1; | ||
l->l = b; | ||||
|
r5341 | l->n = INT_MAX; | ||
|
r400 | l++; | ||
b = p + 1; | ||||
} | ||||
} | ||||
/* set up a sentinel */ | ||||
l->h = l->len = 0; | ||||
l->l = a + len; | ||||
return i - 1; | ||||
} | ||||
int inline cmp(struct line *a, struct line *b) | ||||
{ | ||||
|
r433 | return a->h != b->h || a->len != b->len || memcmp(a->l, b->l, a->len); | ||
|
r400 | } | ||
static int equatelines(struct line *a, int an, struct line *b, int bn) | ||||
{ | ||||
|
r5452 | int i, j, buckets = 1, t, scale; | ||
struct pos *h = NULL; | ||||
|
r400 | |||
/* build a hash table of the next highest power of 2 */ | ||||
while (buckets < bn + 1) | ||||
buckets *= 2; | ||||
|
r5339 | /* try to allocate a large hash table to avoid collisions */ | ||
|
r5452 | for (scale = 4; scale; scale /= 2) { | ||
|
r5339 | h = (struct pos *)malloc(scale * buckets * sizeof(struct pos)); | ||
|
r5452 | if (h) | ||
break; | ||||
} | ||||
|
r5339 | |||
|
r474 | if (!h) | ||
|
r400 | return 0; | ||
|
r5339 | buckets = buckets * scale - 1; | ||
|
r400 | /* clear the hash table */ | ||
|
r474 | for (i = 0; i <= buckets; i++) { | ||
|
r5341 | h[i].pos = INT_MAX; | ||
|
r474 | h[i].len = 0; | ||
} | ||||
|
r400 | |||
/* add lines to the hash table chains */ | ||||
for (i = bn - 1; i >= 0; i--) { | ||||
/* find the equivalence class */ | ||||
|
r5341 | for (j = b[i].h & buckets; h[j].pos != INT_MAX; | ||
|
r474 | j = (j + 1) & buckets) | ||
if (!cmp(b + i, b + h[j].pos)) | ||||
|
r400 | break; | ||
/* add to the head of the equivalence class */ | ||||
|
r474 | b[i].n = h[j].pos; | ||
|
r433 | b[i].e = j; | ||
|
r474 | h[j].pos = i; | ||
h[j].len++; /* keep track of popularity */ | ||||
|
r400 | } | ||
/* compute popularity threshold */ | ||||
|
r9534 | t = (bn >= 31000) ? bn / 1000 : 1000000 / (bn + 1); | ||
|
r400 | |||
/* match items in a to their equivalence class in b */ | ||||
for (i = 0; i < an; i++) { | ||||
/* find the equivalence class */ | ||||
|
r5341 | for (j = a[i].h & buckets; h[j].pos != INT_MAX; | ||
|
r474 | j = (j + 1) & buckets) | ||
if (!cmp(a + i, b + h[j].pos)) | ||||
|
r400 | break; | ||
|
r433 | a[i].e = j; /* use equivalence class for quick compare */ | ||
|
r1542 | if (h[j].len <= t) | ||
|
r474 | a[i].n = h[j].pos; /* point to head of match list */ | ||
|
r400 | else | ||
|
r5341 | a[i].n = INT_MAX; /* too popular */ | ||
|
r400 | } | ||
/* discard hash tables */ | ||||
free(h); | ||||
return 1; | ||||
} | ||||
|
r474 | static int longest_match(struct line *a, struct line *b, struct pos *pos, | ||
|
r400 | int a1, int a2, int b1, int b2, int *omi, int *omj) | ||
{ | ||||
int mi = a1, mj = b1, mk = 0, mb = 0, i, j, k; | ||||
for (i = a1; i < a2; i++) { | ||||
/* skip things before the current block */ | ||||
|
r5341 | for (j = a[i].n; j < b1; j = b[j].n) | ||
|
r400 | ; | ||
/* loop through all lines match a[i] in b */ | ||||
|
r5341 | for (; j < b2; j = b[j].n) { | ||
|
r400 | /* does this extend an earlier match? */ | ||
|
r474 | if (i > a1 && j > b1 && pos[j - 1].pos == i - 1) | ||
k = pos[j - 1].len + 1; | ||||
|
r400 | else | ||
k = 1; | ||||
|
r474 | pos[j].pos = i; | ||
pos[j].len = k; | ||||
|
r400 | |||
/* best match so far? */ | ||||
if (k > mk) { | ||||
mi = i; | ||||
mj = j; | ||||
mk = k; | ||||
} | ||||
} | ||||
} | ||||
if (mk) { | ||||
mi = mi - mk + 1; | ||||
mj = mj - mk + 1; | ||||
} | ||||
/* expand match to include neighboring popular lines */ | ||||
while (mi - mb > a1 && mj - mb > b1 && | ||||
|
r433 | a[mi - mb - 1].e == b[mj - mb - 1].e) | ||
|
r400 | mb++; | ||
while (mi + mk < a2 && mj + mk < b2 && | ||||
|
r433 | a[mi + mk].e == b[mj + mk].e) | ||
|
r400 | mk++; | ||
*omi = mi - mb; | ||||
*omj = mj - mb; | ||||
|
r5341 | |||
|
r400 | return mk + mb; | ||
} | ||||
|
r13089 | static struct hunk *recurse(struct line *a, struct line *b, struct pos *pos, | ||
int a1, int a2, int b1, int b2, struct hunk *l) | ||||
|
r400 | { | ||
int i, j, k; | ||||
|
r10500 | while (1) { | ||
/* find the longest match in this chunk */ | ||||
k = longest_match(a, b, pos, a1, a2, b1, b2, &i, &j); | ||||
if (!k) | ||||
|
r13089 | return l; | ||
|
r400 | |||
|
r10500 | /* and recurse on the remaining chunks on either side */ | ||
|
r13089 | l = recurse(a, b, pos, a1, i, b1, j, l); | ||
if (!l) | ||||
return NULL; | ||||
l->next = (struct hunk *)malloc(sizeof(struct hunk)); | ||||
if (!l->next) | ||||
return NULL; | ||||
l = l->next; | ||||
l->a1 = i; | ||||
l->a2 = i + k; | ||||
l->b1 = j; | ||||
l->b2 = j + k; | ||||
l->next = NULL; | ||||
/* tail-recursion didn't happen, so do equivalent iteration */ | ||||
|
r10500 | a1 = i + k; | ||
b1 = j + k; | ||||
} | ||||
|
r400 | } | ||
|
r13089 | static int diff(struct line *a, int an, struct line *b, int bn, | ||
struct hunk *base) | ||||
|
r400 | { | ||
|
r7104 | struct hunk *curr; | ||
|
r474 | struct pos *pos; | ||
|
r13089 | int t, count = 0; | ||
|
r433 | |||
/* allocate and fill arrays */ | ||||
t = equatelines(a, an, b, bn); | ||||
|
r5571 | pos = (struct pos *)calloc(bn ? bn : 1, sizeof(struct pos)); | ||
|
r13089 | |||
if (pos && t) { | ||||
/* generate the matching block list */ | ||||
curr = recurse(a, b, pos, 0, an, 0, bn, base); | ||||
if (!curr) | ||||
return -1; | ||||
|
r433 | |||
|
r13089 | /* sentinel end hunk */ | ||
curr->next = (struct hunk *)malloc(sizeof(struct hunk)); | ||||
if (!curr->next) | ||||
|
r13090 | return -1; | ||
|
r13089 | curr = curr->next; | ||
curr->a1 = curr->a2 = an; | ||||
curr->b1 = curr->b2 = bn; | ||||
curr->next = NULL; | ||||
|
r433 | } | ||
|
r474 | free(pos); | ||
|
r7104 | |||
|
r7625 | /* normalize the hunk list, try to push each hunk towards the end */ | ||
|
r13089 | for (curr = base->next; curr; curr = curr->next) { | ||
struct hunk *next = curr->next; | ||||
|
r7104 | int shift = 0; | ||
|
r13089 | if (!next) | ||
|
r7104 | break; | ||
if (curr->a2 == next->a1) | ||||
|
r10282 | while (curr->a2 + shift < an && curr->b2 + shift < bn | ||
&& !cmp(a + curr->a2 + shift, | ||||
b + curr->b2 + shift)) | ||||
|
r7104 | shift++; | ||
else if (curr->b2 == next->b1) | ||||
|
r10282 | while (curr->b2 + shift < bn && curr->a2 + shift < an | ||
&& !cmp(b + curr->b2 + shift, | ||||
a + curr->a2 + shift)) | ||||
|
r7104 | shift++; | ||
if (!shift) | ||||
continue; | ||||
curr->b2 += shift; | ||||
next->b1 += shift; | ||||
curr->a2 += shift; | ||||
next->a1 += shift; | ||||
} | ||||
|
r13089 | for (curr = base->next; curr; curr = curr->next) | ||
count++; | ||||
return count; | ||||
} | ||||
static void freehunks(struct hunk *l) | ||||
{ | ||||
struct hunk *n; | ||||
for (; l; l = n) { | ||||
n = l->next; | ||||
free(l); | ||||
} | ||||
|
r433 | } | ||
static PyObject *blocks(PyObject *self, PyObject *args) | ||||
{ | ||||
|
r435 | PyObject *sa, *sb, *rl = NULL, *m; | ||
|
r433 | struct line *a, *b; | ||
|
r13089 | struct hunk l, *h; | ||
int an, bn, count, pos = 0; | ||||
|
r400 | |||
if (!PyArg_ParseTuple(args, "SS:bdiff", &sa, &sb)) | ||||
return NULL; | ||||
|
r11364 | an = splitlines(PyBytes_AsString(sa), PyBytes_Size(sa), &a); | ||
bn = splitlines(PyBytes_AsString(sb), PyBytes_Size(sb), &b); | ||||
|
r433 | if (!a || !b) | ||
goto nomem; | ||||
|
r13089 | l.next = NULL; | ||
count = diff(a, an, b, bn, &l); | ||||
if (count < 0) | ||||
|
r433 | goto nomem; | ||
|
r13089 | rl = PyList_New(count); | ||
if (!rl) | ||||
goto nomem; | ||||
for (h = l.next; h; h = h->next) { | ||||
|
r433 | m = Py_BuildValue("iiii", h->a1, h->a2, h->b1, h->b2); | ||
PyList_SetItem(rl, pos, m); | ||||
pos++; | ||||
} | ||||
nomem: | ||||
free(a); | ||||
free(b); | ||||
|
r13089 | freehunks(l.next); | ||
|
r433 | return rl ? rl : PyErr_NoMemory(); | ||
} | ||||
static PyObject *bdiff(PyObject *self, PyObject *args) | ||||
{ | ||||
|
r3335 | char *sa, *sb; | ||
PyObject *result = NULL; | ||||
|
r433 | struct line *al, *bl; | ||
|
r13089 | struct hunk l, *h; | ||
|
r433 | char encode[12], *rb; | ||
|
r13089 | int an, bn, len = 0, la, lb, count; | ||
|
r433 | |||
|
r3369 | if (!PyArg_ParseTuple(args, "s#s#:bdiff", &sa, &la, &sb, &lb)) | ||
|
r433 | return NULL; | ||
|
r3335 | an = splitlines(sa, la, &al); | ||
bn = splitlines(sb, lb, &bl); | ||||
|
r433 | if (!al || !bl) | ||
|
r400 | goto nomem; | ||
|
r13089 | l.next = NULL; | ||
count = diff(al, an, bl, bn, &l); | ||||
if (count < 0) | ||||
|
r433 | goto nomem; | ||
|
r400 | |||
/* calculate length of output */ | ||||
|
r3335 | la = lb = 0; | ||
|
r13089 | for (h = l.next; h; h = h->next) { | ||
|
r400 | if (h->a1 != la || h->b1 != lb) | ||
len += 12 + bl[h->b1].l - bl[lb].l; | ||||
la = h->a2; | ||||
lb = h->b2; | ||||
} | ||||
|
r11364 | result = PyBytes_FromStringAndSize(NULL, len); | ||
|
r400 | if (!result) | ||
goto nomem; | ||||
/* build binary patch */ | ||||
|
r11364 | rb = PyBytes_AsString(result); | ||
|
r400 | la = lb = 0; | ||
|
r13089 | for (h = l.next; h; h = h->next) { | ||
|
r400 | if (h->a1 != la || h->b1 != lb) { | ||
len = bl[h->b1].l - bl[lb].l; | ||||
*(uint32_t *)(encode) = htonl(al[la].l - al->l); | ||||
*(uint32_t *)(encode + 4) = htonl(al[h->a1].l - al->l); | ||||
*(uint32_t *)(encode + 8) = htonl(len); | ||||
memcpy(rb, encode, 12); | ||||
memcpy(rb + 12, bl[lb].l, len); | ||||
rb += 12 + len; | ||||
} | ||||
la = h->a2; | ||||
lb = h->b2; | ||||
} | ||||
nomem: | ||||
free(al); | ||||
free(bl); | ||||
|
r13089 | freehunks(l.next); | ||
|
r400 | return result ? result : PyErr_NoMemory(); | ||
} | ||||
static char mdiff_doc[] = "Efficient binary diff."; | ||||
static PyMethodDef methods[] = { | ||||
{"bdiff", bdiff, METH_VARARGS, "calculate a binary diff\n"}, | ||||
|
r433 | {"blocks", blocks, METH_VARARGS, "find a list of matching lines\n"}, | ||
|
r400 | {NULL, NULL} | ||
}; | ||||
|
r11364 | #ifdef IS_PY3K | ||
static struct PyModuleDef bdiff_module = { | ||||
PyModuleDef_HEAD_INIT, | ||||
"bdiff", | ||||
mdiff_doc, | ||||
-1, | ||||
methods | ||||
}; | ||||
PyMODINIT_FUNC PyInit_bdiff(void) | ||||
{ | ||||
return PyModule_Create(&bdiff_module); | ||||
} | ||||
#else | ||||
|
r400 | PyMODINIT_FUNC initbdiff(void) | ||
{ | ||||
Py_InitModule3("bdiff", methods, mdiff_doc); | ||||
} | ||||
|
r11364 | #endif | ||
|
r1542 | |||