2 * Copyright (C) 2005 Junio C Hamano
10 #include "cache-tree.h"
11 #include "path-list.h"
17 static int read_directory(const char *path, struct path_list *list)
22 if (!(dir = opendir(path)))
23 return error("Could not open directory %s", path);
25 while ((e = readdir(dir)))
26 if (strcmp(".", e->d_name) && strcmp("..", e->d_name))
27 path_list_insert(e->d_name, list);
33 static int get_mode(const char *path, int *mode)
37 if (!path || !strcmp(path, "/dev/null"))
39 else if (!strcmp(path, "-"))
40 *mode = ntohl(create_ce_mode(0666));
41 else if (stat(path, &st))
42 return error("Could not access '%s'", path);
48 static int queue_diff(struct diff_options *o,
49 const char *name1, const char *name2)
51 int mode1 = 0, mode2 = 0;
53 if (get_mode(name1, &mode1) || get_mode(name2, &mode2))
56 if (mode1 && mode2 && S_ISDIR(mode1) != S_ISDIR(mode2))
57 return error("file/directory conflict: %s, %s", name1, name2);
59 if (S_ISDIR(mode1) || S_ISDIR(mode2)) {
60 char buffer1[PATH_MAX], buffer2[PATH_MAX];
61 struct path_list p1 = {NULL, 0, 0, 1}, p2 = {NULL, 0, 0, 1};
62 int len1 = 0, len2 = 0, i1, i2, ret = 0;
64 if (name1 && read_directory(name1, &p1))
66 if (name2 && read_directory(name2, &p2)) {
67 path_list_clear(&p1, 0);
73 if (len1 > 0 && name1[len1 - 1] == '/')
75 memcpy(buffer1, name1, len1);
76 buffer1[len1++] = '/';
81 if (len2 > 0 && name2[len2 - 1] == '/')
83 memcpy(buffer2, name2, len2);
84 buffer2[len2++] = '/';
87 for (i1 = i2 = 0; !ret && (i1 < p1.nr || i2 < p2.nr); ) {
96 comp = strcmp(p1.items[i1].path,
103 strncpy(buffer1 + len1, p1.items[i1++].path,
111 strncpy(buffer2 + len2, p2.items[i2++].path,
115 ret = queue_diff(o, n1, n2);
117 path_list_clear(&p1, 0);
118 path_list_clear(&p2, 0);
122 struct diff_filespec *d1, *d2;
124 if (o->reverse_diff) {
127 tmp = mode1; mode1 = mode2; mode2 = tmp;
128 tmp_c = name1; name1 = name2; name2 = tmp_c;
135 d1 = alloc_filespec(name1);
136 d2 = alloc_filespec(name2);
137 fill_filespec(d1, null_sha1, mode1);
138 fill_filespec(d2, null_sha1, mode2);
140 diff_queue(&diff_queued_diff, d1, d2);
146 * Does the path name a blob in the working tree, or a directory
147 * in the working tree?
149 static int is_in_index(const char *path)
152 struct cache_entry *ce;
155 while (path[len-1] == '/')
159 pos = cache_name_pos(path, len);
163 while (pos < active_nr) {
164 ce = active_cache[pos++];
165 if (ce_namelen(ce) <= len ||
166 strncmp(ce->name, path, len) ||
167 (ce->name[len] > '/'))
168 break; /* path cannot be a prefix */
169 if (ce->name[len] == '/')
175 static int handle_diff_files_args(struct rev_info *revs,
176 int argc, const char **argv,
177 unsigned int *options)
181 /* revs->max_count == -2 means --no-index */
182 while (1 < argc && argv[1][0] == '-') {
183 if (!strcmp(argv[1], "--base"))
185 else if (!strcmp(argv[1], "--ours"))
187 else if (!strcmp(argv[1], "--theirs"))
189 else if (!strcmp(argv[1], "-n") ||
190 !strcmp(argv[1], "--no-index")) {
191 revs->max_count = -2;
192 revs->diffopt.exit_with_status = 1;
193 revs->diffopt.no_index = 1;
195 else if (!strcmp(argv[1], "-q"))
196 *options |= DIFF_SILENT_ON_REMOVED;
198 return error("invalid option: %s", argv[1]);
202 if (revs->max_count == -1 && revs->diffopt.nr_paths == 2) {
204 * If two files are specified, and at least one is untracked,
205 * default to no-index.
208 if (!is_in_index(revs->diffopt.paths[0]) ||
209 !is_in_index(revs->diffopt.paths[1])) {
210 revs->max_count = -2;
211 revs->diffopt.no_index = 1;
216 * Make sure there are NO revision (i.e. pending object) parameter,
217 * rev.max_count is reasonable (0 <= n <= 3),
218 * there is no other revision filtering parameters.
220 if (revs->pending.nr || revs->max_count > 3 ||
221 revs->min_age != -1 || revs->max_age != -1)
222 return error("no revision allowed with diff-files");
224 if (revs->max_count == -1 &&
225 (revs->diffopt.output_format & DIFF_FORMAT_PATCH))
226 revs->combine_merges = revs->dense_combined_merges = 1;
231 static int is_outside_repo(const char *path, int nongit, const char *prefix)
234 if (nongit || !strcmp(path, "-") || path[0] == '/')
236 if (prefixcmp(path, "../"))
240 for (i = strlen(prefix); !prefixcmp(path, "../"); ) {
241 while (i > 0 && prefix[i - 1] != '/')
250 int setup_diff_no_index(struct rev_info *revs,
251 int argc, const char ** argv, int nongit, const char *prefix)
254 for (i = 1; i < argc; i++)
255 if (argv[i][0] != '-' || argv[i][1] == '\0')
257 else if (!strcmp(argv[i], "--")) {
260 } else if (i < argc - 3 && !strcmp(argv[i], "--no-index")) {
262 revs->diffopt.exit_with_status = 1;
265 if (argc != i + 2 || (!is_outside_repo(argv[i + 1], nongit, prefix) &&
266 !is_outside_repo(argv[i], nongit, prefix)))
269 diff_setup(&revs->diffopt);
270 for (i = 1; i < argc - 2; )
271 if (!strcmp(argv[i], "--no-index"))
274 int j = diff_opt_parse(&revs->diffopt,
277 die("invalid diff option/value: %s", argv[i]);
282 int len = strlen(prefix);
284 revs->diffopt.paths = xcalloc(2, sizeof(char*));
285 for (i = 0; i < 2; i++) {
286 const char *p = argv[argc - 2 + i];
288 * stdin should be spelled as '-'; if you have
289 * path that is '-', spell it as ./-.
292 ? xstrdup(prefix_filename(prefix, len, p))
294 revs->diffopt.paths[i] = p;
298 revs->diffopt.paths = argv + argc - 2;
299 revs->diffopt.nr_paths = 2;
300 revs->diffopt.no_index = 1;
301 revs->max_count = -2;
302 if (diff_setup_done(&revs->diffopt) < 0)
303 die("diff_setup_done failed");
307 int run_diff_files_cmd(struct rev_info *revs, int argc, const char **argv)
309 unsigned int options;
311 if (handle_diff_files_args(revs, argc, argv, &options))
314 if (revs->diffopt.no_index) {
315 if (revs->diffopt.nr_paths != 2)
316 return error("need two files/directories with --no-index");
317 if (queue_diff(&revs->diffopt, revs->diffopt.paths[0],
318 revs->diffopt.paths[1]))
320 diffcore_std(&revs->diffopt);
321 diff_flush(&revs->diffopt);
323 * The return code for --no-index imitates diff(1):
324 * 0 = no changes, 1 = changes, else error
326 return revs->diffopt.found_changes;
329 if (read_cache() < 0) {
330 perror("read_cache");
333 return run_diff_files(revs, options);
336 int run_diff_files(struct rev_info *revs, unsigned int option)
339 int diff_unmerged_stage = revs->max_count;
340 int silent_on_removed = option & DIFF_SILENT_ON_REMOVED;
341 unsigned ce_option = ((option & DIFF_RACY_IS_MODIFIED)
342 ? CE_MATCH_RACY_IS_DIRTY : 0);
344 if (diff_unmerged_stage < 0)
345 diff_unmerged_stage = 2;
347 for (i = 0; i < entries; i++) {
349 unsigned int oldmode, newmode;
350 struct cache_entry *ce = active_cache[i];
353 if (revs->diffopt.quiet && revs->diffopt.has_changes)
356 if (!ce_path_match(ce, revs->prune_data))
360 struct combine_diff_path *dpath;
361 int num_compare_stages = 0;
364 path_len = ce_namelen(ce);
366 dpath = xmalloc(combine_diff_path_size(5, path_len));
367 dpath->path = (char *) &(dpath->parent[5]);
370 dpath->len = path_len;
371 memcpy(dpath->path, ce->name, path_len);
372 dpath->path[path_len] = '\0';
373 hashclr(dpath->sha1);
374 memset(&(dpath->parent[0]), 0,
375 sizeof(struct combine_diff_parent)*5);
377 if (lstat(ce->name, &st) < 0) {
378 if (errno != ENOENT && errno != ENOTDIR) {
382 if (silent_on_removed)
386 dpath->mode = ntohl(ce_mode_from_stat(ce, st.st_mode));
388 while (i < entries) {
389 struct cache_entry *nce = active_cache[i];
392 if (strcmp(ce->name, nce->name))
395 /* Stage #2 (ours) is the first parent,
396 * stage #3 (theirs) is the second.
398 stage = ce_stage(nce);
400 int mode = ntohl(nce->ce_mode);
401 num_compare_stages++;
402 hashcpy(dpath->parent[stage-2].sha1, nce->sha1);
403 dpath->parent[stage-2].mode = ntohl(ce_mode_from_stat(nce, mode));
404 dpath->parent[stage-2].status =
405 DIFF_STATUS_MODIFIED;
408 /* diff against the proper unmerged stage */
409 if (stage == diff_unmerged_stage)
414 * Compensate for loop update
418 if (revs->combine_merges && num_compare_stages == 2) {
419 show_combined_diff(dpath, 2,
420 revs->dense_combined_merges,
429 * Show the diff for the 'ce' if we found the one
430 * from the desired stage.
432 diff_unmerge(&revs->diffopt, ce->name, 0, null_sha1);
433 if (ce_stage(ce) != diff_unmerged_stage)
437 if (lstat(ce->name, &st) < 0) {
438 if (errno != ENOENT && errno != ENOTDIR) {
442 if (silent_on_removed)
444 diff_addremove(&revs->diffopt, '-', ntohl(ce->ce_mode),
445 ce->sha1, ce->name, NULL);
448 changed = ce_match_stat(ce, &st, ce_option);
449 if (!changed && !revs->diffopt.find_copies_harder)
451 oldmode = ntohl(ce->ce_mode);
452 newmode = ntohl(ce_mode_from_stat(ce, st.st_mode));
453 diff_change(&revs->diffopt, oldmode, newmode,
454 ce->sha1, (changed ? null_sha1 : ce->sha1),
458 diffcore_std(&revs->diffopt);
459 diff_flush(&revs->diffopt);
467 /* A file entry went away or appeared */
468 static void diff_index_show_file(struct rev_info *revs,
470 struct cache_entry *ce,
471 unsigned char *sha1, unsigned int mode)
473 diff_addremove(&revs->diffopt, prefix[0], ntohl(mode),
474 sha1, ce->name, NULL);
477 static int get_stat_data(struct cache_entry *ce,
478 unsigned char **sha1p,
480 int cached, int match_missing)
482 unsigned char *sha1 = ce->sha1;
483 unsigned int mode = ce->ce_mode;
486 static unsigned char no_sha1[20];
489 if (lstat(ce->name, &st) < 0) {
490 if (errno == ENOENT && match_missing) {
497 changed = ce_match_stat(ce, &st, 0);
499 mode = ce_mode_from_stat(ce, st.st_mode);
509 static void show_new_file(struct rev_info *revs,
510 struct cache_entry *new,
511 int cached, int match_missing)
516 /* New file in the index: it might actually be different in
519 if (get_stat_data(new, &sha1, &mode, cached, match_missing) < 0)
522 diff_index_show_file(revs, "+", new, sha1, mode);
525 static int show_modified(struct rev_info *revs,
526 struct cache_entry *old,
527 struct cache_entry *new,
529 int cached, int match_missing)
531 unsigned int mode, oldmode;
534 if (get_stat_data(new, &sha1, &mode, cached, match_missing) < 0) {
536 diff_index_show_file(revs, "-", old,
537 old->sha1, old->ce_mode);
541 if (revs->combine_merges && !cached &&
542 (hashcmp(sha1, old->sha1) || hashcmp(old->sha1, new->sha1))) {
543 struct combine_diff_path *p;
544 int pathlen = ce_namelen(new);
546 p = xmalloc(combine_diff_path_size(2, pathlen));
547 p->path = (char *) &p->parent[2];
550 memcpy(p->path, new->name, pathlen);
551 p->path[pathlen] = 0;
552 p->mode = ntohl(mode);
554 memset(p->parent, 0, 2 * sizeof(struct combine_diff_parent));
555 p->parent[0].status = DIFF_STATUS_MODIFIED;
556 p->parent[0].mode = ntohl(new->ce_mode);
557 hashcpy(p->parent[0].sha1, new->sha1);
558 p->parent[1].status = DIFF_STATUS_MODIFIED;
559 p->parent[1].mode = ntohl(old->ce_mode);
560 hashcpy(p->parent[1].sha1, old->sha1);
561 show_combined_diff(p, 2, revs->dense_combined_merges, revs);
566 oldmode = old->ce_mode;
567 if (mode == oldmode && !hashcmp(sha1, old->sha1) &&
568 !revs->diffopt.find_copies_harder)
572 oldmode = ntohl(oldmode);
574 diff_change(&revs->diffopt, oldmode, mode,
575 old->sha1, sha1, old->name, NULL);
579 static int diff_cache(struct rev_info *revs,
580 struct cache_entry **ac, int entries,
581 const char **pathspec,
582 int cached, int match_missing)
585 struct cache_entry *ce = *ac;
586 int same = (entries > 1) && ce_same_name(ce, ac[1]);
588 if (revs->diffopt.quiet && revs->diffopt.has_changes)
591 if (!ce_path_match(ce, pathspec))
594 switch (ce_stage(ce)) {
596 /* No stage 1 entry? That means it's a new file */
598 show_new_file(revs, ce, cached, match_missing);
601 /* Show difference between old and new */
602 show_modified(revs, ac[1], ce, 1,
603 cached, match_missing);
606 /* No stage 3 (merge) entry?
607 * That means it's been deleted.
610 diff_index_show_file(revs, "-", ce,
611 ce->sha1, ce->ce_mode);
614 /* We come here with ce pointing at stage 1
615 * (original tree) and ac[1] pointing at stage
616 * 3 (unmerged). show-modified with
617 * report-missing set to false does not say the
618 * file is deleted but reports true if work
619 * tree does not have it, in which case we
620 * fall through to report the unmerged state.
621 * Otherwise, we show the differences between
622 * the original tree and the work tree.
625 !show_modified(revs, ce, ac[1], 0,
626 cached, match_missing))
628 diff_unmerge(&revs->diffopt, ce->name,
629 ntohl(ce->ce_mode), ce->sha1);
632 diff_unmerge(&revs->diffopt, ce->name,
637 die("impossible cache entry stage");
642 * Ignore all the different stages for this file,
643 * we've handled the relevant cases now.
648 } while (entries && ce_same_name(ce, ac[0]));
654 * This turns all merge entries into "stage 3". That guarantees that
655 * when we read in the new tree (into "stage 1"), we won't lose sight
656 * of the fact that we had unmerged entries.
658 static void mark_merge_entries(void)
661 for (i = 0; i < active_nr; i++) {
662 struct cache_entry *ce = active_cache[i];
665 ce->ce_flags |= htons(CE_STAGEMASK);
669 int run_diff_index(struct rev_info *revs, int cached)
674 const char *tree_name;
675 int match_missing = 0;
678 * Backward compatibility wart - "diff-index -m" does
679 * not mean "do not ignore merges", but totally different.
681 if (!revs->ignore_merges)
684 mark_merge_entries();
686 ent = revs->pending.objects[0].item;
687 tree_name = revs->pending.objects[0].name;
688 tree = parse_tree_indirect(ent->sha1);
690 return error("bad tree object %s", tree_name);
691 if (read_tree(tree, 1, revs->prune_data))
692 return error("unable to read tree object %s", tree_name);
693 ret = diff_cache(revs, active_cache, active_nr, revs->prune_data,
694 cached, match_missing);
695 diffcore_std(&revs->diffopt);
696 diff_flush(&revs->diffopt);
700 int do_diff_cache(const unsigned char *tree_sha1, struct diff_options *opt)
703 struct rev_info revs;
705 struct cache_entry **dst;
706 struct cache_entry *last = NULL;
709 * This is used by git-blame to run diff-cache internally;
710 * it potentially needs to repeatedly run this, so we will
711 * start by removing the higher order entries the last round
715 for (i = 0; i < active_nr; i++) {
716 struct cache_entry *ce = active_cache[i];
718 if (last && !strcmp(ce->name, last->name))
720 cache_tree_invalidate_path(active_cache_tree,
724 ce->ce_flags &= ~htons(CE_STAGEMASK);
728 active_nr = dst - active_cache;
730 init_revisions(&revs, NULL);
731 revs.prune_data = opt->paths;
732 tree = parse_tree_indirect(tree_sha1);
734 die("bad tree object %s", sha1_to_hex(tree_sha1));
735 if (read_tree(tree, 1, opt->paths))
736 return error("unable to read tree %s", sha1_to_hex(tree_sha1));
737 return diff_cache(&revs, active_cache, active_nr, revs.prune_data,