builtin-diff.c

   1 /*
   2  * Builtin "git diff"
   3  *
   4  * Copyright (c) 2006 Junio C Hamano
   5  */
   6 #include "cache.h"
   7 #include "color.h"
   8 #include "commit.h"
   9 #include "blob.h"
  10 #include "tag.h"
  11 #include "diff.h"
  12 #include "diffcore.h"
  13 #include "revision.h"
  14 #include "log-tree.h"
  15 #include "builtin.h"
  16
  17 struct blobinfo {
  18         unsigned char sha1[20];
  19         const char *name;
  20         unsigned mode;
  21 };
  22
  23 static const char builtin_diff_usage[] =
  24 "git diff <options> <rev>{0,2} -- <path>*";
  25
  26 static void stuff_change(struct diff_options *opt,
  27                          unsigned old_mode, unsigned new_mode,
  28                          const unsigned char *old_sha1,
  29                          const unsigned char *new_sha1,
  30                          const char *old_name,
  31                          const char *new_name)
  32 {
  33         struct diff_filespec *one, *two;
  34
  35         if (!is_null_sha1(old_sha1) && !is_null_sha1(new_sha1) &&
  36             !hashcmp(old_sha1, new_sha1) && (old_mode == new_mode))
  37                 return;
  38
  39         if (DIFF_OPT_TST(opt, REVERSE_DIFF)) {
  40                 unsigned tmp;
  41                 const unsigned char *tmp_u;
  42                 const char *tmp_c;
  43                 tmp = old_mode; old_mode = new_mode; new_mode = tmp;
  44                 tmp_u = old_sha1; old_sha1 = new_sha1; new_sha1 = tmp_u;
  45                 tmp_c = old_name; old_name = new_name; new_name = tmp_c;
  46         }
  47
  48         if (opt->prefix &&
  49             (strncmp(old_name, opt->prefix, opt->prefix_length) ||
  50              strncmp(new_name, opt->prefix, opt->prefix_length)))
  51                 return;
  52
  53         one = alloc_filespec(old_name);
  54         two = alloc_filespec(new_name);
  55         fill_filespec(one, old_sha1, old_mode);
  56         fill_filespec(two, new_sha1, new_mode);
  57
  58         diff_queue(&diff_queued_diff, one, two);
  59 }
  60
  61 static int builtin_diff_b_f(struct rev_info *revs,
  62                             int argc, const char **argv,
  63                             struct blobinfo *blob,
  64                             const char *path)
  65 {
  66         /* Blob vs file in the working tree*/
  67         struct stat st;
  68
  69         if (argc > 1)
  70                 usage(builtin_diff_usage);
  71
  72         if (lstat(path, &st))
  73                 die("'%s': %s", path, strerror(errno));
  74         if (!(S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)))
  75                 die("'%s': not a regular file or symlink", path);
  76
  77         diff_set_mnemonic_prefix(&revs->diffopt, "o/", "w/");
  78
  79         if (blob[0].mode == S_IFINVALID)
  80                 blob[0].mode = canon_mode(st.st_mode);
  81
  82         stuff_change(&revs->diffopt,
  83                      blob[0].mode, canon_mode(st.st_mode),
  84                      blob[0].sha1, null_sha1,
  85                      path, path);
  86         diffcore_std(&revs->diffopt);
  87         diff_flush(&revs->diffopt);
  88         return 0;
  89 }
  90
  91 static int builtin_diff_blobs(struct rev_info *revs,
  92                               int argc, const char **argv,
  93                               struct blobinfo *blob)
  94 {
  95         unsigned mode = canon_mode(S_IFREG | 0644);
  96
  97         if (argc > 1)
  98                 usage(builtin_diff_usage);
  99
 100         if (blob[0].mode == S_IFINVALID)
 101                 blob[0].mode = mode;
 102
 103         if (blob[1].mode == S_IFINVALID)
 104                 blob[1].mode = mode;
 105
 106         stuff_change(&revs->diffopt,
 107                      blob[0].mode, blob[1].mode,
 108                      blob[0].sha1, blob[1].sha1,
 109                      blob[0].name, blob[1].name);
 110         diffcore_std(&revs->diffopt);
 111         diff_flush(&revs->diffopt);
 112         return 0;
 113 }
 114
 115 static int builtin_diff_index(struct rev_info *revs,
 116                               int argc, const char **argv)
 117 {
 118         int cached = 0;
 119         while (1 < argc) {
 120                 const char *arg = argv[1];
 121                 if (!strcmp(arg, "--cached"))
 122                         cached = 1;
 123                 else
 124                         usage(builtin_diff_usage);
 125                 argv++; argc--;
 126         }
 127         /*
 128          * Make sure there is one revision (i.e. pending object),
 129          * and there is no revision filtering parameters.
 130          */
 131         if (revs->pending.nr != 1 ||
 132             revs->max_count != -1 || revs->min_age != -1 ||
 133             revs->max_age != -1)
 134                 usage(builtin_diff_usage);
 135         if (read_cache() < 0) {
 136                 perror("read_cache");
 137                 return -1;
 138         }
 139         return run_diff_index(revs, cached);
 140 }
 141
 142 static int builtin_diff_tree(struct rev_info *revs,
 143                              int argc, const char **argv,
 144                              struct object_array_entry *ent)
 145 {
 146         const unsigned char *(sha1[2]);
 147         int swap = 0;
 148
 149         if (argc > 1)
 150                 usage(builtin_diff_usage);
 151
 152         /* We saw two trees, ent[0] and ent[1].
 153          * if ent[1] is uninteresting, they are swapped
 154          */
 155         if (ent[1].item->flags & UNINTERESTING)
 156                 swap = 1;
 157         sha1[swap] = ent[0].item->sha1;
 158         sha1[1-swap] = ent[1].item->sha1;
 159         diff_tree_sha1(sha1[0], sha1[1], "", &revs->diffopt);
 160         log_tree_diff_flush(revs);
 161         return 0;
 162 }
 163
 164 static int builtin_diff_combined(struct rev_info *revs,
 165                                  int argc, const char **argv,
 166                                  struct object_array_entry *ent,
 167                                  int ents)
 168 {
 169         const unsigned char (*parent)[20];
 170         int i;
 171
 172         if (argc > 1)
 173                 usage(builtin_diff_usage);
 174
 175         if (!revs->dense_combined_merges && !revs->combine_merges)
 176                 revs->dense_combined_merges = revs->combine_merges = 1;
 177         parent = xmalloc(ents * sizeof(*parent));
 178         /* Again, the revs are all reverse */
 179         for (i = 0; i < ents; i++)
 180                 hashcpy((unsigned char *)(parent + i),
 181                         ent[ents - 1 - i].item->sha1);
 182         diff_tree_combined(parent[0], parent + 1, ents - 1,
 183                            revs->dense_combined_merges, revs);
 184         return 0;
 185 }
 186
 187 static void refresh_index_quietly(void)
 188 {
 189         struct lock_file *lock_file;
 190         int fd;
 191
 192         lock_file = xcalloc(1, sizeof(struct lock_file));
 193         fd = hold_locked_index(lock_file, 0);
 194         if (fd < 0)
 195                 return;
 196         discard_cache();
 197         read_cache();
 198         refresh_cache(REFRESH_QUIET|REFRESH_UNMERGED);
 199
 200         if (active_cache_changed &&
 201             !write_cache(fd, active_cache, active_nr))
 202                 commit_locked_index(lock_file);
 203
 204         rollback_lock_file(lock_file);
 205 }
 206
 207 static int builtin_diff_files(struct rev_info *revs, int argc, const char **argv)
 208 {
 209         int result;
 210         unsigned int options = 0;
 211
 212         while (1 < argc && argv[1][0] == '-') {
 213                 if (!strcmp(argv[1], "--base"))
 214                         revs->max_count = 1;
 215                 else if (!strcmp(argv[1], "--ours"))
 216                         revs->max_count = 2;
 217                 else if (!strcmp(argv[1], "--theirs"))
 218                         revs->max_count = 3;
 219                 else if (!strcmp(argv[1], "-q"))
 220                         options |= DIFF_SILENT_ON_REMOVED;
 221                 else
 222                         return error("invalid option: %s", argv[1]);
 223                 argv++; argc--;
 224         }
 225
 226         if (revs->max_count == -1 &&
 227             (revs->diffopt.output_format & DIFF_FORMAT_PATCH))
 228                 revs->combine_merges = revs->dense_combined_merges = 1;
 229
 230         if (read_cache() < 0) {
 231                 perror("read_cache");
 232                 return -1;
 233         }
 234         result = run_diff_files(revs, options);
 235         return diff_result_code(&revs->diffopt, result);
 236 }
 237
 238 int cmd_diff(int argc, const char **argv, const char *prefix)
 239 {
 240         int i;
 241         struct rev_info rev;
 242         struct object_array_entry ent[100];
 243         int ents = 0, blobs = 0, paths = 0;
 244         const char *path = NULL;
 245         struct blobinfo blob[2];
 246         int nongit;
 247         int result = 0;
 248
 249         /*
 250          * We could get N tree-ish in the rev.pending_objects list.
 251          * Also there could be M blobs there, and P pathspecs.
 252          *
 253          * N=0, M=0:
 254          *      cache vs files (diff-files)
 255          * N=0, M=2:
 256          *      compare two random blobs.  P must be zero.
 257          * N=0, M=1, P=1:
 258          *      compare a blob with a working tree file.
 259          *
 260          * N=1, M=0:
 261          *      tree vs cache (diff-index --cached)
 262          *
 263          * N=2, M=0:
 264          *      tree vs tree (diff-tree)
 265          *
 266          * N=0, M=0, P=2:
 267          *      compare two filesystem entities (aka --no-index).
 268          *
 269          * Other cases are errors.
 270          */
 271
 272         prefix = setup_git_directory_gently(&nongit);
 273         git_config(git_diff_ui_config, NULL);
 274
 275         if (diff_use_color_default == -1)
 276                 diff_use_color_default = git_use_color_default;
 277
 278         init_revisions(&rev, prefix);
 279
 280         /* If this is a no-index diff, just run it and exit there. */
 281         diff_no_index(&rev, argc, argv, nongit, prefix);
 282
 283         /* Otherwise, we are doing the usual "git" diff */
 284         rev.diffopt.skip_stat_unmatch = !!diff_auto_refresh_index;
 285
 286         if (nongit)
 287                 die("Not a git repository");
 288         argc = setup_revisions(argc, argv, &rev, NULL);
 289         if (!rev.diffopt.output_format) {
 290                 rev.diffopt.output_format = DIFF_FORMAT_PATCH;
 291                 if (diff_setup_done(&rev.diffopt) < 0)
 292                         die("diff_setup_done failed");
 293         }
 294         DIFF_OPT_SET(&rev.diffopt, ALLOW_EXTERNAL);
 295         DIFF_OPT_SET(&rev.diffopt, RECURSIVE);
 296
 297         /*
 298          * If the user asked for our exit code then don't start a
 299          * pager or we would end up reporting its exit code instead.
 300          */
 301         if (!DIFF_OPT_TST(&rev.diffopt, EXIT_WITH_STATUS) &&
 302             check_pager_config("diff") != 0)
 303                 setup_pager();
 304
 305         /*
 306          * Do we have --cached and not have a pending object, then
 307          * default to HEAD by hand.  Eek.
 308          */
 309         if (!rev.pending.nr) {
 310                 int i;
 311                 for (i = 1; i < argc; i++) {
 312                         const char *arg = argv[i];
 313                         if (!strcmp(arg, "--"))
 314                                 break;
 315                         else if (!strcmp(arg, "--cached")) {
 316                                 add_head_to_pending(&rev);
 317                                 if (!rev.pending.nr)
 318                                         die("No HEAD commit to compare with (yet)");
 319                                 break;
 320                         }
 321                 }
 322         }
 323
 324         for (i = 0; i < rev.pending.nr; i++) {
 325                 struct object_array_entry *list = rev.pending.objects+i;
 326                 struct object *obj = list->item;
 327                 const char *name = list->name;
 328                 int flags = (obj->flags & UNINTERESTING);
 329                 if (!obj->parsed)
 330                         obj = parse_object(obj->sha1);
 331                 obj = deref_tag(obj, NULL, 0);
 332                 if (!obj)
 333                         die("invalid object '%s' given.", name);
 334                 if (obj->type == OBJ_COMMIT)
 335                         obj = &((struct commit *)obj)->tree->object;
 336                 if (obj->type == OBJ_TREE) {
 337                         if (ARRAY_SIZE(ent) <= ents)
 338                                 die("more than %d trees given: '%s'",
 339                                     (int) ARRAY_SIZE(ent), name);
 340                         obj->flags |= flags;
 341                         ent[ents].item = obj;
 342                         ent[ents].name = name;
 343                         ents++;
 344                         continue;
 345                 }
 346                 if (obj->type == OBJ_BLOB) {
 347                         if (2 <= blobs)
 348                                 die("more than two blobs given: '%s'", name);
 349                         hashcpy(blob[blobs].sha1, obj->sha1);
 350                         blob[blobs].name = name;
 351                         blob[blobs].mode = list->mode;
 352                         blobs++;
 353                         continue;
 354
 355                 }
 356                 die("unhandled object '%s' given.", name);
 357         }
 358         if (rev.prune_data) {
 359                 const char **pathspec = rev.prune_data;
 360                 while (*pathspec) {
 361                         if (!path)
 362                                 path = *pathspec;
 363                         paths++;
 364                         pathspec++;
 365                 }
 366         }
 367
 368         /*
 369          * Now, do the arguments look reasonable?
 370          */
 371         if (!ents) {
 372                 switch (blobs) {
 373                 case 0:
 374                         result = builtin_diff_files(&rev, argc, argv);
 375                         break;
 376                 case 1:
 377                         if (paths != 1)
 378                                 usage(builtin_diff_usage);
 379                         result = builtin_diff_b_f(&rev, argc, argv, blob, path);
 380                         break;
 381                 case 2:
 382                         if (paths)
 383                                 usage(builtin_diff_usage);
 384                         result = builtin_diff_blobs(&rev, argc, argv, blob);
 385                         break;
 386                 default:
 387                         usage(builtin_diff_usage);
 388                 }
 389         }
 390         else if (blobs)
 391                 usage(builtin_diff_usage);
 392         else if (ents == 1)
 393                 result = builtin_diff_index(&rev, argc, argv);
 394         else if (ents == 2)
 395                 result = builtin_diff_tree(&rev, argc, argv, ent);
 396         else if ((ents == 3) && (ent[0].item->flags & UNINTERESTING)) {
 397                 /* diff A...B where there is one sane merge base between
 398                  * A and B.  We have ent[0] == merge-base, ent[1] == A,
 399                  * and ent[2] == B.  Show diff between the base and B.
 400                  */
 401                 ent[1] = ent[2];
 402                 result = builtin_diff_tree(&rev, argc, argv, ent);
 403         }
 404         else
 405                 result = builtin_diff_combined(&rev, argc, argv,
 406                                              ent, ents);
 407         result = diff_result_code(&rev.diffopt, result);
 408         if (1 < rev.diffopt.skip_stat_unmatch)
 409                 refresh_index_quietly();
 410         return result;
 411 }