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;
56 if (!size || rec[size-1] != '\n') {
57 mb[2].ptr = "\n\\ No newline at end of file\n";
58 mb[2].size = strlen(mb[2].ptr);
62 if (ecb->outf(ecb->priv, mb, i) < 0) {
70 void *xdl_mmfile_first(mmfile_t *mmf, long *size)
77 void *xdl_mmfile_next(mmfile_t *mmf, long *size)
83 long xdl_mmfile_size(mmfile_t *mmf)
89 int xdl_cha_init(chastore_t *cha, long isize, long icount) {
91 cha->head = cha->tail = NULL;
93 cha->nsize = icount * isize;
94 cha->ancur = cha->sncur = NULL;
101 void xdl_cha_free(chastore_t *cha) {
102 chanode_t *cur, *tmp;
104 for (cur = cha->head; (tmp = cur) != NULL;) {
111 void *xdl_cha_alloc(chastore_t *cha) {
115 if (!(ancur = cha->ancur) || ancur->icurr == cha->nsize) {
116 if (!(ancur = (chanode_t *) xdl_malloc(sizeof(chanode_t) + cha->nsize))) {
123 cha->tail->next = ancur;
130 data = (char *) ancur + sizeof(chanode_t) + ancur->icurr;
131 ancur->icurr += cha->isize;
137 void *xdl_cha_first(chastore_t *cha) {
140 if (!(cha->sncur = sncur = cha->head))
145 return (char *) sncur + sizeof(chanode_t) + cha->scurr;
149 void *xdl_cha_next(chastore_t *cha) {
152 if (!(sncur = cha->sncur))
154 cha->scurr += cha->isize;
155 if (cha->scurr == sncur->icurr) {
156 if (!(sncur = cha->sncur = sncur->next))
161 return (char *) sncur + sizeof(chanode_t) + cha->scurr;
165 long xdl_guess_lines(mmfile_t *mf) {
166 long nl = 0, size, tsize = 0;
167 char const *data, *cur, *top;
169 if ((cur = data = xdl_mmfile_first(mf, &size)) != NULL) {
170 for (top = data + size; nl < XDL_GUESS_NLINES;) {
172 tsize += (long) (cur - data);
173 if (!(cur = data = xdl_mmfile_next(mf, &size)))
178 if (!(cur = memchr(cur, '\n', top - cur)))
183 tsize += (long) (cur - data);
187 nl = xdl_mmfile_size(mf) / (tsize / nl);
193 unsigned long xdl_hash_record(char const **data, char const *top) {
194 unsigned long ha = 5381;
195 char const *ptr = *data;
197 for (; ptr < top && *ptr != '\n'; ptr++) {
199 ha ^= (unsigned long) *ptr;
201 *data = ptr < top ? ptr + 1: ptr;
207 unsigned int xdl_hashbits(unsigned int size) {
208 unsigned int val = 1, bits = 0;
210 for (; val < size && bits < CHAR_BIT * sizeof(unsigned int); val <<= 1, bits++);
211 return bits ? bits: 1;
215 int xdl_num_out(char *out, long val) {
216 char *ptr, *str = out;
219 ptr = buf + sizeof(buf) - 1;
225 for (; val && ptr > buf; val /= 10)
226 *--ptr = "0123456789"[val % 10];
228 for (; *ptr; ptr++, str++)
238 long xdl_atol(char const *str, char const **next) {
242 for (top = str; XDL_ISDIGIT(*top); top++);
245 for (val = 0, base = 1, top--; top >= str; top--, base *= 10)
246 val += base * (long)(*top - '0');
251 int xdl_emit_hunk_hdr(long s1, long c1, long s2, long c2,
252 const char *func, long funclen, xdemitcb_t *ecb) {
257 memcpy(buf, "@@ -", 4);
260 nb += xdl_num_out(buf + nb, c1 ? s1: s1 - 1);
263 memcpy(buf + nb, ",", 1);
266 nb += xdl_num_out(buf + nb, c1);
269 memcpy(buf + nb, " +", 2);
272 nb += xdl_num_out(buf + nb, c2 ? s2: s2 - 1);
275 memcpy(buf + nb, ",", 1);
278 nb += xdl_num_out(buf + nb, c2);
281 memcpy(buf + nb, " @@", 3);
283 if (func && funclen) {
285 if (funclen > sizeof(buf) - nb - 1)
286 funclen = sizeof(buf) - nb - 1;
287 memcpy(buf + nb, func, funclen);
294 if (ecb->outf(ecb->priv, &mb, 1) < 0)