revision.c

   1 #include "cache.h"
   2 #include "tag.h"
   3 #include "blob.h"
   4 #include "tree.h"
   5 #include "commit.h"
   6 #include "diff.h"
   7 #include "refs.h"
   8 #include "revision.h"
   9 #include "graph.h"
  10 #include "grep.h"
  11 #include "reflog-walk.h"
  12 #include "patch-ids.h"
  13 #include "decorate.h"
  14 #include "log-tree.h"
  15
  16 volatile show_early_output_fn_t show_early_output;
  17
  18 char *path_name(const struct name_path *path, const char *name)
  19 {
  20         const struct name_path *p;
  21         char *n, *m;
  22         int nlen = strlen(name);
  23         int len = nlen + 1;
  24
  25         for (p = path; p; p = p->up) {
  26                 if (p->elem_len)
  27                         len += p->elem_len + 1;
  28         }
  29         n = xmalloc(len);
  30         m = n + len - (nlen + 1);
  31         strcpy(m, name);
  32         for (p = path; p; p = p->up) {
  33                 if (p->elem_len) {
  34                         m -= p->elem_len + 1;
  35                         memcpy(m, p->elem, p->elem_len);
  36                         m[p->elem_len] = '/';
  37                 }
  38         }
  39         return n;
  40 }
  41
  42 void add_object(struct object *obj,
  43                 struct object_array *p,
  44                 struct name_path *path,
  45                 const char *name)
  46 {
  47         add_object_array(obj, path_name(path, name), p);
  48 }
  49
  50 static void mark_blob_uninteresting(struct blob *blob)
  51 {
  52         if (!blob)
  53                 return;
  54         if (blob->object.flags & UNINTERESTING)
  55                 return;
  56         blob->object.flags |= UNINTERESTING;
  57 }
  58
  59 void mark_tree_uninteresting(struct tree *tree)
  60 {
  61         struct tree_desc desc;
  62         struct name_entry entry;
  63         struct object *obj = &tree->object;
  64
  65         if (!tree)
  66                 return;
  67         if (obj->flags & UNINTERESTING)
  68                 return;
  69         obj->flags |= UNINTERESTING;
  70         if (!has_sha1_file(obj->sha1))
  71                 return;
  72         if (parse_tree(tree) < 0)
  73                 die("bad tree %s", sha1_to_hex(obj->sha1));
  74
  75         init_tree_desc(&desc, tree->buffer, tree->size);
  76         while (tree_entry(&desc, &entry)) {
  77                 switch (object_type(entry.mode)) {
  78                 case OBJ_TREE:
  79                         mark_tree_uninteresting(lookup_tree(entry.sha1));
  80                         break;
  81                 case OBJ_BLOB:
  82                         mark_blob_uninteresting(lookup_blob(entry.sha1));
  83                         break;
  84                 default:
  85                         /* Subproject commit - not in this repository */
  86                         break;
  87                 }
  88         }
  89
  90         /*
  91          * We don't care about the tree any more
  92          * after it has been marked uninteresting.
  93          */
  94         free(tree->buffer);
  95         tree->buffer = NULL;
  96 }
  97
  98 void mark_parents_uninteresting(struct commit *commit)
  99 {
 100         struct commit_list *parents = commit->parents;
 101
 102         while (parents) {
 103                 struct commit *commit = parents->item;
 104                 if (!(commit->object.flags & UNINTERESTING)) {
 105                         commit->object.flags |= UNINTERESTING;
 106
 107                         /*
 108                          * Normally we haven't parsed the parent
 109                          * yet, so we won't have a parent of a parent
 110                          * here. However, it may turn out that we've
 111                          * reached this commit some other way (where it
 112                          * wasn't uninteresting), in which case we need
 113                          * to mark its parents recursively too..
 114                          */
 115                         if (commit->parents)
 116                                 mark_parents_uninteresting(commit);
 117                 }
 118
 119                 /*
 120                  * A missing commit is ok iff its parent is marked
 121                  * uninteresting.
 122                  *
 123                  * We just mark such a thing parsed, so that when
 124                  * it is popped next time around, we won't be trying
 125                  * to parse it and get an error.
 126                  */
 127                 if (!has_sha1_file(commit->object.sha1))
 128                         commit->object.parsed = 1;
 129                 parents = parents->next;
 130         }
 131 }
 132
 133 static void add_pending_object_with_mode(struct rev_info *revs, struct object *obj, const char *name, unsigned mode)
 134 {
 135         if (revs->no_walk && (obj->flags & UNINTERESTING))
 136                 revs->no_walk = 0;
 137         if (revs->reflog_info && obj->type == OBJ_COMMIT &&
 138                         add_reflog_for_walk(revs->reflog_info,
 139                                 (struct commit *)obj, name))
 140                 return;
 141         add_object_array_with_mode(obj, name, &revs->pending, mode);
 142 }
 143
 144 void add_pending_object(struct rev_info *revs, struct object *obj, const char *name)
 145 {
 146         add_pending_object_with_mode(revs, obj, name, S_IFINVALID);
 147 }
 148
 149 void add_head_to_pending(struct rev_info *revs)
 150 {
 151         unsigned char sha1[20];
 152         struct object *obj;
 153         if (get_sha1("HEAD", sha1))
 154                 return;
 155         obj = parse_object(sha1);
 156         if (!obj)
 157                 return;
 158         add_pending_object(revs, obj, "HEAD");
 159 }
 160
 161 static struct object *get_reference(struct rev_info *revs, const char *name, const unsigned char *sha1, unsigned int flags)
 162 {
 163         struct object *object;
 164
 165         object = parse_object(sha1);
 166         if (!object)
 167                 die("bad object %s", name);
 168         object->flags |= flags;
 169         return object;
 170 }
 171
 172 static struct commit *handle_commit(struct rev_info *revs, struct object *object, const char *name)
 173 {
 174         unsigned long flags = object->flags;
 175
 176         /*
 177          * Tag object? Look what it points to..
 178          */
 179         while (object->type == OBJ_TAG) {
 180                 struct tag *tag = (struct tag *) object;
 181                 if (revs->tag_objects && !(flags & UNINTERESTING))
 182                         add_pending_object(revs, object, tag->tag);
 183                 if (!tag->tagged)
 184                         die("bad tag");
 185                 object = parse_object(tag->tagged->sha1);
 186                 if (!object) {
 187                         if (flags & UNINTERESTING)
 188                                 return NULL;
 189                         die("bad object %s", sha1_to_hex(tag->tagged->sha1));
 190                 }
 191         }
 192
 193         /*
 194          * Commit object? Just return it, we'll do all the complex
 195          * reachability crud.
 196          */
 197         if (object->type == OBJ_COMMIT) {
 198                 struct commit *commit = (struct commit *)object;
 199                 if (parse_commit(commit) < 0)
 200                         die("unable to parse commit %s", name);
 201                 if (flags & UNINTERESTING) {
 202                         commit->object.flags |= UNINTERESTING;
 203                         mark_parents_uninteresting(commit);
 204                         revs->limited = 1;
 205                 }
 206                 if (revs->show_source && !commit->util)
 207                         commit->util = (void *) name;
 208                 return commit;
 209         }
 210
 211         /*
 212          * Tree object? Either mark it uninteresting, or add it
 213          * to the list of objects to look at later..
 214          */
 215         if (object->type == OBJ_TREE) {
 216                 struct tree *tree = (struct tree *)object;
 217                 if (!revs->tree_objects)
 218                         return NULL;
 219                 if (flags & UNINTERESTING) {
 220                         mark_tree_uninteresting(tree);
 221                         return NULL;
 222                 }
 223                 add_pending_object(revs, object, "");
 224                 return NULL;
 225         }
 226
 227         /*
 228          * Blob object? You know the drill by now..
 229          */
 230         if (object->type == OBJ_BLOB) {
 231                 struct blob *blob = (struct blob *)object;
 232                 if (!revs->blob_objects)
 233                         return NULL;
 234                 if (flags & UNINTERESTING) {
 235                         mark_blob_uninteresting(blob);
 236                         return NULL;
 237                 }
 238                 add_pending_object(revs, object, "");
 239                 return NULL;
 240         }
 241         die("%s is unknown object", name);
 242 }
 243
 244 static int everybody_uninteresting(struct commit_list *orig)
 245 {
 246         struct commit_list *list = orig;
 247         while (list) {
 248                 struct commit *commit = list->item;
 249                 list = list->next;
 250                 if (commit->object.flags & UNINTERESTING)
 251                         continue;
 252                 return 0;
 253         }
 254         return 1;
 255 }
 256
 257 /*
 258  * The goal is to get REV_TREE_NEW as the result only if the
 259  * diff consists of all '+' (and no other changes), REV_TREE_OLD
 260  * if the whole diff is removal of old data, and otherwise
 261  * REV_TREE_DIFFERENT (of course if the trees are the same we
 262  * want REV_TREE_SAME).
 263  * That means that once we get to REV_TREE_DIFFERENT, we do not
 264  * have to look any further.
 265  */
 266 static int tree_difference = REV_TREE_SAME;
 267
 268 static void file_add_remove(struct diff_options *options,
 269                     int addremove, unsigned mode,
 270                     const unsigned char *sha1,
 271                     const char *fullpath)
 272 {
 273         int diff = addremove == '+' ? REV_TREE_NEW : REV_TREE_OLD;
 274
 275         tree_difference |= diff;
 276         if (tree_difference == REV_TREE_DIFFERENT)
 277                 DIFF_OPT_SET(options, HAS_CHANGES);
 278 }
 279
 280 static void file_change(struct diff_options *options,
 281                  unsigned old_mode, unsigned new_mode,
 282                  const unsigned char *old_sha1,
 283                  const unsigned char *new_sha1,
 284                  const char *fullpath)
 285 {
 286         tree_difference = REV_TREE_DIFFERENT;
 287         DIFF_OPT_SET(options, HAS_CHANGES);
 288 }
 289
 290 static int rev_compare_tree(struct rev_info *revs, struct commit *parent, struct commit *commit)
 291 {
 292         struct tree *t1 = parent->tree;
 293         struct tree *t2 = commit->tree;
 294
 295         if (!t1)
 296                 return REV_TREE_NEW;
 297         if (!t2)
 298                 return REV_TREE_OLD;
 299
 300         if (revs->simplify_by_decoration) {
 301                 /*
 302                  * If we are simplifying by decoration, then the commit
 303                  * is worth showing if it has a tag pointing at it.
 304                  */
 305                 if (lookup_decoration(&name_decoration, &commit->object))
 306                         return REV_TREE_DIFFERENT;
 307                 /*
 308                  * A commit that is not pointed by a tag is uninteresting
 309                  * if we are not limited by path.  This means that you will
 310                  * see the usual "commits that touch the paths" plus any
 311                  * tagged commit by specifying both --simplify-by-decoration
 312                  * and pathspec.
 313                  */
 314                 if (!revs->prune_data)
 315                         return REV_TREE_SAME;
 316         }
 317
 318         tree_difference = REV_TREE_SAME;
 319         DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES);
 320         if (diff_tree_sha1(t1->object.sha1, t2->object.sha1, "",
 321                            &revs->pruning) < 0)
 322                 return REV_TREE_DIFFERENT;
 323         return tree_difference;
 324 }
 325
 326 static int rev_same_tree_as_empty(struct rev_info *revs, struct commit *commit)
 327 {
 328         int retval;
 329         void *tree;
 330         unsigned long size;
 331         struct tree_desc empty, real;
 332         struct tree *t1 = commit->tree;
 333
 334         if (!t1)
 335                 return 0;
 336
 337         tree = read_object_with_reference(t1->object.sha1, tree_type, &size, NULL);
 338         if (!tree)
 339                 return 0;
 340         init_tree_desc(&real, tree, size);
 341         init_tree_desc(&empty, "", 0);
 342
 343         tree_difference = REV_TREE_SAME;
 344         DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES);
 345         retval = diff_tree(&empty, &real, "", &revs->pruning);
 346         free(tree);
 347
 348         return retval >= 0 && (tree_difference == REV_TREE_SAME);
 349 }
 350
 351 static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit)
 352 {
 353         struct commit_list **pp, *parent;
 354         int tree_changed = 0, tree_same = 0;
 355
 356         /*
 357          * If we don't do pruning, everything is interesting
 358          */
 359         if (!revs->prune)
 360                 return;
 361
 362         if (!commit->tree)
 363                 return;
 364
 365         if (!commit->parents) {
 366                 if (rev_same_tree_as_empty(revs, commit))
 367                         commit->object.flags |= TREESAME;
 368                 return;
 369         }
 370
 371         /*
 372          * Normal non-merge commit? If we don't want to make the
 373          * history dense, we consider it always to be a change..
 374          */
 375         if (!revs->dense && !commit->parents->next)
 376                 return;
 377
 378         pp = &commit->parents;
 379         while ((parent = *pp) != NULL) {
 380                 struct commit *p = parent->item;
 381
 382                 if (parse_commit(p) < 0)
 383                         die("cannot simplify commit %s (because of %s)",
 384                             sha1_to_hex(commit->object.sha1),
 385                             sha1_to_hex(p->object.sha1));
 386                 switch (rev_compare_tree(revs, p, commit)) {
 387                 case REV_TREE_SAME:
 388                         tree_same = 1;
 389                         if (!revs->simplify_history || (p->object.flags & UNINTERESTING)) {
 390                                 /* Even if a merge with an uninteresting
 391                                  * side branch brought the entire change
 392                                  * we are interested in, we do not want
 393                                  * to lose the other branches of this
 394                                  * merge, so we just keep going.
 395                                  */
 396                                 pp = &parent->next;
 397                                 continue;
 398                         }
 399                         parent->next = NULL;
 400                         commit->parents = parent;
 401                         commit->object.flags |= TREESAME;
 402                         return;
 403
 404                 case REV_TREE_NEW:
 405                         if (revs->remove_empty_trees &&
 406                             rev_same_tree_as_empty(revs, p)) {
 407                                 /* We are adding all the specified
 408                                  * paths from this parent, so the
 409                                  * history beyond this parent is not
 410                                  * interesting.  Remove its parents
 411                                  * (they are grandparents for us).
 412                                  * IOW, we pretend this parent is a
 413                                  * "root" commit.
 414                                  */
 415                                 if (parse_commit(p) < 0)
 416                                         die("cannot simplify commit %s (invalid %s)",
 417                                             sha1_to_hex(commit->object.sha1),
 418                                             sha1_to_hex(p->object.sha1));
 419                                 p->parents = NULL;
 420                         }
 421                 /* fallthrough */
 422                 case REV_TREE_OLD:
 423                 case REV_TREE_DIFFERENT:
 424                         tree_changed = 1;
 425                         pp = &parent->next;
 426                         continue;
 427                 }
 428                 die("bad tree compare for commit %s", sha1_to_hex(commit->object.sha1));
 429         }
 430         if (tree_changed && !tree_same)
 431                 return;
 432         commit->object.flags |= TREESAME;
 433 }
 434
 435 static void insert_by_date_cached(struct commit *p, struct commit_list **head,
 436                     struct commit_list *cached_base, struct commit_list **cache)
 437 {
 438         struct commit_list *new_entry;
 439
 440         if (cached_base && p->date < cached_base->item->date)
 441                 new_entry = insert_by_date(p, &cached_base->next);
 442         else
 443                 new_entry = insert_by_date(p, head);
 444
 445         if (cache && (!*cache || p->date < (*cache)->item->date))
 446                 *cache = new_entry;
 447 }
 448
 449 static int add_parents_to_list(struct rev_info *revs, struct commit *commit,
 450                     struct commit_list **list, struct commit_list **cache_ptr)
 451 {
 452         struct commit_list *parent = commit->parents;
 453         unsigned left_flag;
 454         struct commit_list *cached_base = cache_ptr ? *cache_ptr : NULL;
 455
 456         if (commit->object.flags & ADDED)
 457                 return 0;
 458         commit->object.flags |= ADDED;
 459
 460         /*
 461          * If the commit is uninteresting, don't try to
 462          * prune parents - we want the maximal uninteresting
 463          * set.
 464          *
 465          * Normally we haven't parsed the parent
 466          * yet, so we won't have a parent of a parent
 467          * here. However, it may turn out that we've
 468          * reached this commit some other way (where it
 469          * wasn't uninteresting), in which case we need
 470          * to mark its parents recursively too..
 471          */
 472         if (commit->object.flags & UNINTERESTING) {
 473                 while (parent) {
 474                         struct commit *p = parent->item;
 475                         parent = parent->next;
 476                         if (p)
 477                                 p->object.flags |= UNINTERESTING;
 478                         if (parse_commit(p) < 0)
 479                                 continue;
 480                         if (p->parents)
 481                                 mark_parents_uninteresting(p);
 482                         if (p->object.flags & SEEN)
 483                                 continue;
 484                         p->object.flags |= SEEN;
 485                         insert_by_date_cached(p, list, cached_base, cache_ptr);
 486                 }
 487                 return 0;
 488         }
 489
 490         /*
 491          * Ok, the commit wasn't uninteresting. Try to
 492          * simplify the commit history and find the parent
 493          * that has no differences in the path set if one exists.
 494          */
 495         try_to_simplify_commit(revs, commit);
 496
 497         if (revs->no_walk)
 498                 return 0;
 499
 500         left_flag = (commit->object.flags & SYMMETRIC_LEFT);
 501
 502         for (parent = commit->parents; parent; parent = parent->next) {
 503                 struct commit *p = parent->item;
 504
 505                 if (parse_commit(p) < 0)
 506                         return -1;
 507                 if (revs->show_source && !p->util)
 508                         p->util = commit->util;
 509                 p->object.flags |= left_flag;
 510                 if (!(p->object.flags & SEEN)) {
 511                         p->object.flags |= SEEN;
 512                         insert_by_date_cached(p, list, cached_base, cache_ptr);
 513                 }
 514                 if (revs->first_parent_only)
 515                         break;
 516         }
 517         return 0;
 518 }
 519
 520 static void cherry_pick_list(struct commit_list *list, struct rev_info *revs)
 521 {
 522         struct commit_list *p;
 523         int left_count = 0, right_count = 0;
 524         int left_first;
 525         struct patch_ids ids;
 526
 527         /* First count the commits on the left and on the right */
 528         for (p = list; p; p = p->next) {
 529                 struct commit *commit = p->item;
 530                 unsigned flags = commit->object.flags;
 531                 if (flags & BOUNDARY)
 532                         ;
 533                 else if (flags & SYMMETRIC_LEFT)
 534                         left_count++;
 535                 else
 536                         right_count++;
 537         }
 538
 539         left_first = left_count < right_count;
 540         init_patch_ids(&ids);
 541         if (revs->diffopt.nr_paths) {
 542                 ids.diffopts.nr_paths = revs->diffopt.nr_paths;
 543                 ids.diffopts.paths = revs->diffopt.paths;
 544                 ids.diffopts.pathlens = revs->diffopt.pathlens;
 545         }
 546
 547         /* Compute patch-ids for one side */
 548         for (p = list; p; p = p->next) {
 549                 struct commit *commit = p->item;
 550                 unsigned flags = commit->object.flags;
 551
 552                 if (flags & BOUNDARY)
 553                         continue;
 554                 /*
 555                  * If we have fewer left, left_first is set and we omit
 556                  * commits on the right branch in this loop.  If we have
 557                  * fewer right, we skip the left ones.
 558                  */
 559                 if (left_first != !!(flags & SYMMETRIC_LEFT))
 560                         continue;
 561                 commit->util = add_commit_patch_id(commit, &ids);
 562         }
 563
 564         /* Check the other side */
 565         for (p = list; p; p = p->next) {
 566                 struct commit *commit = p->item;
 567                 struct patch_id *id;
 568                 unsigned flags = commit->object.flags;
 569
 570                 if (flags & BOUNDARY)
 571                         continue;
 572                 /*
 573                  * If we have fewer left, left_first is set and we omit
 574                  * commits on the left branch in this loop.
 575                  */
 576                 if (left_first == !!(flags & SYMMETRIC_LEFT))
 577                         continue;
 578
 579                 /*
 580                  * Have we seen the same patch id?
 581                  */
 582                 id = has_commit_patch_id(commit, &ids);
 583                 if (!id)
 584                         continue;
 585                 id->seen = 1;
 586                 commit->object.flags |= SHOWN;
 587         }
 588
 589         /* Now check the original side for seen ones */
 590         for (p = list; p; p = p->next) {
 591                 struct commit *commit = p->item;
 592                 struct patch_id *ent;
 593
 594                 ent = commit->util;
 595                 if (!ent)
 596                         continue;
 597                 if (ent->seen)
 598                         commit->object.flags |= SHOWN;
 599                 commit->util = NULL;
 600         }
 601
 602         free_patch_ids(&ids);
 603 }
 604
 605 /* How many extra uninteresting commits we want to see.. */
 606 #define SLOP 5
 607
 608 static int still_interesting(struct commit_list *src, unsigned long date, int slop)
 609 {
 610         /*
 611          * No source list at all? We're definitely done..
 612          */
 613         if (!src)
 614                 return 0;
 615
 616         /*
 617          * Does the destination list contain entries with a date
 618          * before the source list? Definitely _not_ done.
 619          */
 620         if (date < src->item->date)
 621                 return SLOP;
 622
 623         /*
 624          * Does the source list still have interesting commits in
 625          * it? Definitely not done..
 626          */
 627         if (!everybody_uninteresting(src))
 628                 return SLOP;
 629
 630         /* Ok, we're closing in.. */
 631         return slop-1;
 632 }
 633
 634 static int limit_list(struct rev_info *revs)
 635 {
 636         int slop = SLOP;
 637         unsigned long date = ~0ul;
 638         struct commit_list *list = revs->commits;
 639         struct commit_list *newlist = NULL;
 640         struct commit_list **p = &newlist;
 641
 642         while (list) {
 643                 struct commit_list *entry = list;
 644                 struct commit *commit = list->item;
 645                 struct object *obj = &commit->object;
 646                 show_early_output_fn_t show;
 647
 648                 list = list->next;
 649                 free(entry);
 650
 651                 if (revs->max_age != -1 && (commit->date < revs->max_age))
 652                         obj->flags |= UNINTERESTING;
 653                 if (add_parents_to_list(revs, commit, &list, NULL) < 0)
 654                         return -1;
 655                 if (obj->flags & UNINTERESTING) {
 656                         mark_parents_uninteresting(commit);
 657                         if (revs->show_all)
 658                                 p = &commit_list_insert(commit, p)->next;
 659                         slop = still_interesting(list, date, slop);
 660                         if (slop)
 661                                 continue;
 662                         /* If showing all, add the whole pending list to the end */
 663                         if (revs->show_all)
 664                                 *p = list;
 665                         break;
 666                 }
 667                 if (revs->min_age != -1 && (commit->date > revs->min_age))
 668                         continue;
 669                 date = commit->date;
 670                 p = &commit_list_insert(commit, p)->next;
 671
 672                 show = show_early_output;
 673                 if (!show)
 674                         continue;
 675
 676                 show(revs, newlist);
 677                 show_early_output = NULL;
 678         }
 679         if (revs->cherry_pick)
 680                 cherry_pick_list(newlist, revs);
 681
 682         revs->commits = newlist;
 683         return 0;
 684 }
 685
 686 struct all_refs_cb {
 687         int all_flags;
 688         int warned_bad_reflog;
 689         struct rev_info *all_revs;
 690         const char *name_for_errormsg;
 691 };
 692
 693 static int handle_one_ref(const char *path, const unsigned char *sha1, int flag, void *cb_data)
 694 {
 695         struct all_refs_cb *cb = cb_data;
 696         struct object *object = get_reference(cb->all_revs, path, sha1,
 697                                               cb->all_flags);
 698         add_pending_object(cb->all_revs, object, path);
 699         return 0;
 700 }
 701
 702 static void handle_refs(struct rev_info *revs, unsigned flags,
 703                 int (*for_each)(each_ref_fn, void *))
 704 {
 705         struct all_refs_cb cb;
 706         cb.all_revs = revs;
 707         cb.all_flags = flags;
 708         for_each(handle_one_ref, &cb);
 709 }
 710
 711 static void handle_one_reflog_commit(unsigned char *sha1, void *cb_data)
 712 {
 713         struct all_refs_cb *cb = cb_data;
 714         if (!is_null_sha1(sha1)) {
 715                 struct object *o = parse_object(sha1);
 716                 if (o) {
 717                         o->flags |= cb->all_flags;
 718                         add_pending_object(cb->all_revs, o, "");
 719                 }
 720                 else if (!cb->warned_bad_reflog) {
 721                         warning("reflog of '%s' references pruned commits",
 722                                 cb->name_for_errormsg);
 723                         cb->warned_bad_reflog = 1;
 724                 }
 725         }
 726 }
 727
 728 static int handle_one_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
 729                 const char *email, unsigned long timestamp, int tz,
 730                 const char *message, void *cb_data)
 731 {
 732         handle_one_reflog_commit(osha1, cb_data);
 733         handle_one_reflog_commit(nsha1, cb_data);
 734         return 0;
 735 }
 736
 737 static int handle_one_reflog(const char *path, const unsigned char *sha1, int flag, void *cb_data)
 738 {
 739         struct all_refs_cb *cb = cb_data;
 740         cb->warned_bad_reflog = 0;
 741         cb->name_for_errormsg = path;
 742         for_each_reflog_ent(path, handle_one_reflog_ent, cb_data);
 743         return 0;
 744 }
 745
 746 static void handle_reflog(struct rev_info *revs, unsigned flags)
 747 {
 748         struct all_refs_cb cb;
 749         cb.all_revs = revs;
 750         cb.all_flags = flags;
 751         for_each_reflog(handle_one_reflog, &cb);
 752 }
 753
 754 static int add_parents_only(struct rev_info *revs, const char *arg, int flags)
 755 {
 756         unsigned char sha1[20];
 757         struct object *it;
 758         struct commit *commit;
 759         struct commit_list *parents;
 760
 761         if (*arg == '^') {
 762                 flags ^= UNINTERESTING;
 763                 arg++;
 764         }
 765         if (get_sha1(arg, sha1))
 766                 return 0;
 767         while (1) {
 768                 it = get_reference(revs, arg, sha1, 0);
 769                 if (it->type != OBJ_TAG)
 770                         break;
 771                 if (!((struct tag*)it)->tagged)
 772                         return 0;
 773                 hashcpy(sha1, ((struct tag*)it)->tagged->sha1);
 774         }
 775         if (it->type != OBJ_COMMIT)
 776                 return 0;
 777         commit = (struct commit *)it;
 778         for (parents = commit->parents; parents; parents = parents->next) {
 779                 it = &parents->item->object;
 780                 it->flags |= flags;
 781                 add_pending_object(revs, it, arg);
 782         }
 783         return 1;
 784 }
 785
 786 void init_revisions(struct rev_info *revs, const char *prefix)
 787 {
 788         memset(revs, 0, sizeof(*revs));
 789
 790         revs->abbrev = DEFAULT_ABBREV;
 791         revs->ignore_merges = 1;
 792         revs->simplify_history = 1;
 793         DIFF_OPT_SET(&revs->pruning, RECURSIVE);
 794         DIFF_OPT_SET(&revs->pruning, QUIET);
 795         revs->pruning.add_remove = file_add_remove;
 796         revs->pruning.change = file_change;
 797         revs->lifo = 1;
 798         revs->dense = 1;
 799         revs->prefix = prefix;
 800         revs->max_age = -1;
 801         revs->min_age = -1;
 802         revs->skip_count = -1;
 803         revs->max_count = -1;
 804
 805         revs->commit_format = CMIT_FMT_DEFAULT;
 806
 807         revs->grep_filter.status_only = 1;
 808         revs->grep_filter.pattern_tail = &(revs->grep_filter.pattern_list);
 809         revs->grep_filter.regflags = REG_NEWLINE;
 810
 811         diff_setup(&revs->diffopt);
 812         if (prefix && !revs->diffopt.prefix) {
 813                 revs->diffopt.prefix = prefix;
 814                 revs->diffopt.prefix_length = strlen(prefix);
 815         }
 816 }
 817
 818 static void add_pending_commit_list(struct rev_info *revs,
 819                                     struct commit_list *commit_list,
 820                                     unsigned int flags)
 821 {
 822         while (commit_list) {
 823                 struct object *object = &commit_list->item->object;
 824                 object->flags |= flags;
 825                 add_pending_object(revs, object, sha1_to_hex(object->sha1));
 826                 commit_list = commit_list->next;
 827         }
 828 }
 829
 830 static void prepare_show_merge(struct rev_info *revs)
 831 {
 832         struct commit_list *bases;
 833         struct commit *head, *other;
 834         unsigned char sha1[20];
 835         const char **prune = NULL;
 836         int i, prune_num = 1; /* counting terminating NULL */
 837
 838         if (get_sha1("HEAD", sha1) || !(head = lookup_commit(sha1)))
 839                 die("--merge without HEAD?");
 840         if (get_sha1("MERGE_HEAD", sha1) || !(other = lookup_commit(sha1)))
 841                 die("--merge without MERGE_HEAD?");
 842         add_pending_object(revs, &head->object, "HEAD");
 843         add_pending_object(revs, &other->object, "MERGE_HEAD");
 844         bases = get_merge_bases(head, other, 1);
 845         add_pending_commit_list(revs, bases, UNINTERESTING);
 846         free_commit_list(bases);
 847         head->object.flags |= SYMMETRIC_LEFT;
 848
 849         if (!active_nr)
 850                 read_cache();
 851         for (i = 0; i < active_nr; i++) {
 852                 struct cache_entry *ce = active_cache[i];
 853                 if (!ce_stage(ce))
 854                         continue;
 855                 if (ce_path_match(ce, revs->prune_data)) {
 856                         prune_num++;
 857                         prune = xrealloc(prune, sizeof(*prune) * prune_num);
 858                         prune[prune_num-2] = ce->name;
 859                         prune[prune_num-1] = NULL;
 860                 }
 861                 while ((i+1 < active_nr) &&
 862                        ce_same_name(ce, active_cache[i+1]))
 863                         i++;
 864         }
 865         revs->prune_data = prune;
 866         revs->limited = 1;
 867 }
 868
 869 int handle_revision_arg(const char *arg, struct rev_info *revs,
 870                         int flags,
 871                         int cant_be_filename)
 872 {
 873         unsigned mode;
 874         char *dotdot;
 875         struct object *object;
 876         unsigned char sha1[20];
 877         int local_flags;
 878
 879         dotdot = strstr(arg, "..");
 880         if (dotdot) {
 881                 unsigned char from_sha1[20];
 882                 const char *next = dotdot + 2;
 883                 const char *this = arg;
 884                 int symmetric = *next == '.';
 885                 unsigned int flags_exclude = flags ^ UNINTERESTING;
 886
 887                 *dotdot = 0;
 888                 next += symmetric;
 889
 890                 if (!*next)
 891                         next = "HEAD";
 892                 if (dotdot == arg)
 893                         this = "HEAD";
 894                 if (!get_sha1(this, from_sha1) &&
 895                     !get_sha1(next, sha1)) {
 896                         struct commit *a, *b;
 897                         struct commit_list *exclude;
 898
 899                         a = lookup_commit_reference(from_sha1);
 900                         b = lookup_commit_reference(sha1);
 901                         if (!a || !b) {
 902                                 die(symmetric ?
 903                                     "Invalid symmetric difference expression %s...%s" :
 904                                     "Invalid revision range %s..%s",
 905                                     arg, next);
 906                         }
 907
 908                         if (!cant_be_filename) {
 909                                 *dotdot = '.';
 910                                 verify_non_filename(revs->prefix, arg);
 911                         }
 912
 913                         if (symmetric) {
 914                                 exclude = get_merge_bases(a, b, 1);
 915                                 add_pending_commit_list(revs, exclude,
 916                                                         flags_exclude);
 917                                 free_commit_list(exclude);
 918                                 a->object.flags |= flags | SYMMETRIC_LEFT;
 919                         } else
 920                                 a->object.flags |= flags_exclude;
 921                         b->object.flags |= flags;
 922                         add_pending_object(revs, &a->object, this);
 923                         add_pending_object(revs, &b->object, next);
 924                         return 0;
 925                 }
 926                 *dotdot = '.';
 927         }
 928         dotdot = strstr(arg, "^@");
 929         if (dotdot && !dotdot[2]) {
 930                 *dotdot = 0;
 931                 if (add_parents_only(revs, arg, flags))
 932                         return 0;
 933                 *dotdot = '^';
 934         }
 935         dotdot = strstr(arg, "^!");
 936         if (dotdot && !dotdot[2]) {
 937                 *dotdot = 0;
 938                 if (!add_parents_only(revs, arg, flags ^ UNINTERESTING))
 939                         *dotdot = '^';
 940         }
 941
 942         local_flags = 0;
 943         if (*arg == '^') {
 944                 local_flags = UNINTERESTING;
 945                 arg++;
 946         }
 947         if (get_sha1_with_mode(arg, sha1, &mode))
 948                 return -1;
 949         if (!cant_be_filename)
 950                 verify_non_filename(revs->prefix, arg);
 951         object = get_reference(revs, arg, sha1, flags ^ local_flags);
 952         add_pending_object_with_mode(revs, object, arg, mode);
 953         return 0;
 954 }
 955
 956 struct cmdline_pathspec {
 957         int alloc;
 958         int nr;
 959         const char **path;
 960 };
 961
 962 static void append_prune_data(struct cmdline_pathspec *prune, const char **av)
 963 {
 964         while (*av) {
 965                 ALLOC_GROW(prune->path, prune->nr+1, prune->alloc);
 966                 prune->path[prune->nr++] = *(av++);
 967         }
 968 }
 969
 970 static void read_pathspec_from_stdin(struct rev_info *revs, struct strbuf *sb,
 971                                      struct cmdline_pathspec *prune)
 972 {
 973         while (strbuf_getwholeline(sb, stdin, '\n') != EOF) {
 974                 int len = sb->len;
 975                 if (len && sb->buf[len - 1] == '\n')
 976                         sb->buf[--len] = '\0';
 977                 ALLOC_GROW(prune->path, prune->nr+1, prune->alloc);
 978                 prune->path[prune->nr++] = xstrdup(sb->buf);
 979         }
 980 }
 981
 982 static void read_revisions_from_stdin(struct rev_info *revs,
 983                                       struct cmdline_pathspec *prune)
 984 {
 985         struct strbuf sb;
 986         int seen_dashdash = 0;
 987
 988         strbuf_init(&sb, 1000);
 989         while (strbuf_getwholeline(&sb, stdin, '\n') != EOF) {
 990                 int len = sb.len;
 991                 if (len && sb.buf[len - 1] == '\n')
 992                         sb.buf[--len] = '\0';
 993                 if (!len)
 994                         break;
 995                 if (sb.buf[0] == '-') {
 996                         if (len == 2 && sb.buf[1] == '-') {
 997                                 seen_dashdash = 1;
 998                                 break;
 999                         }
1000                         die("options not supported in --stdin mode");
1001                 }
1002                 if (handle_revision_arg(sb.buf, revs, 0, 1))
1003                         die("bad revision '%s'", sb.buf);
1004         }
1005         if (seen_dashdash)
1006                 read_pathspec_from_stdin(revs, &sb, prune);
1007         strbuf_release(&sb);
1008 }
1009
1010 static void add_grep(struct rev_info *revs, const char *ptn, enum grep_pat_token what)
1011 {
1012         append_grep_pattern(&revs->grep_filter, ptn, "command line", 0, what);
1013 }
1014
1015 static void add_header_grep(struct rev_info *revs, enum grep_header_field field, const char *pattern)
1016 {
1017         append_header_grep_pattern(&revs->grep_filter, field, pattern);
1018 }
1019
1020 static void add_message_grep(struct rev_info *revs, const char *pattern)
1021 {
1022         add_grep(revs, pattern, GREP_PATTERN_BODY);
1023 }
1024
1025 static int handle_revision_opt(struct rev_info *revs, int argc, const char **argv,
1026                                int *unkc, const char **unkv)
1027 {
1028         const char *arg = argv[0];
1029
1030         /* pseudo revision arguments */
1031         if (!strcmp(arg, "--all") || !strcmp(arg, "--branches") ||
1032             !strcmp(arg, "--tags") || !strcmp(arg, "--remotes") ||
1033             !strcmp(arg, "--reflog") || !strcmp(arg, "--not") ||
1034             !strcmp(arg, "--no-walk") || !strcmp(arg, "--do-walk") ||
1035             !strcmp(arg, "--bisect"))
1036         {
1037                 unkv[(*unkc)++] = arg;
1038                 return 1;
1039         }
1040
1041         if (!prefixcmp(arg, "--max-count=")) {
1042                 revs->max_count = atoi(arg + 12);
1043         } else if (!prefixcmp(arg, "--skip=")) {
1044                 revs->skip_count = atoi(arg + 7);
1045         } else if ((*arg == '-') && isdigit(arg[1])) {
1046         /* accept -<digit>, like traditional "head" */
1047                 revs->max_count = atoi(arg + 1);
1048         } else if (!strcmp(arg, "-n")) {
1049                 if (argc <= 1)
1050                         return error("-n requires an argument");
1051                 revs->max_count = atoi(argv[1]);
1052                 return 2;
1053         } else if (!prefixcmp(arg, "-n")) {
1054                 revs->max_count = atoi(arg + 2);
1055         } else if (!prefixcmp(arg, "--max-age=")) {
1056                 revs->max_age = atoi(arg + 10);
1057         } else if (!prefixcmp(arg, "--since=")) {
1058                 revs->max_age = approxidate(arg + 8);
1059         } else if (!prefixcmp(arg, "--after=")) {
1060                 revs->max_age = approxidate(arg + 8);
1061         } else if (!prefixcmp(arg, "--min-age=")) {
1062                 revs->min_age = atoi(arg + 10);
1063         } else if (!prefixcmp(arg, "--before=")) {
1064                 revs->min_age = approxidate(arg + 9);
1065         } else if (!prefixcmp(arg, "--until=")) {
1066                 revs->min_age = approxidate(arg + 8);
1067         } else if (!strcmp(arg, "--first-parent")) {
1068                 revs->first_parent_only = 1;
1069         } else if (!strcmp(arg, "-g") || !strcmp(arg, "--walk-reflogs")) {
1070                 init_reflog_walk(&revs->reflog_info);
1071         } else if (!strcmp(arg, "--default")) {
1072                 if (argc <= 1)
1073                         return error("bad --default argument");
1074                 revs->def = argv[1];
1075                 return 2;
1076         } else if (!strcmp(arg, "--merge")) {
1077                 revs->show_merge = 1;
1078         } else if (!strcmp(arg, "--topo-order")) {
1079                 revs->lifo = 1;
1080                 revs->topo_order = 1;
1081         } else if (!strcmp(arg, "--simplify-merges")) {
1082                 revs->simplify_merges = 1;
1083                 revs->rewrite_parents = 1;
1084                 revs->simplify_history = 0;
1085                 revs->limited = 1;
1086         } else if (!strcmp(arg, "--simplify-by-decoration")) {
1087                 revs->simplify_merges = 1;
1088                 revs->rewrite_parents = 1;
1089                 revs->simplify_history = 0;
1090                 revs->simplify_by_decoration = 1;
1091                 revs->limited = 1;
1092                 revs->prune = 1;
1093                 load_ref_decorations(DECORATE_SHORT_REFS);
1094         } else if (!strcmp(arg, "--date-order")) {
1095                 revs->lifo = 0;
1096                 revs->topo_order = 1;
1097         } else if (!prefixcmp(arg, "--early-output")) {
1098                 int count = 100;
1099                 switch (arg[14]) {
1100                 case '=':
1101                         count = atoi(arg+15);
1102                         /* Fallthrough */
1103                 case 0:
1104                         revs->topo_order = 1;
1105                        revs->early_output = count;
1106                 }
1107         } else if (!strcmp(arg, "--parents")) {
1108                 revs->rewrite_parents = 1;
1109                 revs->print_parents = 1;
1110         } else if (!strcmp(arg, "--dense")) {
1111                 revs->dense = 1;
1112         } else if (!strcmp(arg, "--sparse")) {
1113                 revs->dense = 0;
1114         } else if (!strcmp(arg, "--show-all")) {
1115                 revs->show_all = 1;
1116         } else if (!strcmp(arg, "--remove-empty")) {
1117                 revs->remove_empty_trees = 1;
1118         } else if (!strcmp(arg, "--merges")) {
1119                 revs->merges_only = 1;
1120         } else if (!strcmp(arg, "--no-merges")) {
1121                 revs->no_merges = 1;
1122         } else if (!strcmp(arg, "--boundary")) {
1123                 revs->boundary = 1;
1124         } else if (!strcmp(arg, "--left-right")) {
1125                 revs->left_right = 1;
1126         } else if (!strcmp(arg, "--cherry-pick")) {
1127                 revs->cherry_pick = 1;
1128                 revs->limited = 1;
1129         } else if (!strcmp(arg, "--objects")) {
1130                 revs->tag_objects = 1;
1131                 revs->tree_objects = 1;
1132                 revs->blob_objects = 1;
1133         } else if (!strcmp(arg, "--objects-edge")) {
1134                 revs->tag_objects = 1;
1135                 revs->tree_objects = 1;
1136                 revs->blob_objects = 1;
1137                 revs->edge_hint = 1;
1138         } else if (!strcmp(arg, "--unpacked")) {
1139                 revs->unpacked = 1;
1140         } else if (!prefixcmp(arg, "--unpacked=")) {
1141                 die("--unpacked=<packfile> no longer supported.");
1142         } else if (!strcmp(arg, "-r")) {
1143                 revs->diff = 1;
1144                 DIFF_OPT_SET(&revs->diffopt, RECURSIVE);
1145         } else if (!strcmp(arg, "-t")) {
1146                 revs->diff = 1;
1147                 DIFF_OPT_SET(&revs->diffopt, RECURSIVE);
1148                 DIFF_OPT_SET(&revs->diffopt, TREE_IN_RECURSIVE);
1149         } else if (!strcmp(arg, "-m")) {
1150                 revs->ignore_merges = 0;
1151         } else if (!strcmp(arg, "-c")) {
1152                 revs->diff = 1;
1153                 revs->dense_combined_merges = 0;
1154                 revs->combine_merges = 1;
1155         } else if (!strcmp(arg, "--cc")) {
1156                 revs->diff = 1;
1157                 revs->dense_combined_merges = 1;
1158                 revs->combine_merges = 1;
1159         } else if (!strcmp(arg, "-v")) {
1160                 revs->verbose_header = 1;
1161         } else if (!strcmp(arg, "--pretty")) {
1162                 revs->verbose_header = 1;
1163                 get_commit_format(arg+8, revs);
1164         } else if (!prefixcmp(arg, "--pretty=") || !prefixcmp(arg, "--format=")) {
1165                 revs->verbose_header = 1;
1166                 get_commit_format(arg+9, revs);
1167         } else if (!strcmp(arg, "--oneline")) {
1168                 revs->verbose_header = 1;
1169                 get_commit_format("oneline", revs);
1170                 revs->abbrev_commit = 1;
1171         } else if (!strcmp(arg, "--graph")) {
1172                 revs->topo_order = 1;
1173                 revs->rewrite_parents = 1;
1174                 revs->graph = graph_init(revs);
1175         } else if (!strcmp(arg, "--root")) {
1176                 revs->show_root_diff = 1;
1177         } else if (!strcmp(arg, "--no-commit-id")) {
1178                 revs->no_commit_id = 1;
1179         } else if (!strcmp(arg, "--always")) {
1180                 revs->always_show_header = 1;
1181         } else if (!strcmp(arg, "--no-abbrev")) {
1182                 revs->abbrev = 0;
1183         } else if (!strcmp(arg, "--abbrev")) {
1184                 revs->abbrev = DEFAULT_ABBREV;
1185         } else if (!prefixcmp(arg, "--abbrev=")) {
1186                 revs->abbrev = strtoul(arg + 9, NULL, 10);
1187                 if (revs->abbrev < MINIMUM_ABBREV)
1188                         revs->abbrev = MINIMUM_ABBREV;
1189                 else if (revs->abbrev > 40)
1190                         revs->abbrev = 40;
1191         } else if (!strcmp(arg, "--abbrev-commit")) {
1192                 revs->abbrev_commit = 1;
1193         } else if (!strcmp(arg, "--full-diff")) {
1194                 revs->diff = 1;
1195                 revs->full_diff = 1;
1196         } else if (!strcmp(arg, "--full-history")) {
1197                 revs->simplify_history = 0;
1198         } else if (!strcmp(arg, "--relative-date")) {
1199                 revs->date_mode = DATE_RELATIVE;
1200                 revs->date_mode_explicit = 1;
1201         } else if (!strncmp(arg, "--date=", 7)) {
1202                 revs->date_mode = parse_date_format(arg + 7);
1203                 revs->date_mode_explicit = 1;
1204         } else if (!strcmp(arg, "--log-size")) {
1205                 revs->show_log_size = 1;
1206         }
1207         /*
1208          * Grepping the commit log
1209          */
1210         else if (!prefixcmp(arg, "--author=")) {
1211                 add_header_grep(revs, GREP_HEADER_AUTHOR, arg+9);
1212         } else if (!prefixcmp(arg, "--committer=")) {
1213                 add_header_grep(revs, GREP_HEADER_COMMITTER, arg+12);
1214         } else if (!prefixcmp(arg, "--grep=")) {
1215                 add_message_grep(revs, arg+7);
1216         } else if (!strcmp(arg, "--extended-regexp") || !strcmp(arg, "-E")) {
1217                 revs->grep_filter.regflags |= REG_EXTENDED;
1218         } else if (!strcmp(arg, "--regexp-ignore-case") || !strcmp(arg, "-i")) {
1219                 revs->grep_filter.regflags |= REG_ICASE;
1220         } else if (!strcmp(arg, "--fixed-strings") || !strcmp(arg, "-F")) {
1221                 revs->grep_filter.fixed = 1;
1222         } else if (!strcmp(arg, "--all-match")) {
1223                 revs->grep_filter.all_match = 1;
1224         } else if (!prefixcmp(arg, "--encoding=")) {
1225                 arg += 11;
1226                 if (strcmp(arg, "none"))
1227                         git_log_output_encoding = xstrdup(arg);
1228                 else
1229                         git_log_output_encoding = "";
1230         } else if (!strcmp(arg, "--reverse")) {
1231                 revs->reverse ^= 1;
1232         } else if (!strcmp(arg, "--children")) {
1233                 revs->children.name = "children";
1234                 revs->limited = 1;
1235         } else {
1236                 int opts = diff_opt_parse(&revs->diffopt, argv, argc);
1237                 if (!opts)
1238                         unkv[(*unkc)++] = arg;
1239                 return opts;
1240         }
1241
1242         return 1;
1243 }
1244
1245 void parse_revision_opt(struct rev_info *revs, struct parse_opt_ctx_t *ctx,
1246                         const struct option *options,
1247                         const char * const usagestr[])
1248 {
1249         int n = handle_revision_opt(revs, ctx->argc, ctx->argv,
1250                                     &ctx->cpidx, ctx->out);
1251         if (n <= 0) {
1252                 error("unknown option `%s'", ctx->argv[0]);
1253                 usage_with_options(usagestr, options);
1254         }
1255         ctx->argv += n;
1256         ctx->argc -= n;
1257 }
1258
1259 static int for_each_bad_bisect_ref(each_ref_fn fn, void *cb_data)
1260 {
1261         return for_each_ref_in("refs/bisect/bad", fn, cb_data);
1262 }
1263
1264 static int for_each_good_bisect_ref(each_ref_fn fn, void *cb_data)
1265 {
1266         return for_each_ref_in("refs/bisect/good", fn, cb_data);
1267 }
1268
1269 /*
1270  * Parse revision information, filling in the "rev_info" structure,
1271  * and removing the used arguments from the argument list.
1272  *
1273  * Returns the number of arguments left that weren't recognized
1274  * (which are also moved to the head of the argument list)
1275  */
1276 int setup_revisions(int argc, const char **argv, struct rev_info *revs, const char *def)
1277 {
1278         int i, flags, left, seen_dashdash, read_from_stdin;
1279         struct cmdline_pathspec prune_data;
1280
1281         memset(&prune_data, 0, sizeof(prune_data));
1282
1283         /* First, search for "--" */
1284         seen_dashdash = 0;
1285         for (i = 1; i < argc; i++) {
1286                 const char *arg = argv[i];
1287                 if (strcmp(arg, "--"))
1288                         continue;
1289                 argv[i] = NULL;
1290                 argc = i;
1291                 if (argv[i + 1])
1292                         append_prune_data(&prune_data, argv + i + 1);
1293                 seen_dashdash = 1;
1294                 break;
1295         }
1296
1297         /* Second, deal with arguments and options */
1298         flags = 0;
1299         read_from_stdin = 0;
1300         for (left = i = 1; i < argc; i++) {
1301                 const char *arg = argv[i];
1302                 if (*arg == '-') {
1303                         int opts;
1304
1305                         if (!strcmp(arg, "--all")) {
1306                                 handle_refs(revs, flags, for_each_ref);
1307                                 handle_refs(revs, flags, head_ref);
1308                                 continue;
1309                         }
1310                         if (!strcmp(arg, "--branches")) {
1311                                 handle_refs(revs, flags, for_each_branch_ref);
1312                                 continue;
1313                         }
1314                         if (!strcmp(arg, "--bisect")) {
1315                                 handle_refs(revs, flags, for_each_bad_bisect_ref);
1316                                 handle_refs(revs, flags ^ UNINTERESTING, for_each_good_bisect_ref);
1317                                 revs->bisect = 1;
1318                                 continue;
1319                         }
1320                         if (!strcmp(arg, "--tags")) {
1321                                 handle_refs(revs, flags, for_each_tag_ref);
1322                                 continue;
1323                         }
1324                         if (!strcmp(arg, "--remotes")) {
1325                                 handle_refs(revs, flags, for_each_remote_ref);
1326                                 continue;
1327                         }
1328                         if (!strcmp(arg, "--reflog")) {
1329                                 handle_reflog(revs, flags);
1330                                 continue;
1331                         }
1332                         if (!strcmp(arg, "--not")) {
1333                                 flags ^= UNINTERESTING;
1334                                 continue;
1335                         }
1336                         if (!strcmp(arg, "--no-walk")) {
1337                                 revs->no_walk = 1;
1338                                 continue;
1339                         }
1340                         if (!strcmp(arg, "--do-walk")) {
1341                                 revs->no_walk = 0;
1342                                 continue;
1343                         }
1344                         if (!strcmp(arg, "--stdin")) {
1345                                 if (revs->disable_stdin) {
1346                                         argv[left++] = arg;
1347                                         continue;
1348                                 }
1349                                 if (read_from_stdin++)
1350                                         die("--stdin given twice?");
1351                                 read_revisions_from_stdin(revs, &prune_data);
1352                                 continue;
1353                         }
1354
1355                         opts = handle_revision_opt(revs, argc - i, argv + i, &left, argv);
1356                         if (opts > 0) {
1357                                 i += opts - 1;
1358                                 continue;
1359                         }
1360                         if (opts < 0)
1361                                 exit(128);
1362                         continue;
1363                 }
1364
1365                 if (handle_revision_arg(arg, revs, flags, seen_dashdash)) {
1366                         int j;
1367                         if (seen_dashdash || *arg == '^')
1368                                 die("bad revision '%s'", arg);
1369
1370                         /* If we didn't have a "--":
1371                          * (1) all filenames must exist;
1372                          * (2) all rev-args must not be interpretable
1373                          *     as a valid filename.
1374                          * but the latter we have checked in the main loop.
1375                          */
1376                         for (j = i; j < argc; j++)
1377                                 verify_filename(revs->prefix, argv[j]);
1378
1379                         append_prune_data(&prune_data, argv + i);
1380                         break;
1381                 }
1382         }
1383
1384         if (prune_data.nr) {
1385                 ALLOC_GROW(prune_data.path, prune_data.nr+1, prune_data.alloc);
1386                 prune_data.path[prune_data.nr++] = NULL;
1387                 revs->prune_data = get_pathspec(revs->prefix, prune_data.path);
1388         }
1389
1390         if (revs->def == NULL)
1391                 revs->def = def;
1392         if (revs->show_merge)
1393                 prepare_show_merge(revs);
1394         if (revs->def && !revs->pending.nr) {
1395                 unsigned char sha1[20];
1396                 struct object *object;
1397                 unsigned mode;
1398                 if (get_sha1_with_mode(revs->def, sha1, &mode))
1399                         die("bad default revision '%s'", revs->def);
1400                 object = get_reference(revs, revs->def, sha1, 0);
1401                 add_pending_object_with_mode(revs, object, revs->def, mode);
1402         }
1403
1404         /* Did the user ask for any diff output? Run the diff! */
1405         if (revs->diffopt.output_format & ~DIFF_FORMAT_NO_OUTPUT)
1406                 revs->diff = 1;
1407
1408         /* Pickaxe, diff-filter and rename following need diffs */
1409         if (revs->diffopt.pickaxe ||
1410             revs->diffopt.filter ||
1411             DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES))
1412                 revs->diff = 1;
1413
1414         if (revs->topo_order)
1415                 revs->limited = 1;
1416
1417         if (revs->prune_data) {
1418                 diff_tree_setup_paths(revs->prune_data, &revs->pruning);
1419                 /* Can't prune commits with rename following: the paths change.. */
1420                 if (!DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES))
1421                         revs->prune = 1;
1422                 if (!revs->full_diff)
1423                         diff_tree_setup_paths(revs->prune_data, &revs->diffopt);
1424         }
1425         if (revs->combine_merges) {
1426                 revs->ignore_merges = 0;
1427                 if (revs->dense_combined_merges && !revs->diffopt.output_format)
1428                         revs->diffopt.output_format = DIFF_FORMAT_PATCH;
1429         }
1430         revs->diffopt.abbrev = revs->abbrev;
1431         if (diff_setup_done(&revs->diffopt) < 0)
1432                 die("diff_setup_done failed");
1433
1434         compile_grep_patterns(&revs->grep_filter);
1435
1436         if (revs->reverse && revs->reflog_info)
1437                 die("cannot combine --reverse with --walk-reflogs");
1438         if (revs->rewrite_parents && revs->children.name)
1439                 die("cannot combine --parents and --children");
1440
1441         /*
1442          * Limitations on the graph functionality
1443          */
1444         if (revs->reverse && revs->graph)
1445                 die("cannot combine --reverse with --graph");
1446
1447         if (revs->reflog_info && revs->graph)
1448                 die("cannot combine --walk-reflogs with --graph");
1449
1450         return left;
1451 }
1452
1453 static void add_child(struct rev_info *revs, struct commit *parent, struct commit *child)
1454 {
1455         struct commit_list *l = xcalloc(1, sizeof(*l));
1456
1457         l->item = child;
1458         l->next = add_decoration(&revs->children, &parent->object, l);
1459 }
1460
1461 static int remove_duplicate_parents(struct commit *commit)
1462 {
1463         struct commit_list **pp, *p;
1464         int surviving_parents;
1465
1466         /* Examine existing parents while marking ones we have seen... */
1467         pp = &commit->parents;
1468         while ((p = *pp) != NULL) {
1469                 struct commit *parent = p->item;
1470                 if (parent->object.flags & TMP_MARK) {
1471                         *pp = p->next;
1472                         continue;
1473                 }
1474                 parent->object.flags |= TMP_MARK;
1475                 pp = &p->next;
1476         }
1477         /* count them while clearing the temporary mark */
1478         surviving_parents = 0;
1479         for (p = commit->parents; p; p = p->next) {
1480                 p->item->object.flags &= ~TMP_MARK;
1481                 surviving_parents++;
1482         }
1483         return surviving_parents;
1484 }
1485
1486 struct merge_simplify_state {
1487         struct commit *simplified;
1488 };
1489
1490 static struct merge_simplify_state *locate_simplify_state(struct rev_info *revs, struct commit *commit)
1491 {
1492         struct merge_simplify_state *st;
1493
1494         st = lookup_decoration(&revs->merge_simplification, &commit->object);
1495         if (!st) {
1496                 st = xcalloc(1, sizeof(*st));
1497                 add_decoration(&revs->merge_simplification, &commit->object, st);
1498         }
1499         return st;
1500 }
1501
1502 static struct commit_list **simplify_one(struct rev_info *revs, struct commit *commit, struct commit_list **tail)
1503 {
1504         struct commit_list *p;
1505         struct merge_simplify_state *st, *pst;
1506         int cnt;
1507
1508         st = locate_simplify_state(revs, commit);
1509
1510         /*
1511          * Have we handled this one?
1512          */
1513         if (st->simplified)
1514                 return tail;
1515
1516         /*
1517          * An UNINTERESTING commit simplifies to itself, so does a
1518          * root commit.  We do not rewrite parents of such commit
1519          * anyway.
1520          */
1521         if ((commit->object.flags & UNINTERESTING) || !commit->parents) {
1522                 st->simplified = commit;
1523                 return tail;
1524         }
1525
1526         /*
1527          * Do we know what commit all of our parents should be rewritten to?
1528          * Otherwise we are not ready to rewrite this one yet.
1529          */
1530         for (cnt = 0, p = commit->parents; p; p = p->next) {
1531                 pst = locate_simplify_state(revs, p->item);
1532                 if (!pst->simplified) {
1533                         tail = &commit_list_insert(p->item, tail)->next;
1534                         cnt++;
1535                 }
1536         }
1537         if (cnt) {
1538                 tail = &commit_list_insert(commit, tail)->next;
1539                 return tail;
1540         }
1541
1542         /*
1543          * Rewrite our list of parents.
1544          */
1545         for (p = commit->parents; p; p = p->next) {
1546                 pst = locate_simplify_state(revs, p->item);
1547                 p->item = pst->simplified;
1548         }
1549         cnt = remove_duplicate_parents(commit);
1550
1551         /*
1552          * It is possible that we are a merge and one side branch
1553          * does not have any commit that touches the given paths;
1554          * in such a case, the immediate parents will be rewritten
1555          * to different commits.
1556          *
1557          *      o----X          X: the commit we are looking at;
1558          *     /    /           o: a commit that touches the paths;
1559          * ---o----'
1560          *
1561          * Further reduce the parents by removing redundant parents.
1562          */
1563         if (1 < cnt) {
1564                 struct commit_list *h = reduce_heads(commit->parents);
1565                 cnt = commit_list_count(h);
1566                 free_commit_list(commit->parents);
1567                 commit->parents = h;
1568         }
1569
1570         /*
1571          * A commit simplifies to itself if it is a root, if it is
1572          * UNINTERESTING, if it touches the given paths, or if it is a
1573          * merge and its parents simplifies to more than one commits
1574          * (the first two cases are already handled at the beginning of
1575          * this function).
1576          *
1577          * Otherwise, it simplifies to what its sole parent simplifies to.
1578          */
1579         if (!cnt ||
1580             (commit->object.flags & UNINTERESTING) ||
1581             !(commit->object.flags & TREESAME) ||
1582             (1 < cnt))
1583                 st->simplified = commit;
1584         else {
1585                 pst = locate_simplify_state(revs, commit->parents->item);
1586                 st->simplified = pst->simplified;
1587         }
1588         return tail;
1589 }
1590
1591 static void simplify_merges(struct rev_info *revs)
1592 {
1593         struct commit_list *list;
1594         struct commit_list *yet_to_do, **tail;
1595
1596         if (!revs->topo_order)
1597                 sort_in_topological_order(&revs->commits, revs->lifo);
1598         if (!revs->prune)
1599                 return;
1600
1601         /* feed the list reversed */
1602         yet_to_do = NULL;
1603         for (list = revs->commits; list; list = list->next)
1604                 commit_list_insert(list->item, &yet_to_do);
1605         while (yet_to_do) {
1606                 list = yet_to_do;
1607                 yet_to_do = NULL;
1608                 tail = &yet_to_do;
1609                 while (list) {
1610                         struct commit *commit = list->item;
1611                         struct commit_list *next = list->next;
1612                         free(list);
1613                         list = next;
1614                         tail = simplify_one(revs, commit, tail);
1615                 }
1616         }
1617
1618         /* clean up the result, removing the simplified ones */
1619         list = revs->commits;
1620         revs->commits = NULL;
1621         tail = &revs->commits;
1622         while (list) {
1623                 struct commit *commit = list->item;
1624                 struct commit_list *next = list->next;
1625                 struct merge_simplify_state *st;
1626                 free(list);
1627                 list = next;
1628                 st = locate_simplify_state(revs, commit);
1629                 if (st->simplified == commit)
1630                         tail = &commit_list_insert(commit, tail)->next;
1631         }
1632 }
1633
1634 static void set_children(struct rev_info *revs)
1635 {
1636         struct commit_list *l;
1637         for (l = revs->commits; l; l = l->next) {
1638                 struct commit *commit = l->item;
1639                 struct commit_list *p;
1640
1641                 for (p = commit->parents; p; p = p->next)
1642                         add_child(revs, p->item, commit);
1643         }
1644 }
1645
1646 int prepare_revision_walk(struct rev_info *revs)
1647 {
1648         int nr = revs->pending.nr;
1649         struct object_array_entry *e, *list;
1650
1651         e = list = revs->pending.objects;
1652         revs->pending.nr = 0;
1653         revs->pending.alloc = 0;
1654         revs->pending.objects = NULL;
1655         while (--nr >= 0) {
1656                 struct commit *commit = handle_commit(revs, e->item, e->name);
1657                 if (commit) {
1658                         if (!(commit->object.flags & SEEN)) {
1659                                 commit->object.flags |= SEEN;
1660                                 insert_by_date(commit, &revs->commits);
1661                         }
1662                 }
1663                 e++;
1664         }
1665         free(list);
1666
1667         if (revs->no_walk)
1668                 return 0;
1669         if (revs->limited)
1670                 if (limit_list(revs) < 0)
1671                         return -1;
1672         if (revs->topo_order)
1673                 sort_in_topological_order(&revs->commits, revs->lifo);
1674         if (revs->simplify_merges)
1675                 simplify_merges(revs);
1676         if (revs->children.name)
1677                 set_children(revs);
1678         return 0;
1679 }
1680
1681 enum rewrite_result {
1682         rewrite_one_ok,
1683         rewrite_one_noparents,
1684         rewrite_one_error,
1685 };
1686
1687 static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp)
1688 {
1689         struct commit_list *cache = NULL;
1690
1691         for (;;) {
1692                 struct commit *p = *pp;
1693                 if (!revs->limited)
1694                         if (add_parents_to_list(revs, p, &revs->commits, &cache) < 0)
1695                                 return rewrite_one_error;
1696                 if (p->parents && p->parents->next)
1697                         return rewrite_one_ok;
1698                 if (p->object.flags & UNINTERESTING)
1699                         return rewrite_one_ok;
1700                 if (!(p->object.flags & TREESAME))
1701                         return rewrite_one_ok;
1702                 if (!p->parents)
1703                         return rewrite_one_noparents;
1704                 *pp = p->parents->item;
1705         }
1706 }
1707
1708 static int rewrite_parents(struct rev_info *revs, struct commit *commit)
1709 {
1710         struct commit_list **pp = &commit->parents;
1711         while (*pp) {
1712                 struct commit_list *parent = *pp;
1713                 switch (rewrite_one(revs, &parent->item)) {
1714                 case rewrite_one_ok:
1715                         break;
1716                 case rewrite_one_noparents:
1717                         *pp = parent->next;
1718                         continue;
1719                 case rewrite_one_error:
1720                         return -1;
1721                 }
1722                 pp = &parent->next;
1723         }
1724         remove_duplicate_parents(commit);
1725         return 0;
1726 }
1727
1728 static int commit_match(struct commit *commit, struct rev_info *opt)
1729 {
1730         if (!opt->grep_filter.pattern_list)
1731                 return 1;
1732         return grep_buffer(&opt->grep_filter,
1733                            NULL, /* we say nothing, not even filename */
1734                            commit->buffer, strlen(commit->buffer));
1735 }
1736
1737 static inline int want_ancestry(struct rev_info *revs)
1738 {
1739         return (revs->rewrite_parents || revs->children.name);
1740 }
1741
1742 enum commit_action get_commit_action(struct rev_info *revs, struct commit *commit)
1743 {
1744         if (commit->object.flags & SHOWN)
1745                 return commit_ignore;
1746         if (revs->unpacked && has_sha1_pack(commit->object.sha1))
1747                 return commit_ignore;
1748         if (revs->show_all)
1749                 return commit_show;
1750         if (commit->object.flags & UNINTERESTING)
1751                 return commit_ignore;
1752         if (revs->min_age != -1 && (commit->date > revs->min_age))
1753                 return commit_ignore;
1754         if (revs->no_merges && commit->parents && commit->parents->next)
1755                 return commit_ignore;
1756         if (revs->merges_only && !(commit->parents && commit->parents->next))
1757                 return commit_ignore;
1758         if (!commit_match(commit, revs))
1759                 return commit_ignore;
1760         if (revs->prune && revs->dense) {
1761                 /* Commit without changes? */
1762                 if (commit->object.flags & TREESAME) {
1763                         /* drop merges unless we want parenthood */
1764                         if (!want_ancestry(revs))
1765                                 return commit_ignore;
1766                         /* non-merge - always ignore it */
1767                         if (!commit->parents || !commit->parents->next)
1768                                 return commit_ignore;
1769                 }
1770         }
1771         return commit_show;
1772 }
1773
1774 enum commit_action simplify_commit(struct rev_info *revs, struct commit *commit)
1775 {
1776         enum commit_action action = get_commit_action(revs, commit);
1777
1778         if (action == commit_show &&
1779             !revs->show_all &&
1780             revs->prune && revs->dense && want_ancestry(revs)) {
1781                 if (rewrite_parents(revs, commit) < 0)
1782                         return commit_error;
1783         }
1784         return action;
1785 }
1786
1787 static struct commit *get_revision_1(struct rev_info *revs)
1788 {
1789         if (!revs->commits)
1790                 return NULL;
1791
1792         do {
1793                 struct commit_list *entry = revs->commits;
1794                 struct commit *commit = entry->item;
1795
1796                 revs->commits = entry->next;
1797                 free(entry);
1798
1799                 if (revs->reflog_info)
1800                         fake_reflog_parent(revs->reflog_info, commit);
1801
1802                 /*
1803                  * If we haven't done the list limiting, we need to look at
1804                  * the parents here. We also need to do the date-based limiting
1805                  * that we'd otherwise have done in limit_list().
1806                  */
1807                 if (!revs->limited) {
1808                         if (revs->max_age != -1 &&
1809                             (commit->date < revs->max_age))
1810                                 continue;
1811                         if (add_parents_to_list(revs, commit, &revs->commits, NULL) < 0)
1812                                 die("Failed to traverse parents of commit %s",
1813                                     sha1_to_hex(commit->object.sha1));
1814                 }
1815
1816                 switch (simplify_commit(revs, commit)) {
1817                 case commit_ignore:
1818                         continue;
1819                 case commit_error:
1820                         die("Failed to simplify parents of commit %s",
1821                             sha1_to_hex(commit->object.sha1));
1822                 default:
1823                         return commit;
1824                 }
1825         } while (revs->commits);
1826         return NULL;
1827 }
1828
1829 static void gc_boundary(struct object_array *array)
1830 {
1831         unsigned nr = array->nr;
1832         unsigned alloc = array->alloc;
1833         struct object_array_entry *objects = array->objects;
1834
1835         if (alloc <= nr) {
1836                 unsigned i, j;
1837                 for (i = j = 0; i < nr; i++) {
1838                         if (objects[i].item->flags & SHOWN)
1839                                 continue;
1840                         if (i != j)
1841                                 objects[j] = objects[i];
1842                         j++;
1843                 }
1844                 for (i = j; i < nr; i++)
1845                         objects[i].item = NULL;
1846                 array->nr = j;
1847         }
1848 }
1849
1850 static void create_boundary_commit_list(struct rev_info *revs)
1851 {
1852         unsigned i;
1853         struct commit *c;
1854         struct object_array *array = &revs->boundary_commits;
1855         struct object_array_entry *objects = array->objects;
1856
1857         /*
1858          * If revs->commits is non-NULL at this point, an error occurred in
1859          * get_revision_1().  Ignore the error and continue printing the
1860          * boundary commits anyway.  (This is what the code has always
1861          * done.)
1862          */
1863         if (revs->commits) {
1864                 free_commit_list(revs->commits);
1865                 revs->commits = NULL;
1866         }
1867
1868         /*
1869          * Put all of the actual boundary commits from revs->boundary_commits
1870          * into revs->commits
1871          */
1872         for (i = 0; i < array->nr; i++) {
1873                 c = (struct commit *)(objects[i].item);
1874                 if (!c)
1875                         continue;
1876                 if (!(c->object.flags & CHILD_SHOWN))
1877                         continue;
1878                 if (c->object.flags & (SHOWN | BOUNDARY))
1879                         continue;
1880                 c->object.flags |= BOUNDARY;
1881                 commit_list_insert(c, &revs->commits);
1882         }
1883
1884         /*
1885          * If revs->topo_order is set, sort the boundary commits
1886          * in topological order
1887          */
1888         sort_in_topological_order(&revs->commits, revs->lifo);
1889 }
1890
1891 static struct commit *get_revision_internal(struct rev_info *revs)
1892 {
1893         struct commit *c = NULL;
1894         struct commit_list *l;
1895
1896         if (revs->boundary == 2) {
1897                 /*
1898                  * All of the normal commits have already been returned,
1899                  * and we are now returning boundary commits.
1900                  * create_boundary_commit_list() has populated
1901                  * revs->commits with the remaining commits to return.
1902                  */
1903                 c = pop_commit(&revs->commits);
1904                 if (c)
1905                         c->object.flags |= SHOWN;
1906                 return c;
1907         }
1908
1909         /*
1910          * Now pick up what they want to give us
1911          */
1912         c = get_revision_1(revs);
1913         if (c) {
1914                 while (0 < revs->skip_count) {
1915                         revs->skip_count--;
1916                         c = get_revision_1(revs);
1917                         if (!c)
1918                                 break;
1919                 }
1920         }
1921
1922         /*
1923          * Check the max_count.
1924          */
1925         switch (revs->max_count) {
1926         case -1:
1927                 break;
1928         case 0:
1929                 c = NULL;
1930                 break;
1931         default:
1932                 revs->max_count--;
1933         }
1934
1935         if (c)
1936                 c->object.flags |= SHOWN;
1937
1938         if (!revs->boundary) {
1939                 return c;
1940         }
1941
1942         if (!c) {
1943                 /*
1944                  * get_revision_1() runs out the commits, and
1945                  * we are done computing the boundaries.
1946                  * switch to boundary commits output mode.
1947                  */
1948                 revs->boundary = 2;
1949
1950                 /*
1951                  * Update revs->commits to contain the list of
1952                  * boundary commits.
1953                  */
1954                 create_boundary_commit_list(revs);
1955
1956                 return get_revision_internal(revs);
1957         }
1958
1959         /*
1960          * boundary commits are the commits that are parents of the
1961          * ones we got from get_revision_1() but they themselves are
1962          * not returned from get_revision_1().  Before returning
1963          * 'c', we need to mark its parents that they could be boundaries.
1964          */
1965
1966         for (l = c->parents; l; l = l->next) {
1967                 struct object *p;
1968                 p = &(l->item->object);
1969                 if (p->flags & (CHILD_SHOWN | SHOWN))
1970                         continue;
1971                 p->flags |= CHILD_SHOWN;
1972                 gc_boundary(&revs->boundary_commits);
1973                 add_object_array(p, NULL, &revs->boundary_commits);
1974         }
1975
1976         return c;
1977 }
1978
1979 struct commit *get_revision(struct rev_info *revs)
1980 {
1981         struct commit *c;
1982         struct commit_list *reversed;
1983
1984         if (revs->reverse) {
1985                 reversed = NULL;
1986                 while ((c = get_revision_internal(revs))) {
1987                         commit_list_insert(c, &reversed);
1988                 }
1989                 revs->commits = reversed;
1990                 revs->reverse = 0;
1991                 revs->reverse_output_stage = 1;
1992         }
1993
1994         if (revs->reverse_output_stage)
1995                 return pop_commit(&revs->commits);
1996
1997         c = get_revision_internal(revs);
1998         if (c && revs->graph)
1999                 graph_update(revs->graph, c);
2000         return c;
2001 }