2 * LibXDiff by Davide Libenzi ( File Differential Library )
3 * Copyright (C) 2003-2006 Davide Libenzi, Johannes E. Schindelin
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>
25 typedef struct s_xdmerge {
26 struct s_xdmerge *next;
29 * 1 = no conflict, take first,
30 * 2 = no conflict, take second.
37 static int xdl_append_merge(xdmerge_t **merge, int mode,
38 long i1, long chg1, long i2, long chg2)
40 xdmerge_t *m = *merge;
41 if (m && (i1 <= m->i1 + m->chg1 || i2 <= m->i2 + m->chg2)) {
44 m->chg1 = i1 + chg1 - m->i1;
45 m->chg2 = i2 + chg2 - m->i2;
47 m = xdl_malloc(sizeof(xdmerge_t));
63 static int xdl_cleanup_merge(xdmerge_t *c)
68 /* were there conflicts? */
69 for (; c; c = next_c) {
78 static int xdl_merge_cmp_lines(xdfenv_t *xe1, int i1, xdfenv_t *xe2, int i2,
79 int line_count, long flags)
82 xrecord_t **rec1 = xe1->xdf2.recs + i1;
83 xrecord_t **rec2 = xe2->xdf2.recs + i2;
85 for (i = 0; i < line_count; i++) {
86 int result = xdl_recmatch(rec1[i]->ptr, rec1[i]->size,
87 rec2[i]->ptr, rec2[i]->size, flags);
94 static int xdl_recs_copy(xdfenv_t *xe, int i, int count, int add_nl, char *dest)
96 xrecord_t **recs = xe->xdf2.recs + i;
102 for (i = 0; i < count; size += recs[i++]->size)
104 memcpy(dest + size, recs[i]->ptr, recs[i]->size);
106 i = recs[count - 1]->size;
107 if (i == 0 || recs[count - 1]->ptr[i - 1] != '\n') {
116 static int xdl_fill_merge_buffer(xdfenv_t *xe1, const char *name1,
117 xdfenv_t *xe2, const char *name2, xdmerge_t *m, char *dest)
119 const int marker_size = 7;
120 int marker1_size = (name1 ? strlen(name1) + 1 : 0);
121 int marker2_size = (name2 ? strlen(name2) + 1 : 0);
122 int conflict_marker_size = 3 * (marker_size + 1)
123 + marker1_size + marker2_size;
126 for (size = i1 = 0; m; m = m->next) {
128 size += xdl_recs_copy(xe1, i1, m->i1 - i1, 0,
129 dest ? dest + size : NULL);
131 for (j = 0; j < marker_size; j++)
135 memcpy(dest + size + 1, name1,
137 size += marker1_size;
141 size += conflict_marker_size;
142 size += xdl_recs_copy(xe1, m->i1, m->chg1, 1,
143 dest ? dest + size : NULL);
145 for (j = 0; j < marker_size; j++)
149 size += xdl_recs_copy(xe2, m->i2, m->chg2, 1,
150 dest ? dest + size : NULL);
152 for (j = 0; j < marker_size; j++)
156 memcpy(dest + size + 1, name2,
158 size += marker2_size;
162 } else if (m->mode == 1)
163 size += xdl_recs_copy(xe1, i1, m->i1 + m->chg1 - i1, 0,
164 dest ? dest + size : NULL);
165 else if (m->mode == 2)
166 size += xdl_recs_copy(xe2, m->i2 - m->i1 + i1,
167 m->i1 + m->chg2 - i1, 0,
168 dest ? dest + size : NULL);
169 i1 = m->i1 + m->chg1;
171 size += xdl_recs_copy(xe1, i1, xe1->xdf2.nrec - i1, 0,
172 dest ? dest + size : NULL);
177 * Sometimes, changes are not quite identical, but differ in only a few
178 * lines. Try hard to show only these few lines as conflicting.
180 static int xdl_refine_conflicts(xdfenv_t *xe1, xdfenv_t *xe2, xdmerge_t *m,
181 xpparam_t const *xpp)
183 for (; m; m = m->next) {
186 xdchange_t *xscr, *x;
187 int i1 = m->i1, i2 = m->i2;
189 /* let's handle just the conflicts */
194 * This probably does not work outside git, since
195 * we have a very simple mmfile structure.
197 t1.ptr = (char *)xe1->xdf2.recs[m->i1]->ptr;
198 t1.size = xe1->xdf2.recs[m->i1 + m->chg1 - 1]->ptr
199 + xe1->xdf2.recs[m->i1 + m->chg1 - 1]->size - t1.ptr;
200 t2.ptr = (char *)xe2->xdf2.recs[m->i2]->ptr;
201 t2.size = xe2->xdf2.recs[m->i2 + m->chg2 - 1]->ptr
202 + xe2->xdf2.recs[m->i2 + m->chg2 - 1]->size - t2.ptr;
203 if (xdl_do_diff(&t1, &t2, xpp, &xe) < 0)
205 if (xdl_change_compact(&xe.xdf1, &xe.xdf2, xpp->flags) < 0 ||
206 xdl_change_compact(&xe.xdf2, &xe.xdf1, xpp->flags) < 0 ||
207 xdl_build_script(&xe, &xscr) < 0) {
212 /* If this happens, it's a bug. */
217 m->i1 = xscr->i1 + i1;
218 m->chg1 = xscr->chg1;
219 m->i2 = xscr->i2 + i2;
220 m->chg2 = xscr->chg2;
222 xdmerge_t *m2 = xdl_malloc(sizeof(xdmerge_t));
233 m->i1 = xscr->i1 + i1;
234 m->chg1 = xscr->chg1;
235 m->i2 = xscr->i2 + i2;
236 m->chg2 = xscr->chg2;
245 * level == 0: mark all overlapping changes as conflict
246 * level == 1: mark overlapping changes as conflict only if not identical
247 * level == 2: analyze non-identical changes for minimal conflict set
249 * returns < 0 on error, == 0 for no conflicts, else number of conflicts
251 static int xdl_do_merge(xdfenv_t *xe1, xdchange_t *xscr1, const char *name1,
252 xdfenv_t *xe2, xdchange_t *xscr2, const char *name2,
253 int level, xpparam_t const *xpp, mmbuffer_t *result) {
254 xdmerge_t *changes, *c;
255 int i1, i2, chg1, chg2;
259 while (xscr1 && xscr2) {
262 if (xscr1->i1 + xscr1->chg1 < xscr2->i1) {
264 i2 = xscr2->i2 - xscr2->i1 + xscr1->i1;
267 if (xdl_append_merge(&c, 1, i1, chg1, i2, chg2)) {
268 xdl_cleanup_merge(changes);
274 if (xscr2->i1 + xscr2->chg1 < xscr1->i1) {
275 i1 = xscr1->i2 - xscr1->i1 + xscr2->i1;
279 if (xdl_append_merge(&c, 2, i1, chg1, i2, chg2)) {
280 xdl_cleanup_merge(changes);
286 if (level < 1 || xscr1->i1 != xscr2->i1 ||
287 xscr1->chg1 != xscr2->chg1 ||
288 xscr1->chg2 != xscr2->chg2 ||
289 xdl_merge_cmp_lines(xe1, xscr1->i2,
291 xscr1->chg2, xpp->flags)) {
293 int off = xscr1->i1 - xscr2->i1;
294 int ffo = off + xscr1->chg1 - xscr2->chg1;
302 chg1 = xscr1->i2 + xscr1->chg2 - i1;
303 chg2 = xscr2->i2 + xscr2->chg2 - i2;
308 if (xdl_append_merge(&c, 0, i1, chg1, i2, chg2)) {
309 xdl_cleanup_merge(changes);
314 i1 = xscr1->i1 + xscr1->chg1;
315 i2 = xscr2->i1 + xscr2->chg1;
326 i2 = xscr1->i1 + xe2->xdf2.nrec - xe2->xdf1.nrec;
329 if (xdl_append_merge(&c, 1, i1, chg1, i2, chg2)) {
330 xdl_cleanup_merge(changes);
338 i1 = xscr2->i1 + xe1->xdf2.nrec - xe1->xdf1.nrec;
342 if (xdl_append_merge(&c, 2, i1, chg1, i2, chg2)) {
343 xdl_cleanup_merge(changes);
350 /* refine conflicts */
351 if (level > 1 && xdl_refine_conflicts(xe1, xe2, changes, xpp) < 0) {
352 xdl_cleanup_merge(changes);
357 int size = xdl_fill_merge_buffer(xe1, name1, xe2, name2,
359 result->ptr = xdl_malloc(size);
361 xdl_cleanup_merge(changes);
365 xdl_fill_merge_buffer(xe1, name1, xe2, name2, changes,
368 return xdl_cleanup_merge(changes);
371 int xdl_merge(mmfile_t *orig, mmfile_t *mf1, const char *name1,
372 mmfile_t *mf2, const char *name2,
373 xpparam_t const *xpp, int level, mmbuffer_t *result) {
374 xdchange_t *xscr1, *xscr2;
381 if (xdl_do_diff(orig, mf1, xpp, &xe1) < 0 ||
382 xdl_do_diff(orig, mf2, xpp, &xe2) < 0) {
385 if (xdl_change_compact(&xe1.xdf1, &xe1.xdf2, xpp->flags) < 0 ||
386 xdl_change_compact(&xe1.xdf2, &xe1.xdf1, xpp->flags) < 0 ||
387 xdl_build_script(&xe1, &xscr1) < 0) {
391 if (xdl_change_compact(&xe2.xdf1, &xe2.xdf2, xpp->flags) < 0 ||
392 xdl_change_compact(&xe2.xdf2, &xe2.xdf1, xpp->flags) < 0 ||
393 xdl_build_script(&xe2, &xscr2) < 0) {
398 if (xscr1 || xscr2) {
400 result->ptr = xdl_malloc(mf2->size);
401 memcpy(result->ptr, mf2->ptr, mf2->size);
402 result->size = mf2->size;
404 result->ptr = xdl_malloc(mf1->size);
405 memcpy(result->ptr, mf1->ptr, mf1->size);
406 result->size = mf1->size;
408 status = xdl_do_merge(&xe1, xscr1, name1,
412 xdl_free_script(xscr1);
413 xdl_free_script(xscr2);