2 * LibXDiff by Davide Libenzi ( File Differential Library )
3 * Copyright (C) 2003 Davide Libenzi
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2.1 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 * Davide Libenzi <davidel@xmailserver.org>
27 #define XDL_GUESS_NLINES 256
32 int xdl_emit_diffrec(char const *rec, long size, char const *pre, long psize,
36 mb[0].ptr = (char *) pre;
38 mb[1].ptr = (char *) rec;
41 if (ecb->outf(ecb->priv, mb, 2) < 0) {
49 void *xdl_mmfile_first(mmfile_t *mmf, long *size)
56 void *xdl_mmfile_next(mmfile_t *mmf, long *size)
62 long xdl_mmfile_size(mmfile_t *mmf)
68 int xdl_cha_init(chastore_t *cha, long isize, long icount) {
70 cha->head = cha->tail = NULL;
72 cha->nsize = icount * isize;
73 cha->ancur = cha->sncur = NULL;
80 void xdl_cha_free(chastore_t *cha) {
83 for (cur = cha->head; (tmp = cur) != NULL;) {
90 void *xdl_cha_alloc(chastore_t *cha) {
94 if (!(ancur = cha->ancur) || ancur->icurr == cha->nsize) {
95 if (!(ancur = (chanode_t *) xdl_malloc(sizeof(chanode_t) + cha->nsize))) {
102 cha->tail->next = ancur;
109 data = (char *) ancur + sizeof(chanode_t) + ancur->icurr;
110 ancur->icurr += cha->isize;
116 void *xdl_cha_first(chastore_t *cha) {
119 if (!(cha->sncur = sncur = cha->head))
124 return (char *) sncur + sizeof(chanode_t) + cha->scurr;
128 void *xdl_cha_next(chastore_t *cha) {
131 if (!(sncur = cha->sncur))
133 cha->scurr += cha->isize;
134 if (cha->scurr == sncur->icurr) {
135 if (!(sncur = cha->sncur = sncur->next))
140 return (char *) sncur + sizeof(chanode_t) + cha->scurr;
144 long xdl_guess_lines(mmfile_t *mf) {
145 long nl = 0, size, tsize = 0;
146 char const *data, *cur, *top;
148 if ((cur = data = xdl_mmfile_first(mf, &size)) != NULL) {
149 for (top = data + size; nl < XDL_GUESS_NLINES;) {
151 tsize += (long) (cur - data);
152 if (!(cur = data = xdl_mmfile_next(mf, &size)))
157 if (!(cur = memchr(cur, '\n', top - cur)))
162 tsize += (long) (cur - data);
166 nl = xdl_mmfile_size(mf) / (tsize / nl);
172 unsigned long xdl_hash_record(char const **data, char const *top) {
173 unsigned long ha = 5381;
174 char const *ptr = *data;
176 for (; ptr < top && *ptr != '\n'; ptr++) {
178 ha ^= (unsigned long) *ptr;
180 *data = ptr < top ? ptr + 1: ptr;
186 unsigned int xdl_hashbits(unsigned int size) {
187 unsigned int val = 1, bits = 0;
189 for (; val < size && bits < CHAR_BIT * sizeof(unsigned int); val <<= 1, bits++);
190 return bits ? bits: 1;
194 int xdl_num_out(char *out, long val) {
195 char *ptr, *str = out;
198 ptr = buf + sizeof(buf) - 1;
204 for (; val && ptr > buf; val /= 10)
205 *--ptr = "0123456789"[val % 10];
207 for (; *ptr; ptr++, str++)
217 long xdl_atol(char const *str, char const **next) {
221 for (top = str; XDL_ISDIGIT(*top); top++);
224 for (val = 0, base = 1, top--; top >= str; top--, base *= 10)
225 val += base * (long)(*top - '0');
230 int xdl_emit_hunk_hdr(long s1, long c1, long s2, long c2, xdemitcb_t *ecb) {
235 memcpy(buf, "@@ -", 4);
238 nb += xdl_num_out(buf + nb, c1 ? s1: 0);
240 memcpy(buf + nb, ",", 1);
243 nb += xdl_num_out(buf + nb, c1);
245 memcpy(buf + nb, " +", 2);
248 nb += xdl_num_out(buf + nb, c2 ? s2: 0);
250 memcpy(buf + nb, ",", 1);
253 nb += xdl_num_out(buf + nb, c2);
255 memcpy(buf + nb, " @@\n", 4);
260 if (ecb->outf(ecb->priv, &mb, 1) < 0)