* find set of paths that everybody touches, assuming diff is run without * rename/copy detection, etc, comparing all trees simultaneously (= faster). */
| 1425 | * rename/copy detection, etc, comparing all trees simultaneously (= faster). |
| 1426 | */ |
| 1427 | static struct combine_diff_path *find_paths_multitree( |
| 1428 | const struct object_id *oid, const struct oid_array *parents, |
| 1429 | struct diff_options *opt) |
| 1430 | { |
| 1431 | int i, nparent = parents->nr; |
| 1432 | const struct object_id **parents_oid; |
| 1433 | struct combine_diff_path *paths; |
| 1434 | struct strbuf base; |
| 1435 | |
| 1436 | ALLOC_ARRAY(parents_oid, nparent); |
| 1437 | for (i = 0; i < nparent; i++) |
| 1438 | parents_oid[i] = &parents->oid[i]; |
| 1439 | |
| 1440 | strbuf_init(&base, PATH_MAX); |
| 1441 | paths = diff_tree_paths(oid, parents_oid, nparent, &base, opt); |
| 1442 | |
| 1443 | strbuf_release(&base); |
| 1444 | free(parents_oid); |
| 1445 | return paths; |
| 1446 | } |
| 1447 | |
| 1448 | static int match_objfind(struct combine_diff_path *path, |
| 1449 | int num_parent, |
no test coverage detected