2005-05-19 16:27:14 +02:00
|
|
|
/*
|
|
|
|
* diff-delta.c: generate a delta between two buffers
|
|
|
|
*
|
|
|
|
* Many parts of this file have been lifted from LibXDiff version 0.10.
|
|
|
|
* http://www.xmailserver.org/xdiff-lib.html
|
|
|
|
*
|
|
|
|
* LibXDiff was written by Davide Libenzi <davidel@xmailserver.org>
|
|
|
|
* Copyright (C) 2003 Davide Libenzi
|
|
|
|
*
|
|
|
|
* Many mods for GIT usage by Nicolas Pitre <nico@cam.org>, (C) 2005.
|
|
|
|
*
|
|
|
|
* This file is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Use of this within git automatically means that the LGPL
|
|
|
|
* licensing gets turned into GPLv2 within this project.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
2006-02-22 02:43:17 +01:00
|
|
|
#include <string.h>
|
2005-05-19 16:27:14 +02:00
|
|
|
#include "delta.h"
|
|
|
|
|
|
|
|
|
2006-02-22 02:43:17 +01:00
|
|
|
struct index {
|
2005-05-19 16:27:14 +02:00
|
|
|
const unsigned char *ptr;
|
2006-02-22 02:43:17 +01:00
|
|
|
struct index *next;
|
|
|
|
};
|
2005-05-19 16:27:14 +02:00
|
|
|
|
2006-02-22 02:43:17 +01:00
|
|
|
static struct index ** delta_index(const unsigned char *buf,
|
|
|
|
unsigned long bufsize,
|
|
|
|
unsigned int *hash_shift)
|
2005-05-19 16:27:14 +02:00
|
|
|
{
|
2006-02-22 02:45:36 +01:00
|
|
|
unsigned long hsize;
|
|
|
|
unsigned int hshift, i;
|
2006-02-22 02:43:17 +01:00
|
|
|
const unsigned char *data;
|
|
|
|
struct index *entry, **hash;
|
|
|
|
void *mem;
|
|
|
|
|
|
|
|
/* determine index hash size */
|
2006-02-22 02:45:36 +01:00
|
|
|
hsize = bufsize / 4;
|
|
|
|
for (i = 8; (1 << i) < hsize && i < 16; i++);
|
2006-02-22 02:43:17 +01:00
|
|
|
hsize = 1 << i;
|
2006-02-22 02:45:36 +01:00
|
|
|
hshift = i - 8;
|
2006-02-22 02:43:17 +01:00
|
|
|
*hash_shift = hshift;
|
|
|
|
|
|
|
|
/* allocate lookup index */
|
2006-02-22 02:45:36 +01:00
|
|
|
mem = malloc(hsize * sizeof(*hash) + bufsize * sizeof(*entry));
|
2006-02-22 02:43:17 +01:00
|
|
|
if (!mem)
|
|
|
|
return NULL;
|
|
|
|
hash = mem;
|
|
|
|
entry = mem + hsize * sizeof(*hash);
|
|
|
|
memset(hash, 0, hsize * sizeof(*hash));
|
|
|
|
|
|
|
|
/* then populate it */
|
2006-02-22 02:45:36 +01:00
|
|
|
data = buf + bufsize - 2;
|
|
|
|
while (data > buf) {
|
|
|
|
entry->ptr = --data;
|
|
|
|
i = data[0] ^ data[1] ^ (data[2] << hshift);
|
2006-02-22 02:43:17 +01:00
|
|
|
entry->next = hash[i];
|
|
|
|
hash[i] = entry++;
|
|
|
|
}
|
2005-05-19 16:27:14 +02:00
|
|
|
|
2006-02-22 02:43:17 +01:00
|
|
|
return hash;
|
2005-05-19 16:27:14 +02:00
|
|
|
}
|
|
|
|
|
2006-02-22 02:41:41 +01:00
|
|
|
/* provide the size of the copy opcode given the block offset and size */
|
2005-05-19 16:27:14 +02:00
|
|
|
#define COPYOP_SIZE(o, s) \
|
|
|
|
(!!(o & 0xff) + !!(o & 0xff00) + !!(o & 0xff0000) + !!(o & 0xff000000) + \
|
|
|
|
!!(s & 0xff) + !!(s & 0xff00) + 1)
|
|
|
|
|
2006-02-22 02:41:41 +01:00
|
|
|
/* the maximum size for any opcode */
|
|
|
|
#define MAX_OP_SIZE COPYOP_SIZE(0xffffffff, 0xffffffff)
|
|
|
|
|
2005-05-19 16:27:14 +02:00
|
|
|
void *diff_delta(void *from_buf, unsigned long from_size,
|
|
|
|
void *to_buf, unsigned long to_size,
|
2005-06-26 04:30:20 +02:00
|
|
|
unsigned long *delta_size,
|
|
|
|
unsigned long max_size)
|
2005-05-19 16:27:14 +02:00
|
|
|
{
|
2006-02-22 02:43:17 +01:00
|
|
|
unsigned int i, outpos, outsize, inscnt, hash_shift;
|
|
|
|
const unsigned char *ref_data, *ref_top, *data, *top;
|
|
|
|
unsigned char *out;
|
|
|
|
struct index *entry, **hash;
|
2005-05-19 16:27:14 +02:00
|
|
|
|
2006-02-22 02:43:17 +01:00
|
|
|
if (!from_size || !to_size)
|
2005-05-19 16:27:14 +02:00
|
|
|
return NULL;
|
2006-02-22 02:43:17 +01:00
|
|
|
hash = delta_index(from_buf, from_size, &hash_shift);
|
|
|
|
if (!hash)
|
|
|
|
return NULL;
|
|
|
|
|
2005-05-19 16:27:14 +02:00
|
|
|
outpos = 0;
|
|
|
|
outsize = 8192;
|
2006-02-22 02:41:41 +01:00
|
|
|
if (max_size && outsize >= max_size)
|
|
|
|
outsize = max_size + MAX_OP_SIZE + 1;
|
2005-05-19 16:27:14 +02:00
|
|
|
out = malloc(outsize);
|
|
|
|
if (!out) {
|
2006-02-22 02:43:17 +01:00
|
|
|
free(hash);
|
2005-05-19 16:27:14 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2005-12-15 17:10:32 +01:00
|
|
|
ref_data = from_buf;
|
|
|
|
ref_top = from_buf + from_size;
|
2005-05-19 16:27:14 +02:00
|
|
|
data = to_buf;
|
|
|
|
top = to_buf + to_size;
|
|
|
|
|
|
|
|
/* store reference buffer size */
|
2005-06-29 06:27:45 +02:00
|
|
|
out[outpos++] = from_size;
|
|
|
|
from_size >>= 7;
|
|
|
|
while (from_size) {
|
|
|
|
out[outpos - 1] |= 0x80;
|
|
|
|
out[outpos++] = from_size;
|
|
|
|
from_size >>= 7;
|
|
|
|
}
|
2005-05-19 16:27:14 +02:00
|
|
|
|
|
|
|
/* store target buffer size */
|
2005-06-29 06:27:45 +02:00
|
|
|
out[outpos++] = to_size;
|
|
|
|
to_size >>= 7;
|
|
|
|
while (to_size) {
|
|
|
|
out[outpos - 1] |= 0x80;
|
|
|
|
out[outpos++] = to_size;
|
|
|
|
to_size >>= 7;
|
|
|
|
}
|
2005-05-19 16:27:14 +02:00
|
|
|
|
|
|
|
inscnt = 0;
|
|
|
|
|
2006-02-22 02:43:17 +01:00
|
|
|
while (data < top) {
|
|
|
|
unsigned int moff = 0, msize = 0;
|
2006-02-22 02:45:36 +01:00
|
|
|
if (data + 2 < top) {
|
|
|
|
i = data[0] ^ data[1] ^ (data[2] << hash_shift);
|
|
|
|
for (entry = hash[i]; entry; entry = entry->next) {
|
|
|
|
const unsigned char *ref = entry->ptr;
|
|
|
|
const unsigned char *src = data;
|
|
|
|
unsigned int ref_size = ref_top - ref;
|
|
|
|
if (ref_size > top - src)
|
|
|
|
ref_size = top - src;
|
|
|
|
if (ref_size > 0x10000)
|
|
|
|
ref_size = 0x10000;
|
|
|
|
if (ref_size <= msize)
|
2006-02-22 02:43:17 +01:00
|
|
|
break;
|
2006-02-22 02:45:36 +01:00
|
|
|
while (ref_size && *src++ == *ref) {
|
|
|
|
ref++;
|
|
|
|
ref_size--;
|
|
|
|
}
|
|
|
|
ref_size = ref - entry->ptr;
|
|
|
|
if (msize < ref - entry->ptr) {
|
|
|
|
/* this is our best match so far */
|
|
|
|
msize = ref - entry->ptr;
|
|
|
|
moff = entry->ptr - ref_data;
|
2005-05-19 16:27:14 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!msize || msize < COPYOP_SIZE(moff, msize)) {
|
|
|
|
if (!inscnt)
|
|
|
|
outpos++;
|
|
|
|
out[outpos++] = *data++;
|
|
|
|
inscnt++;
|
|
|
|
if (inscnt == 0x7f) {
|
|
|
|
out[outpos - inscnt - 1] = inscnt;
|
|
|
|
inscnt = 0;
|
|
|
|
}
|
|
|
|
} else {
|
2006-02-22 02:43:17 +01:00
|
|
|
unsigned char *op;
|
|
|
|
|
2005-05-19 16:27:14 +02:00
|
|
|
if (inscnt) {
|
|
|
|
out[outpos - inscnt - 1] = inscnt;
|
|
|
|
inscnt = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
data += msize;
|
2006-02-22 02:43:17 +01:00
|
|
|
op = out + outpos++;
|
2005-05-19 16:27:14 +02:00
|
|
|
i = 0x80;
|
|
|
|
|
|
|
|
if (moff & 0xff) { out[outpos++] = moff; i |= 0x01; }
|
|
|
|
moff >>= 8;
|
|
|
|
if (moff & 0xff) { out[outpos++] = moff; i |= 0x02; }
|
|
|
|
moff >>= 8;
|
|
|
|
if (moff & 0xff) { out[outpos++] = moff; i |= 0x04; }
|
|
|
|
moff >>= 8;
|
|
|
|
if (moff & 0xff) { out[outpos++] = moff; i |= 0x08; }
|
|
|
|
|
|
|
|
if (msize & 0xff) { out[outpos++] = msize; i |= 0x10; }
|
|
|
|
msize >>= 8;
|
|
|
|
if (msize & 0xff) { out[outpos++] = msize; i |= 0x20; }
|
|
|
|
|
2006-02-22 02:43:17 +01:00
|
|
|
*op = i;
|
2005-05-19 16:27:14 +02:00
|
|
|
}
|
|
|
|
|
2006-02-22 02:41:41 +01:00
|
|
|
if (outpos >= outsize - MAX_OP_SIZE) {
|
2005-05-19 16:27:14 +02:00
|
|
|
void *tmp = out;
|
|
|
|
outsize = outsize * 3 / 2;
|
2006-02-22 02:41:41 +01:00
|
|
|
if (max_size && outsize >= max_size)
|
|
|
|
outsize = max_size + MAX_OP_SIZE + 1;
|
|
|
|
if (max_size && outpos > max_size)
|
|
|
|
out = NULL;
|
|
|
|
else
|
|
|
|
out = realloc(out, outsize);
|
2005-05-19 16:27:14 +02:00
|
|
|
if (!out) {
|
|
|
|
free(tmp);
|
2006-02-22 02:43:17 +01:00
|
|
|
free(hash);
|
2005-05-19 16:27:14 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (inscnt)
|
|
|
|
out[outpos - inscnt - 1] = inscnt;
|
|
|
|
|
2006-02-22 02:43:17 +01:00
|
|
|
free(hash);
|
2005-05-19 16:27:14 +02:00
|
|
|
*delta_size = outpos;
|
|
|
|
return out;
|
|
|
|
}
|