Windows resource: handle dashes in the Git version gracefully
[git/dscho.git] / revision.c
bloba6c263a2d697650966db25f63cd51f29afe3ee50
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 #include "string-list.h"
17 volatile show_early_output_fn_t show_early_output;
19 char *path_name(const struct name_path *path, const char *name)
21 const struct name_path *p;
22 char *n, *m;
23 int nlen = strlen(name);
24 int len = nlen + 1;
26 for (p = path; p; p = p->up) {
27 if (p->elem_len)
28 len += p->elem_len + 1;
30 n = xmalloc(len);
31 m = n + len - (nlen + 1);
32 strcpy(m, name);
33 for (p = path; p; p = p->up) {
34 if (p->elem_len) {
35 m -= p->elem_len + 1;
36 memcpy(m, p->elem, p->elem_len);
37 m[p->elem_len] = '/';
40 return n;
43 static int show_path_component_truncated(FILE *out, const char *name, int len)
45 int cnt;
46 for (cnt = 0; cnt < len; cnt++) {
47 int ch = name[cnt];
48 if (!ch || ch == '\n')
49 return -1;
50 fputc(ch, out);
52 return len;
55 static int show_path_truncated(FILE *out, const struct name_path *path)
57 int emitted, ours;
59 if (!path)
60 return 0;
61 emitted = show_path_truncated(out, path->up);
62 if (emitted < 0)
63 return emitted;
64 if (emitted)
65 fputc('/', out);
66 ours = show_path_component_truncated(out, path->elem, path->elem_len);
67 if (ours < 0)
68 return ours;
69 return ours || emitted;
72 void show_object_with_name(FILE *out, struct object *obj, const struct name_path *path, const char *component)
74 struct name_path leaf;
75 leaf.up = (struct name_path *)path;
76 leaf.elem = component;
77 leaf.elem_len = strlen(component);
79 fprintf(out, "%s ", sha1_to_hex(obj->sha1));
80 show_path_truncated(out, &leaf);
81 fputc('\n', out);
84 void add_object(struct object *obj,
85 struct object_array *p,
86 struct name_path *path,
87 const char *name)
89 add_object_array(obj, path_name(path, name), p);
92 static void mark_blob_uninteresting(struct blob *blob)
94 if (!blob)
95 return;
96 if (blob->object.flags & UNINTERESTING)
97 return;
98 blob->object.flags |= UNINTERESTING;
101 void mark_tree_uninteresting(struct tree *tree)
103 struct tree_desc desc;
104 struct name_entry entry;
105 struct object *obj = &tree->object;
107 if (!tree)
108 return;
109 if (obj->flags & UNINTERESTING)
110 return;
111 obj->flags |= UNINTERESTING;
112 if (!has_sha1_file(obj->sha1))
113 return;
114 if (parse_tree(tree) < 0)
115 die("bad tree %s", sha1_to_hex(obj->sha1));
117 init_tree_desc(&desc, tree->buffer, tree->size);
118 while (tree_entry(&desc, &entry)) {
119 switch (object_type(entry.mode)) {
120 case OBJ_TREE:
121 mark_tree_uninteresting(lookup_tree(entry.sha1));
122 break;
123 case OBJ_BLOB:
124 mark_blob_uninteresting(lookup_blob(entry.sha1));
125 break;
126 default:
127 /* Subproject commit - not in this repository */
128 break;
133 * We don't care about the tree any more
134 * after it has been marked uninteresting.
136 free(tree->buffer);
137 tree->buffer = NULL;
140 void mark_parents_uninteresting(struct commit *commit)
142 struct commit_list *parents = NULL, *l;
144 for (l = commit->parents; l; l = l->next)
145 commit_list_insert(l->item, &parents);
147 while (parents) {
148 struct commit *commit = parents->item;
149 l = parents;
150 parents = parents->next;
151 free(l);
153 while (commit) {
155 * A missing commit is ok iff its parent is marked
156 * uninteresting.
158 * We just mark such a thing parsed, so that when
159 * it is popped next time around, we won't be trying
160 * to parse it and get an error.
162 if (!has_sha1_file(commit->object.sha1))
163 commit->object.parsed = 1;
165 if (commit->object.flags & UNINTERESTING)
166 break;
168 commit->object.flags |= UNINTERESTING;
171 * Normally we haven't parsed the parent
172 * yet, so we won't have a parent of a parent
173 * here. However, it may turn out that we've
174 * reached this commit some other way (where it
175 * wasn't uninteresting), in which case we need
176 * to mark its parents recursively too..
178 if (!commit->parents)
179 break;
181 for (l = commit->parents->next; l; l = l->next)
182 commit_list_insert(l->item, &parents);
183 commit = commit->parents->item;
188 static void add_pending_object_with_mode(struct rev_info *revs, struct object *obj, const char *name, unsigned mode, unsigned flags)
190 if (!obj)
191 return;
192 if (revs->no_walk && (obj->flags & UNINTERESTING))
193 revs->no_walk = 0;
194 if (revs->reflog_info && obj->type == OBJ_COMMIT) {
195 struct strbuf buf = STRBUF_INIT;
196 int len = interpret_branch_name(name, &buf);
197 int st;
199 if (0 < len && name[len] && buf.len)
200 strbuf_addstr(&buf, name + len);
201 st = add_reflog_for_walk(revs->reflog_info,
202 (struct commit *)obj,
203 buf.buf[0] ? buf.buf: name);
204 strbuf_release(&buf);
205 if (st)
206 return;
208 add_object_array_with_mode(obj, name, &revs->pending, mode);
209 revs->pending.objects[revs->pending.nr-1].flags = flags;
212 void add_pending_object(struct rev_info *revs, struct object *obj, const char *name)
214 add_pending_object_with_mode(revs, obj, name, S_IFINVALID, 0);
217 void add_head_to_pending(struct rev_info *revs)
219 unsigned char sha1[20];
220 struct object *obj;
221 if (get_sha1("HEAD", sha1))
222 return;
223 obj = parse_object(sha1);
224 if (!obj)
225 return;
226 add_pending_object(revs, obj, "HEAD");
229 static struct object *get_reference(struct rev_info *revs, const char *name, const unsigned char *sha1, unsigned int flags)
231 struct object *object;
233 object = parse_object(sha1);
234 if (!object) {
235 if (revs->ignore_missing)
236 return object;
237 die("bad object %s", name);
239 object->flags |= flags;
240 return object;
243 void add_pending_sha1(struct rev_info *revs, const char *name,
244 const unsigned char *sha1, unsigned int flags)
246 struct object *object = get_reference(revs, name, sha1, flags);
247 add_pending_object(revs, object, name);
250 static struct commit *handle_commit(struct rev_info *revs, struct object *object, const char *name)
252 unsigned long flags = object->flags;
255 * Tag object? Look what it points to..
257 while (object->type == OBJ_TAG) {
258 struct tag *tag = (struct tag *) object;
259 if (revs->tag_objects && !(flags & UNINTERESTING))
260 add_pending_object(revs, object, tag->tag);
261 if (!tag->tagged)
262 die("bad tag");
263 object = parse_object(tag->tagged->sha1);
264 if (!object) {
265 if (flags & UNINTERESTING)
266 return NULL;
267 die("bad object %s", sha1_to_hex(tag->tagged->sha1));
272 * Commit object? Just return it, we'll do all the complex
273 * reachability crud.
275 if (object->type == OBJ_COMMIT) {
276 struct commit *commit = (struct commit *)object;
277 if (parse_commit(commit) < 0)
278 die("unable to parse commit %s", name);
279 if (flags & UNINTERESTING) {
280 commit->object.flags |= UNINTERESTING;
281 mark_parents_uninteresting(commit);
282 revs->limited = 1;
284 if (revs->show_source && !commit->util)
285 commit->util = (void *) name;
286 return commit;
290 * Tree object? Either mark it uninteresting, or add it
291 * to the list of objects to look at later..
293 if (object->type == OBJ_TREE) {
294 struct tree *tree = (struct tree *)object;
295 if (!revs->tree_objects)
296 return NULL;
297 if (flags & UNINTERESTING) {
298 mark_tree_uninteresting(tree);
299 return NULL;
301 add_pending_object(revs, object, "");
302 return NULL;
306 * Blob object? You know the drill by now..
308 if (object->type == OBJ_BLOB) {
309 struct blob *blob = (struct blob *)object;
310 if (!revs->blob_objects)
311 return NULL;
312 if (flags & UNINTERESTING) {
313 mark_blob_uninteresting(blob);
314 return NULL;
316 add_pending_object(revs, object, "");
317 return NULL;
319 die("%s is unknown object", name);
322 static int everybody_uninteresting(struct commit_list *orig)
324 struct commit_list *list = orig;
325 while (list) {
326 struct commit *commit = list->item;
327 list = list->next;
328 if (commit->object.flags & UNINTERESTING)
329 continue;
330 return 0;
332 return 1;
336 * The goal is to get REV_TREE_NEW as the result only if the
337 * diff consists of all '+' (and no other changes), REV_TREE_OLD
338 * if the whole diff is removal of old data, and otherwise
339 * REV_TREE_DIFFERENT (of course if the trees are the same we
340 * want REV_TREE_SAME).
341 * That means that once we get to REV_TREE_DIFFERENT, we do not
342 * have to look any further.
344 static int tree_difference = REV_TREE_SAME;
346 static void file_add_remove(struct diff_options *options,
347 int addremove, unsigned mode,
348 const unsigned char *sha1,
349 int sha1_valid,
350 const char *fullpath, unsigned dirty_submodule)
352 int diff = addremove == '+' ? REV_TREE_NEW : REV_TREE_OLD;
354 tree_difference |= diff;
355 if (tree_difference == REV_TREE_DIFFERENT)
356 DIFF_OPT_SET(options, HAS_CHANGES);
359 static void file_change(struct diff_options *options,
360 unsigned old_mode, unsigned new_mode,
361 const unsigned char *old_sha1,
362 const unsigned char *new_sha1,
363 int old_sha1_valid, int new_sha1_valid,
364 const char *fullpath,
365 unsigned old_dirty_submodule, unsigned new_dirty_submodule)
367 tree_difference = REV_TREE_DIFFERENT;
368 DIFF_OPT_SET(options, HAS_CHANGES);
371 static int rev_compare_tree(struct rev_info *revs, struct commit *parent, struct commit *commit)
373 struct tree *t1 = parent->tree;
374 struct tree *t2 = commit->tree;
376 if (!t1)
377 return REV_TREE_NEW;
378 if (!t2)
379 return REV_TREE_OLD;
381 if (revs->simplify_by_decoration) {
383 * If we are simplifying by decoration, then the commit
384 * is worth showing if it has a tag pointing at it.
386 if (lookup_decoration(&name_decoration, &commit->object))
387 return REV_TREE_DIFFERENT;
389 * A commit that is not pointed by a tag is uninteresting
390 * if we are not limited by path. This means that you will
391 * see the usual "commits that touch the paths" plus any
392 * tagged commit by specifying both --simplify-by-decoration
393 * and pathspec.
395 if (!revs->prune_data.nr)
396 return REV_TREE_SAME;
399 tree_difference = REV_TREE_SAME;
400 DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES);
401 if (diff_tree_sha1(t1->object.sha1, t2->object.sha1, "",
402 &revs->pruning) < 0)
403 return REV_TREE_DIFFERENT;
404 return tree_difference;
407 static int rev_same_tree_as_empty(struct rev_info *revs, struct commit *commit)
409 int retval;
410 void *tree;
411 unsigned long size;
412 struct tree_desc empty, real;
413 struct tree *t1 = commit->tree;
415 if (!t1)
416 return 0;
418 tree = read_object_with_reference(t1->object.sha1, tree_type, &size, NULL);
419 if (!tree)
420 return 0;
421 init_tree_desc(&real, tree, size);
422 init_tree_desc(&empty, "", 0);
424 tree_difference = REV_TREE_SAME;
425 DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES);
426 retval = diff_tree(&empty, &real, "", &revs->pruning);
427 free(tree);
429 return retval >= 0 && (tree_difference == REV_TREE_SAME);
432 static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit)
434 struct commit_list **pp, *parent;
435 int tree_changed = 0, tree_same = 0, nth_parent = 0;
438 * If we don't do pruning, everything is interesting
440 if (!revs->prune)
441 return;
443 if (!commit->tree)
444 return;
446 if (!commit->parents) {
447 if (rev_same_tree_as_empty(revs, commit))
448 commit->object.flags |= TREESAME;
449 return;
453 * Normal non-merge commit? If we don't want to make the
454 * history dense, we consider it always to be a change..
456 if (!revs->dense && !commit->parents->next)
457 return;
459 pp = &commit->parents;
460 while ((parent = *pp) != NULL) {
461 struct commit *p = parent->item;
464 * Do not compare with later parents when we care only about
465 * the first parent chain, in order to avoid derailing the
466 * traversal to follow a side branch that brought everything
467 * in the path we are limited to by the pathspec.
469 if (revs->first_parent_only && nth_parent++)
470 break;
471 if (parse_commit(p) < 0)
472 die("cannot simplify commit %s (because of %s)",
473 sha1_to_hex(commit->object.sha1),
474 sha1_to_hex(p->object.sha1));
475 switch (rev_compare_tree(revs, p, commit)) {
476 case REV_TREE_SAME:
477 tree_same = 1;
478 if (!revs->simplify_history || (p->object.flags & UNINTERESTING)) {
479 /* Even if a merge with an uninteresting
480 * side branch brought the entire change
481 * we are interested in, we do not want
482 * to lose the other branches of this
483 * merge, so we just keep going.
485 pp = &parent->next;
486 continue;
488 parent->next = NULL;
489 commit->parents = parent;
490 commit->object.flags |= TREESAME;
491 return;
493 case REV_TREE_NEW:
494 if (revs->remove_empty_trees &&
495 rev_same_tree_as_empty(revs, p)) {
496 /* We are adding all the specified
497 * paths from this parent, so the
498 * history beyond this parent is not
499 * interesting. Remove its parents
500 * (they are grandparents for us).
501 * IOW, we pretend this parent is a
502 * "root" commit.
504 if (parse_commit(p) < 0)
505 die("cannot simplify commit %s (invalid %s)",
506 sha1_to_hex(commit->object.sha1),
507 sha1_to_hex(p->object.sha1));
508 p->parents = NULL;
510 /* fallthrough */
511 case REV_TREE_OLD:
512 case REV_TREE_DIFFERENT:
513 tree_changed = 1;
514 pp = &parent->next;
515 continue;
517 die("bad tree compare for commit %s", sha1_to_hex(commit->object.sha1));
519 if (tree_changed && !tree_same)
520 return;
521 commit->object.flags |= TREESAME;
524 static void commit_list_insert_by_date_cached(struct commit *p, struct commit_list **head,
525 struct commit_list *cached_base, struct commit_list **cache)
527 struct commit_list *new_entry;
529 if (cached_base && p->date < cached_base->item->date)
530 new_entry = commit_list_insert_by_date(p, &cached_base->next);
531 else
532 new_entry = commit_list_insert_by_date(p, head);
534 if (cache && (!*cache || p->date < (*cache)->item->date))
535 *cache = new_entry;
538 static int add_parents_to_list(struct rev_info *revs, struct commit *commit,
539 struct commit_list **list, struct commit_list **cache_ptr)
541 struct commit_list *parent = commit->parents;
542 unsigned left_flag;
543 struct commit_list *cached_base = cache_ptr ? *cache_ptr : NULL;
545 if (commit->object.flags & ADDED)
546 return 0;
547 commit->object.flags |= ADDED;
550 * If the commit is uninteresting, don't try to
551 * prune parents - we want the maximal uninteresting
552 * set.
554 * Normally we haven't parsed the parent
555 * yet, so we won't have a parent of a parent
556 * here. However, it may turn out that we've
557 * reached this commit some other way (where it
558 * wasn't uninteresting), in which case we need
559 * to mark its parents recursively too..
561 if (commit->object.flags & UNINTERESTING) {
562 while (parent) {
563 struct commit *p = parent->item;
564 parent = parent->next;
565 if (p)
566 p->object.flags |= UNINTERESTING;
567 if (parse_commit(p) < 0)
568 continue;
569 if (p->parents)
570 mark_parents_uninteresting(p);
571 if (p->object.flags & SEEN)
572 continue;
573 p->object.flags |= SEEN;
574 commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr);
576 return 0;
580 * Ok, the commit wasn't uninteresting. Try to
581 * simplify the commit history and find the parent
582 * that has no differences in the path set if one exists.
584 try_to_simplify_commit(revs, commit);
586 if (revs->no_walk)
587 return 0;
589 left_flag = (commit->object.flags & SYMMETRIC_LEFT);
591 for (parent = commit->parents; parent; parent = parent->next) {
592 struct commit *p = parent->item;
594 if (parse_commit(p) < 0)
595 return -1;
596 if (revs->show_source && !p->util)
597 p->util = commit->util;
598 p->object.flags |= left_flag;
599 if (!(p->object.flags & SEEN)) {
600 p->object.flags |= SEEN;
601 commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr);
603 if (revs->first_parent_only)
604 break;
606 return 0;
609 static void cherry_pick_list(struct commit_list *list, struct rev_info *revs)
611 struct commit_list *p;
612 int left_count = 0, right_count = 0;
613 int left_first;
614 struct patch_ids ids;
615 unsigned cherry_flag;
617 /* First count the commits on the left and on the right */
618 for (p = list; p; p = p->next) {
619 struct commit *commit = p->item;
620 unsigned flags = commit->object.flags;
621 if (flags & BOUNDARY)
623 else if (flags & SYMMETRIC_LEFT)
624 left_count++;
625 else
626 right_count++;
629 if (!left_count || !right_count)
630 return;
632 left_first = left_count < right_count;
633 init_patch_ids(&ids);
634 ids.diffopts.pathspec = revs->diffopt.pathspec;
636 /* Compute patch-ids for one side */
637 for (p = list; p; p = p->next) {
638 struct commit *commit = p->item;
639 unsigned flags = commit->object.flags;
641 if (flags & BOUNDARY)
642 continue;
644 * If we have fewer left, left_first is set and we omit
645 * commits on the right branch in this loop. If we have
646 * fewer right, we skip the left ones.
648 if (left_first != !!(flags & SYMMETRIC_LEFT))
649 continue;
650 commit->util = add_commit_patch_id(commit, &ids);
653 /* either cherry_mark or cherry_pick are true */
654 cherry_flag = revs->cherry_mark ? PATCHSAME : SHOWN;
656 /* Check the other side */
657 for (p = list; p; p = p->next) {
658 struct commit *commit = p->item;
659 struct patch_id *id;
660 unsigned flags = commit->object.flags;
662 if (flags & BOUNDARY)
663 continue;
665 * If we have fewer left, left_first is set and we omit
666 * commits on the left branch in this loop.
668 if (left_first == !!(flags & SYMMETRIC_LEFT))
669 continue;
672 * Have we seen the same patch id?
674 id = has_commit_patch_id(commit, &ids);
675 if (!id)
676 continue;
677 id->seen = 1;
678 commit->object.flags |= cherry_flag;
681 /* Now check the original side for seen ones */
682 for (p = list; p; p = p->next) {
683 struct commit *commit = p->item;
684 struct patch_id *ent;
686 ent = commit->util;
687 if (!ent)
688 continue;
689 if (ent->seen)
690 commit->object.flags |= cherry_flag;
691 commit->util = NULL;
694 free_patch_ids(&ids);
697 /* How many extra uninteresting commits we want to see.. */
698 #define SLOP 5
700 static int still_interesting(struct commit_list *src, unsigned long date, int slop)
703 * No source list at all? We're definitely done..
705 if (!src)
706 return 0;
709 * Does the destination list contain entries with a date
710 * before the source list? Definitely _not_ done.
712 if (date < src->item->date)
713 return SLOP;
716 * Does the source list still have interesting commits in
717 * it? Definitely not done..
719 if (!everybody_uninteresting(src))
720 return SLOP;
722 /* Ok, we're closing in.. */
723 return slop-1;
727 * "rev-list --ancestry-path A..B" computes commits that are ancestors
728 * of B but not ancestors of A but further limits the result to those
729 * that are descendants of A. This takes the list of bottom commits and
730 * the result of "A..B" without --ancestry-path, and limits the latter
731 * further to the ones that can reach one of the commits in "bottom".
733 static void limit_to_ancestry(struct commit_list *bottom, struct commit_list *list)
735 struct commit_list *p;
736 struct commit_list *rlist = NULL;
737 int made_progress;
740 * Reverse the list so that it will be likely that we would
741 * process parents before children.
743 for (p = list; p; p = p->next)
744 commit_list_insert(p->item, &rlist);
746 for (p = bottom; p; p = p->next)
747 p->item->object.flags |= TMP_MARK;
750 * Mark the ones that can reach bottom commits in "list",
751 * in a bottom-up fashion.
753 do {
754 made_progress = 0;
755 for (p = rlist; p; p = p->next) {
756 struct commit *c = p->item;
757 struct commit_list *parents;
758 if (c->object.flags & (TMP_MARK | UNINTERESTING))
759 continue;
760 for (parents = c->parents;
761 parents;
762 parents = parents->next) {
763 if (!(parents->item->object.flags & TMP_MARK))
764 continue;
765 c->object.flags |= TMP_MARK;
766 made_progress = 1;
767 break;
770 } while (made_progress);
773 * NEEDSWORK: decide if we want to remove parents that are
774 * not marked with TMP_MARK from commit->parents for commits
775 * in the resulting list. We may not want to do that, though.
779 * The ones that are not marked with TMP_MARK are uninteresting
781 for (p = list; p; p = p->next) {
782 struct commit *c = p->item;
783 if (c->object.flags & TMP_MARK)
784 continue;
785 c->object.flags |= UNINTERESTING;
788 /* We are done with the TMP_MARK */
789 for (p = list; p; p = p->next)
790 p->item->object.flags &= ~TMP_MARK;
791 for (p = bottom; p; p = p->next)
792 p->item->object.flags &= ~TMP_MARK;
793 free_commit_list(rlist);
797 * Before walking the history, keep the set of "negative" refs the
798 * caller has asked to exclude.
800 * This is used to compute "rev-list --ancestry-path A..B", as we need
801 * to filter the result of "A..B" further to the ones that can actually
802 * reach A.
804 static struct commit_list *collect_bottom_commits(struct rev_info *revs)
806 struct commit_list *bottom = NULL;
807 int i;
808 for (i = 0; i < revs->cmdline.nr; i++) {
809 struct rev_cmdline_entry *elem = &revs->cmdline.rev[i];
810 if ((elem->flags & UNINTERESTING) &&
811 elem->item->type == OBJ_COMMIT)
812 commit_list_insert((struct commit *)elem->item, &bottom);
814 return bottom;
817 /* Assumes either left_only or right_only is set */
818 static void limit_left_right(struct commit_list *list, struct rev_info *revs)
820 struct commit_list *p;
822 for (p = list; p; p = p->next) {
823 struct commit *commit = p->item;
825 if (revs->right_only) {
826 if (commit->object.flags & SYMMETRIC_LEFT)
827 commit->object.flags |= SHOWN;
828 } else /* revs->left_only is set */
829 if (!(commit->object.flags & SYMMETRIC_LEFT))
830 commit->object.flags |= SHOWN;
834 static int limit_list(struct rev_info *revs)
836 int slop = SLOP;
837 unsigned long date = ~0ul;
838 struct commit_list *list = revs->commits;
839 struct commit_list *newlist = NULL;
840 struct commit_list **p = &newlist;
841 struct commit_list *bottom = NULL;
843 if (revs->ancestry_path) {
844 bottom = collect_bottom_commits(revs);
845 if (!bottom)
846 die("--ancestry-path given but there are no bottom commits");
849 while (list) {
850 struct commit_list *entry = list;
851 struct commit *commit = list->item;
852 struct object *obj = &commit->object;
853 show_early_output_fn_t show;
855 list = list->next;
856 free(entry);
858 if (revs->max_age != -1 && (commit->date < revs->max_age))
859 obj->flags |= UNINTERESTING;
860 if (add_parents_to_list(revs, commit, &list, NULL) < 0)
861 return -1;
862 if (obj->flags & UNINTERESTING) {
863 mark_parents_uninteresting(commit);
864 if (revs->show_all)
865 p = &commit_list_insert(commit, p)->next;
866 slop = still_interesting(list, date, slop);
867 if (slop)
868 continue;
869 /* If showing all, add the whole pending list to the end */
870 if (revs->show_all)
871 *p = list;
872 break;
874 if (revs->min_age != -1 && (commit->date > revs->min_age))
875 continue;
876 date = commit->date;
877 p = &commit_list_insert(commit, p)->next;
879 show = show_early_output;
880 if (!show)
881 continue;
883 show(revs, newlist);
884 show_early_output = NULL;
886 if (revs->cherry_pick || revs->cherry_mark)
887 cherry_pick_list(newlist, revs);
889 if (revs->left_only || revs->right_only)
890 limit_left_right(newlist, revs);
892 if (bottom) {
893 limit_to_ancestry(bottom, newlist);
894 free_commit_list(bottom);
897 revs->commits = newlist;
898 return 0;
901 static void add_rev_cmdline(struct rev_info *revs,
902 struct object *item,
903 const char *name,
904 int whence,
905 unsigned flags)
907 struct rev_cmdline_info *info = &revs->cmdline;
908 int nr = info->nr;
910 ALLOC_GROW(info->rev, nr + 1, info->alloc);
911 info->rev[nr].item = item;
912 info->rev[nr].name = name;
913 info->rev[nr].whence = whence;
914 info->rev[nr].flags = flags;
915 info->nr++;
918 struct all_refs_cb {
919 int all_flags;
920 int warned_bad_reflog;
921 struct rev_info *all_revs;
922 const char *name_for_errormsg;
925 static int handle_one_ref(const char *path, const unsigned char *sha1, int flag, void *cb_data)
927 struct all_refs_cb *cb = cb_data;
928 struct object *object = get_reference(cb->all_revs, path, sha1,
929 cb->all_flags);
930 add_rev_cmdline(cb->all_revs, object, path, REV_CMD_REF, cb->all_flags);
931 add_pending_sha1(cb->all_revs, path, sha1, cb->all_flags);
932 return 0;
935 static void init_all_refs_cb(struct all_refs_cb *cb, struct rev_info *revs,
936 unsigned flags)
938 cb->all_revs = revs;
939 cb->all_flags = flags;
942 static void handle_refs(const char *submodule, struct rev_info *revs, unsigned flags,
943 int (*for_each)(const char *, each_ref_fn, void *))
945 struct all_refs_cb cb;
946 init_all_refs_cb(&cb, revs, flags);
947 for_each(submodule, handle_one_ref, &cb);
950 static void handle_one_reflog_commit(unsigned char *sha1, void *cb_data)
952 struct all_refs_cb *cb = cb_data;
953 if (!is_null_sha1(sha1)) {
954 struct object *o = parse_object(sha1);
955 if (o) {
956 o->flags |= cb->all_flags;
957 /* ??? CMDLINEFLAGS ??? */
958 add_pending_object(cb->all_revs, o, "");
960 else if (!cb->warned_bad_reflog) {
961 warning("reflog of '%s' references pruned commits",
962 cb->name_for_errormsg);
963 cb->warned_bad_reflog = 1;
968 static int handle_one_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
969 const char *email, unsigned long timestamp, int tz,
970 const char *message, void *cb_data)
972 handle_one_reflog_commit(osha1, cb_data);
973 handle_one_reflog_commit(nsha1, cb_data);
974 return 0;
977 static int handle_one_reflog(const char *path, const unsigned char *sha1, int flag, void *cb_data)
979 struct all_refs_cb *cb = cb_data;
980 cb->warned_bad_reflog = 0;
981 cb->name_for_errormsg = path;
982 for_each_reflog_ent(path, handle_one_reflog_ent, cb_data);
983 return 0;
986 static void handle_reflog(struct rev_info *revs, unsigned flags)
988 struct all_refs_cb cb;
989 cb.all_revs = revs;
990 cb.all_flags = flags;
991 for_each_reflog(handle_one_reflog, &cb);
994 static int add_parents_only(struct rev_info *revs, const char *arg_, int flags)
996 unsigned char sha1[20];
997 struct object *it;
998 struct commit *commit;
999 struct commit_list *parents;
1000 const char *arg = arg_;
1002 if (*arg == '^') {
1003 flags ^= UNINTERESTING;
1004 arg++;
1006 if (get_sha1_committish(arg, sha1))
1007 return 0;
1008 while (1) {
1009 it = get_reference(revs, arg, sha1, 0);
1010 if (!it && revs->ignore_missing)
1011 return 0;
1012 if (it->type != OBJ_TAG)
1013 break;
1014 if (!((struct tag*)it)->tagged)
1015 return 0;
1016 hashcpy(sha1, ((struct tag*)it)->tagged->sha1);
1018 if (it->type != OBJ_COMMIT)
1019 return 0;
1020 commit = (struct commit *)it;
1021 for (parents = commit->parents; parents; parents = parents->next) {
1022 it = &parents->item->object;
1023 it->flags |= flags;
1024 add_rev_cmdline(revs, it, arg_, REV_CMD_PARENTS_ONLY, flags);
1025 add_pending_object(revs, it, arg);
1027 return 1;
1030 void init_revisions(struct rev_info *revs, const char *prefix)
1032 memset(revs, 0, sizeof(*revs));
1034 revs->abbrev = DEFAULT_ABBREV;
1035 revs->ignore_merges = 1;
1036 revs->simplify_history = 1;
1037 DIFF_OPT_SET(&revs->pruning, RECURSIVE);
1038 DIFF_OPT_SET(&revs->pruning, QUICK);
1039 revs->pruning.add_remove = file_add_remove;
1040 revs->pruning.change = file_change;
1041 revs->lifo = 1;
1042 revs->dense = 1;
1043 revs->prefix = prefix;
1044 revs->max_age = -1;
1045 revs->min_age = -1;
1046 revs->skip_count = -1;
1047 revs->max_count = -1;
1048 revs->max_parents = -1;
1050 revs->commit_format = CMIT_FMT_DEFAULT;
1052 revs->grep_filter.status_only = 1;
1053 revs->grep_filter.pattern_tail = &(revs->grep_filter.pattern_list);
1054 revs->grep_filter.header_tail = &(revs->grep_filter.header_list);
1055 revs->grep_filter.regflags = REG_NEWLINE;
1057 diff_setup(&revs->diffopt);
1058 if (prefix && !revs->diffopt.prefix) {
1059 revs->diffopt.prefix = prefix;
1060 revs->diffopt.prefix_length = strlen(prefix);
1063 revs->notes_opt.use_default_notes = -1;
1066 static void add_pending_commit_list(struct rev_info *revs,
1067 struct commit_list *commit_list,
1068 unsigned int flags)
1070 while (commit_list) {
1071 struct object *object = &commit_list->item->object;
1072 object->flags |= flags;
1073 add_pending_object(revs, object, sha1_to_hex(object->sha1));
1074 commit_list = commit_list->next;
1078 static void prepare_show_merge(struct rev_info *revs)
1080 struct commit_list *bases;
1081 struct commit *head, *other;
1082 unsigned char sha1[20];
1083 const char **prune = NULL;
1084 int i, prune_num = 1; /* counting terminating NULL */
1086 if (get_sha1("HEAD", sha1))
1087 die("--merge without HEAD?");
1088 head = lookup_commit_or_die(sha1, "HEAD");
1089 if (get_sha1("MERGE_HEAD", sha1))
1090 die("--merge without MERGE_HEAD?");
1091 other = lookup_commit_or_die(sha1, "MERGE_HEAD");
1092 add_pending_object(revs, &head->object, "HEAD");
1093 add_pending_object(revs, &other->object, "MERGE_HEAD");
1094 bases = get_merge_bases(head, other, 1);
1095 add_pending_commit_list(revs, bases, UNINTERESTING);
1096 free_commit_list(bases);
1097 head->object.flags |= SYMMETRIC_LEFT;
1099 if (!active_nr)
1100 read_cache();
1101 for (i = 0; i < active_nr; i++) {
1102 struct cache_entry *ce = active_cache[i];
1103 if (!ce_stage(ce))
1104 continue;
1105 if (ce_path_match(ce, &revs->prune_data)) {
1106 prune_num++;
1107 prune = xrealloc(prune, sizeof(*prune) * prune_num);
1108 prune[prune_num-2] = ce->name;
1109 prune[prune_num-1] = NULL;
1111 while ((i+1 < active_nr) &&
1112 ce_same_name(ce, active_cache[i+1]))
1113 i++;
1115 free_pathspec(&revs->prune_data);
1116 init_pathspec(&revs->prune_data, prune);
1117 revs->limited = 1;
1120 int handle_revision_arg(const char *arg_, struct rev_info *revs, int flags, unsigned revarg_opt)
1122 struct object_context oc;
1123 char *dotdot;
1124 struct object *object;
1125 unsigned char sha1[20];
1126 int local_flags;
1127 const char *arg = arg_;
1128 int cant_be_filename = revarg_opt & REVARG_CANNOT_BE_FILENAME;
1129 unsigned get_sha1_flags = 0;
1131 dotdot = strstr(arg, "..");
1132 if (dotdot) {
1133 unsigned char from_sha1[20];
1134 const char *next = dotdot + 2;
1135 const char *this = arg;
1136 int symmetric = *next == '.';
1137 unsigned int flags_exclude = flags ^ UNINTERESTING;
1138 static const char head_by_default[] = "HEAD";
1139 unsigned int a_flags;
1141 *dotdot = 0;
1142 next += symmetric;
1144 if (!*next)
1145 next = head_by_default;
1146 if (dotdot == arg)
1147 this = head_by_default;
1148 if (this == head_by_default && next == head_by_default &&
1149 !symmetric) {
1151 * Just ".."? That is not a range but the
1152 * pathspec for the parent directory.
1154 if (!cant_be_filename) {
1155 *dotdot = '.';
1156 return -1;
1159 if (!get_sha1_committish(this, from_sha1) &&
1160 !get_sha1_committish(next, sha1)) {
1161 struct commit *a, *b;
1162 struct commit_list *exclude;
1164 a = lookup_commit_reference(from_sha1);
1165 b = lookup_commit_reference(sha1);
1166 if (!a || !b) {
1167 if (revs->ignore_missing)
1168 return 0;
1169 die(symmetric ?
1170 "Invalid symmetric difference expression %s...%s" :
1171 "Invalid revision range %s..%s",
1172 arg, next);
1175 if (!cant_be_filename) {
1176 *dotdot = '.';
1177 verify_non_filename(revs->prefix, arg);
1180 if (symmetric) {
1181 exclude = get_merge_bases(a, b, 1);
1182 add_pending_commit_list(revs, exclude,
1183 flags_exclude);
1184 free_commit_list(exclude);
1185 a_flags = flags | SYMMETRIC_LEFT;
1186 } else
1187 a_flags = flags_exclude;
1188 a->object.flags |= a_flags;
1189 b->object.flags |= flags;
1190 add_rev_cmdline(revs, &a->object, this,
1191 REV_CMD_LEFT, a_flags);
1192 add_rev_cmdline(revs, &b->object, next,
1193 REV_CMD_RIGHT, flags);
1194 add_pending_object_with_mode(revs, &a->object, this,
1195 S_IFINVALID, flags_exclude);
1196 add_pending_object(revs, &b->object, next);
1197 return 0;
1199 *dotdot = '.';
1201 dotdot = strstr(arg, "^@");
1202 if (dotdot && !dotdot[2]) {
1203 *dotdot = 0;
1204 if (add_parents_only(revs, arg, flags))
1205 return 0;
1206 *dotdot = '^';
1208 dotdot = strstr(arg, "^!");
1209 if (dotdot && !dotdot[2]) {
1210 *dotdot = 0;
1211 if (!add_parents_only(revs, arg, flags ^ UNINTERESTING))
1212 *dotdot = '^';
1215 local_flags = 0;
1216 if (*arg == '^') {
1217 local_flags = UNINTERESTING;
1218 arg++;
1221 if (revarg_opt & REVARG_COMMITTISH)
1222 get_sha1_flags = GET_SHA1_COMMITTISH;
1224 if (get_sha1_with_context(arg, get_sha1_flags, sha1, &oc))
1225 return revs->ignore_missing ? 0 : -1;
1226 if (!cant_be_filename)
1227 verify_non_filename(revs->prefix, arg);
1228 object = get_reference(revs, arg, sha1, flags ^ local_flags);
1229 add_rev_cmdline(revs, object, arg_, REV_CMD_REV, flags ^ local_flags);
1230 add_pending_object_with_mode(revs, object, arg, oc.mode, local_flags);
1231 return 0;
1234 struct cmdline_pathspec {
1235 int alloc;
1236 int nr;
1237 const char **path;
1240 static void append_prune_data(struct cmdline_pathspec *prune, const char **av)
1242 while (*av) {
1243 ALLOC_GROW(prune->path, prune->nr+1, prune->alloc);
1244 prune->path[prune->nr++] = *(av++);
1248 static void read_pathspec_from_stdin(struct rev_info *revs, struct strbuf *sb,
1249 struct cmdline_pathspec *prune)
1251 while (strbuf_getwholeline(sb, stdin, '\n') != EOF) {
1252 int len = sb->len;
1253 if (len && sb->buf[len - 1] == '\n')
1254 sb->buf[--len] = '\0';
1255 ALLOC_GROW(prune->path, prune->nr+1, prune->alloc);
1256 prune->path[prune->nr++] = xstrdup(sb->buf);
1260 static void read_revisions_from_stdin(struct rev_info *revs,
1261 struct cmdline_pathspec *prune)
1263 struct strbuf sb;
1264 int seen_dashdash = 0;
1266 strbuf_init(&sb, 1000);
1267 while (strbuf_getwholeline(&sb, stdin, '\n') != EOF) {
1268 int len = sb.len;
1269 if (len && sb.buf[len - 1] == '\n')
1270 sb.buf[--len] = '\0';
1271 if (!len)
1272 break;
1273 if (sb.buf[0] == '-') {
1274 if (len == 2 && sb.buf[1] == '-') {
1275 seen_dashdash = 1;
1276 break;
1278 die("options not supported in --stdin mode");
1280 if (handle_revision_arg(sb.buf, revs, 0, REVARG_CANNOT_BE_FILENAME))
1281 die("bad revision '%s'", sb.buf);
1283 if (seen_dashdash)
1284 read_pathspec_from_stdin(revs, &sb, prune);
1285 strbuf_release(&sb);
1288 static void add_grep(struct rev_info *revs, const char *ptn, enum grep_pat_token what)
1290 append_grep_pattern(&revs->grep_filter, ptn, "command line", 0, what);
1293 static void add_header_grep(struct rev_info *revs, enum grep_header_field field, const char *pattern)
1295 append_header_grep_pattern(&revs->grep_filter, field, pattern);
1298 static void add_message_grep(struct rev_info *revs, const char *pattern)
1300 add_grep(revs, pattern, GREP_PATTERN_BODY);
1303 static int handle_revision_opt(struct rev_info *revs, int argc, const char **argv,
1304 int *unkc, const char **unkv)
1306 const char *arg = argv[0];
1307 const char *optarg;
1308 int argcount;
1310 /* pseudo revision arguments */
1311 if (!strcmp(arg, "--all") || !strcmp(arg, "--branches") ||
1312 !strcmp(arg, "--tags") || !strcmp(arg, "--remotes") ||
1313 !strcmp(arg, "--reflog") || !strcmp(arg, "--not") ||
1314 !strcmp(arg, "--no-walk") || !strcmp(arg, "--do-walk") ||
1315 !strcmp(arg, "--bisect") || !prefixcmp(arg, "--glob=") ||
1316 !prefixcmp(arg, "--branches=") || !prefixcmp(arg, "--tags=") ||
1317 !prefixcmp(arg, "--remotes=") || !prefixcmp(arg, "--no-walk="))
1319 unkv[(*unkc)++] = arg;
1320 return 1;
1323 if ((argcount = parse_long_opt("max-count", argv, &optarg))) {
1324 revs->max_count = atoi(optarg);
1325 revs->no_walk = 0;
1326 return argcount;
1327 } else if ((argcount = parse_long_opt("skip", argv, &optarg))) {
1328 revs->skip_count = atoi(optarg);
1329 return argcount;
1330 } else if ((*arg == '-') && isdigit(arg[1])) {
1331 /* accept -<digit>, like traditional "head" */
1332 revs->max_count = atoi(arg + 1);
1333 revs->no_walk = 0;
1334 } else if (!strcmp(arg, "-n")) {
1335 if (argc <= 1)
1336 return error("-n requires an argument");
1337 revs->max_count = atoi(argv[1]);
1338 revs->no_walk = 0;
1339 return 2;
1340 } else if (!prefixcmp(arg, "-n")) {
1341 revs->max_count = atoi(arg + 2);
1342 revs->no_walk = 0;
1343 } else if ((argcount = parse_long_opt("max-age", argv, &optarg))) {
1344 revs->max_age = atoi(optarg);
1345 return argcount;
1346 } else if ((argcount = parse_long_opt("since", argv, &optarg))) {
1347 revs->max_age = approxidate(optarg);
1348 return argcount;
1349 } else if ((argcount = parse_long_opt("after", argv, &optarg))) {
1350 revs->max_age = approxidate(optarg);
1351 return argcount;
1352 } else if ((argcount = parse_long_opt("min-age", argv, &optarg))) {
1353 revs->min_age = atoi(optarg);
1354 return argcount;
1355 } else if ((argcount = parse_long_opt("before", argv, &optarg))) {
1356 revs->min_age = approxidate(optarg);
1357 return argcount;
1358 } else if ((argcount = parse_long_opt("until", argv, &optarg))) {
1359 revs->min_age = approxidate(optarg);
1360 return argcount;
1361 } else if (!strcmp(arg, "--first-parent")) {
1362 revs->first_parent_only = 1;
1363 } else if (!strcmp(arg, "--ancestry-path")) {
1364 revs->ancestry_path = 1;
1365 revs->simplify_history = 0;
1366 revs->limited = 1;
1367 } else if (!strcmp(arg, "-g") || !strcmp(arg, "--walk-reflogs")) {
1368 init_reflog_walk(&revs->reflog_info);
1369 } else if (!strcmp(arg, "--default")) {
1370 if (argc <= 1)
1371 return error("bad --default argument");
1372 revs->def = argv[1];
1373 return 2;
1374 } else if (!strcmp(arg, "--merge")) {
1375 revs->show_merge = 1;
1376 } else if (!strcmp(arg, "--topo-order")) {
1377 revs->lifo = 1;
1378 revs->topo_order = 1;
1379 } else if (!strcmp(arg, "--simplify-merges")) {
1380 revs->simplify_merges = 1;
1381 revs->topo_order = 1;
1382 revs->rewrite_parents = 1;
1383 revs->simplify_history = 0;
1384 revs->limited = 1;
1385 } else if (!strcmp(arg, "--simplify-by-decoration")) {
1386 revs->simplify_merges = 1;
1387 revs->topo_order = 1;
1388 revs->rewrite_parents = 1;
1389 revs->simplify_history = 0;
1390 revs->simplify_by_decoration = 1;
1391 revs->limited = 1;
1392 revs->prune = 1;
1393 load_ref_decorations(DECORATE_SHORT_REFS);
1394 } else if (!strcmp(arg, "--date-order")) {
1395 revs->lifo = 0;
1396 revs->topo_order = 1;
1397 } else if (!prefixcmp(arg, "--early-output")) {
1398 int count = 100;
1399 switch (arg[14]) {
1400 case '=':
1401 count = atoi(arg+15);
1402 /* Fallthrough */
1403 case 0:
1404 revs->topo_order = 1;
1405 revs->early_output = count;
1407 } else if (!strcmp(arg, "--parents")) {
1408 revs->rewrite_parents = 1;
1409 revs->print_parents = 1;
1410 } else if (!strcmp(arg, "--dense")) {
1411 revs->dense = 1;
1412 } else if (!strcmp(arg, "--sparse")) {
1413 revs->dense = 0;
1414 } else if (!strcmp(arg, "--show-all")) {
1415 revs->show_all = 1;
1416 } else if (!strcmp(arg, "--remove-empty")) {
1417 revs->remove_empty_trees = 1;
1418 } else if (!strcmp(arg, "--merges")) {
1419 revs->min_parents = 2;
1420 } else if (!strcmp(arg, "--no-merges")) {
1421 revs->max_parents = 1;
1422 } else if (!prefixcmp(arg, "--min-parents=")) {
1423 revs->min_parents = atoi(arg+14);
1424 } else if (!prefixcmp(arg, "--no-min-parents")) {
1425 revs->min_parents = 0;
1426 } else if (!prefixcmp(arg, "--max-parents=")) {
1427 revs->max_parents = atoi(arg+14);
1428 } else if (!prefixcmp(arg, "--no-max-parents")) {
1429 revs->max_parents = -1;
1430 } else if (!strcmp(arg, "--boundary")) {
1431 revs->boundary = 1;
1432 } else if (!strcmp(arg, "--left-right")) {
1433 revs->left_right = 1;
1434 } else if (!strcmp(arg, "--left-only")) {
1435 if (revs->right_only)
1436 die("--left-only is incompatible with --right-only"
1437 " or --cherry");
1438 revs->left_only = 1;
1439 } else if (!strcmp(arg, "--right-only")) {
1440 if (revs->left_only)
1441 die("--right-only is incompatible with --left-only");
1442 revs->right_only = 1;
1443 } else if (!strcmp(arg, "--cherry")) {
1444 if (revs->left_only)
1445 die("--cherry is incompatible with --left-only");
1446 revs->cherry_mark = 1;
1447 revs->right_only = 1;
1448 revs->max_parents = 1;
1449 revs->limited = 1;
1450 } else if (!strcmp(arg, "--count")) {
1451 revs->count = 1;
1452 } else if (!strcmp(arg, "--cherry-mark")) {
1453 if (revs->cherry_pick)
1454 die("--cherry-mark is incompatible with --cherry-pick");
1455 revs->cherry_mark = 1;
1456 revs->limited = 1; /* needs limit_list() */
1457 } else if (!strcmp(arg, "--cherry-pick")) {
1458 if (revs->cherry_mark)
1459 die("--cherry-pick is incompatible with --cherry-mark");
1460 revs->cherry_pick = 1;
1461 revs->limited = 1;
1462 } else if (!strcmp(arg, "--objects")) {
1463 revs->tag_objects = 1;
1464 revs->tree_objects = 1;
1465 revs->blob_objects = 1;
1466 } else if (!strcmp(arg, "--objects-edge")) {
1467 revs->tag_objects = 1;
1468 revs->tree_objects = 1;
1469 revs->blob_objects = 1;
1470 revs->edge_hint = 1;
1471 } else if (!strcmp(arg, "--verify-objects")) {
1472 revs->tag_objects = 1;
1473 revs->tree_objects = 1;
1474 revs->blob_objects = 1;
1475 revs->verify_objects = 1;
1476 } else if (!strcmp(arg, "--unpacked")) {
1477 revs->unpacked = 1;
1478 } else if (!prefixcmp(arg, "--unpacked=")) {
1479 die("--unpacked=<packfile> no longer supported.");
1480 } else if (!strcmp(arg, "-r")) {
1481 revs->diff = 1;
1482 DIFF_OPT_SET(&revs->diffopt, RECURSIVE);
1483 } else if (!strcmp(arg, "-t")) {
1484 revs->diff = 1;
1485 DIFF_OPT_SET(&revs->diffopt, RECURSIVE);
1486 DIFF_OPT_SET(&revs->diffopt, TREE_IN_RECURSIVE);
1487 } else if (!strcmp(arg, "-m")) {
1488 revs->ignore_merges = 0;
1489 } else if (!strcmp(arg, "-c")) {
1490 revs->diff = 1;
1491 revs->dense_combined_merges = 0;
1492 revs->combine_merges = 1;
1493 } else if (!strcmp(arg, "--cc")) {
1494 revs->diff = 1;
1495 revs->dense_combined_merges = 1;
1496 revs->combine_merges = 1;
1497 } else if (!strcmp(arg, "-v")) {
1498 revs->verbose_header = 1;
1499 } else if (!strcmp(arg, "--pretty")) {
1500 revs->verbose_header = 1;
1501 revs->pretty_given = 1;
1502 get_commit_format(arg+8, revs);
1503 } else if (!prefixcmp(arg, "--pretty=") || !prefixcmp(arg, "--format=")) {
1505 * Detached form ("--pretty X" as opposed to "--pretty=X")
1506 * not allowed, since the argument is optional.
1508 revs->verbose_header = 1;
1509 revs->pretty_given = 1;
1510 get_commit_format(arg+9, revs);
1511 } else if (!strcmp(arg, "--show-notes") || !strcmp(arg, "--notes")) {
1512 revs->show_notes = 1;
1513 revs->show_notes_given = 1;
1514 revs->notes_opt.use_default_notes = 1;
1515 } else if (!strcmp(arg, "--show-signature")) {
1516 revs->show_signature = 1;
1517 } else if (!prefixcmp(arg, "--show-notes=") ||
1518 !prefixcmp(arg, "--notes=")) {
1519 struct strbuf buf = STRBUF_INIT;
1520 revs->show_notes = 1;
1521 revs->show_notes_given = 1;
1522 if (!prefixcmp(arg, "--show-notes")) {
1523 if (revs->notes_opt.use_default_notes < 0)
1524 revs->notes_opt.use_default_notes = 1;
1525 strbuf_addstr(&buf, arg+13);
1527 else
1528 strbuf_addstr(&buf, arg+8);
1529 expand_notes_ref(&buf);
1530 string_list_append(&revs->notes_opt.extra_notes_refs,
1531 strbuf_detach(&buf, NULL));
1532 } else if (!strcmp(arg, "--no-notes")) {
1533 revs->show_notes = 0;
1534 revs->show_notes_given = 1;
1535 revs->notes_opt.use_default_notes = -1;
1536 /* we have been strdup'ing ourselves, so trick
1537 * string_list into free()ing strings */
1538 revs->notes_opt.extra_notes_refs.strdup_strings = 1;
1539 string_list_clear(&revs->notes_opt.extra_notes_refs, 0);
1540 revs->notes_opt.extra_notes_refs.strdup_strings = 0;
1541 } else if (!strcmp(arg, "--standard-notes")) {
1542 revs->show_notes_given = 1;
1543 revs->notes_opt.use_default_notes = 1;
1544 } else if (!strcmp(arg, "--no-standard-notes")) {
1545 revs->notes_opt.use_default_notes = 0;
1546 } else if (!strcmp(arg, "--oneline")) {
1547 revs->verbose_header = 1;
1548 get_commit_format("oneline", revs);
1549 revs->pretty_given = 1;
1550 revs->abbrev_commit = 1;
1551 } else if (!strcmp(arg, "--graph")) {
1552 revs->topo_order = 1;
1553 revs->rewrite_parents = 1;
1554 revs->graph = graph_init(revs);
1555 } else if (!strcmp(arg, "--root")) {
1556 revs->show_root_diff = 1;
1557 } else if (!strcmp(arg, "--no-commit-id")) {
1558 revs->no_commit_id = 1;
1559 } else if (!strcmp(arg, "--always")) {
1560 revs->always_show_header = 1;
1561 } else if (!strcmp(arg, "--no-abbrev")) {
1562 revs->abbrev = 0;
1563 } else if (!strcmp(arg, "--abbrev")) {
1564 revs->abbrev = DEFAULT_ABBREV;
1565 } else if (!prefixcmp(arg, "--abbrev=")) {
1566 revs->abbrev = strtoul(arg + 9, NULL, 10);
1567 if (revs->abbrev < MINIMUM_ABBREV)
1568 revs->abbrev = MINIMUM_ABBREV;
1569 else if (revs->abbrev > 40)
1570 revs->abbrev = 40;
1571 } else if (!strcmp(arg, "--abbrev-commit")) {
1572 revs->abbrev_commit = 1;
1573 revs->abbrev_commit_given = 1;
1574 } else if (!strcmp(arg, "--no-abbrev-commit")) {
1575 revs->abbrev_commit = 0;
1576 } else if (!strcmp(arg, "--full-diff")) {
1577 revs->diff = 1;
1578 revs->full_diff = 1;
1579 } else if (!strcmp(arg, "--full-history")) {
1580 revs->simplify_history = 0;
1581 } else if (!strcmp(arg, "--relative-date")) {
1582 revs->date_mode = DATE_RELATIVE;
1583 revs->date_mode_explicit = 1;
1584 } else if ((argcount = parse_long_opt("date", argv, &optarg))) {
1585 revs->date_mode = parse_date_format(optarg);
1586 revs->date_mode_explicit = 1;
1587 return argcount;
1588 } else if (!strcmp(arg, "--log-size")) {
1589 revs->show_log_size = 1;
1592 * Grepping the commit log
1594 else if ((argcount = parse_long_opt("author", argv, &optarg))) {
1595 add_header_grep(revs, GREP_HEADER_AUTHOR, optarg);
1596 return argcount;
1597 } else if ((argcount = parse_long_opt("committer", argv, &optarg))) {
1598 add_header_grep(revs, GREP_HEADER_COMMITTER, optarg);
1599 return argcount;
1600 } else if ((argcount = parse_long_opt("grep-reflog", argv, &optarg))) {
1601 add_header_grep(revs, GREP_HEADER_REFLOG, optarg);
1602 return argcount;
1603 } else if ((argcount = parse_long_opt("grep", argv, &optarg))) {
1604 add_message_grep(revs, optarg);
1605 return argcount;
1606 } else if (!strcmp(arg, "--grep-debug")) {
1607 revs->grep_filter.debug = 1;
1608 } else if (!strcmp(arg, "--extended-regexp") || !strcmp(arg, "-E")) {
1609 revs->grep_filter.regflags |= REG_EXTENDED;
1610 } else if (!strcmp(arg, "--regexp-ignore-case") || !strcmp(arg, "-i")) {
1611 revs->grep_filter.regflags |= REG_ICASE;
1612 DIFF_OPT_SET(&revs->diffopt, PICKAXE_IGNORE_CASE);
1613 } else if (!strcmp(arg, "--fixed-strings") || !strcmp(arg, "-F")) {
1614 revs->grep_filter.fixed = 1;
1615 } else if (!strcmp(arg, "--all-match")) {
1616 revs->grep_filter.all_match = 1;
1617 } else if ((argcount = parse_long_opt("encoding", argv, &optarg))) {
1618 if (strcmp(optarg, "none"))
1619 git_log_output_encoding = xstrdup(optarg);
1620 else
1621 git_log_output_encoding = "";
1622 return argcount;
1623 } else if (!strcmp(arg, "--reverse")) {
1624 revs->reverse ^= 1;
1625 } else if (!strcmp(arg, "--children")) {
1626 revs->children.name = "children";
1627 revs->limited = 1;
1628 } else if (!strcmp(arg, "--ignore-missing")) {
1629 revs->ignore_missing = 1;
1630 } else {
1631 int opts = diff_opt_parse(&revs->diffopt, argv, argc);
1632 if (!opts)
1633 unkv[(*unkc)++] = arg;
1634 return opts;
1637 return 1;
1640 void parse_revision_opt(struct rev_info *revs, struct parse_opt_ctx_t *ctx,
1641 const struct option *options,
1642 const char * const usagestr[])
1644 int n = handle_revision_opt(revs, ctx->argc, ctx->argv,
1645 &ctx->cpidx, ctx->out);
1646 if (n <= 0) {
1647 error("unknown option `%s'", ctx->argv[0]);
1648 usage_with_options(usagestr, options);
1650 ctx->argv += n;
1651 ctx->argc -= n;
1654 static int for_each_bad_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1656 return for_each_ref_in_submodule(submodule, "refs/bisect/bad", fn, cb_data);
1659 static int for_each_good_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1661 return for_each_ref_in_submodule(submodule, "refs/bisect/good", fn, cb_data);
1664 static int handle_revision_pseudo_opt(const char *submodule,
1665 struct rev_info *revs,
1666 int argc, const char **argv, int *flags)
1668 const char *arg = argv[0];
1669 const char *optarg;
1670 int argcount;
1673 * NOTE!
1675 * Commands like "git shortlog" will not accept the options below
1676 * unless parse_revision_opt queues them (as opposed to erroring
1677 * out).
1679 * When implementing your new pseudo-option, remember to
1680 * register it in the list at the top of handle_revision_opt.
1682 if (!strcmp(arg, "--all")) {
1683 handle_refs(submodule, revs, *flags, for_each_ref_submodule);
1684 handle_refs(submodule, revs, *flags, head_ref_submodule);
1685 } else if (!strcmp(arg, "--branches")) {
1686 handle_refs(submodule, revs, *flags, for_each_branch_ref_submodule);
1687 } else if (!strcmp(arg, "--bisect")) {
1688 handle_refs(submodule, revs, *flags, for_each_bad_bisect_ref);
1689 handle_refs(submodule, revs, *flags ^ UNINTERESTING, for_each_good_bisect_ref);
1690 revs->bisect = 1;
1691 } else if (!strcmp(arg, "--tags")) {
1692 handle_refs(submodule, revs, *flags, for_each_tag_ref_submodule);
1693 } else if (!strcmp(arg, "--remotes")) {
1694 handle_refs(submodule, revs, *flags, for_each_remote_ref_submodule);
1695 } else if ((argcount = parse_long_opt("glob", argv, &optarg))) {
1696 struct all_refs_cb cb;
1697 init_all_refs_cb(&cb, revs, *flags);
1698 for_each_glob_ref(handle_one_ref, optarg, &cb);
1699 return argcount;
1700 } else if (!prefixcmp(arg, "--branches=")) {
1701 struct all_refs_cb cb;
1702 init_all_refs_cb(&cb, revs, *flags);
1703 for_each_glob_ref_in(handle_one_ref, arg + 11, "refs/heads/", &cb);
1704 } else if (!prefixcmp(arg, "--tags=")) {
1705 struct all_refs_cb cb;
1706 init_all_refs_cb(&cb, revs, *flags);
1707 for_each_glob_ref_in(handle_one_ref, arg + 7, "refs/tags/", &cb);
1708 } else if (!prefixcmp(arg, "--remotes=")) {
1709 struct all_refs_cb cb;
1710 init_all_refs_cb(&cb, revs, *flags);
1711 for_each_glob_ref_in(handle_one_ref, arg + 10, "refs/remotes/", &cb);
1712 } else if (!strcmp(arg, "--reflog")) {
1713 handle_reflog(revs, *flags);
1714 } else if (!strcmp(arg, "--not")) {
1715 *flags ^= UNINTERESTING;
1716 } else if (!strcmp(arg, "--no-walk")) {
1717 revs->no_walk = REVISION_WALK_NO_WALK_SORTED;
1718 } else if (!prefixcmp(arg, "--no-walk=")) {
1720 * Detached form ("--no-walk X" as opposed to "--no-walk=X")
1721 * not allowed, since the argument is optional.
1723 if (!strcmp(arg + 10, "sorted"))
1724 revs->no_walk = REVISION_WALK_NO_WALK_SORTED;
1725 else if (!strcmp(arg + 10, "unsorted"))
1726 revs->no_walk = REVISION_WALK_NO_WALK_UNSORTED;
1727 else
1728 return error("invalid argument to --no-walk");
1729 } else if (!strcmp(arg, "--do-walk")) {
1730 revs->no_walk = 0;
1731 } else {
1732 return 0;
1735 return 1;
1739 * Parse revision information, filling in the "rev_info" structure,
1740 * and removing the used arguments from the argument list.
1742 * Returns the number of arguments left that weren't recognized
1743 * (which are also moved to the head of the argument list)
1745 int setup_revisions(int argc, const char **argv, struct rev_info *revs, struct setup_revision_opt *opt)
1747 int i, flags, left, seen_dashdash, read_from_stdin, got_rev_arg = 0, revarg_opt;
1748 struct cmdline_pathspec prune_data;
1749 const char *submodule = NULL;
1751 memset(&prune_data, 0, sizeof(prune_data));
1752 if (opt)
1753 submodule = opt->submodule;
1755 /* First, search for "--" */
1756 if (opt && opt->assume_dashdash) {
1757 seen_dashdash = 1;
1758 } else {
1759 seen_dashdash = 0;
1760 for (i = 1; i < argc; i++) {
1761 const char *arg = argv[i];
1762 if (strcmp(arg, "--"))
1763 continue;
1764 argv[i] = NULL;
1765 argc = i;
1766 if (argv[i + 1])
1767 append_prune_data(&prune_data, argv + i + 1);
1768 seen_dashdash = 1;
1769 break;
1773 /* Second, deal with arguments and options */
1774 flags = 0;
1775 revarg_opt = opt ? opt->revarg_opt : 0;
1776 if (seen_dashdash)
1777 revarg_opt |= REVARG_CANNOT_BE_FILENAME;
1778 read_from_stdin = 0;
1779 for (left = i = 1; i < argc; i++) {
1780 const char *arg = argv[i];
1781 if (*arg == '-') {
1782 int opts;
1784 opts = handle_revision_pseudo_opt(submodule,
1785 revs, argc - i, argv + i,
1786 &flags);
1787 if (opts > 0) {
1788 i += opts - 1;
1789 continue;
1792 if (!strcmp(arg, "--stdin")) {
1793 if (revs->disable_stdin) {
1794 argv[left++] = arg;
1795 continue;
1797 if (read_from_stdin++)
1798 die("--stdin given twice?");
1799 read_revisions_from_stdin(revs, &prune_data);
1800 continue;
1803 opts = handle_revision_opt(revs, argc - i, argv + i, &left, argv);
1804 if (opts > 0) {
1805 i += opts - 1;
1806 continue;
1808 if (opts < 0)
1809 exit(128);
1810 continue;
1814 if (handle_revision_arg(arg, revs, flags, revarg_opt)) {
1815 int j;
1816 if (seen_dashdash || *arg == '^')
1817 die("bad revision '%s'", arg);
1819 /* If we didn't have a "--":
1820 * (1) all filenames must exist;
1821 * (2) all rev-args must not be interpretable
1822 * as a valid filename.
1823 * but the latter we have checked in the main loop.
1825 for (j = i; j < argc; j++)
1826 verify_filename(revs->prefix, argv[j], j == i);
1828 append_prune_data(&prune_data, argv + i);
1829 break;
1831 else
1832 got_rev_arg = 1;
1835 if (prune_data.nr) {
1837 * If we need to introduce the magic "a lone ':' means no
1838 * pathspec whatsoever", here is the place to do so.
1840 * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) {
1841 * prune_data.nr = 0;
1842 * prune_data.alloc = 0;
1843 * free(prune_data.path);
1844 * prune_data.path = NULL;
1845 * } else {
1846 * terminate prune_data.alloc with NULL and
1847 * call init_pathspec() to set revs->prune_data here.
1850 ALLOC_GROW(prune_data.path, prune_data.nr+1, prune_data.alloc);
1851 prune_data.path[prune_data.nr++] = NULL;
1852 init_pathspec(&revs->prune_data,
1853 get_pathspec(revs->prefix, prune_data.path));
1856 if (revs->def == NULL)
1857 revs->def = opt ? opt->def : NULL;
1858 if (opt && opt->tweak)
1859 opt->tweak(revs, opt);
1860 if (revs->show_merge)
1861 prepare_show_merge(revs);
1862 if (revs->def && !revs->pending.nr && !got_rev_arg) {
1863 unsigned char sha1[20];
1864 struct object *object;
1865 struct object_context oc;
1866 if (get_sha1_with_context(revs->def, 0, sha1, &oc))
1867 die("bad default revision '%s'", revs->def);
1868 object = get_reference(revs, revs->def, sha1, 0);
1869 add_pending_object_with_mode(revs, object, revs->def, oc.mode, 0);
1872 /* Did the user ask for any diff output? Run the diff! */
1873 if (revs->diffopt.output_format & ~DIFF_FORMAT_NO_OUTPUT)
1874 revs->diff = 1;
1876 /* Pickaxe, diff-filter and rename following need diffs */
1877 if (revs->diffopt.pickaxe ||
1878 revs->diffopt.filter ||
1879 DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES))
1880 revs->diff = 1;
1882 if (revs->topo_order)
1883 revs->limited = 1;
1885 if (revs->prune_data.nr) {
1886 diff_tree_setup_paths(revs->prune_data.raw, &revs->pruning);
1887 /* Can't prune commits with rename following: the paths change.. */
1888 if (!DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES))
1889 revs->prune = 1;
1890 if (!revs->full_diff)
1891 diff_tree_setup_paths(revs->prune_data.raw, &revs->diffopt);
1893 if (revs->combine_merges)
1894 revs->ignore_merges = 0;
1895 revs->diffopt.abbrev = revs->abbrev;
1896 diff_setup_done(&revs->diffopt);
1898 compile_grep_patterns(&revs->grep_filter);
1900 if (revs->reverse && revs->reflog_info)
1901 die("cannot combine --reverse with --walk-reflogs");
1902 if (revs->rewrite_parents && revs->children.name)
1903 die("cannot combine --parents and --children");
1906 * Limitations on the graph functionality
1908 if (revs->reverse && revs->graph)
1909 die("cannot combine --reverse with --graph");
1911 if (revs->reflog_info && revs->graph)
1912 die("cannot combine --walk-reflogs with --graph");
1913 if (!revs->reflog_info && revs->grep_filter.use_reflog_filter)
1914 die("cannot use --grep-reflog without --walk-reflogs");
1916 return left;
1919 static void add_child(struct rev_info *revs, struct commit *parent, struct commit *child)
1921 struct commit_list *l = xcalloc(1, sizeof(*l));
1923 l->item = child;
1924 l->next = add_decoration(&revs->children, &parent->object, l);
1927 static int remove_duplicate_parents(struct commit *commit)
1929 struct commit_list **pp, *p;
1930 int surviving_parents;
1932 /* Examine existing parents while marking ones we have seen... */
1933 pp = &commit->parents;
1934 while ((p = *pp) != NULL) {
1935 struct commit *parent = p->item;
1936 if (parent->object.flags & TMP_MARK) {
1937 *pp = p->next;
1938 continue;
1940 parent->object.flags |= TMP_MARK;
1941 pp = &p->next;
1943 /* count them while clearing the temporary mark */
1944 surviving_parents = 0;
1945 for (p = commit->parents; p; p = p->next) {
1946 p->item->object.flags &= ~TMP_MARK;
1947 surviving_parents++;
1949 return surviving_parents;
1952 struct merge_simplify_state {
1953 struct commit *simplified;
1956 static struct merge_simplify_state *locate_simplify_state(struct rev_info *revs, struct commit *commit)
1958 struct merge_simplify_state *st;
1960 st = lookup_decoration(&revs->merge_simplification, &commit->object);
1961 if (!st) {
1962 st = xcalloc(1, sizeof(*st));
1963 add_decoration(&revs->merge_simplification, &commit->object, st);
1965 return st;
1968 static struct commit_list **simplify_one(struct rev_info *revs, struct commit *commit, struct commit_list **tail)
1970 struct commit_list *p;
1971 struct merge_simplify_state *st, *pst;
1972 int cnt;
1974 st = locate_simplify_state(revs, commit);
1977 * Have we handled this one?
1979 if (st->simplified)
1980 return tail;
1983 * An UNINTERESTING commit simplifies to itself, so does a
1984 * root commit. We do not rewrite parents of such commit
1985 * anyway.
1987 if ((commit->object.flags & UNINTERESTING) || !commit->parents) {
1988 st->simplified = commit;
1989 return tail;
1993 * Do we know what commit all of our parents that matter
1994 * should be rewritten to? Otherwise we are not ready to
1995 * rewrite this one yet.
1997 for (cnt = 0, p = commit->parents; p; p = p->next) {
1998 pst = locate_simplify_state(revs, p->item);
1999 if (!pst->simplified) {
2000 tail = &commit_list_insert(p->item, tail)->next;
2001 cnt++;
2003 if (revs->first_parent_only)
2004 break;
2006 if (cnt) {
2007 tail = &commit_list_insert(commit, tail)->next;
2008 return tail;
2012 * Rewrite our list of parents.
2014 for (p = commit->parents; p; p = p->next) {
2015 pst = locate_simplify_state(revs, p->item);
2016 p->item = pst->simplified;
2017 if (revs->first_parent_only)
2018 break;
2020 if (!revs->first_parent_only)
2021 cnt = remove_duplicate_parents(commit);
2022 else
2023 cnt = 1;
2026 * It is possible that we are a merge and one side branch
2027 * does not have any commit that touches the given paths;
2028 * in such a case, the immediate parents will be rewritten
2029 * to different commits.
2031 * o----X X: the commit we are looking at;
2032 * / / o: a commit that touches the paths;
2033 * ---o----'
2035 * Further reduce the parents by removing redundant parents.
2037 if (1 < cnt) {
2038 struct commit_list *h = reduce_heads(commit->parents);
2039 cnt = commit_list_count(h);
2040 free_commit_list(commit->parents);
2041 commit->parents = h;
2045 * A commit simplifies to itself if it is a root, if it is
2046 * UNINTERESTING, if it touches the given paths, or if it is a
2047 * merge and its parents simplifies to more than one commits
2048 * (the first two cases are already handled at the beginning of
2049 * this function).
2051 * Otherwise, it simplifies to what its sole parent simplifies to.
2053 if (!cnt ||
2054 (commit->object.flags & UNINTERESTING) ||
2055 !(commit->object.flags & TREESAME) ||
2056 (1 < cnt))
2057 st->simplified = commit;
2058 else {
2059 pst = locate_simplify_state(revs, commit->parents->item);
2060 st->simplified = pst->simplified;
2062 return tail;
2065 static void simplify_merges(struct rev_info *revs)
2067 struct commit_list *list, *next;
2068 struct commit_list *yet_to_do, **tail;
2069 struct commit *commit;
2071 if (!revs->prune)
2072 return;
2074 /* feed the list reversed */
2075 yet_to_do = NULL;
2076 for (list = revs->commits; list; list = next) {
2077 commit = list->item;
2078 next = list->next;
2080 * Do not free(list) here yet; the original list
2081 * is used later in this function.
2083 commit_list_insert(commit, &yet_to_do);
2085 while (yet_to_do) {
2086 list = yet_to_do;
2087 yet_to_do = NULL;
2088 tail = &yet_to_do;
2089 while (list) {
2090 commit = list->item;
2091 next = list->next;
2092 free(list);
2093 list = next;
2094 tail = simplify_one(revs, commit, tail);
2098 /* clean up the result, removing the simplified ones */
2099 list = revs->commits;
2100 revs->commits = NULL;
2101 tail = &revs->commits;
2102 while (list) {
2103 struct merge_simplify_state *st;
2105 commit = list->item;
2106 next = list->next;
2107 free(list);
2108 list = next;
2109 st = locate_simplify_state(revs, commit);
2110 if (st->simplified == commit)
2111 tail = &commit_list_insert(commit, tail)->next;
2115 static void set_children(struct rev_info *revs)
2117 struct commit_list *l;
2118 for (l = revs->commits; l; l = l->next) {
2119 struct commit *commit = l->item;
2120 struct commit_list *p;
2122 for (p = commit->parents; p; p = p->next)
2123 add_child(revs, p->item, commit);
2127 void reset_revision_walk(void)
2129 clear_object_flags(SEEN | ADDED | SHOWN);
2132 int prepare_revision_walk(struct rev_info *revs)
2134 int nr = revs->pending.nr;
2135 struct object_array_entry *e, *list;
2136 struct commit_list **next = &revs->commits;
2138 e = list = revs->pending.objects;
2139 revs->pending.nr = 0;
2140 revs->pending.alloc = 0;
2141 revs->pending.objects = NULL;
2142 while (--nr >= 0) {
2143 struct commit *commit = handle_commit(revs, e->item, e->name);
2144 if (commit) {
2145 if (!(commit->object.flags & SEEN)) {
2146 commit->object.flags |= SEEN;
2147 next = commit_list_append(commit, next);
2150 e++;
2152 if (!revs->leak_pending)
2153 free(list);
2155 if (revs->no_walk != REVISION_WALK_NO_WALK_UNSORTED)
2156 commit_list_sort_by_date(&revs->commits);
2157 if (revs->no_walk)
2158 return 0;
2159 if (revs->limited)
2160 if (limit_list(revs) < 0)
2161 return -1;
2162 if (revs->topo_order)
2163 sort_in_topological_order(&revs->commits, revs->lifo);
2164 if (revs->simplify_merges)
2165 simplify_merges(revs);
2166 if (revs->children.name)
2167 set_children(revs);
2168 return 0;
2171 enum rewrite_result {
2172 rewrite_one_ok,
2173 rewrite_one_noparents,
2174 rewrite_one_error
2177 static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp)
2179 struct commit_list *cache = NULL;
2181 for (;;) {
2182 struct commit *p = *pp;
2183 if (!revs->limited)
2184 if (add_parents_to_list(revs, p, &revs->commits, &cache) < 0)
2185 return rewrite_one_error;
2186 if (p->parents && p->parents->next)
2187 return rewrite_one_ok;
2188 if (p->object.flags & UNINTERESTING)
2189 return rewrite_one_ok;
2190 if (!(p->object.flags & TREESAME))
2191 return rewrite_one_ok;
2192 if (!p->parents)
2193 return rewrite_one_noparents;
2194 *pp = p->parents->item;
2198 static int rewrite_parents(struct rev_info *revs, struct commit *commit)
2200 struct commit_list **pp = &commit->parents;
2201 while (*pp) {
2202 struct commit_list *parent = *pp;
2203 switch (rewrite_one(revs, &parent->item)) {
2204 case rewrite_one_ok:
2205 break;
2206 case rewrite_one_noparents:
2207 *pp = parent->next;
2208 continue;
2209 case rewrite_one_error:
2210 return -1;
2212 pp = &parent->next;
2214 remove_duplicate_parents(commit);
2215 return 0;
2218 static int commit_match(struct commit *commit, struct rev_info *opt)
2220 int retval;
2221 struct strbuf buf = STRBUF_INIT;
2222 if (!opt->grep_filter.pattern_list && !opt->grep_filter.header_list)
2223 return 1;
2225 /* Prepend "fake" headers as needed */
2226 if (opt->grep_filter.use_reflog_filter) {
2227 strbuf_addstr(&buf, "reflog ");
2228 get_reflog_message(&buf, opt->reflog_info);
2229 strbuf_addch(&buf, '\n');
2232 /* Copy the commit to temporary if we are using "fake" headers */
2233 if (buf.len)
2234 strbuf_addstr(&buf, commit->buffer);
2236 /* Append "fake" message parts as needed */
2237 if (opt->show_notes) {
2238 if (!buf.len)
2239 strbuf_addstr(&buf, commit->buffer);
2240 format_display_notes(commit->object.sha1, &buf,
2241 get_log_output_encoding(), 0);
2244 /* Find either in the commit object, or in the temporary */
2245 if (buf.len)
2246 retval = grep_buffer(&opt->grep_filter, buf.buf, buf.len);
2247 else
2248 retval = grep_buffer(&opt->grep_filter,
2249 commit->buffer, strlen(commit->buffer));
2250 strbuf_release(&buf);
2251 return retval;
2254 static inline int want_ancestry(struct rev_info *revs)
2256 return (revs->rewrite_parents || revs->children.name);
2259 enum commit_action get_commit_action(struct rev_info *revs, struct commit *commit)
2261 if (commit->object.flags & SHOWN)
2262 return commit_ignore;
2263 if (revs->unpacked && has_sha1_pack(commit->object.sha1))
2264 return commit_ignore;
2265 if (revs->show_all)
2266 return commit_show;
2267 if (commit->object.flags & UNINTERESTING)
2268 return commit_ignore;
2269 if (revs->min_age != -1 && (commit->date > revs->min_age))
2270 return commit_ignore;
2271 if (revs->min_parents || (revs->max_parents >= 0)) {
2272 int n = 0;
2273 struct commit_list *p;
2274 for (p = commit->parents; p; p = p->next)
2275 n++;
2276 if ((n < revs->min_parents) ||
2277 ((revs->max_parents >= 0) && (n > revs->max_parents)))
2278 return commit_ignore;
2280 if (!commit_match(commit, revs))
2281 return commit_ignore;
2282 if (revs->prune && revs->dense) {
2283 /* Commit without changes? */
2284 if (commit->object.flags & TREESAME) {
2285 /* drop merges unless we want parenthood */
2286 if (!want_ancestry(revs))
2287 return commit_ignore;
2288 /* non-merge - always ignore it */
2289 if (!commit->parents || !commit->parents->next)
2290 return commit_ignore;
2293 return commit_show;
2296 enum commit_action simplify_commit(struct rev_info *revs, struct commit *commit)
2298 enum commit_action action = get_commit_action(revs, commit);
2300 if (action == commit_show &&
2301 !revs->show_all &&
2302 revs->prune && revs->dense && want_ancestry(revs)) {
2303 if (rewrite_parents(revs, commit) < 0)
2304 return commit_error;
2306 return action;
2309 static struct commit *get_revision_1(struct rev_info *revs)
2311 if (!revs->commits)
2312 return NULL;
2314 do {
2315 struct commit_list *entry = revs->commits;
2316 struct commit *commit = entry->item;
2318 revs->commits = entry->next;
2319 free(entry);
2321 if (revs->reflog_info) {
2322 fake_reflog_parent(revs->reflog_info, commit);
2323 commit->object.flags &= ~(ADDED | SEEN | SHOWN);
2327 * If we haven't done the list limiting, we need to look at
2328 * the parents here. We also need to do the date-based limiting
2329 * that we'd otherwise have done in limit_list().
2331 if (!revs->limited) {
2332 if (revs->max_age != -1 &&
2333 (commit->date < revs->max_age))
2334 continue;
2335 if (add_parents_to_list(revs, commit, &revs->commits, NULL) < 0)
2336 die("Failed to traverse parents of commit %s",
2337 sha1_to_hex(commit->object.sha1));
2340 switch (simplify_commit(revs, commit)) {
2341 case commit_ignore:
2342 continue;
2343 case commit_error:
2344 die("Failed to simplify parents of commit %s",
2345 sha1_to_hex(commit->object.sha1));
2346 default:
2347 return commit;
2349 } while (revs->commits);
2350 return NULL;
2353 static void gc_boundary(struct object_array *array)
2355 unsigned nr = array->nr;
2356 unsigned alloc = array->alloc;
2357 struct object_array_entry *objects = array->objects;
2359 if (alloc <= nr) {
2360 unsigned i, j;
2361 for (i = j = 0; i < nr; i++) {
2362 if (objects[i].item->flags & SHOWN)
2363 continue;
2364 if (i != j)
2365 objects[j] = objects[i];
2366 j++;
2368 for (i = j; i < nr; i++)
2369 objects[i].item = NULL;
2370 array->nr = j;
2374 static void create_boundary_commit_list(struct rev_info *revs)
2376 unsigned i;
2377 struct commit *c;
2378 struct object_array *array = &revs->boundary_commits;
2379 struct object_array_entry *objects = array->objects;
2382 * If revs->commits is non-NULL at this point, an error occurred in
2383 * get_revision_1(). Ignore the error and continue printing the
2384 * boundary commits anyway. (This is what the code has always
2385 * done.)
2387 if (revs->commits) {
2388 free_commit_list(revs->commits);
2389 revs->commits = NULL;
2393 * Put all of the actual boundary commits from revs->boundary_commits
2394 * into revs->commits
2396 for (i = 0; i < array->nr; i++) {
2397 c = (struct commit *)(objects[i].item);
2398 if (!c)
2399 continue;
2400 if (!(c->object.flags & CHILD_SHOWN))
2401 continue;
2402 if (c->object.flags & (SHOWN | BOUNDARY))
2403 continue;
2404 c->object.flags |= BOUNDARY;
2405 commit_list_insert(c, &revs->commits);
2409 * If revs->topo_order is set, sort the boundary commits
2410 * in topological order
2412 sort_in_topological_order(&revs->commits, revs->lifo);
2415 static struct commit *get_revision_internal(struct rev_info *revs)
2417 struct commit *c = NULL;
2418 struct commit_list *l;
2420 if (revs->boundary == 2) {
2422 * All of the normal commits have already been returned,
2423 * and we are now returning boundary commits.
2424 * create_boundary_commit_list() has populated
2425 * revs->commits with the remaining commits to return.
2427 c = pop_commit(&revs->commits);
2428 if (c)
2429 c->object.flags |= SHOWN;
2430 return c;
2434 * If our max_count counter has reached zero, then we are done. We
2435 * don't simply return NULL because we still might need to show
2436 * boundary commits. But we want to avoid calling get_revision_1, which
2437 * might do a considerable amount of work finding the next commit only
2438 * for us to throw it away.
2440 * If it is non-zero, then either we don't have a max_count at all
2441 * (-1), or it is still counting, in which case we decrement.
2443 if (revs->max_count) {
2444 c = get_revision_1(revs);
2445 if (c) {
2446 while (0 < revs->skip_count) {
2447 revs->skip_count--;
2448 c = get_revision_1(revs);
2449 if (!c)
2450 break;
2454 if (revs->max_count > 0)
2455 revs->max_count--;
2458 if (c)
2459 c->object.flags |= SHOWN;
2461 if (!revs->boundary) {
2462 return c;
2465 if (!c) {
2467 * get_revision_1() runs out the commits, and
2468 * we are done computing the boundaries.
2469 * switch to boundary commits output mode.
2471 revs->boundary = 2;
2474 * Update revs->commits to contain the list of
2475 * boundary commits.
2477 create_boundary_commit_list(revs);
2479 return get_revision_internal(revs);
2483 * boundary commits are the commits that are parents of the
2484 * ones we got from get_revision_1() but they themselves are
2485 * not returned from get_revision_1(). Before returning
2486 * 'c', we need to mark its parents that they could be boundaries.
2489 for (l = c->parents; l; l = l->next) {
2490 struct object *p;
2491 p = &(l->item->object);
2492 if (p->flags & (CHILD_SHOWN | SHOWN))
2493 continue;
2494 p->flags |= CHILD_SHOWN;
2495 gc_boundary(&revs->boundary_commits);
2496 add_object_array(p, NULL, &revs->boundary_commits);
2499 return c;
2502 struct commit *get_revision(struct rev_info *revs)
2504 struct commit *c;
2505 struct commit_list *reversed;
2507 if (revs->reverse) {
2508 reversed = NULL;
2509 while ((c = get_revision_internal(revs))) {
2510 commit_list_insert(c, &reversed);
2512 revs->commits = reversed;
2513 revs->reverse = 0;
2514 revs->reverse_output_stage = 1;
2517 if (revs->reverse_output_stage)
2518 return pop_commit(&revs->commits);
2520 c = get_revision_internal(revs);
2521 if (c && revs->graph)
2522 graph_update(revs->graph, c);
2523 return c;
2526 char *get_revision_mark(const struct rev_info *revs, const struct commit *commit)
2528 if (commit->object.flags & BOUNDARY)
2529 return "-";
2530 else if (commit->object.flags & UNINTERESTING)
2531 return "^";
2532 else if (commit->object.flags & PATCHSAME)
2533 return "=";
2534 else if (!revs || revs->left_right) {
2535 if (commit->object.flags & SYMMETRIC_LEFT)
2536 return "<";
2537 else
2538 return ">";
2539 } else if (revs->graph)
2540 return "*";
2541 else if (revs->cherry_mark)
2542 return "+";
2543 return "";
2546 void put_revision_mark(const struct rev_info *revs, const struct commit *commit)
2548 char *mark = get_revision_mark(revs, commit);
2549 if (!strlen(mark))
2550 return;
2551 fputs(mark, stdout);
2552 putchar(' ');