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 long xdl_bogosqrt(long n) {
36 * Classical integer square root approximation using shifts.
38 for (i = 1; n > 0; n >>= 2)
45 int xdl_emit_diffrec(char const *rec, long size, char const *pre, long psize,
50 mb[0].ptr = (char *) pre;
52 mb[1].ptr = (char *) rec;
54 if (size > 0 && rec[size - 1] != '\n') {
55 mb[2].ptr = (char *) "\n\\ No newline at end of file\n";
56 mb[2].size = strlen(mb[2].ptr);
59 if (ecb->outf(ecb->priv, mb, i) < 0) {
67 void *xdl_mmfile_first(mmfile_t *mmf, long *size)
74 void *xdl_mmfile_next(mmfile_t *mmf, long *size)
80 long xdl_mmfile_size(mmfile_t *mmf)
86 int xdl_cha_init(chastore_t *cha, long isize, long icount) {
88 cha->head = cha->tail = NULL;
90 cha->nsize = icount * isize;
91 cha->ancur = cha->sncur = NULL;
98 void xdl_cha_free(chastore_t *cha) {
101 for (cur = cha->head; (tmp = cur) != NULL;) {
108 void *xdl_cha_alloc(chastore_t *cha) {
112 if (!(ancur = cha->ancur) || ancur->icurr == cha->nsize) {
113 if (!(ancur = (chanode_t *) xdl_malloc(sizeof(chanode_t) + cha->nsize))) {
120 cha->tail->next = ancur;
127 data = (char *) ancur + sizeof(chanode_t) + ancur->icurr;
128 ancur->icurr += cha->isize;
134 void *xdl_cha_first(chastore_t *cha) {
137 if (!(cha->sncur = sncur = cha->head))
142 return (char *) sncur + sizeof(chanode_t) + cha->scurr;
146 void *xdl_cha_next(chastore_t *cha) {
149 if (!(sncur = cha->sncur))
151 cha->scurr += cha->isize;
152 if (cha->scurr == sncur->icurr) {
153 if (!(sncur = cha->sncur = sncur->next))
158 return (char *) sncur + sizeof(chanode_t) + cha->scurr;
162 long xdl_guess_lines(mmfile_t *mf) {
163 long nl = 0, size, tsize = 0;
164 char const *data, *cur, *top;
166 if ((cur = data = xdl_mmfile_first(mf, &size)) != NULL) {
167 for (top = data + size; nl < XDL_GUESS_NLINES;) {
169 tsize += (long) (cur - data);
170 if (!(cur = data = xdl_mmfile_next(mf, &size)))
175 if (!(cur = memchr(cur, '\n', top - cur)))
180 tsize += (long) (cur - data);
184 nl = xdl_mmfile_size(mf) / (tsize / nl);
189 int xdl_recmatch(const char *l1, long s1, const char *l2, long s2, long flags)
193 if (flags & XDF_IGNORE_WHITESPACE) {
194 for (i1 = i2 = 0; i1 < s1 && i2 < s2; i1++, i2++) {
196 while (isspace(l1[i1]) && i1 < s1)
198 else if (isspace(l2[i2]))
199 while (isspace(l2[i2]) && i2 < s2)
201 else if (l1[i1] != l2[i2])
202 return l2[i2] - l1[i1];
208 } else if (flags & XDF_IGNORE_WHITESPACE_CHANGE) {
209 for (i1 = i2 = 0; i1 < s1 && i2 < s2; i1++, i2++) {
210 if (isspace(l1[i1])) {
211 if (!isspace(l2[i2]))
213 while (isspace(l1[i1]) && i1 < s1)
215 while (isspace(l2[i2]) && i2 < s2)
217 } else if (l1[i1] != l2[i2])
218 return l2[i2] - l1[i1];
225 return s1 == s2 && !memcmp(l1, l2, s1);
230 unsigned long xdl_hash_record(char const **data, char const *top, long flags) {
231 unsigned long ha = 5381;
232 char const *ptr = *data;
234 for (; ptr < top && *ptr != '\n'; ptr++) {
235 if (isspace(*ptr) && (flags & XDF_WHITESPACE_FLAGS)) {
236 while (ptr < top && isspace(*ptr) && ptr[1] != '\n')
238 if (flags & XDF_IGNORE_WHITESPACE_CHANGE) {
240 ha ^= (unsigned long) ' ';
245 ha ^= (unsigned long) *ptr;
247 *data = ptr < top ? ptr + 1: ptr;
253 unsigned int xdl_hashbits(unsigned int size) {
254 unsigned int val = 1, bits = 0;
256 for (; val < size && bits < CHAR_BIT * sizeof(unsigned int); val <<= 1, bits++);
257 return bits ? bits: 1;
261 int xdl_num_out(char *out, long val) {
262 char *ptr, *str = out;
265 ptr = buf + sizeof(buf) - 1;
271 for (; val && ptr > buf; val /= 10)
272 *--ptr = "0123456789"[val % 10];
274 for (; *ptr; ptr++, str++)
284 long xdl_atol(char const *str, char const **next) {
288 for (top = str; XDL_ISDIGIT(*top); top++);
291 for (val = 0, base = 1, top--; top >= str; top--, base *= 10)
292 val += base * (long)(*top - '0');
297 int xdl_emit_hunk_hdr(long s1, long c1, long s2, long c2,
298 const char *func, long funclen, xdemitcb_t *ecb) {
303 memcpy(buf, "@@ -", 4);
306 nb += xdl_num_out(buf + nb, c1 ? s1: s1 - 1);
309 memcpy(buf + nb, ",", 1);
312 nb += xdl_num_out(buf + nb, c1);
315 memcpy(buf + nb, " +", 2);
318 nb += xdl_num_out(buf + nb, c2 ? s2: s2 - 1);
321 memcpy(buf + nb, ",", 1);
324 nb += xdl_num_out(buf + nb, c2);
327 memcpy(buf + nb, " @@", 3);
329 if (func && funclen) {
331 if (funclen > sizeof(buf) - nb - 1)
332 funclen = sizeof(buf) - nb - 1;
333 memcpy(buf + nb, func, funclen);
340 if (ecb->outf(ecb->priv, &mb, 1) < 0)