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>
28 long xdl_bogosqrt(long n
) {
32 * Classical integer square root approximation using shifts.
34 for (i
= 1; n
> 0; n
>>= 2)
41 int xdl_emit_diffrec(char const *rec
, long size
, char const *pre
, long psize
,
46 mb
[0].ptr
= (char *) pre
;
48 mb
[1].ptr
= (char *) rec
;
50 if (size
> 0 && rec
[size
- 1] != '\n') {
51 mb
[2].ptr
= (char *) "\n\\ No newline at end of file\n";
52 mb
[2].size
= strlen(mb
[2].ptr
);
55 if (ecb
->outf(ecb
->priv
, mb
, i
) < 0) {
63 void *xdl_mmfile_first(mmfile_t
*mmf
, long *size
)
70 long xdl_mmfile_size(mmfile_t
*mmf
)
76 int xdl_cha_init(chastore_t
*cha
, long isize
, long icount
) {
78 cha
->head
= cha
->tail
= NULL
;
80 cha
->nsize
= icount
* isize
;
81 cha
->ancur
= cha
->sncur
= NULL
;
88 void xdl_cha_free(chastore_t
*cha
) {
91 for (cur
= cha
->head
; (tmp
= cur
) != NULL
;) {
98 void *xdl_cha_alloc(chastore_t
*cha
) {
102 if (!(ancur
= cha
->ancur
) || ancur
->icurr
== cha
->nsize
) {
103 if (!(ancur
= (chanode_t
*) xdl_malloc(sizeof(chanode_t
) + cha
->nsize
))) {
110 cha
->tail
->next
= ancur
;
117 data
= (char *) ancur
+ sizeof(chanode_t
) + ancur
->icurr
;
118 ancur
->icurr
+= cha
->isize
;
124 void *xdl_cha_first(chastore_t
*cha
) {
127 if (!(cha
->sncur
= sncur
= cha
->head
))
132 return (char *) sncur
+ sizeof(chanode_t
) + cha
->scurr
;
136 void *xdl_cha_next(chastore_t
*cha
) {
139 if (!(sncur
= cha
->sncur
))
141 cha
->scurr
+= cha
->isize
;
142 if (cha
->scurr
== sncur
->icurr
) {
143 if (!(sncur
= cha
->sncur
= sncur
->next
))
148 return (char *) sncur
+ sizeof(chanode_t
) + cha
->scurr
;
152 long xdl_guess_lines(mmfile_t
*mf
, long sample
) {
153 long nl
= 0, size
, tsize
= 0;
154 char const *data
, *cur
, *top
;
156 if ((cur
= data
= xdl_mmfile_first(mf
, &size
)) != NULL
) {
157 for (top
= data
+ size
; nl
< sample
&& cur
< top
; ) {
159 if (!(cur
= memchr(cur
, '\n', top
- cur
)))
164 tsize
+= (long) (cur
- data
);
168 nl
= xdl_mmfile_size(mf
) / (tsize
/ nl
);
173 int xdl_recmatch(const char *l1
, long s1
, const char *l2
, long s2
, long flags
)
177 if (s1
== s2
&& !memcmp(l1
, l2
, s1
))
179 if (!(flags
& XDF_WHITESPACE_FLAGS
))
186 * -w matches everything that matches with -b, and -b in turn
187 * matches everything that matches with --ignore-space-at-eol.
189 * Each flavor of ignoring needs different logic to skip whitespaces
190 * while we have both sides to compare.
192 if (flags
& XDF_IGNORE_WHITESPACE
) {
194 while (i1
< s1
&& i2
< s2
) {
195 if (l1
[i1
++] != l2
[i2
++])
198 while (i1
< s1
&& XDL_ISSPACE(l1
[i1
]))
200 while (i2
< s2
&& XDL_ISSPACE(l2
[i2
]))
203 } else if (flags
& XDF_IGNORE_WHITESPACE_CHANGE
) {
204 while (i1
< s1
&& i2
< s2
) {
205 if (XDL_ISSPACE(l1
[i1
]) && XDL_ISSPACE(l2
[i2
])) {
206 /* Skip matching spaces and try again */
207 while (i1
< s1
&& XDL_ISSPACE(l1
[i1
]))
209 while (i2
< s2
&& XDL_ISSPACE(l2
[i2
]))
213 if (l1
[i1
++] != l2
[i2
++])
216 } else if (flags
& XDF_IGNORE_WHITESPACE_AT_EOL
) {
217 while (i1
< s1
&& i2
< s2
&& l1
[i1
++] == l2
[i2
++])
222 * After running out of one side, the remaining side must have
223 * nothing but whitespace for the lines to match. Note that
224 * ignore-whitespace-at-eol case may break out of the loop
225 * while there still are characters remaining on both lines.
228 while (i1
< s1
&& XDL_ISSPACE(l1
[i1
]))
234 while (i2
< s2
&& XDL_ISSPACE(l2
[i2
]))
241 static unsigned long xdl_hash_record_with_whitespace(char const **data
,
242 char const *top
, long flags
) {
243 unsigned long ha
= 5381;
244 char const *ptr
= *data
;
246 for (; ptr
< top
&& *ptr
!= '\n'; ptr
++) {
247 if (XDL_ISSPACE(*ptr
)) {
248 const char *ptr2
= ptr
;
250 while (ptr
+ 1 < top
&& XDL_ISSPACE(ptr
[1])
253 at_eol
= (top
<= ptr
+ 1 || ptr
[1] == '\n');
254 if (flags
& XDF_IGNORE_WHITESPACE
)
255 ; /* already handled */
256 else if (flags
& XDF_IGNORE_WHITESPACE_CHANGE
259 ha
^= (unsigned long) ' ';
261 else if (flags
& XDF_IGNORE_WHITESPACE_AT_EOL
263 while (ptr2
!= ptr
+ 1) {
265 ha
^= (unsigned long) *ptr2
;
272 ha
^= (unsigned long) *ptr
;
274 *data
= ptr
< top
? ptr
+ 1: ptr
;
280 unsigned long xdl_hash_record(char const **data
, char const *top
, long flags
) {
281 unsigned long ha
= 5381;
282 char const *ptr
= *data
;
284 if (flags
& XDF_WHITESPACE_FLAGS
)
285 return xdl_hash_record_with_whitespace(data
, top
, flags
);
287 for (; ptr
< top
&& *ptr
!= '\n'; ptr
++) {
289 ha
^= (unsigned long) *ptr
;
291 *data
= ptr
< top
? ptr
+ 1: ptr
;
297 unsigned int xdl_hashbits(unsigned int size
) {
298 unsigned int val
= 1, bits
= 0;
300 for (; val
< size
&& bits
< CHAR_BIT
* sizeof(unsigned int); val
<<= 1, bits
++);
301 return bits
? bits
: 1;
305 int xdl_num_out(char *out
, long val
) {
306 char *ptr
, *str
= out
;
309 ptr
= buf
+ sizeof(buf
) - 1;
315 for (; val
&& ptr
> buf
; val
/= 10)
316 *--ptr
= "0123456789"[val
% 10];
318 for (; *ptr
; ptr
++, str
++)
328 long xdl_atol(char const *str
, char const **next
) {
332 for (top
= str
; XDL_ISDIGIT(*top
); top
++);
335 for (val
= 0, base
= 1, top
--; top
>= str
; top
--, base
*= 10)
336 val
+= base
* (long)(*top
- '0');
341 int xdl_emit_hunk_hdr(long s1
, long c1
, long s2
, long c2
,
342 const char *func
, long funclen
, xdemitcb_t
*ecb
) {
347 memcpy(buf
, "@@ -", 4);
350 nb
+= xdl_num_out(buf
+ nb
, c1
? s1
: s1
- 1);
353 memcpy(buf
+ nb
, ",", 1);
356 nb
+= xdl_num_out(buf
+ nb
, c1
);
359 memcpy(buf
+ nb
, " +", 2);
362 nb
+= xdl_num_out(buf
+ nb
, c2
? s2
: s2
- 1);
365 memcpy(buf
+ nb
, ",", 1);
368 nb
+= xdl_num_out(buf
+ nb
, c2
);
371 memcpy(buf
+ nb
, " @@", 3);
373 if (func
&& funclen
) {
375 if (funclen
> sizeof(buf
) - nb
- 1)
376 funclen
= sizeof(buf
) - nb
- 1;
377 memcpy(buf
+ nb
, func
, funclen
);
384 if (ecb
->outf(ecb
->priv
, &mb
, 1) < 0)
390 int xdl_fall_back_diff(xdfenv_t
*diff_env
, xpparam_t
const *xpp
,
391 int line1
, int count1
, int line2
, int count2
)
394 * This probably does not work outside Git, since
395 * we have a very simple mmfile structure.
397 * Note: ideally, we would reuse the prepared environment, but
398 * the libxdiff interface does not (yet) allow for diffing only
399 * ranges of lines instead of the whole files.
401 mmfile_t subfile1
, subfile2
;
404 subfile1
.ptr
= (char *)diff_env
->xdf1
.recs
[line1
- 1]->ptr
;
405 subfile1
.size
= diff_env
->xdf1
.recs
[line1
+ count1
- 2]->ptr
+
406 diff_env
->xdf1
.recs
[line1
+ count1
- 2]->size
- subfile1
.ptr
;
407 subfile2
.ptr
= (char *)diff_env
->xdf2
.recs
[line2
- 1]->ptr
;
408 subfile2
.size
= diff_env
->xdf2
.recs
[line2
+ count2
- 2]->ptr
+
409 diff_env
->xdf2
.recs
[line2
+ count2
- 2]->size
- subfile2
.ptr
;
410 if (xdl_do_diff(&subfile1
, &subfile2
, xpp
, &env
) < 0)
413 memcpy(diff_env
->xdf1
.rchg
+ line1
- 1, env
.xdf1
.rchg
, count1
);
414 memcpy(diff_env
->xdf2
.rchg
+ line2
- 1, env
.xdf2
.rchg
, count2
);