2 #include "range-diff.h"
3 #include "string-list.h"
4 #include "run-command.h"
5 #include "argv-array.h"
7 #include "xdiff-interface.h"
8 #include "linear-assignment.h"
15 /* For the search for an exact match */
16 struct hashmap_entry e
;
17 const char *diff
, *patch
;
22 /* the index of the matching item in the other branch, or -1 */
28 * Reads the patches into a string list, with the `util` field being populated
29 * as struct object_id (will need to be free()d).
31 static int read_patches(const char *range
, struct string_list
*list
)
33 struct child_process cp
= CHILD_PROCESS_INIT
;
35 struct strbuf buf
= STRBUF_INIT
, line
= STRBUF_INIT
;
36 struct patch_util
*util
= NULL
;
39 argv_array_pushl(&cp
.args
, "log", "--no-color", "-p", "--no-merges",
40 "--reverse", "--date-order", "--decorate=no",
41 "--no-abbrev-commit", range
,
47 if (start_command(&cp
))
48 return error_errno(_("could not start `log`"));
49 in
= fdopen(cp
.out
, "r");
51 error_errno(_("could not read `log` output"));
56 while (strbuf_getline(&line
, in
) != EOF
) {
59 if (skip_prefix(line
.buf
, "commit ", &p
)) {
61 string_list_append(list
, buf
.buf
)->util
= util
;
64 util
= xcalloc(sizeof(*util
), 1);
65 if (get_oid(p
, &util
->oid
)) {
66 error(_("could not parse commit '%s'"), p
);
68 string_list_clear(list
, 1);
70 strbuf_release(&line
);
80 if (starts_with(line
.buf
, "diff --git")) {
82 strbuf_addch(&buf
, '\n');
83 if (!util
->diff_offset
)
84 util
->diff_offset
= buf
.len
;
85 strbuf_addbuf(&buf
, &line
);
86 } else if (in_header
) {
87 if (starts_with(line
.buf
, "Author: ")) {
88 strbuf_addbuf(&buf
, &line
);
89 strbuf_addstr(&buf
, "\n\n");
90 } else if (starts_with(line
.buf
, " ")) {
92 strbuf_addbuf(&buf
, &line
);
93 strbuf_addch(&buf
, '\n');
96 } else if (starts_with(line
.buf
, "@@ "))
97 strbuf_addstr(&buf
, "@@");
98 else if (!line
.buf
[0] || starts_with(line
.buf
, "index "))
100 * A completely blank (not ' \n', which is context)
101 * line is not valid in a diff. We skip it
102 * silently, because this neatly handles the blank
103 * separator line between commits in git-log
106 * We also want to ignore the diff's `index` lines
107 * because they contain exact blob hashes in which
108 * we are not interested.
112 strbuf_addbuf(&buf
, &line
);
114 strbuf_addch(&buf
, '\n');
118 strbuf_release(&line
);
121 string_list_append(list
, buf
.buf
)->util
= util
;
122 strbuf_release(&buf
);
124 if (finish_command(&cp
))
130 static int patch_util_cmp(const void *dummy
, const struct patch_util
*a
,
131 const struct patch_util
*b
, const char *keydata
)
133 return strcmp(a
->diff
, keydata
? keydata
: b
->diff
);
136 static void find_exact_matches(struct string_list
*a
, struct string_list
*b
)
141 hashmap_init(&map
, (hashmap_cmp_fn
)patch_util_cmp
, NULL
, 0);
143 /* First, add the patches of a to a hash map */
144 for (i
= 0; i
< a
->nr
; i
++) {
145 struct patch_util
*util
= a
->items
[i
].util
;
148 util
->patch
= a
->items
[i
].string
;
149 util
->diff
= util
->patch
+ util
->diff_offset
;
150 hashmap_entry_init(util
, strhash(util
->diff
));
151 hashmap_add(&map
, util
);
154 /* Now try to find exact matches in b */
155 for (i
= 0; i
< b
->nr
; i
++) {
156 struct patch_util
*util
= b
->items
[i
].util
, *other
;
159 util
->patch
= b
->items
[i
].string
;
160 util
->diff
= util
->patch
+ util
->diff_offset
;
161 hashmap_entry_init(util
, strhash(util
->diff
));
162 other
= hashmap_remove(&map
, util
, NULL
);
164 if (other
->matching
>= 0)
165 BUG("already assigned!");
168 util
->matching
= other
->i
;
172 hashmap_free(&map
, 0);
175 static void diffsize_consume(void *data
, char *line
, unsigned long len
)
180 static int diffsize(const char *a
, const char *b
)
182 xpparam_t pp
= { 0 };
183 xdemitconf_t cfg
= { 0 };
188 mf1
.size
= strlen(a
);
190 mf2
.size
= strlen(b
);
193 if (!xdi_diff_outf(&mf1
, &mf2
, diffsize_consume
, &count
, &pp
, &cfg
))
196 error(_("failed to generate diff"));
200 static void get_correspondences(struct string_list
*a
, struct string_list
*b
,
203 int n
= a
->nr
+ b
->nr
;
204 int *cost
, c
, *a2b
, *b2a
;
207 ALLOC_ARRAY(cost
, st_mult(n
, n
));
211 for (i
= 0; i
< a
->nr
; i
++) {
212 struct patch_util
*a_util
= a
->items
[i
].util
;
214 for (j
= 0; j
< b
->nr
; j
++) {
215 struct patch_util
*b_util
= b
->items
[j
].util
;
217 if (a_util
->matching
== j
)
219 else if (a_util
->matching
< 0 && b_util
->matching
< 0)
220 c
= diffsize(a_util
->diff
, b_util
->diff
);
226 c
= a_util
->matching
< 0 ?
227 a_util
->diffsize
* creation_factor
/ 100 : COST_MAX
;
228 for (j
= b
->nr
; j
< n
; j
++)
232 for (j
= 0; j
< b
->nr
; j
++) {
233 struct patch_util
*util
= b
->items
[j
].util
;
235 c
= util
->matching
< 0 ?
236 util
->diffsize
* creation_factor
/ 100 : COST_MAX
;
237 for (i
= a
->nr
; i
< n
; i
++)
241 for (i
= a
->nr
; i
< n
; i
++)
242 for (j
= b
->nr
; j
< n
; j
++)
245 compute_assignment(n
, n
, cost
, a2b
, b2a
);
247 for (i
= 0; i
< a
->nr
; i
++)
248 if (a2b
[i
] >= 0 && a2b
[i
] < b
->nr
) {
249 struct patch_util
*a_util
= a
->items
[i
].util
;
250 struct patch_util
*b_util
= b
->items
[a2b
[i
]].util
;
252 a_util
->matching
= a2b
[i
];
253 b_util
->matching
= i
;
261 static void output_pair_header(struct diff_options
*diffopt
,
264 struct strbuf
*dashes
,
265 struct patch_util
*a_util
,
266 struct patch_util
*b_util
)
268 struct object_id
*oid
= a_util
? &a_util
->oid
: &b_util
->oid
;
269 struct commit
*commit
;
271 const char *color_reset
= diff_get_color_opt(diffopt
, DIFF_RESET
);
272 const char *color_old
= diff_get_color_opt(diffopt
, DIFF_FILE_OLD
);
273 const char *color_new
= diff_get_color_opt(diffopt
, DIFF_FILE_NEW
);
274 const char *color_commit
= diff_get_color_opt(diffopt
, DIFF_COMMIT
);
278 strbuf_addchars(dashes
, '-',
279 strlen(find_unique_abbrev(oid
,
285 } else if (!a_util
) {
288 } else if (strcmp(a_util
->patch
, b_util
->patch
)) {
289 color
= color_commit
;
292 color
= color_commit
;
297 strbuf_addstr(buf
, status
== '!' ? color_old
: color
);
299 strbuf_addf(buf
, "%*s: %s ", patch_no_width
, "-", dashes
->buf
);
301 strbuf_addf(buf
, "%*d: %s ", patch_no_width
, a_util
->i
+ 1,
302 find_unique_abbrev(&a_util
->oid
, DEFAULT_ABBREV
));
305 strbuf_addf(buf
, "%s%s", color_reset
, color
);
306 strbuf_addch(buf
, status
);
308 strbuf_addf(buf
, "%s%s", color_reset
, color_new
);
311 strbuf_addf(buf
, " %*s: %s", patch_no_width
, "-", dashes
->buf
);
313 strbuf_addf(buf
, " %*d: %s", patch_no_width
, b_util
->i
+ 1,
314 find_unique_abbrev(&b_util
->oid
, DEFAULT_ABBREV
));
316 commit
= lookup_commit_reference(the_repository
, oid
);
319 strbuf_addf(buf
, "%s%s", color_reset
, color
);
321 strbuf_addch(buf
, ' ');
322 pp_commit_easy(CMIT_FMT_ONELINE
, commit
, buf
);
324 strbuf_addf(buf
, "%s\n", color_reset
);
326 fwrite(buf
->buf
, buf
->len
, 1, stdout
);
329 static struct userdiff_driver no_func_name
= {
330 .funcname
= { "$^", 0 }
333 static struct diff_filespec
*get_filespec(const char *name
, const char *p
)
335 struct diff_filespec
*spec
= alloc_filespec(name
);
337 fill_filespec(spec
, &null_oid
, 0, 0644);
338 spec
->data
= (char *)p
;
339 spec
->size
= strlen(p
);
340 spec
->should_munmap
= 0;
342 spec
->driver
= &no_func_name
;
347 static void patch_diff(const char *a
, const char *b
,
348 struct diff_options
*diffopt
)
350 diff_queue(&diff_queued_diff
,
351 get_filespec("a", a
), get_filespec("b", b
));
353 diffcore_std(diffopt
);
357 static void output(struct string_list
*a
, struct string_list
*b
,
358 struct diff_options
*diffopt
)
360 struct strbuf buf
= STRBUF_INIT
, dashes
= STRBUF_INIT
;
361 int patch_no_width
= decimal_width(1 + (a
->nr
> b
->nr
? a
->nr
: b
->nr
));
365 * We assume the user is really more interested in the second argument
366 * ("newer" version). To that end, we print the output in the order of
367 * the RHS (the `b` parameter). To put the LHS (the `a` parameter)
368 * commits that are no longer in the RHS into a good place, we place
369 * them once we have shown all of their predecessors in the LHS.
372 while (i
< a
->nr
|| j
< b
->nr
) {
373 struct patch_util
*a_util
, *b_util
;
374 a_util
= i
< a
->nr
? a
->items
[i
].util
: NULL
;
375 b_util
= j
< b
->nr
? b
->items
[j
].util
: NULL
;
377 /* Skip all the already-shown commits from the LHS. */
378 while (i
< a
->nr
&& a_util
->shown
)
379 a_util
= ++i
< a
->nr
? a
->items
[i
].util
: NULL
;
381 /* Show unmatched LHS commit whose predecessors were shown. */
382 if (i
< a
->nr
&& a_util
->matching
< 0) {
383 output_pair_header(diffopt
, patch_no_width
,
384 &buf
, &dashes
, a_util
, NULL
);
389 /* Show unmatched RHS commits. */
390 while (j
< b
->nr
&& b_util
->matching
< 0) {
391 output_pair_header(diffopt
, patch_no_width
,
392 &buf
, &dashes
, NULL
, b_util
);
393 b_util
= ++j
< b
->nr
? b
->items
[j
].util
: NULL
;
396 /* Show matching LHS/RHS pair. */
398 a_util
= a
->items
[b_util
->matching
].util
;
399 output_pair_header(diffopt
, patch_no_width
,
400 &buf
, &dashes
, a_util
, b_util
);
401 if (!(diffopt
->output_format
& DIFF_FORMAT_NO_OUTPUT
))
402 patch_diff(a
->items
[b_util
->matching
].string
,
403 b
->items
[j
].string
, diffopt
);
408 strbuf_release(&buf
);
409 strbuf_release(&dashes
);
412 int show_range_diff(const char *range1
, const char *range2
,
413 int creation_factor
, struct diff_options
*diffopt
)
417 struct string_list branch1
= STRING_LIST_INIT_DUP
;
418 struct string_list branch2
= STRING_LIST_INIT_DUP
;
420 if (read_patches(range1
, &branch1
))
421 res
= error(_("could not parse log for '%s'"), range1
);
422 if (!res
&& read_patches(range2
, &branch2
))
423 res
= error(_("could not parse log for '%s'"), range2
);
426 find_exact_matches(&branch1
, &branch2
);
427 get_correspondences(&branch1
, &branch2
, creation_factor
);
428 output(&branch1
, &branch2
, diffopt
);
431 string_list_clear(&branch1
, 1);
432 string_list_clear(&branch2
, 1);