12 static char *path_name(struct name_path *path, const char *name)
16 int nlen = strlen(name);
19 for (p = path; p; p = p->up) {
21 len += p->elem_len + 1;
24 m = n + len - (nlen + 1);
26 for (p = path; p; p = p->up) {
29 memcpy(m, p->elem, p->elem_len);
36 void add_object(struct object *obj,
37 struct object_array *p,
38 struct name_path *path,
41 add_object_array(obj, path_name(path, name), p);
44 static void mark_blob_uninteresting(struct blob *blob)
46 if (blob->object.flags & UNINTERESTING)
48 blob->object.flags |= UNINTERESTING;
51 void mark_tree_uninteresting(struct tree *tree)
53 struct tree_desc desc;
54 struct name_entry entry;
55 struct object *obj = &tree->object;
57 if (obj->flags & UNINTERESTING)
59 obj->flags |= UNINTERESTING;
60 if (!has_sha1_file(obj->sha1))
62 if (parse_tree(tree) < 0)
63 die("bad tree %s", sha1_to_hex(obj->sha1));
65 desc.buf = tree->buffer;
66 desc.size = tree->size;
67 while (tree_entry(&desc, &entry)) {
68 if (S_ISDIR(entry.mode))
69 mark_tree_uninteresting(lookup_tree(entry.sha1));
71 mark_blob_uninteresting(lookup_blob(entry.sha1));
75 * We don't care about the tree any more
76 * after it has been marked uninteresting.
82 void mark_parents_uninteresting(struct commit *commit)
84 struct commit_list *parents = commit->parents;
87 struct commit *commit = parents->item;
88 if (!(commit->object.flags & UNINTERESTING)) {
89 commit->object.flags |= UNINTERESTING;
92 * Normally we haven't parsed the parent
93 * yet, so we won't have a parent of a parent
94 * here. However, it may turn out that we've
95 * reached this commit some other way (where it
96 * wasn't uninteresting), in which case we need
97 * to mark its parents recursively too..
100 mark_parents_uninteresting(commit);
104 * A missing commit is ok iff its parent is marked
107 * We just mark such a thing parsed, so that when
108 * it is popped next time around, we won't be trying
109 * to parse it and get an error.
111 if (!has_sha1_file(commit->object.sha1))
112 commit->object.parsed = 1;
113 parents = parents->next;
117 void add_pending_object(struct rev_info *revs, struct object *obj, const char *name)
119 add_object_array(obj, name, &revs->pending);
122 static struct object *get_reference(struct rev_info *revs, const char *name, const unsigned char *sha1, unsigned int flags)
124 struct object *object;
126 object = parse_object(sha1);
128 die("bad object %s", name);
129 object->flags |= flags;
133 static struct commit *handle_commit(struct rev_info *revs, struct object *object, const char *name)
135 unsigned long flags = object->flags;
138 * Tag object? Look what it points to..
140 while (object->type == OBJ_TAG) {
141 struct tag *tag = (struct tag *) object;
142 if (revs->tag_objects && !(flags & UNINTERESTING))
143 add_pending_object(revs, object, tag->tag);
144 object = parse_object(tag->tagged->sha1);
146 die("bad object %s", sha1_to_hex(tag->tagged->sha1));
150 * Commit object? Just return it, we'll do all the complex
153 if (object->type == OBJ_COMMIT) {
154 struct commit *commit = (struct commit *)object;
155 if (parse_commit(commit) < 0)
156 die("unable to parse commit %s", name);
157 if (flags & UNINTERESTING) {
158 commit->object.flags |= UNINTERESTING;
159 mark_parents_uninteresting(commit);
166 * Tree object? Either mark it uniniteresting, or add it
167 * to the list of objects to look at later..
169 if (object->type == OBJ_TREE) {
170 struct tree *tree = (struct tree *)object;
171 if (!revs->tree_objects)
173 if (flags & UNINTERESTING) {
174 mark_tree_uninteresting(tree);
177 add_pending_object(revs, object, "");
182 * Blob object? You know the drill by now..
184 if (object->type == OBJ_BLOB) {
185 struct blob *blob = (struct blob *)object;
186 if (!revs->blob_objects)
188 if (flags & UNINTERESTING) {
189 mark_blob_uninteresting(blob);
192 add_pending_object(revs, object, "");
195 die("%s is unknown object", name);
198 static int everybody_uninteresting(struct commit_list *orig)
200 struct commit_list *list = orig;
202 struct commit *commit = list->item;
204 if (commit->object.flags & UNINTERESTING)
211 static int tree_difference = REV_TREE_SAME;
213 static void file_add_remove(struct diff_options *options,
214 int addremove, unsigned mode,
215 const unsigned char *sha1,
216 const char *base, const char *path)
218 int diff = REV_TREE_DIFFERENT;
221 * Is it an add of a new file? It means that the old tree
222 * didn't have it at all, so we will turn "REV_TREE_SAME" ->
223 * "REV_TREE_NEW", but leave any "REV_TREE_DIFFERENT" alone
224 * (and if it already was "REV_TREE_NEW", we'll keep it
225 * "REV_TREE_NEW" of course).
227 if (addremove == '+') {
228 diff = tree_difference;
229 if (diff != REV_TREE_SAME)
233 tree_difference = diff;
236 static void file_change(struct diff_options *options,
237 unsigned old_mode, unsigned new_mode,
238 const unsigned char *old_sha1,
239 const unsigned char *new_sha1,
240 const char *base, const char *path)
242 tree_difference = REV_TREE_DIFFERENT;
245 int rev_compare_tree(struct rev_info *revs, struct tree *t1, struct tree *t2)
250 return REV_TREE_DIFFERENT;
251 tree_difference = REV_TREE_SAME;
252 if (diff_tree_sha1(t1->object.sha1, t2->object.sha1, "",
254 return REV_TREE_DIFFERENT;
255 return tree_difference;
258 int rev_same_tree_as_empty(struct rev_info *revs, struct tree *t1)
262 struct tree_desc empty, real;
267 tree = read_object_with_reference(t1->object.sha1, tree_type, &real.size, NULL);
276 retval = diff_tree(&empty, &real, "", &revs->pruning);
279 return retval >= 0 && !tree_difference;
282 static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit)
284 struct commit_list **pp, *parent;
285 int tree_changed = 0, tree_same = 0;
290 if (!commit->parents) {
291 if (!rev_same_tree_as_empty(revs, commit->tree))
292 commit->object.flags |= TREECHANGE;
296 pp = &commit->parents;
297 while ((parent = *pp) != NULL) {
298 struct commit *p = parent->item;
301 switch (rev_compare_tree(revs, p->tree, commit->tree)) {
304 if (!revs->simplify_history || (p->object.flags & UNINTERESTING)) {
305 /* Even if a merge with an uninteresting
306 * side branch brought the entire change
307 * we are interested in, we do not want
308 * to lose the other branches of this
309 * merge, so we just keep going.
315 commit->parents = parent;
319 if (revs->remove_empty_trees &&
320 rev_same_tree_as_empty(revs, p->tree)) {
321 /* We are adding all the specified
322 * paths from this parent, so the
323 * history beyond this parent is not
324 * interesting. Remove its parents
325 * (they are grandparents for us).
326 * IOW, we pretend this parent is a
333 case REV_TREE_DIFFERENT:
338 die("bad tree compare for commit %s", sha1_to_hex(commit->object.sha1));
340 if (tree_changed && !tree_same)
341 commit->object.flags |= TREECHANGE;
344 static void add_parents_to_list(struct rev_info *revs, struct commit *commit, struct commit_list **list)
346 struct commit_list *parent = commit->parents;
348 if (commit->object.flags & ADDED)
350 commit->object.flags |= ADDED;
353 * If the commit is uninteresting, don't try to
354 * prune parents - we want the maximal uninteresting
357 * Normally we haven't parsed the parent
358 * yet, so we won't have a parent of a parent
359 * here. However, it may turn out that we've
360 * reached this commit some other way (where it
361 * wasn't uninteresting), in which case we need
362 * to mark its parents recursively too..
364 if (commit->object.flags & UNINTERESTING) {
366 struct commit *p = parent->item;
367 parent = parent->next;
369 p->object.flags |= UNINTERESTING;
371 mark_parents_uninteresting(p);
372 if (p->object.flags & SEEN)
374 p->object.flags |= SEEN;
375 insert_by_date(p, list);
381 * Ok, the commit wasn't uninteresting. Try to
382 * simplify the commit history and find the parent
383 * that has no differences in the path set if one exists.
386 revs->prune_fn(revs, commit);
391 parent = commit->parents;
393 struct commit *p = parent->item;
395 parent = parent->next;
398 if (p->object.flags & SEEN)
400 p->object.flags |= SEEN;
401 insert_by_date(p, list);
405 static void limit_list(struct rev_info *revs)
407 struct commit_list *list = revs->commits;
408 struct commit_list *newlist = NULL;
409 struct commit_list **p = &newlist;
412 struct commit_list *entry = list;
413 struct commit *commit = list->item;
414 struct object *obj = &commit->object;
419 if (revs->max_age != -1 && (commit->date < revs->max_age))
420 obj->flags |= UNINTERESTING;
421 if (revs->unpacked &&
422 has_sha1_pack(obj->sha1, revs->ignore_packed))
423 obj->flags |= UNINTERESTING;
424 add_parents_to_list(revs, commit, &list);
425 if (obj->flags & UNINTERESTING) {
426 mark_parents_uninteresting(commit);
427 if (everybody_uninteresting(list))
431 if (revs->min_age != -1 && (commit->date > revs->min_age))
433 p = &commit_list_insert(commit, p)->next;
435 if (revs->boundary) {
436 /* mark the ones that are on the result list first */
437 for (list = newlist; list; list = list->next) {
438 struct commit *commit = list->item;
439 commit->object.flags |= TMP_MARK;
441 for (list = newlist; list; list = list->next) {
442 struct commit *commit = list->item;
443 struct object *obj = &commit->object;
444 struct commit_list *parent;
445 if (obj->flags & UNINTERESTING)
447 for (parent = commit->parents;
449 parent = parent->next) {
450 struct commit *pcommit = parent->item;
451 if (!(pcommit->object.flags & UNINTERESTING))
453 pcommit->object.flags |= BOUNDARY;
454 if (pcommit->object.flags & TMP_MARK)
456 pcommit->object.flags |= TMP_MARK;
457 p = &commit_list_insert(pcommit, p)->next;
460 for (list = newlist; list; list = list->next) {
461 struct commit *commit = list->item;
462 commit->object.flags &= ~TMP_MARK;
465 revs->commits = newlist;
468 static int all_flags;
469 static struct rev_info *all_revs;
471 static int handle_one_ref(const char *path, const unsigned char *sha1)
473 struct object *object = get_reference(all_revs, path, sha1, all_flags);
474 add_pending_object(all_revs, object, "");
478 static void handle_all(struct rev_info *revs, unsigned flags)
482 for_each_ref(handle_one_ref);
485 static int add_parents_only(struct rev_info *revs, const char *arg, int flags)
487 unsigned char sha1[20];
489 struct commit *commit;
490 struct commit_list *parents;
493 flags ^= UNINTERESTING;
496 if (get_sha1(arg, sha1))
499 it = get_reference(revs, arg, sha1, 0);
500 if (it->type != OBJ_TAG)
502 hashcpy(sha1, ((struct tag*)it)->tagged->sha1);
504 if (it->type != OBJ_COMMIT)
506 commit = (struct commit *)it;
507 for (parents = commit->parents; parents; parents = parents->next) {
508 it = &parents->item->object;
510 add_pending_object(revs, it, arg);
515 void init_revisions(struct rev_info *revs, const char *prefix)
517 memset(revs, 0, sizeof(*revs));
519 revs->abbrev = DEFAULT_ABBREV;
520 revs->ignore_merges = 1;
521 revs->simplify_history = 1;
522 revs->pruning.recursive = 1;
523 revs->pruning.add_remove = file_add_remove;
524 revs->pruning.change = file_change;
527 revs->prefix = prefix;
530 revs->max_count = -1;
532 revs->prune_fn = NULL;
533 revs->prune_data = NULL;
535 revs->topo_setter = topo_sort_default_setter;
536 revs->topo_getter = topo_sort_default_getter;
538 revs->commit_format = CMIT_FMT_DEFAULT;
540 diff_setup(&revs->diffopt);
543 static void add_pending_commit_list(struct rev_info *revs,
544 struct commit_list *commit_list,
547 while (commit_list) {
548 struct object *object = &commit_list->item->object;
549 object->flags |= flags;
550 add_pending_object(revs, object, sha1_to_hex(object->sha1));
551 commit_list = commit_list->next;
555 static void prepare_show_merge(struct rev_info *revs)
557 struct commit_list *bases;
558 struct commit *head, *other;
559 unsigned char sha1[20];
560 const char **prune = NULL;
561 int i, prune_num = 1; /* counting terminating NULL */
563 if (get_sha1("HEAD", sha1) || !(head = lookup_commit(sha1)))
564 die("--merge without HEAD?");
565 if (get_sha1("MERGE_HEAD", sha1) || !(other = lookup_commit(sha1)))
566 die("--merge without MERGE_HEAD?");
567 add_pending_object(revs, &head->object, "HEAD");
568 add_pending_object(revs, &other->object, "MERGE_HEAD");
569 bases = get_merge_bases(head, other, 1);
571 struct commit *it = bases->item;
572 struct commit_list *n = bases->next;
575 it->object.flags |= UNINTERESTING;
576 add_pending_object(revs, &it->object, "(merge-base)");
581 for (i = 0; i < active_nr; i++) {
582 struct cache_entry *ce = active_cache[i];
585 if (ce_path_match(ce, revs->prune_data)) {
587 prune = xrealloc(prune, sizeof(*prune) * prune_num);
588 prune[prune_num-2] = ce->name;
589 prune[prune_num-1] = NULL;
591 while ((i+1 < active_nr) &&
592 ce_same_name(ce, active_cache[i+1]))
595 revs->prune_data = prune;
598 int handle_revision_arg(const char *arg, struct rev_info *revs,
600 int cant_be_filename)
603 struct object *object;
604 unsigned char sha1[20];
607 dotdot = strstr(arg, "..");
609 unsigned char from_sha1[20];
610 const char *next = dotdot + 2;
611 const char *this = arg;
612 int symmetric = *next == '.';
613 unsigned int flags_exclude = flags ^ UNINTERESTING;
622 if (!get_sha1(this, from_sha1) &&
623 !get_sha1(next, sha1)) {
624 struct commit *a, *b;
625 struct commit_list *exclude;
627 a = lookup_commit_reference(from_sha1);
628 b = lookup_commit_reference(sha1);
631 "Invalid symmetric difference expression %s...%s" :
632 "Invalid revision range %s..%s",
636 if (!cant_be_filename) {
638 verify_non_filename(revs->prefix, arg);
642 exclude = get_merge_bases(a, b, 1);
643 add_pending_commit_list(revs, exclude,
645 free_commit_list(exclude);
646 a->object.flags |= flags;
648 a->object.flags |= flags_exclude;
649 b->object.flags |= flags;
650 add_pending_object(revs, &a->object, this);
651 add_pending_object(revs, &b->object, next);
656 dotdot = strstr(arg, "^@");
657 if (dotdot && !dotdot[2]) {
659 if (add_parents_only(revs, arg, flags))
665 local_flags = UNINTERESTING;
668 if (get_sha1(arg, sha1))
670 if (!cant_be_filename)
671 verify_non_filename(revs->prefix, arg);
672 object = get_reference(revs, arg, sha1, flags ^ local_flags);
673 add_pending_object(revs, object, arg);
677 static void add_header_grep(struct rev_info *revs, const char *field, const char *pattern)
683 if (!revs->header_filter) {
684 struct grep_opt *opt = xcalloc(1, sizeof(*opt));
685 opt->status_only = 1;
686 opt->pattern_tail = &(opt->pattern_list);
687 opt->regflags = REG_NEWLINE;
688 revs->header_filter = opt;
691 fldlen = strlen(field);
692 patlen = strlen(pattern);
693 pat = xmalloc(patlen + fldlen + 10);
695 if (*pattern == '^') {
699 sprintf(pat, "^%s %s%s", field, prefix, pattern);
700 append_grep_pattern(revs->header_filter, pat,
701 "command line", 0, GREP_PATTERN);
704 static void add_message_grep(struct rev_info *revs, const char *pattern)
706 if (!revs->message_filter) {
707 struct grep_opt *opt = xcalloc(1, sizeof(*opt));
708 opt->status_only = 1;
709 opt->pattern_tail = &(opt->pattern_list);
710 opt->regflags = REG_NEWLINE;
711 revs->message_filter = opt;
713 append_grep_pattern(revs->message_filter, pattern,
714 "command line", 0, GREP_PATTERN);
717 static void add_ignore_packed(struct rev_info *revs, const char *name)
719 int num = ++revs->num_ignore_packed;
721 revs->ignore_packed = xrealloc(revs->ignore_packed,
722 sizeof(const char **) * (num + 1));
723 revs->ignore_packed[num-1] = name;
724 revs->ignore_packed[num] = NULL;
728 * Parse revision information, filling in the "rev_info" structure,
729 * and removing the used arguments from the argument list.
731 * Returns the number of arguments left that weren't recognized
732 * (which are also moved to the head of the argument list)
734 int setup_revisions(int argc, const char **argv, struct rev_info *revs, const char *def)
736 int i, flags, seen_dashdash, show_merge;
737 const char **unrecognized = argv + 1;
740 /* First, search for "--" */
742 for (i = 1; i < argc; i++) {
743 const char *arg = argv[i];
744 if (strcmp(arg, "--"))
748 revs->prune_data = get_pathspec(revs->prefix, argv + i + 1);
753 flags = show_merge = 0;
754 for (i = 1; i < argc; i++) {
755 const char *arg = argv[i];
758 if (!strncmp(arg, "--max-count=", 12)) {
759 revs->max_count = atoi(arg + 12);
762 /* accept -<digit>, like traditional "head" */
763 if ((*arg == '-') && isdigit(arg[1])) {
764 revs->max_count = atoi(arg + 1);
767 if (!strcmp(arg, "-n")) {
769 die("-n requires an argument");
770 revs->max_count = atoi(argv[++i]);
773 if (!strncmp(arg,"-n",2)) {
774 revs->max_count = atoi(arg + 2);
777 if (!strncmp(arg, "--max-age=", 10)) {
778 revs->max_age = atoi(arg + 10);
781 if (!strncmp(arg, "--since=", 8)) {
782 revs->max_age = approxidate(arg + 8);
785 if (!strncmp(arg, "--after=", 8)) {
786 revs->max_age = approxidate(arg + 8);
789 if (!strncmp(arg, "--min-age=", 10)) {
790 revs->min_age = atoi(arg + 10);
793 if (!strncmp(arg, "--before=", 9)) {
794 revs->min_age = approxidate(arg + 9);
797 if (!strncmp(arg, "--until=", 8)) {
798 revs->min_age = approxidate(arg + 8);
801 if (!strcmp(arg, "--all")) {
802 handle_all(revs, flags);
805 if (!strcmp(arg, "--not")) {
806 flags ^= UNINTERESTING;
809 if (!strcmp(arg, "--default")) {
811 die("bad --default argument");
815 if (!strcmp(arg, "--merge")) {
819 if (!strcmp(arg, "--topo-order")) {
820 revs->topo_order = 1;
823 if (!strcmp(arg, "--date-order")) {
825 revs->topo_order = 1;
828 if (!strcmp(arg, "--parents")) {
832 if (!strcmp(arg, "--dense")) {
836 if (!strcmp(arg, "--sparse")) {
840 if (!strcmp(arg, "--remove-empty")) {
841 revs->remove_empty_trees = 1;
844 if (!strcmp(arg, "--no-merges")) {
848 if (!strcmp(arg, "--boundary")) {
852 if (!strcmp(arg, "--objects")) {
853 revs->tag_objects = 1;
854 revs->tree_objects = 1;
855 revs->blob_objects = 1;
858 if (!strcmp(arg, "--objects-edge")) {
859 revs->tag_objects = 1;
860 revs->tree_objects = 1;
861 revs->blob_objects = 1;
865 if (!strcmp(arg, "--unpacked")) {
867 free(revs->ignore_packed);
868 revs->ignore_packed = NULL;
869 revs->num_ignore_packed = 0;
872 if (!strncmp(arg, "--unpacked=", 11)) {
874 add_ignore_packed(revs, arg+11);
877 if (!strcmp(arg, "-r")) {
879 revs->diffopt.recursive = 1;
882 if (!strcmp(arg, "-t")) {
884 revs->diffopt.recursive = 1;
885 revs->diffopt.tree_in_recursive = 1;
888 if (!strcmp(arg, "-m")) {
889 revs->ignore_merges = 0;
892 if (!strcmp(arg, "-c")) {
894 revs->dense_combined_merges = 0;
895 revs->combine_merges = 1;
898 if (!strcmp(arg, "--cc")) {
900 revs->dense_combined_merges = 1;
901 revs->combine_merges = 1;
904 if (!strcmp(arg, "-v")) {
905 revs->verbose_header = 1;
908 if (!strncmp(arg, "--pretty", 8)) {
909 revs->verbose_header = 1;
910 revs->commit_format = get_commit_format(arg+8);
913 if (!strcmp(arg, "--root")) {
914 revs->show_root_diff = 1;
917 if (!strcmp(arg, "--no-commit-id")) {
918 revs->no_commit_id = 1;
921 if (!strcmp(arg, "--always")) {
922 revs->always_show_header = 1;
925 if (!strcmp(arg, "--no-abbrev")) {
929 if (!strcmp(arg, "--abbrev")) {
930 revs->abbrev = DEFAULT_ABBREV;
933 if (!strncmp(arg, "--abbrev=", 9)) {
934 revs->abbrev = strtoul(arg + 9, NULL, 10);
935 if (revs->abbrev < MINIMUM_ABBREV)
936 revs->abbrev = MINIMUM_ABBREV;
937 else if (revs->abbrev > 40)
941 if (!strcmp(arg, "--abbrev-commit")) {
942 revs->abbrev_commit = 1;
945 if (!strcmp(arg, "--full-diff")) {
950 if (!strcmp(arg, "--full-history")) {
951 revs->simplify_history = 0;
954 if (!strcmp(arg, "--relative-date")) {
955 revs->relative_date = 1;
958 if (!strncmp(arg, "--author=", 9)) {
959 add_header_grep(revs, "author", arg+9);
962 if (!strncmp(arg, "--committer=", 12)) {
963 add_header_grep(revs, "committer", arg+12);
966 if (!strncmp(arg, "--grep=", 7)) {
967 add_message_grep(revs, arg+7);
970 opts = diff_opt_parse(&revs->diffopt, argv+i, argc-i);
976 *unrecognized++ = arg;
981 if (handle_revision_arg(arg, revs, flags, seen_dashdash)) {
983 if (seen_dashdash || *arg == '^')
984 die("bad revision '%s'", arg);
986 /* If we didn't have a "--":
987 * (1) all filenames must exist;
988 * (2) all rev-args must not be interpretable
989 * as a valid filename.
990 * but the latter we have checked in the main loop.
992 for (j = i; j < argc; j++)
993 verify_filename(revs->prefix, argv[j]);
995 revs->prune_data = get_pathspec(revs->prefix,
1002 prepare_show_merge(revs);
1003 if (def && !revs->pending.nr) {
1004 unsigned char sha1[20];
1005 struct object *object;
1006 if (get_sha1(def, sha1))
1007 die("bad default revision '%s'", def);
1008 object = get_reference(revs, def, sha1, 0);
1009 add_pending_object(revs, object, def);
1012 if (revs->topo_order || revs->unpacked)
1015 if (revs->prune_data) {
1016 diff_tree_setup_paths(revs->prune_data, &revs->pruning);
1017 revs->prune_fn = try_to_simplify_commit;
1018 if (!revs->full_diff)
1019 diff_tree_setup_paths(revs->prune_data, &revs->diffopt);
1021 if (revs->combine_merges) {
1022 revs->ignore_merges = 0;
1023 if (revs->dense_combined_merges && !revs->diffopt.output_format)
1024 revs->diffopt.output_format = DIFF_FORMAT_PATCH;
1026 revs->diffopt.abbrev = revs->abbrev;
1027 if (diff_setup_done(&revs->diffopt) < 0)
1028 die("diff_setup_done failed");
1030 if (revs->header_filter)
1031 compile_grep_patterns(revs->header_filter);
1032 if (revs->message_filter)
1033 compile_grep_patterns(revs->message_filter);
1038 void prepare_revision_walk(struct rev_info *revs)
1040 int nr = revs->pending.nr;
1041 struct object_array_entry *list = revs->pending.objects;
1043 revs->pending.nr = 0;
1044 revs->pending.alloc = 0;
1045 revs->pending.objects = NULL;
1047 struct commit *commit = handle_commit(revs, list->item, list->name);
1049 if (!(commit->object.flags & SEEN)) {
1050 commit->object.flags |= SEEN;
1051 insert_by_date(commit, &revs->commits);
1061 if (revs->topo_order)
1062 sort_in_topological_order_fn(&revs->commits, revs->lifo,
1067 static int rewrite_one(struct rev_info *revs, struct commit **pp)
1070 struct commit *p = *pp;
1072 add_parents_to_list(revs, p, &revs->commits);
1073 if (p->parents && p->parents->next)
1075 if (p->object.flags & (TREECHANGE | UNINTERESTING))
1079 *pp = p->parents->item;
1083 static void rewrite_parents(struct rev_info *revs, struct commit *commit)
1085 struct commit_list **pp = &commit->parents;
1087 struct commit_list *parent = *pp;
1088 if (rewrite_one(revs, &parent->item) < 0) {
1096 static void mark_boundary_to_show(struct commit *commit)
1098 struct commit_list *p = commit->parents;
1102 if (commit->object.flags & BOUNDARY)
1103 commit->object.flags |= BOUNDARY_SHOW;
1107 static int commit_match(struct commit *commit, struct rev_info *opt)
1109 char *header, *message;
1110 unsigned long header_len, message_len;
1112 if (!opt->header_filter && !opt->message_filter)
1115 header = commit->buffer;
1116 message = strstr(header, "\n\n");
1119 header_len = message - header - 1;
1120 message_len = strlen(message);
1123 header_len = strlen(header);
1128 if (opt->header_filter &&
1129 !grep_buffer(opt->header_filter, NULL, header, header_len))
1132 if (opt->message_filter &&
1133 !grep_buffer(opt->message_filter, NULL, message, message_len))
1139 struct commit *get_revision(struct rev_info *revs)
1141 struct commit_list *list = revs->commits;
1146 /* Check the max_count ... */
1147 switch (revs->max_count) {
1157 struct commit_list *entry = revs->commits;
1158 struct commit *commit = entry->item;
1160 revs->commits = entry->next;
1164 * If we haven't done the list limiting, we need to look at
1165 * the parents here. We also need to do the date-based limiting
1166 * that we'd otherwise have done in limit_list().
1168 if (!revs->limited) {
1169 if ((revs->unpacked &&
1170 has_sha1_pack(commit->object.sha1,
1171 revs->ignore_packed)) ||
1172 (revs->max_age != -1 &&
1173 (commit->date < revs->max_age)))
1175 add_parents_to_list(revs, commit, &revs->commits);
1177 if (commit->object.flags & SHOWN)
1180 /* We want to show boundary commits only when their
1181 * children are shown. When path-limiter is in effect,
1182 * rewrite_parents() drops some commits from getting shown,
1183 * and there is no point showing boundary parents that
1184 * are not shown. After rewrite_parents() rewrites the
1185 * parents of a commit that is shown, we mark the boundary
1186 * parents with BOUNDARY_SHOW.
1188 if (commit->object.flags & BOUNDARY_SHOW) {
1189 commit->object.flags |= SHOWN;
1192 if (commit->object.flags & UNINTERESTING)
1194 if (revs->min_age != -1 && (commit->date > revs->min_age))
1196 if (revs->no_merges &&
1197 commit->parents && commit->parents->next)
1199 if (!commit_match(commit, revs))
1201 if (revs->prune_fn && revs->dense) {
1202 /* Commit without changes? */
1203 if (!(commit->object.flags & TREECHANGE)) {
1204 /* drop merges unless we want parenthood */
1207 /* non-merge - always ignore it */
1208 if (!commit->parents || !commit->parents->next)
1212 rewrite_parents(revs, commit);
1215 mark_boundary_to_show(commit);
1216 commit->object.flags |= SHOWN;
1218 } while (revs->commits);