builtin-diff.c

   1 /*
   2  * Builtin "git diff"
   3  *
   4  * Copyright (c) 2006 Junio C Hamano
   5  */
   6 #include "cache.h"
   7 #include "commit.h"
   8 #include "blob.h"
   9 #include "tag.h"
  10 #include "diff.h"
  11 #include "diffcore.h"
  12 #include "revision.h"
  13 #include "log-tree.h"
  14 #include "builtin.h"
  15
  16 /* NEEDSWORK: struct object has place for name but we _do_
  17  * know mode when we extracted the blob out of a tree, which
  18  * we currently lose.
  19  */
  20 struct blobinfo {
  21         unsigned char sha1[20];
  22         const char *name;
  23 };
  24
  25 static const char builtin_diff_usage[] =
  26 "git-diff <options> <rev>{0,2} -- <path>*";
  27
  28 static void stuff_change(struct diff_options *opt,
  29                          unsigned old_mode, unsigned new_mode,
  30                          const unsigned char *old_sha1,
  31                          const unsigned char *new_sha1,
  32                          const char *old_name,
  33                          const char *new_name)
  34 {
  35         struct diff_filespec *one, *two;
  36
  37         if (!is_null_sha1(old_sha1) && !is_null_sha1(new_sha1) &&
  38             !hashcmp(old_sha1, new_sha1))
  39                 return;
  40
  41         if (opt->reverse_diff) {
  42                 unsigned tmp;
  43                 const unsigned char *tmp_u;
  44                 const char *tmp_c;
  45                 tmp = old_mode; old_mode = new_mode; new_mode = tmp;
  46                 tmp_u = old_sha1; old_sha1 = new_sha1; new_sha1 = tmp_u;
  47                 tmp_c = old_name; old_name = new_name; new_name = tmp_c;
  48         }
  49         one = alloc_filespec(old_name);
  50         two = alloc_filespec(new_name);
  51         fill_filespec(one, old_sha1, old_mode);
  52         fill_filespec(two, new_sha1, new_mode);
  53
  54         /* NEEDSWORK: shouldn't this part of diffopt??? */
  55         diff_queue(&diff_queued_diff, one, two);
  56 }
  57
  58 static int builtin_diff_b_f(struct rev_info *revs,
  59                             int argc, const char **argv,
  60                             struct blobinfo *blob,
  61                             const char *path)
  62 {
  63         /* Blob vs file in the working tree*/
  64         struct stat st;
  65
  66         if (argc > 1)
  67                 usage(builtin_diff_usage);
  68
  69         if (lstat(path, &st))
  70                 die("'%s': %s", path, strerror(errno));
  71         if (!(S_ISREG(st.st_mode) || S_ISLNK(st.st_mode)))
  72                 die("'%s': not a regular file or symlink", path);
  73         stuff_change(&revs->diffopt,
  74                      canon_mode(st.st_mode), canon_mode(st.st_mode),
  75                      blob[0].sha1, null_sha1,
  76                      path, path);
  77         diffcore_std(&revs->diffopt);
  78         diff_flush(&revs->diffopt);
  79         return 0;
  80 }
  81
  82 static int builtin_diff_blobs(struct rev_info *revs,
  83                               int argc, const char **argv,
  84                               struct blobinfo *blob)
  85 {
  86         unsigned mode = canon_mode(S_IFREG | 0644);
  87
  88         if (argc > 1)
  89                 usage(builtin_diff_usage);
  90
  91         stuff_change(&revs->diffopt,
  92                      mode, mode,
  93                      blob[0].sha1, blob[1].sha1,
  94                      blob[0].name, blob[1].name);
  95         diffcore_std(&revs->diffopt);
  96         diff_flush(&revs->diffopt);
  97         return 0;
  98 }
  99
 100 static int builtin_diff_index(struct rev_info *revs,
 101                               int argc, const char **argv)
 102 {
 103         int cached = 0;
 104         while (1 < argc) {
 105                 const char *arg = argv[1];
 106                 if (!strcmp(arg, "--cached"))
 107                         cached = 1;
 108                 else
 109                         usage(builtin_diff_usage);
 110                 argv++; argc--;
 111         }
 112         /*
 113          * Make sure there is one revision (i.e. pending object),
 114          * and there is no revision filtering parameters.
 115          */
 116         if (revs->pending.nr != 1 ||
 117             revs->max_count != -1 || revs->min_age != -1 ||
 118             revs->max_age != -1)
 119                 usage(builtin_diff_usage);
 120         return run_diff_index(revs, cached);
 121 }
 122
 123 static int builtin_diff_tree(struct rev_info *revs,
 124                              int argc, const char **argv,
 125                              struct object_array_entry *ent)
 126 {
 127         const unsigned char *(sha1[2]);
 128         int swap = 0;
 129
 130         if (argc > 1)
 131                 usage(builtin_diff_usage);
 132
 133         /* We saw two trees, ent[0] and ent[1].
 134          * if ent[1] is uninteresting, they are swapped
 135          */
 136         if (ent[1].item->flags & UNINTERESTING)
 137                 swap = 1;
 138         sha1[swap] = ent[0].item->sha1;
 139         sha1[1-swap] = ent[1].item->sha1;
 140         diff_tree_sha1(sha1[0], sha1[1], "", &revs->diffopt);
 141         log_tree_diff_flush(revs);
 142         return 0;
 143 }
 144
 145 static int builtin_diff_combined(struct rev_info *revs,
 146                                  int argc, const char **argv,
 147                                  struct object_array_entry *ent,
 148                                  int ents)
 149 {
 150         const unsigned char (*parent)[20];
 151         int i;
 152
 153         if (argc > 1)
 154                 usage(builtin_diff_usage);
 155
 156         if (!revs->dense_combined_merges && !revs->combine_merges)
 157                 revs->dense_combined_merges = revs->combine_merges = 1;
 158         parent = xmalloc(ents * sizeof(*parent));
 159         /* Again, the revs are all reverse */
 160         for (i = 0; i < ents; i++)
 161                 hashcpy((unsigned char*)parent + i, ent[ents - 1 - i].item->sha1);
 162         diff_tree_combined(parent[0], parent + 1, ents - 1,
 163                            revs->dense_combined_merges, revs);
 164         return 0;
 165 }
 166
 167 void add_head(struct rev_info *revs)
 168 {
 169         unsigned char sha1[20];
 170         struct object *obj;
 171         if (get_sha1("HEAD", sha1))
 172                 return;
 173         obj = parse_object(sha1);
 174         if (!obj)
 175                 return;
 176         add_pending_object(revs, obj, "HEAD");
 177 }
 178
 179 int cmd_diff(int argc, const char **argv, const char *prefix)
 180 {
 181         int i;
 182         struct rev_info rev;
 183         struct object_array_entry ent[100];
 184         int ents = 0, blobs = 0, paths = 0;
 185         const char *path = NULL;
 186         struct blobinfo blob[2];
 187         int nongit = 0;
 188
 189         /*
 190          * We could get N tree-ish in the rev.pending_objects list.
 191          * Also there could be M blobs there, and P pathspecs.
 192          *
 193          * N=0, M=0:
 194          *      cache vs files (diff-files)
 195          * N=0, M=2:
 196          *      compare two random blobs.  P must be zero.
 197          * N=0, M=1, P=1:
 198          *      compare a blob with a working tree file.
 199          *
 200          * N=1, M=0:
 201          *      tree vs cache (diff-index --cached)
 202          *
 203          * N=2, M=0:
 204          *      tree vs tree (diff-tree)
 205          *
 206          * Other cases are errors.
 207          */
 208
 209         prefix = setup_git_directory_gently(&nongit);
 210         git_config(git_diff_ui_config);
 211         init_revisions(&rev, prefix);
 212
 213         argc = setup_revisions(argc, argv, &rev, NULL);
 214         if (!rev.diffopt.output_format) {
 215                 rev.diffopt.output_format = DIFF_FORMAT_PATCH;
 216                 if (diff_setup_done(&rev.diffopt) < 0)
 217                         die("diff_setup_done failed");
 218         }
 219
 220         /* Do we have --cached and not have a pending object, then
 221          * default to HEAD by hand.  Eek.
 222          */
 223         if (!rev.pending.nr) {
 224                 int i;
 225                 for (i = 1; i < argc; i++) {
 226                         const char *arg = argv[i];
 227                         if (!strcmp(arg, "--"))
 228                                 break;
 229                         else if (!strcmp(arg, "--cached")) {
 230                                 add_head(&rev);
 231                                 break;
 232                         }
 233                 }
 234         }
 235
 236         for (i = 0; i < rev.pending.nr; i++) {
 237                 struct object_array_entry *list = rev.pending.objects+i;
 238                 struct object *obj = list->item;
 239                 const char *name = list->name;
 240                 int flags = (obj->flags & UNINTERESTING);
 241                 if (!obj->parsed)
 242                         obj = parse_object(obj->sha1);
 243                 obj = deref_tag(obj, NULL, 0);
 244                 if (!obj)
 245                         die("invalid object '%s' given.", name);
 246                 if (obj->type == OBJ_COMMIT)
 247                         obj = &((struct commit *)obj)->tree->object;
 248                 if (obj->type == OBJ_TREE) {
 249                         if (ARRAY_SIZE(ent) <= ents)
 250                                 die("more than %d trees given: '%s'",
 251                                     (int) ARRAY_SIZE(ent), name);
 252                         obj->flags |= flags;
 253                         ent[ents].item = obj;
 254                         ent[ents].name = name;
 255                         ents++;
 256                         continue;
 257                 }
 258                 if (obj->type == OBJ_BLOB) {
 259                         if (2 <= blobs)
 260                                 die("more than two blobs given: '%s'", name);
 261                         hashcpy(blob[blobs].sha1, obj->sha1);
 262                         blob[blobs].name = name;
 263                         blobs++;
 264                         continue;
 265
 266                 }
 267                 die("unhandled object '%s' given.", name);
 268         }
 269         if (rev.prune_data) {
 270                 const char **pathspec = rev.prune_data;
 271                 while (*pathspec) {
 272                         if (!path)
 273                                 path = *pathspec;
 274                         paths++;
 275                         pathspec++;
 276                 }
 277         }
 278
 279         /*
 280          * Now, do the arguments look reasonable?
 281          */
 282         if (!ents) {
 283                 switch (blobs) {
 284                 case 0:
 285                         return run_diff_files_cmd(&rev, argc, argv);
 286                         break;
 287                 case 1:
 288                         if (paths != 1)
 289                                 usage(builtin_diff_usage);
 290                         return builtin_diff_b_f(&rev, argc, argv, blob, path);
 291                         break;
 292                 case 2:
 293                         if (paths)
 294                                 usage(builtin_diff_usage);
 295                         return builtin_diff_blobs(&rev, argc, argv, blob);
 296                         break;
 297                 default:
 298                         usage(builtin_diff_usage);
 299                 }
 300         }
 301         else if (blobs)
 302                 usage(builtin_diff_usage);
 303         else if (ents == 1)
 304                 return builtin_diff_index(&rev, argc, argv);
 305         else if (ents == 2)
 306                 return builtin_diff_tree(&rev, argc, argv, ent);
 307         else if ((ents == 3) && (ent[0].item->flags & UNINTERESTING)) {
 308                 /* diff A...B where there is one sane merge base between
 309                  * A and B.  We have ent[0] == merge-base, ent[1] == A,
 310                  * and ent[2] == B.  Show diff between the base and B.
 311                  */
 312                 ent[1] = ent[2];
 313                 return builtin_diff_tree(&rev, argc, argv, ent);
 314         }
 315         else
 316                 return builtin_diff_combined(&rev, argc, argv,
 317                                              ent, ents);
 318         usage(builtin_diff_usage);
 319 }