rev-list --exclude: tests
[git/git.git] / revision.c
CommitLineData
ae563542
LT
1#include "cache.h"
2#include "tag.h"
3#include "blob.h"
4#include "tree.h"
5#include "commit.h"
a4a88b2b 6#include "diff.h"
ae563542
LT
7#include "refs.h"
8#include "revision.h"
7fefda5c 9#include "graph.h"
8ecae9b0 10#include "grep.h"
8860fd42 11#include "reflog-walk.h"
d7a17cad 12#include "patch-ids.h"
f35f5603 13#include "decorate.h"
78892e32 14#include "log-tree.h"
894a9d33 15#include "string-list.h"
12da1d1f 16#include "line-log.h"
d72fbe81 17#include "mailmap.h"
ae563542 18
cdcefbc9
LT
19volatile show_early_output_fn_t show_early_output;
20
cf2ab916 21char *path_name(const struct name_path *path, const char *name)
ae563542 22{
cf2ab916 23 const struct name_path *p;
ae563542
LT
24 char *n, *m;
25 int nlen = strlen(name);
26 int len = nlen + 1;
27
28 for (p = path; p; p = p->up) {
29 if (p->elem_len)
30 len += p->elem_len + 1;
31 }
32 n = xmalloc(len);
33 m = n + len - (nlen + 1);
34 strcpy(m, name);
35 for (p = path; p; p = p->up) {
36 if (p->elem_len) {
37 m -= p->elem_len + 1;
38 memcpy(m, p->elem, p->elem_len);
39 m[p->elem_len] = '/';
40 }
41 }
42 return n;
43}
44
beba25ab
JH
45static int show_path_component_truncated(FILE *out, const char *name, int len)
46{
47 int cnt;
48 for (cnt = 0; cnt < len; cnt++) {
49 int ch = name[cnt];
50 if (!ch || ch == '\n')
51 return -1;
52 fputc(ch, out);
53 }
54 return len;
55}
56
57static int show_path_truncated(FILE *out, const struct name_path *path)
58{
59 int emitted, ours;
60
61 if (!path)
62 return 0;
63 emitted = show_path_truncated(out, path->up);
64 if (emitted < 0)
65 return emitted;
66 if (emitted)
67 fputc('/', out);
68 ours = show_path_component_truncated(out, path->elem, path->elem_len);
69 if (ours < 0)
70 return ours;
71 return ours || emitted;
72}
73
ff5f5f26
MH
74void show_object_with_name(FILE *out, struct object *obj,
75 const struct name_path *path, const char *component)
91f17516 76{
beba25ab
JH
77 struct name_path leaf;
78 leaf.up = (struct name_path *)path;
79 leaf.elem = component;
80 leaf.elem_len = strlen(component);
91f17516 81
beba25ab
JH
82 fprintf(out, "%s ", sha1_to_hex(obj->sha1));
83 show_path_truncated(out, &leaf);
84 fputc('\n', out);
91f17516
JH
85}
86
1f1e895f
LT
87void add_object(struct object *obj,
88 struct object_array *p,
89 struct name_path *path,
90 const char *name)
ae563542 91{
31faeb20
MH
92 char *pn = path_name(path, name);
93 add_object_array(obj, pn, p);
94 free(pn);
ae563542
LT
95}
96
97static void mark_blob_uninteresting(struct blob *blob)
98{
c1ee9013
MK
99 if (!blob)
100 return;
ae563542
LT
101 if (blob->object.flags & UNINTERESTING)
102 return;
103 blob->object.flags |= UNINTERESTING;
104}
105
106void mark_tree_uninteresting(struct tree *tree)
107{
f75e53ed 108 struct tree_desc desc;
4c068a98 109 struct name_entry entry;
ae563542 110 struct object *obj = &tree->object;
ae563542 111
c1ee9013
MK
112 if (!tree)
113 return;
ae563542
LT
114 if (obj->flags & UNINTERESTING)
115 return;
116 obj->flags |= UNINTERESTING;
117 if (!has_sha1_file(obj->sha1))
118 return;
119 if (parse_tree(tree) < 0)
120 die("bad tree %s", sha1_to_hex(obj->sha1));
f75e53ed 121
6fda5e51 122 init_tree_desc(&desc, tree->buffer, tree->size);
4c068a98 123 while (tree_entry(&desc, &entry)) {
4d1012c3
LT
124 switch (object_type(entry.mode)) {
125 case OBJ_TREE:
4c068a98 126 mark_tree_uninteresting(lookup_tree(entry.sha1));
4d1012c3
LT
127 break;
128 case OBJ_BLOB:
4c068a98 129 mark_blob_uninteresting(lookup_blob(entry.sha1));
4d1012c3
LT
130 break;
131 default:
132 /* Subproject commit - not in this repository */
133 break;
134 }
ae563542 135 }
f75e53ed
LT
136
137 /*
138 * We don't care about the tree any more
139 * after it has been marked uninteresting.
140 */
141 free(tree->buffer);
142 tree->buffer = NULL;
ae563542
LT
143}
144
145void mark_parents_uninteresting(struct commit *commit)
146{
941ba8db
NTND
147 struct commit_list *parents = NULL, *l;
148
149 for (l = commit->parents; l; l = l->next)
150 commit_list_insert(l->item, &parents);
ae563542
LT
151
152 while (parents) {
153 struct commit *commit = parents->item;
941ba8db
NTND
154 l = parents;
155 parents = parents->next;
156 free(l);
157
158 while (commit) {
159 /*
160 * A missing commit is ok iff its parent is marked
161 * uninteresting.
162 *
163 * We just mark such a thing parsed, so that when
164 * it is popped next time around, we won't be trying
165 * to parse it and get an error.
166 */
167 if (!has_sha1_file(commit->object.sha1))
168 commit->object.parsed = 1;
169
170 if (commit->object.flags & UNINTERESTING)
171 break;
172
d2c4af73 173 commit->object.flags |= UNINTERESTING;
ae563542 174
d2c4af73
MU
175 /*
176 * Normally we haven't parsed the parent
177 * yet, so we won't have a parent of a parent
178 * here. However, it may turn out that we've
179 * reached this commit some other way (where it
180 * wasn't uninteresting), in which case we need
181 * to mark its parents recursively too..
182 */
941ba8db
NTND
183 if (!commit->parents)
184 break;
ae563542 185
941ba8db
NTND
186 for (l = commit->parents->next; l; l = l->next)
187 commit_list_insert(l->item, &parents);
188 commit = commit->parents->item;
189 }
ae563542
LT
190 }
191}
192
ff5f5f26
MH
193static void add_pending_object_with_mode(struct rev_info *revs,
194 struct object *obj,
195 const char *name, unsigned mode)
ae563542 196{
cc243c3c
JH
197 if (!obj)
198 return;
aa27e461 199 if (revs->no_walk && (obj->flags & UNINTERESTING))
f222abde 200 revs->no_walk = 0;
105e4733
JH
201 if (revs->reflog_info && obj->type == OBJ_COMMIT) {
202 struct strbuf buf = STRBUF_INIT;
203 int len = interpret_branch_name(name, &buf);
204 int st;
205
206 if (0 < len && name[len] && buf.len)
207 strbuf_addstr(&buf, name + len);
208 st = add_reflog_for_walk(revs->reflog_info,
209 (struct commit *)obj,
210 buf.buf[0] ? buf.buf: name);
211 strbuf_release(&buf);
212 if (st)
213 return;
214 }
bb6c2fba 215 add_object_array_with_mode(obj, name, &revs->pending, mode);
ae563542
LT
216}
217
ff5f5f26
MH
218void add_pending_object(struct rev_info *revs,
219 struct object *obj, const char *name)
2d93b9fa
JH
220{
221 add_pending_object_with_mode(revs, obj, name, S_IFINVALID);
222}
223
3384a2df
JH
224void add_head_to_pending(struct rev_info *revs)
225{
226 unsigned char sha1[20];
227 struct object *obj;
228 if (get_sha1("HEAD", sha1))
229 return;
230 obj = parse_object(sha1);
231 if (!obj)
232 return;
233 add_pending_object(revs, obj, "HEAD");
234}
235
ff5f5f26
MH
236static struct object *get_reference(struct rev_info *revs, const char *name,
237 const unsigned char *sha1,
238 unsigned int flags)
ae563542
LT
239{
240 struct object *object;
241
242 object = parse_object(sha1);
cc243c3c
JH
243 if (!object) {
244 if (revs->ignore_missing)
245 return object;
ae563542 246 die("bad object %s", name);
cc243c3c 247 }
cd2bdc53
LT
248 object->flags |= flags;
249 return object;
250}
251
26c3177e
RS
252void add_pending_sha1(struct rev_info *revs, const char *name,
253 const unsigned char *sha1, unsigned int flags)
254{
255 struct object *object = get_reference(revs, name, sha1, flags);
256 add_pending_object(revs, object, name);
257}
258
ff5f5f26
MH
259static struct commit *handle_commit(struct rev_info *revs,
260 struct object *object, const char *name)
cd2bdc53
LT
261{
262 unsigned long flags = object->flags;
ae563542
LT
263
264 /*
265 * Tag object? Look what it points to..
266 */
1974632c 267 while (object->type == OBJ_TAG) {
ae563542 268 struct tag *tag = (struct tag *) object;
cd2bdc53 269 if (revs->tag_objects && !(flags & UNINTERESTING))
ae563542 270 add_pending_object(revs, object, tag->tag);
9684afd9
MK
271 if (!tag->tagged)
272 die("bad tag");
ae563542 273 object = parse_object(tag->tagged->sha1);
aeeae1b7
JH
274 if (!object) {
275 if (flags & UNINTERESTING)
276 return NULL;
ae563542 277 die("bad object %s", sha1_to_hex(tag->tagged->sha1));
aeeae1b7 278 }
ae563542
LT
279 }
280
281 /*
282 * Commit object? Just return it, we'll do all the complex
283 * reachability crud.
284 */
1974632c 285 if (object->type == OBJ_COMMIT) {
ae563542 286 struct commit *commit = (struct commit *)object;
ae563542
LT
287 if (parse_commit(commit) < 0)
288 die("unable to parse commit %s", name);
d9a83684 289 if (flags & UNINTERESTING) {
4262c1b0 290 commit->object.flags |= UNINTERESTING;
ae563542 291 mark_parents_uninteresting(commit);
d9a83684
LT
292 revs->limited = 1;
293 }
0f3a290b
LT
294 if (revs->show_source && !commit->util)
295 commit->util = (void *) name;
ae563542
LT
296 return commit;
297 }
298
299 /*
3ea3c215 300 * Tree object? Either mark it uninteresting, or add it
ae563542
LT
301 * to the list of objects to look at later..
302 */
1974632c 303 if (object->type == OBJ_TREE) {
ae563542
LT
304 struct tree *tree = (struct tree *)object;
305 if (!revs->tree_objects)
306 return NULL;
307 if (flags & UNINTERESTING) {
308 mark_tree_uninteresting(tree);
309 return NULL;
310 }
311 add_pending_object(revs, object, "");
312 return NULL;
313 }
314
315 /*
316 * Blob object? You know the drill by now..
317 */
1974632c 318 if (object->type == OBJ_BLOB) {
ae563542
LT
319 struct blob *blob = (struct blob *)object;
320 if (!revs->blob_objects)
321 return NULL;
322 if (flags & UNINTERESTING) {
323 mark_blob_uninteresting(blob);
324 return NULL;
325 }
326 add_pending_object(revs, object, "");
327 return NULL;
328 }
329 die("%s is unknown object", name);
330}
331
a4a88b2b
LT
332static int everybody_uninteresting(struct commit_list *orig)
333{
334 struct commit_list *list = orig;
335 while (list) {
336 struct commit *commit = list->item;
337 list = list->next;
338 if (commit->object.flags & UNINTERESTING)
339 continue;
340 return 0;
341 }
342 return 1;
343}
344
4d826608
KB
345/*
346 * A definition of "relevant" commit that we can use to simplify limited graphs
347 * by eliminating side branches.
348 *
349 * A "relevant" commit is one that is !UNINTERESTING (ie we are including it
350 * in our list), or that is a specified BOTTOM commit. Then after computing
351 * a limited list, during processing we can generally ignore boundary merges
352 * coming from outside the graph, (ie from irrelevant parents), and treat
353 * those merges as if they were single-parent. TREESAME is defined to consider
354 * only relevant parents, if any. If we are TREESAME to our on-graph parents,
355 * we don't care if we were !TREESAME to non-graph parents.
356 *
357 * Treating bottom commits as relevant ensures that a limited graph's
358 * connection to the actual bottom commit is not viewed as a side branch, but
359 * treated as part of the graph. For example:
360 *
361 * ....Z...A---X---o---o---B
362 * . /
363 * W---Y
364 *
365 * When computing "A..B", the A-X connection is at least as important as
366 * Y-X, despite A being flagged UNINTERESTING.
367 *
368 * And when computing --ancestry-path "A..B", the A-X connection is more
369 * important than Y-X, despite both A and Y being flagged UNINTERESTING.
370 */
371static inline int relevant_commit(struct commit *commit)
372{
373 return (commit->object.flags & (UNINTERESTING | BOTTOM)) != UNINTERESTING;
374}
375
376/*
377 * Return a single relevant commit from a parent list. If we are a TREESAME
378 * commit, and this selects one of our parents, then we can safely simplify to
379 * that parent.
380 */
381static struct commit *one_relevant_parent(const struct rev_info *revs,
382 struct commit_list *orig)
383{
384 struct commit_list *list = orig;
385 struct commit *relevant = NULL;
386
387 if (!orig)
388 return NULL;
389
390 /*
391 * For 1-parent commits, or if first-parent-only, then return that
392 * first parent (even if not "relevant" by the above definition).
393 * TREESAME will have been set purely on that parent.
394 */
395 if (revs->first_parent_only || !orig->next)
396 return orig->item;
397
398 /*
399 * For multi-parent commits, identify a sole relevant parent, if any.
400 * If we have only one relevant parent, then TREESAME will be set purely
401 * with regard to that parent, and we can simplify accordingly.
402 *
403 * If we have more than one relevant parent, or no relevant parents
404 * (and multiple irrelevant ones), then we can't select a parent here
405 * and return NULL.
406 */
407 while (list) {
408 struct commit *commit = list->item;
409 list = list->next;
410 if (relevant_commit(commit)) {
411 if (relevant)
412 return NULL;
413 relevant = commit;
414 }
415 }
416 return relevant;
417}
418
0a4ba7f8
JH
419/*
420 * The goal is to get REV_TREE_NEW as the result only if the
ceff8e7a
LT
421 * diff consists of all '+' (and no other changes), REV_TREE_OLD
422 * if the whole diff is removal of old data, and otherwise
423 * REV_TREE_DIFFERENT (of course if the trees are the same we
424 * want REV_TREE_SAME).
425 * That means that once we get to REV_TREE_DIFFERENT, we do not
426 * have to look any further.
0a4ba7f8 427 */
8efdc326 428static int tree_difference = REV_TREE_SAME;
a4a88b2b
LT
429
430static void file_add_remove(struct diff_options *options,
431 int addremove, unsigned mode,
432 const unsigned char *sha1,
e5450100 433 int sha1_valid,
e3d42c47 434 const char *fullpath, unsigned dirty_submodule)
a4a88b2b 435{
ceff8e7a 436 int diff = addremove == '+' ? REV_TREE_NEW : REV_TREE_OLD;
a4a88b2b 437
ceff8e7a 438 tree_difference |= diff;
dd47aa31 439 if (tree_difference == REV_TREE_DIFFERENT)
8f67f8ae 440 DIFF_OPT_SET(options, HAS_CHANGES);
a4a88b2b
LT
441}
442
443static void file_change(struct diff_options *options,
444 unsigned old_mode, unsigned new_mode,
445 const unsigned char *old_sha1,
446 const unsigned char *new_sha1,
e5450100 447 int old_sha1_valid, int new_sha1_valid,
e3d42c47
JL
448 const char *fullpath,
449 unsigned old_dirty_submodule, unsigned new_dirty_submodule)
a4a88b2b 450{
8efdc326 451 tree_difference = REV_TREE_DIFFERENT;
8f67f8ae 452 DIFF_OPT_SET(options, HAS_CHANGES);
a4a88b2b
LT
453}
454
ff5f5f26
MH
455static int rev_compare_tree(struct rev_info *revs,
456 struct commit *parent, struct commit *commit)
a4a88b2b 457{
3a5e8608
LT
458 struct tree *t1 = parent->tree;
459 struct tree *t2 = commit->tree;
460
a4a88b2b 461 if (!t1)
8efdc326 462 return REV_TREE_NEW;
ceff8e7a
LT
463 if (!t2)
464 return REV_TREE_OLD;
78892e32
LT
465
466 if (revs->simplify_by_decoration) {
467 /*
468 * If we are simplifying by decoration, then the commit
469 * is worth showing if it has a tag pointing at it.
470 */
471 if (lookup_decoration(&name_decoration, &commit->object))
472 return REV_TREE_DIFFERENT;
473 /*
474 * A commit that is not pointed by a tag is uninteresting
475 * if we are not limited by path. This means that you will
476 * see the usual "commits that touch the paths" plus any
477 * tagged commit by specifying both --simplify-by-decoration
478 * and pathspec.
479 */
afe069d1 480 if (!revs->prune_data.nr)
78892e32
LT
481 return REV_TREE_SAME;
482 }
ceff8e7a 483
8efdc326 484 tree_difference = REV_TREE_SAME;
8f67f8ae 485 DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES);
c4e05b1a 486 if (diff_tree_sha1(t1->object.sha1, t2->object.sha1, "",
cd2bdc53 487 &revs->pruning) < 0)
8efdc326 488 return REV_TREE_DIFFERENT;
a4a88b2b
LT
489 return tree_difference;
490}
491
3a5e8608 492static int rev_same_tree_as_empty(struct rev_info *revs, struct commit *commit)
a4a88b2b
LT
493{
494 int retval;
495 void *tree;
6fda5e51 496 unsigned long size;
a4a88b2b 497 struct tree_desc empty, real;
3a5e8608 498 struct tree *t1 = commit->tree;
a4a88b2b
LT
499
500 if (!t1)
501 return 0;
502
6fda5e51 503 tree = read_object_with_reference(t1->object.sha1, tree_type, &size, NULL);
a4a88b2b
LT
504 if (!tree)
505 return 0;
6fda5e51
LT
506 init_tree_desc(&real, tree, size);
507 init_tree_desc(&empty, "", 0);
a4a88b2b 508
0a4ba7f8 509 tree_difference = REV_TREE_SAME;
8f67f8ae 510 DIFF_OPT_CLR(&revs->pruning, HAS_CHANGES);
cd2bdc53 511 retval = diff_tree(&empty, &real, "", &revs->pruning);
a4a88b2b
LT
512 free(tree);
513
0a4ba7f8 514 return retval >= 0 && (tree_difference == REV_TREE_SAME);
a4a88b2b
LT
515}
516
d0af663e
KB
517struct treesame_state {
518 unsigned int nparents;
519 unsigned char treesame[FLEX_ARRAY];
520};
521
522static struct treesame_state *initialise_treesame(struct rev_info *revs, struct commit *commit)
523{
524 unsigned n = commit_list_count(commit->parents);
525 struct treesame_state *st = xcalloc(1, sizeof(*st) + n);
526 st->nparents = n;
527 add_decoration(&revs->treesame, &commit->object, st);
528 return st;
529}
530
531/*
532 * Must be called immediately after removing the nth_parent from a commit's
533 * parent list, if we are maintaining the per-parent treesame[] decoration.
534 * This does not recalculate the master TREESAME flag - update_treesame()
535 * should be called to update it after a sequence of treesame[] modifications
536 * that may have affected it.
537 */
538static int compact_treesame(struct rev_info *revs, struct commit *commit, unsigned nth_parent)
539{
540 struct treesame_state *st;
541 int old_same;
542
543 if (!commit->parents) {
544 /*
545 * Have just removed the only parent from a non-merge.
546 * Different handling, as we lack decoration.
547 */
548 if (nth_parent != 0)
549 die("compact_treesame %u", nth_parent);
550 old_same = !!(commit->object.flags & TREESAME);
551 if (rev_same_tree_as_empty(revs, commit))
552 commit->object.flags |= TREESAME;
553 else
554 commit->object.flags &= ~TREESAME;
555 return old_same;
556 }
557
558 st = lookup_decoration(&revs->treesame, &commit->object);
559 if (!st || nth_parent >= st->nparents)
560 die("compact_treesame %u", nth_parent);
561
562 old_same = st->treesame[nth_parent];
563 memmove(st->treesame + nth_parent,
564 st->treesame + nth_parent + 1,
565 st->nparents - nth_parent - 1);
566
567 /*
568 * If we've just become a non-merge commit, update TREESAME
569 * immediately, and remove the no-longer-needed decoration.
570 * If still a merge, defer update until update_treesame().
571 */
572 if (--st->nparents == 1) {
573 if (commit->parents->next)
574 die("compact_treesame parents mismatch");
575 if (st->treesame[0] && revs->dense)
576 commit->object.flags |= TREESAME;
577 else
578 commit->object.flags &= ~TREESAME;
579 free(add_decoration(&revs->treesame, &commit->object, NULL));
580 }
581
582 return old_same;
583}
584
585static unsigned update_treesame(struct rev_info *revs, struct commit *commit)
586{
587 if (commit->parents && commit->parents->next) {
588 unsigned n;
589 struct treesame_state *st;
4d826608
KB
590 struct commit_list *p;
591 unsigned relevant_parents;
592 unsigned relevant_change, irrelevant_change;
d0af663e
KB
593
594 st = lookup_decoration(&revs->treesame, &commit->object);
595 if (!st)
596 die("update_treesame %s", sha1_to_hex(commit->object.sha1));
4d826608
KB
597 relevant_parents = 0;
598 relevant_change = irrelevant_change = 0;
599 for (p = commit->parents, n = 0; p; n++, p = p->next) {
600 if (relevant_commit(p->item)) {
601 relevant_change |= !st->treesame[n];
602 relevant_parents++;
603 } else
604 irrelevant_change |= !st->treesame[n];
d0af663e 605 }
4d826608
KB
606 if (relevant_parents ? relevant_change : irrelevant_change)
607 commit->object.flags &= ~TREESAME;
608 else
609 commit->object.flags |= TREESAME;
d0af663e
KB
610 }
611
612 return commit->object.flags & TREESAME;
613}
614
4d826608
KB
615static inline int limiting_can_increase_treesame(const struct rev_info *revs)
616{
617 /*
618 * TREESAME is irrelevant unless prune && dense;
619 * if simplify_history is set, we can't have a mixture of TREESAME and
620 * !TREESAME INTERESTING parents (and we don't have treesame[]
621 * decoration anyway);
622 * if first_parent_only is set, then the TREESAME flag is locked
623 * against the first parent (and again we lack treesame[] decoration).
624 */
625 return revs->prune && revs->dense &&
626 !revs->simplify_history &&
627 !revs->first_parent_only;
628}
629
a4a88b2b
LT
630static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit)
631{
632 struct commit_list **pp, *parent;
d0af663e 633 struct treesame_state *ts = NULL;
4d826608
KB
634 int relevant_change = 0, irrelevant_change = 0;
635 int relevant_parents, nth_parent;
a4a88b2b 636
53b2c823
LT
637 /*
638 * If we don't do pruning, everything is interesting
639 */
7dc0fe3b 640 if (!revs->prune)
53b2c823 641 return;
53b2c823 642
a4a88b2b
LT
643 if (!commit->tree)
644 return;
645
646 if (!commit->parents) {
3a5e8608 647 if (rev_same_tree_as_empty(revs, commit))
7dc0fe3b 648 commit->object.flags |= TREESAME;
a4a88b2b
LT
649 return;
650 }
651
53b2c823
LT
652 /*
653 * Normal non-merge commit? If we don't want to make the
654 * history dense, we consider it always to be a change..
655 */
7dc0fe3b 656 if (!revs->dense && !commit->parents->next)
53b2c823 657 return;
53b2c823 658
4d826608 659 for (pp = &commit->parents, nth_parent = 0, relevant_parents = 0;
d0af663e
KB
660 (parent = *pp) != NULL;
661 pp = &parent->next, nth_parent++) {
a4a88b2b 662 struct commit *p = parent->item;
4d826608
KB
663 if (relevant_commit(p))
664 relevant_parents++;
a4a88b2b 665
d0af663e
KB
666 if (nth_parent == 1) {
667 /*
668 * This our second loop iteration - so we now know
669 * we're dealing with a merge.
670 *
671 * Do not compare with later parents when we care only about
672 * the first parent chain, in order to avoid derailing the
673 * traversal to follow a side branch that brought everything
674 * in the path we are limited to by the pathspec.
675 */
676 if (revs->first_parent_only)
677 break;
678 /*
679 * If this will remain a potentially-simplifiable
680 * merge, remember per-parent treesame if needed.
681 * Initialise the array with the comparison from our
682 * first iteration.
683 */
684 if (revs->treesame.name &&
685 !revs->simplify_history &&
686 !(commit->object.flags & UNINTERESTING)) {
687 ts = initialise_treesame(revs, commit);
4d826608 688 if (!(irrelevant_change || relevant_change))
d0af663e
KB
689 ts->treesame[0] = 1;
690 }
691 }
cc0e6c5a
AR
692 if (parse_commit(p) < 0)
693 die("cannot simplify commit %s (because of %s)",
694 sha1_to_hex(commit->object.sha1),
695 sha1_to_hex(p->object.sha1));
3a5e8608 696 switch (rev_compare_tree(revs, p, commit)) {
8efdc326 697 case REV_TREE_SAME:
141efdba 698 if (!revs->simplify_history || !relevant_commit(p)) {
f3219fbb
JH
699 /* Even if a merge with an uninteresting
700 * side branch brought the entire change
701 * we are interested in, we do not want
702 * to lose the other branches of this
703 * merge, so we just keep going.
704 */
d0af663e
KB
705 if (ts)
706 ts->treesame[nth_parent] = 1;
f3219fbb
JH
707 continue;
708 }
a4a88b2b
LT
709 parent->next = NULL;
710 commit->parents = parent;
7dc0fe3b 711 commit->object.flags |= TREESAME;
a4a88b2b
LT
712 return;
713
8efdc326
FK
714 case REV_TREE_NEW:
715 if (revs->remove_empty_trees &&
3a5e8608 716 rev_same_tree_as_empty(revs, p)) {
c348f31a
JH
717 /* We are adding all the specified
718 * paths from this parent, so the
719 * history beyond this parent is not
720 * interesting. Remove its parents
721 * (they are grandparents for us).
722 * IOW, we pretend this parent is a
723 * "root" commit.
a41e109c 724 */
cc0e6c5a
AR
725 if (parse_commit(p) < 0)
726 die("cannot simplify commit %s (invalid %s)",
727 sha1_to_hex(commit->object.sha1),
728 sha1_to_hex(p->object.sha1));
c348f31a 729 p->parents = NULL;
a4a88b2b
LT
730 }
731 /* fallthrough */
ceff8e7a 732 case REV_TREE_OLD:
8efdc326 733 case REV_TREE_DIFFERENT:
4d826608
KB
734 if (relevant_commit(p))
735 relevant_change = 1;
736 else
737 irrelevant_change = 1;
a4a88b2b
LT
738 continue;
739 }
740 die("bad tree compare for commit %s", sha1_to_hex(commit->object.sha1));
741 }
4d826608
KB
742
743 /*
744 * TREESAME is straightforward for single-parent commits. For merge
745 * commits, it is most useful to define it so that "irrelevant"
746 * parents cannot make us !TREESAME - if we have any relevant
747 * parents, then we only consider TREESAMEness with respect to them,
748 * allowing irrelevant merges from uninteresting branches to be
749 * simplified away. Only if we have only irrelevant parents do we
750 * base TREESAME on them. Note that this logic is replicated in
751 * update_treesame, which should be kept in sync.
752 */
753 if (relevant_parents ? !relevant_change : !irrelevant_change)
754 commit->object.flags |= TREESAME;
a4a88b2b
LT
755}
756
47e44ed1 757static void commit_list_insert_by_date_cached(struct commit *p, struct commit_list **head,
fce87ae5
AG
758 struct commit_list *cached_base, struct commit_list **cache)
759{
760 struct commit_list *new_entry;
761
762 if (cached_base && p->date < cached_base->item->date)
47e44ed1 763 new_entry = commit_list_insert_by_date(p, &cached_base->next);
fce87ae5 764 else
47e44ed1 765 new_entry = commit_list_insert_by_date(p, head);
fce87ae5
AG
766
767 if (cache && (!*cache || p->date < (*cache)->item->date))
768 *cache = new_entry;
769}
770
771static int add_parents_to_list(struct rev_info *revs, struct commit *commit,
772 struct commit_list **list, struct commit_list **cache_ptr)
a4a88b2b
LT
773{
774 struct commit_list *parent = commit->parents;
577ed5c2 775 unsigned left_flag;
fce87ae5 776 struct commit_list *cached_base = cache_ptr ? *cache_ptr : NULL;
a4a88b2b 777
3381c790 778 if (commit->object.flags & ADDED)
cc0e6c5a 779 return 0;
3381c790
LT
780 commit->object.flags |= ADDED;
781
a4a88b2b
LT
782 /*
783 * If the commit is uninteresting, don't try to
784 * prune parents - we want the maximal uninteresting
785 * set.
786 *
787 * Normally we haven't parsed the parent
788 * yet, so we won't have a parent of a parent
789 * here. However, it may turn out that we've
790 * reached this commit some other way (where it
791 * wasn't uninteresting), in which case we need
792 * to mark its parents recursively too..
793 */
794 if (commit->object.flags & UNINTERESTING) {
795 while (parent) {
796 struct commit *p = parent->item;
797 parent = parent->next;
aeeae1b7
JH
798 if (p)
799 p->object.flags |= UNINTERESTING;
cc0e6c5a 800 if (parse_commit(p) < 0)
aeeae1b7 801 continue;
a4a88b2b
LT
802 if (p->parents)
803 mark_parents_uninteresting(p);
804 if (p->object.flags & SEEN)
805 continue;
806 p->object.flags |= SEEN;
47e44ed1 807 commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr);
a4a88b2b 808 }
cc0e6c5a 809 return 0;
a4a88b2b
LT
810 }
811
812 /*
813 * Ok, the commit wasn't uninteresting. Try to
814 * simplify the commit history and find the parent
815 * that has no differences in the path set if one exists.
816 */
53b2c823 817 try_to_simplify_commit(revs, commit);
a4a88b2b 818
ba1d4505 819 if (revs->no_walk)
cc0e6c5a 820 return 0;
ba1d4505 821
577ed5c2 822 left_flag = (commit->object.flags & SYMMETRIC_LEFT);
0053e902 823
d9c292e8 824 for (parent = commit->parents; parent; parent = parent->next) {
a4a88b2b
LT
825 struct commit *p = parent->item;
826
cc0e6c5a
AR
827 if (parse_commit(p) < 0)
828 return -1;
0f3a290b
LT
829 if (revs->show_source && !p->util)
830 p->util = commit->util;
577ed5c2 831 p->object.flags |= left_flag;
ad1012eb
LH
832 if (!(p->object.flags & SEEN)) {
833 p->object.flags |= SEEN;
47e44ed1 834 commit_list_insert_by_date_cached(p, list, cached_base, cache_ptr);
ad1012eb 835 }
60d30b02 836 if (revs->first_parent_only)
d9c292e8 837 break;
a4a88b2b 838 }
cc0e6c5a 839 return 0;
a4a88b2b
LT
840}
841
36d56de6 842static void cherry_pick_list(struct commit_list *list, struct rev_info *revs)
d7a17cad
JH
843{
844 struct commit_list *p;
845 int left_count = 0, right_count = 0;
846 int left_first;
847 struct patch_ids ids;
adbbb31e 848 unsigned cherry_flag;
d7a17cad
JH
849
850 /* First count the commits on the left and on the right */
851 for (p = list; p; p = p->next) {
852 struct commit *commit = p->item;
853 unsigned flags = commit->object.flags;
854 if (flags & BOUNDARY)
855 ;
856 else if (flags & SYMMETRIC_LEFT)
857 left_count++;
858 else
859 right_count++;
860 }
861
36c07975
TR
862 if (!left_count || !right_count)
863 return;
864
d7a17cad
JH
865 left_first = left_count < right_count;
866 init_patch_ids(&ids);
66f13625 867 ids.diffopts.pathspec = revs->diffopt.pathspec;
d7a17cad
JH
868
869 /* Compute patch-ids for one side */
870 for (p = list; p; p = p->next) {
871 struct commit *commit = p->item;
872 unsigned flags = commit->object.flags;
873
874 if (flags & BOUNDARY)
875 continue;
876 /*
877 * If we have fewer left, left_first is set and we omit
878 * commits on the right branch in this loop. If we have
879 * fewer right, we skip the left ones.
880 */
881 if (left_first != !!(flags & SYMMETRIC_LEFT))
882 continue;
883 commit->util = add_commit_patch_id(commit, &ids);
884 }
885
adbbb31e
MG
886 /* either cherry_mark or cherry_pick are true */
887 cherry_flag = revs->cherry_mark ? PATCHSAME : SHOWN;
888
d7a17cad
JH
889 /* Check the other side */
890 for (p = list; p; p = p->next) {
891 struct commit *commit = p->item;
892 struct patch_id *id;
893 unsigned flags = commit->object.flags;
894
895 if (flags & BOUNDARY)
896 continue;
897 /*
898 * If we have fewer left, left_first is set and we omit
899 * commits on the left branch in this loop.
900 */
901 if (left_first == !!(flags & SYMMETRIC_LEFT))
902 continue;
903
904 /*
905 * Have we seen the same patch id?
906 */
907 id = has_commit_patch_id(commit, &ids);
908 if (!id)
909 continue;
910 id->seen = 1;
adbbb31e 911 commit->object.flags |= cherry_flag;
d7a17cad
JH
912 }
913
914 /* Now check the original side for seen ones */
915 for (p = list; p; p = p->next) {
916 struct commit *commit = p->item;
917 struct patch_id *ent;
918
919 ent = commit->util;
920 if (!ent)
921 continue;
922 if (ent->seen)
adbbb31e 923 commit->object.flags |= cherry_flag;
d7a17cad
JH
924 commit->util = NULL;
925 }
926
927 free_patch_ids(&ids);
928}
929
7d004199
LT
930/* How many extra uninteresting commits we want to see.. */
931#define SLOP 5
932
933static int still_interesting(struct commit_list *src, unsigned long date, int slop)
3131b713 934{
7d004199
LT
935 /*
936 * No source list at all? We're definitely done..
937 */
938 if (!src)
939 return 0;
940
941 /*
942 * Does the destination list contain entries with a date
943 * before the source list? Definitely _not_ done.
944 */
c19d1b4e 945 if (date <= src->item->date)
7d004199
LT
946 return SLOP;
947
948 /*
949 * Does the source list still have interesting commits in
950 * it? Definitely not done..
951 */
952 if (!everybody_uninteresting(src))
953 return SLOP;
954
955 /* Ok, we're closing in.. */
956 return slop-1;
3131b713
LT
957}
958
ebdc94f3
JH
959/*
960 * "rev-list --ancestry-path A..B" computes commits that are ancestors
961 * of B but not ancestors of A but further limits the result to those
962 * that are descendants of A. This takes the list of bottom commits and
963 * the result of "A..B" without --ancestry-path, and limits the latter
964 * further to the ones that can reach one of the commits in "bottom".
965 */
966static void limit_to_ancestry(struct commit_list *bottom, struct commit_list *list)
967{
968 struct commit_list *p;
969 struct commit_list *rlist = NULL;
970 int made_progress;
971
972 /*
973 * Reverse the list so that it will be likely that we would
974 * process parents before children.
975 */
976 for (p = list; p; p = p->next)
977 commit_list_insert(p->item, &rlist);
978
979 for (p = bottom; p; p = p->next)
980 p->item->object.flags |= TMP_MARK;
981
982 /*
983 * Mark the ones that can reach bottom commits in "list",
984 * in a bottom-up fashion.
985 */
986 do {
987 made_progress = 0;
988 for (p = rlist; p; p = p->next) {
989 struct commit *c = p->item;
990 struct commit_list *parents;
991 if (c->object.flags & (TMP_MARK | UNINTERESTING))
992 continue;
993 for (parents = c->parents;
994 parents;
995 parents = parents->next) {
996 if (!(parents->item->object.flags & TMP_MARK))
997 continue;
998 c->object.flags |= TMP_MARK;
999 made_progress = 1;
1000 break;
1001 }
1002 }
1003 } while (made_progress);
1004
1005 /*
1006 * NEEDSWORK: decide if we want to remove parents that are
1007 * not marked with TMP_MARK from commit->parents for commits
1008 * in the resulting list. We may not want to do that, though.
1009 */
1010
1011 /*
1012 * The ones that are not marked with TMP_MARK are uninteresting
1013 */
1014 for (p = list; p; p = p->next) {
1015 struct commit *c = p->item;
1016 if (c->object.flags & TMP_MARK)
1017 continue;
1018 c->object.flags |= UNINTERESTING;
1019 }
1020
1021 /* We are done with the TMP_MARK */
1022 for (p = list; p; p = p->next)
1023 p->item->object.flags &= ~TMP_MARK;
1024 for (p = bottom; p; p = p->next)
1025 p->item->object.flags &= ~TMP_MARK;
1026 free_commit_list(rlist);
1027}
1028
1029/*
1030 * Before walking the history, keep the set of "negative" refs the
1031 * caller has asked to exclude.
1032 *
1033 * This is used to compute "rev-list --ancestry-path A..B", as we need
1034 * to filter the result of "A..B" further to the ones that can actually
1035 * reach A.
1036 */
7f34a46f 1037static struct commit_list *collect_bottom_commits(struct commit_list *list)
ebdc94f3 1038{
7f34a46f
KB
1039 struct commit_list *elem, *bottom = NULL;
1040 for (elem = list; elem; elem = elem->next)
1041 if (elem->item->object.flags & BOTTOM)
1042 commit_list_insert(elem->item, &bottom);
ebdc94f3
JH
1043 return bottom;
1044}
1045
60adf7d7
MG
1046/* Assumes either left_only or right_only is set */
1047static void limit_left_right(struct commit_list *list, struct rev_info *revs)
1048{
1049 struct commit_list *p;
1050
1051 for (p = list; p; p = p->next) {
1052 struct commit *commit = p->item;
1053
1054 if (revs->right_only) {
1055 if (commit->object.flags & SYMMETRIC_LEFT)
1056 commit->object.flags |= SHOWN;
1057 } else /* revs->left_only is set */
1058 if (!(commit->object.flags & SYMMETRIC_LEFT))
1059 commit->object.flags |= SHOWN;
1060 }
1061}
1062
cc0e6c5a 1063static int limit_list(struct rev_info *revs)
a4a88b2b 1064{
7d004199
LT
1065 int slop = SLOP;
1066 unsigned long date = ~0ul;
a4a88b2b
LT
1067 struct commit_list *list = revs->commits;
1068 struct commit_list *newlist = NULL;
1069 struct commit_list **p = &newlist;
ebdc94f3
JH
1070 struct commit_list *bottom = NULL;
1071
1072 if (revs->ancestry_path) {
7f34a46f 1073 bottom = collect_bottom_commits(list);
ebdc94f3 1074 if (!bottom)
97b03c35 1075 die("--ancestry-path given but there are no bottom commits");
ebdc94f3 1076 }
a4a88b2b
LT
1077
1078 while (list) {
1079 struct commit_list *entry = list;
1080 struct commit *commit = list->item;
1081 struct object *obj = &commit->object;
cdcefbc9 1082 show_early_output_fn_t show;
a4a88b2b
LT
1083
1084 list = list->next;
1085 free(entry);
1086
1087 if (revs->max_age != -1 && (commit->date < revs->max_age))
1088 obj->flags |= UNINTERESTING;
fce87ae5 1089 if (add_parents_to_list(revs, commit, &list, NULL) < 0)
cc0e6c5a 1090 return -1;
a4a88b2b
LT
1091 if (obj->flags & UNINTERESTING) {
1092 mark_parents_uninteresting(commit);
7d004199
LT
1093 if (revs->show_all)
1094 p = &commit_list_insert(commit, p)->next;
1095 slop = still_interesting(list, date, slop);
1096 if (slop)
3131b713 1097 continue;
7d004199
LT
1098 /* If showing all, add the whole pending list to the end */
1099 if (revs->show_all)
1100 *p = list;
1101 break;
a4a88b2b
LT
1102 }
1103 if (revs->min_age != -1 && (commit->date > revs->min_age))
1104 continue;
7d004199 1105 date = commit->date;
a4a88b2b 1106 p = &commit_list_insert(commit, p)->next;
cdcefbc9
LT
1107
1108 show = show_early_output;
1109 if (!show)
1110 continue;
1111
1112 show(revs, newlist);
1113 show_early_output = NULL;
a4a88b2b 1114 }
adbbb31e 1115 if (revs->cherry_pick || revs->cherry_mark)
36d56de6 1116 cherry_pick_list(newlist, revs);
d7a17cad 1117
60adf7d7
MG
1118 if (revs->left_only || revs->right_only)
1119 limit_left_right(newlist, revs);
1120
ebdc94f3
JH
1121 if (bottom) {
1122 limit_to_ancestry(bottom, newlist);
1123 free_commit_list(bottom);
1124 }
1125
4d826608
KB
1126 /*
1127 * Check if any commits have become TREESAME by some of their parents
1128 * becoming UNINTERESTING.
1129 */
1130 if (limiting_can_increase_treesame(revs))
1131 for (list = newlist; list; list = list->next) {
1132 struct commit *c = list->item;
1133 if (c->object.flags & (UNINTERESTING | TREESAME))
1134 continue;
1135 update_treesame(revs, c);
1136 }
1137
a4a88b2b 1138 revs->commits = newlist;
cc0e6c5a 1139 return 0;
a4a88b2b
LT
1140}
1141
df835d3a
MH
1142/*
1143 * Add an entry to refs->cmdline with the specified information.
1144 * *name is copied.
1145 */
281eee47
JH
1146static void add_rev_cmdline(struct rev_info *revs,
1147 struct object *item,
1148 const char *name,
1149 int whence,
1150 unsigned flags)
1151{
1152 struct rev_cmdline_info *info = &revs->cmdline;
1153 int nr = info->nr;
1154
1155 ALLOC_GROW(info->rev, nr + 1, info->alloc);
1156 info->rev[nr].item = item;
df835d3a 1157 info->rev[nr].name = xstrdup(name);
281eee47
JH
1158 info->rev[nr].whence = whence;
1159 info->rev[nr].flags = flags;
1160 info->nr++;
1161}
1162
a765499a
KB
1163static void add_rev_cmdline_list(struct rev_info *revs,
1164 struct commit_list *commit_list,
1165 int whence,
1166 unsigned flags)
1167{
1168 while (commit_list) {
1169 struct object *object = &commit_list->item->object;
1170 add_rev_cmdline(revs, object, sha1_to_hex(object->sha1),
1171 whence, flags);
1172 commit_list = commit_list->next;
1173 }
1174}
1175
63049292
JH
1176struct all_refs_cb {
1177 int all_flags;
71b03b42 1178 int warned_bad_reflog;
63049292
JH
1179 struct rev_info *all_revs;
1180 const char *name_for_errormsg;
1181};
ae563542 1182
e7b432c5
JH
1183static int ref_excluded(struct rev_info *revs, const char *path)
1184{
1185 struct string_list_item *item;
1186
1187 if (!revs->ref_excludes)
1188 return 0;
1189 for_each_string_list_item(item, revs->ref_excludes) {
1190 if (!fnmatch(item->string, path, 0))
1191 return 1;
1192 }
1193 return 0;
1194}
1195
8da19775 1196static int handle_one_ref(const char *path, const unsigned char *sha1, int flag, void *cb_data)
ae563542 1197{
63049292 1198 struct all_refs_cb *cb = cb_data;
e7b432c5
JH
1199 struct object *object;
1200
1201 if (ref_excluded(cb->all_revs, path))
1202 return 0;
1203
1204 object = get_reference(cb->all_revs, path, sha1, cb->all_flags);
281eee47 1205 add_rev_cmdline(cb->all_revs, object, path, REV_CMD_REF, cb->all_flags);
26c3177e 1206 add_pending_sha1(cb->all_revs, path, sha1, cb->all_flags);
ae563542
LT
1207 return 0;
1208}
1209
d08bae7e
IL
1210static void init_all_refs_cb(struct all_refs_cb *cb, struct rev_info *revs,
1211 unsigned flags)
1212{
1213 cb->all_revs = revs;
1214 cb->all_flags = flags;
1215}
1216
e7b432c5
JH
1217static void clear_ref_exclusion(struct rev_info *revs)
1218{
1219 if (revs->ref_excludes) {
1220 string_list_clear(revs->ref_excludes, 0);
1221 free(revs->ref_excludes);
1222 }
1223 revs->ref_excludes = NULL;
1224}
1225
1226static void add_ref_exclusion(struct rev_info *revs, const char *exclude)
1227{
1228 if (!revs->ref_excludes) {
1229 revs->ref_excludes = xcalloc(1, sizeof(*revs->ref_excludes));
1230 revs->ref_excludes->strdup_strings = 1;
1231 }
1232 string_list_append(revs->ref_excludes, exclude);
1233}
1234
9ef6aeb0
HV
1235static void handle_refs(const char *submodule, struct rev_info *revs, unsigned flags,
1236 int (*for_each)(const char *, each_ref_fn, void *))
ae563542 1237{
63049292 1238 struct all_refs_cb cb;
d08bae7e 1239 init_all_refs_cb(&cb, revs, flags);
9ef6aeb0 1240 for_each(submodule, handle_one_ref, &cb);
63049292
JH
1241}
1242
71b03b42 1243static void handle_one_reflog_commit(unsigned char *sha1, void *cb_data)
63049292
JH
1244{
1245 struct all_refs_cb *cb = cb_data;
71b03b42
SP
1246 if (!is_null_sha1(sha1)) {
1247 struct object *o = parse_object(sha1);
1248 if (o) {
1249 o->flags |= cb->all_flags;
281eee47 1250 /* ??? CMDLINEFLAGS ??? */
71b03b42
SP
1251 add_pending_object(cb->all_revs, o, "");
1252 }
1253 else if (!cb->warned_bad_reflog) {
46efd2d9 1254 warning("reflog of '%s' references pruned commits",
71b03b42
SP
1255 cb->name_for_errormsg);
1256 cb->warned_bad_reflog = 1;
1257 }
63049292 1258 }
71b03b42
SP
1259}
1260
883d60fa
JS
1261static int handle_one_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
1262 const char *email, unsigned long timestamp, int tz,
1263 const char *message, void *cb_data)
71b03b42
SP
1264{
1265 handle_one_reflog_commit(osha1, cb_data);
1266 handle_one_reflog_commit(nsha1, cb_data);
63049292
JH
1267 return 0;
1268}
1269
1270static int handle_one_reflog(const char *path, const unsigned char *sha1, int flag, void *cb_data)
1271{
1272 struct all_refs_cb *cb = cb_data;
71b03b42 1273 cb->warned_bad_reflog = 0;
63049292
JH
1274 cb->name_for_errormsg = path;
1275 for_each_reflog_ent(path, handle_one_reflog_ent, cb_data);
1276 return 0;
1277}
1278
1279static void handle_reflog(struct rev_info *revs, unsigned flags)
1280{
1281 struct all_refs_cb cb;
1282 cb.all_revs = revs;
1283 cb.all_flags = flags;
25b51e2c 1284 for_each_reflog(handle_one_reflog, &cb);
ae563542
LT
1285}
1286
281eee47 1287static int add_parents_only(struct rev_info *revs, const char *arg_, int flags)
ea4a19e1
JH
1288{
1289 unsigned char sha1[20];
1290 struct object *it;
1291 struct commit *commit;
1292 struct commit_list *parents;
281eee47 1293 const char *arg = arg_;
ea4a19e1
JH
1294
1295 if (*arg == '^') {
7f34a46f 1296 flags ^= UNINTERESTING | BOTTOM;
ea4a19e1
JH
1297 arg++;
1298 }
cd74e473 1299 if (get_sha1_committish(arg, sha1))
ea4a19e1
JH
1300 return 0;
1301 while (1) {
1302 it = get_reference(revs, arg, sha1, 0);
cc243c3c
JH
1303 if (!it && revs->ignore_missing)
1304 return 0;
1974632c 1305 if (it->type != OBJ_TAG)
ea4a19e1 1306 break;
9684afd9
MK
1307 if (!((struct tag*)it)->tagged)
1308 return 0;
e702496e 1309 hashcpy(sha1, ((struct tag*)it)->tagged->sha1);
ea4a19e1 1310 }
1974632c 1311 if (it->type != OBJ_COMMIT)
ea4a19e1
JH
1312 return 0;
1313 commit = (struct commit *)it;
1314 for (parents = commit->parents; parents; parents = parents->next) {
1315 it = &parents->item->object;
1316 it->flags |= flags;
281eee47 1317 add_rev_cmdline(revs, it, arg_, REV_CMD_PARENTS_ONLY, flags);
ea4a19e1
JH
1318 add_pending_object(revs, it, arg);
1319 }
1320 return 1;
1321}
1322
db6296a5 1323void init_revisions(struct rev_info *revs, const char *prefix)
8efdc326
FK
1324{
1325 memset(revs, 0, sizeof(*revs));
8e8f9987 1326
6b9c58f4 1327 revs->abbrev = DEFAULT_ABBREV;
8e8f9987 1328 revs->ignore_merges = 1;
9202434c 1329 revs->simplify_history = 1;
8f67f8ae 1330 DIFF_OPT_SET(&revs->pruning, RECURSIVE);
90b19941 1331 DIFF_OPT_SET(&revs->pruning, QUICK);
cd2bdc53
LT
1332 revs->pruning.add_remove = file_add_remove;
1333 revs->pruning.change = file_change;
08f704f2 1334 revs->sort_order = REV_SORT_IN_GRAPH_ORDER;
8efdc326 1335 revs->dense = 1;
db6296a5 1336 revs->prefix = prefix;
8efdc326
FK
1337 revs->max_age = -1;
1338 revs->min_age = -1;
d5db6c9e 1339 revs->skip_count = -1;
8efdc326 1340 revs->max_count = -1;
ad5aeede 1341 revs->max_parents = -1;
8efdc326 1342
cd2bdc53
LT
1343 revs->commit_format = CMIT_FMT_DEFAULT;
1344
918d4e1c
JH
1345 init_grep_defaults();
1346 grep_init(&revs->grep_filter, prefix);
0843acfd 1347 revs->grep_filter.status_only = 1;
0843acfd
JK
1348 revs->grep_filter.regflags = REG_NEWLINE;
1349
cd2bdc53 1350 diff_setup(&revs->diffopt);
c0cb4a06 1351 if (prefix && !revs->diffopt.prefix) {
cd676a51
JH
1352 revs->diffopt.prefix = prefix;
1353 revs->diffopt.prefix_length = strlen(prefix);
1354 }
3a03cf6b
JK
1355
1356 revs->notes_opt.use_default_notes = -1;
8efdc326
FK
1357}
1358
0d2c9d67
RS
1359static void add_pending_commit_list(struct rev_info *revs,
1360 struct commit_list *commit_list,
1361 unsigned int flags)
1362{
1363 while (commit_list) {
1364 struct object *object = &commit_list->item->object;
1365 object->flags |= flags;
1366 add_pending_object(revs, object, sha1_to_hex(object->sha1));
1367 commit_list = commit_list->next;
1368 }
1369}
1370
ae3e5e1e
JH
1371static void prepare_show_merge(struct rev_info *revs)
1372{
1373 struct commit_list *bases;
1374 struct commit *head, *other;
1375 unsigned char sha1[20];
1376 const char **prune = NULL;
1377 int i, prune_num = 1; /* counting terminating NULL */
1378
baf18fc2 1379 if (get_sha1("HEAD", sha1))
ae3e5e1e 1380 die("--merge without HEAD?");
baf18fc2
NTND
1381 head = lookup_commit_or_die(sha1, "HEAD");
1382 if (get_sha1("MERGE_HEAD", sha1))
ae3e5e1e 1383 die("--merge without MERGE_HEAD?");
baf18fc2 1384 other = lookup_commit_or_die(sha1, "MERGE_HEAD");
ae3e5e1e
JH
1385 add_pending_object(revs, &head->object, "HEAD");
1386 add_pending_object(revs, &other->object, "MERGE_HEAD");
1387 bases = get_merge_bases(head, other, 1);
7f34a46f
KB
1388 add_rev_cmdline_list(revs, bases, REV_CMD_MERGE_BASE, UNINTERESTING | BOTTOM);
1389 add_pending_commit_list(revs, bases, UNINTERESTING | BOTTOM);
e82447b1
JH
1390 free_commit_list(bases);
1391 head->object.flags |= SYMMETRIC_LEFT;
ae3e5e1e
JH
1392
1393 if (!active_nr)
1394 read_cache();
1395 for (i = 0; i < active_nr; i++) {
9c5e6c80 1396 const struct cache_entry *ce = active_cache[i];
ae3e5e1e
JH
1397 if (!ce_stage(ce))
1398 continue;
eb9cb55b 1399 if (ce_path_match(ce, &revs->prune_data)) {
ae3e5e1e
JH
1400 prune_num++;
1401 prune = xrealloc(prune, sizeof(*prune) * prune_num);
1402 prune[prune_num-2] = ce->name;
1403 prune[prune_num-1] = NULL;
1404 }
1405 while ((i+1 < active_nr) &&
1406 ce_same_name(ce, active_cache[i+1]))
1407 i++;
1408 }
afe069d1
NTND
1409 free_pathspec(&revs->prune_data);
1410 init_pathspec(&revs->prune_data, prune);
e82447b1 1411 revs->limited = 1;
ae3e5e1e
JH
1412}
1413
8e676e8b 1414int handle_revision_arg(const char *arg_, struct rev_info *revs, int flags, unsigned revarg_opt)
5d6f0935 1415{
249c8f4a 1416 struct object_context oc;
5d6f0935
JH
1417 char *dotdot;
1418 struct object *object;
1419 unsigned char sha1[20];
1420 int local_flags;
281eee47 1421 const char *arg = arg_;
8e676e8b 1422 int cant_be_filename = revarg_opt & REVARG_CANNOT_BE_FILENAME;
d5f6b1d7 1423 unsigned get_sha1_flags = 0;
5d6f0935 1424
7f34a46f
KB
1425 flags = flags & UNINTERESTING ? flags | BOTTOM : flags & ~BOTTOM;
1426
5d6f0935
JH
1427 dotdot = strstr(arg, "..");
1428 if (dotdot) {
1429 unsigned char from_sha1[20];
1430 const char *next = dotdot + 2;
1431 const char *this = arg;
1432 int symmetric = *next == '.';
7f34a46f 1433 unsigned int flags_exclude = flags ^ (UNINTERESTING | BOTTOM);
003c84f6 1434 static const char head_by_default[] = "HEAD";
281eee47 1435 unsigned int a_flags;
5d6f0935
JH
1436
1437 *dotdot = 0;
1438 next += symmetric;
1439
1440 if (!*next)
003c84f6 1441 next = head_by_default;
5d6f0935 1442 if (dotdot == arg)
003c84f6
JH
1443 this = head_by_default;
1444 if (this == head_by_default && next == head_by_default &&
1445 !symmetric) {
1446 /*
1447 * Just ".."? That is not a range but the
1448 * pathspec for the parent directory.
1449 */
1450 if (!cant_be_filename) {
1451 *dotdot = '.';
1452 return -1;
1453 }
1454 }
cd74e473
JH
1455 if (!get_sha1_committish(this, from_sha1) &&
1456 !get_sha1_committish(next, sha1)) {
5d6f0935
JH
1457 struct commit *a, *b;
1458 struct commit_list *exclude;
1459
1460 a = lookup_commit_reference(from_sha1);
1461 b = lookup_commit_reference(sha1);
1462 if (!a || !b) {
cc243c3c
JH
1463 if (revs->ignore_missing)
1464 return 0;
5d6f0935
JH
1465 die(symmetric ?
1466 "Invalid symmetric difference expression %s...%s" :
1467 "Invalid revision range %s..%s",
1468 arg, next);
1469 }
1470
1471 if (!cant_be_filename) {
1472 *dotdot = '.';
1473 verify_non_filename(revs->prefix, arg);
1474 }
1475
1476 if (symmetric) {
1477 exclude = get_merge_bases(a, b, 1);
a765499a
KB
1478 add_rev_cmdline_list(revs, exclude,
1479 REV_CMD_MERGE_BASE,
1480 flags_exclude);
5d6f0935
JH
1481 add_pending_commit_list(revs, exclude,
1482 flags_exclude);
1483 free_commit_list(exclude);
281eee47 1484 a_flags = flags | SYMMETRIC_LEFT;
5d6f0935 1485 } else
281eee47
JH
1486 a_flags = flags_exclude;
1487 a->object.flags |= a_flags;
5d6f0935 1488 b->object.flags |= flags;
281eee47
JH
1489 add_rev_cmdline(revs, &a->object, this,
1490 REV_CMD_LEFT, a_flags);
1491 add_rev_cmdline(revs, &b->object, next,
1492 REV_CMD_RIGHT, flags);
5d6f0935
JH
1493 add_pending_object(revs, &a->object, this);
1494 add_pending_object(revs, &b->object, next);
1495 return 0;
1496 }
1497 *dotdot = '.';
1498 }
1499 dotdot = strstr(arg, "^@");
1500 if (dotdot && !dotdot[2]) {
1501 *dotdot = 0;
1502 if (add_parents_only(revs, arg, flags))
1503 return 0;
1504 *dotdot = '^';
1505 }
62476c8e
JH
1506 dotdot = strstr(arg, "^!");
1507 if (dotdot && !dotdot[2]) {
1508 *dotdot = 0;
7f34a46f 1509 if (!add_parents_only(revs, arg, flags ^ (UNINTERESTING | BOTTOM)))
62476c8e
JH
1510 *dotdot = '^';
1511 }
1512
5d6f0935
JH
1513 local_flags = 0;
1514 if (*arg == '^') {
7f34a46f 1515 local_flags = UNINTERESTING | BOTTOM;
5d6f0935
JH
1516 arg++;
1517 }
d5f6b1d7
JH
1518
1519 if (revarg_opt & REVARG_COMMITTISH)
1520 get_sha1_flags = GET_SHA1_COMMITTISH;
1521
1522 if (get_sha1_with_context(arg, get_sha1_flags, sha1, &oc))
cc243c3c 1523 return revs->ignore_missing ? 0 : -1;
5d6f0935
JH
1524 if (!cant_be_filename)
1525 verify_non_filename(revs->prefix, arg);
1526 object = get_reference(revs, arg, sha1, flags ^ local_flags);
281eee47 1527 add_rev_cmdline(revs, object, arg_, REV_CMD_REV, flags ^ local_flags);
249c8f4a 1528 add_pending_object_with_mode(revs, object, arg, oc.mode);
5d6f0935
JH
1529 return 0;
1530}
1531
4da5af31
JH
1532struct cmdline_pathspec {
1533 int alloc;
1534 int nr;
1535 const char **path;
1536};
1fc561d1 1537
4da5af31
JH
1538static void append_prune_data(struct cmdline_pathspec *prune, const char **av)
1539{
1540 while (*av) {
1541 ALLOC_GROW(prune->path, prune->nr+1, prune->alloc);
1542 prune->path[prune->nr++] = *(av++);
1543 }
1544}
60da8b15 1545
4da5af31
JH
1546static void read_pathspec_from_stdin(struct rev_info *revs, struct strbuf *sb,
1547 struct cmdline_pathspec *prune)
1548{
60da8b15
JH
1549 while (strbuf_getwholeline(sb, stdin, '\n') != EOF) {
1550 int len = sb->len;
1551 if (len && sb->buf[len - 1] == '\n')
1552 sb->buf[--len] = '\0';
4da5af31
JH
1553 ALLOC_GROW(prune->path, prune->nr+1, prune->alloc);
1554 prune->path[prune->nr++] = xstrdup(sb->buf);
60da8b15 1555 }
60da8b15
JH
1556}
1557
4da5af31
JH
1558static void read_revisions_from_stdin(struct rev_info *revs,
1559 struct cmdline_pathspec *prune)
1fc561d1 1560{
63d564b3 1561 struct strbuf sb;
60da8b15 1562 int seen_dashdash = 0;
1fc561d1 1563
63d564b3
JH
1564 strbuf_init(&sb, 1000);
1565 while (strbuf_getwholeline(&sb, stdin, '\n') != EOF) {
1566 int len = sb.len;
1567 if (len && sb.buf[len - 1] == '\n')
1568 sb.buf[--len] = '\0';
1fc561d1
AB
1569 if (!len)
1570 break;
60da8b15
JH
1571 if (sb.buf[0] == '-') {
1572 if (len == 2 && sb.buf[1] == '-') {
1573 seen_dashdash = 1;
1574 break;
1575 }
1fc561d1 1576 die("options not supported in --stdin mode");
60da8b15 1577 }
31faeb20 1578 if (handle_revision_arg(sb.buf, revs, 0,
70d26c6e 1579 REVARG_CANNOT_BE_FILENAME))
63d564b3 1580 die("bad revision '%s'", sb.buf);
1fc561d1 1581 }
60da8b15
JH
1582 if (seen_dashdash)
1583 read_pathspec_from_stdin(revs, &sb, prune);
63d564b3 1584 strbuf_release(&sb);
1fc561d1
AB
1585}
1586
2d10c555 1587static void add_grep(struct rev_info *revs, const char *ptn, enum grep_pat_token what)
bd95fcd3 1588{
0843acfd 1589 append_grep_pattern(&revs->grep_filter, ptn, "command line", 0, what);
2d10c555
JH
1590}
1591
a4d7d2c6 1592static void add_header_grep(struct rev_info *revs, enum grep_header_field field, const char *pattern)
2d10c555 1593{
a4d7d2c6 1594 append_header_grep_pattern(&revs->grep_filter, field, pattern);
bd95fcd3
JH
1595}
1596
1597static void add_message_grep(struct rev_info *revs, const char *pattern)
1598{
2d10c555 1599 add_grep(revs, pattern, GREP_PATTERN_BODY);
bd95fcd3
JH
1600}
1601
6b61ec05
PH
1602static int handle_revision_opt(struct rev_info *revs, int argc, const char **argv,
1603 int *unkc, const char **unkv)
02e54220
PH
1604{
1605 const char *arg = argv[0];
7d7b86f7
MM
1606 const char *optarg;
1607 int argcount;
02e54220
PH
1608
1609 /* pseudo revision arguments */
1610 if (!strcmp(arg, "--all") || !strcmp(arg, "--branches") ||
1611 !strcmp(arg, "--tags") || !strcmp(arg, "--remotes") ||
1612 !strcmp(arg, "--reflog") || !strcmp(arg, "--not") ||
ad3f9a71 1613 !strcmp(arg, "--no-walk") || !strcmp(arg, "--do-walk") ||
0fc63ec4
JN
1614 !strcmp(arg, "--bisect") || !prefixcmp(arg, "--glob=") ||
1615 !prefixcmp(arg, "--branches=") || !prefixcmp(arg, "--tags=") ||
ca92e59e 1616 !prefixcmp(arg, "--remotes=") || !prefixcmp(arg, "--no-walk="))
02e54220
PH
1617 {
1618 unkv[(*unkc)++] = arg;
0fe8c138 1619 return 1;
02e54220
PH
1620 }
1621
7d7b86f7
MM
1622 if ((argcount = parse_long_opt("max-count", argv, &optarg))) {
1623 revs->max_count = atoi(optarg);
5853caec 1624 revs->no_walk = 0;
7d7b86f7
MM
1625 return argcount;
1626 } else if ((argcount = parse_long_opt("skip", argv, &optarg))) {
1627 revs->skip_count = atoi(optarg);
1628 return argcount;
02e54220
PH
1629 } else if ((*arg == '-') && isdigit(arg[1])) {
1630 /* accept -<digit>, like traditional "head" */
1631 revs->max_count = atoi(arg + 1);
5853caec 1632 revs->no_walk = 0;
02e54220
PH
1633 } else if (!strcmp(arg, "-n")) {
1634 if (argc <= 1)
1635 return error("-n requires an argument");
1636 revs->max_count = atoi(argv[1]);
5853caec 1637 revs->no_walk = 0;
02e54220
PH
1638 return 2;
1639 } else if (!prefixcmp(arg, "-n")) {
1640 revs->max_count = atoi(arg + 2);
5853caec 1641 revs->no_walk = 0;
7d7b86f7
MM
1642 } else if ((argcount = parse_long_opt("max-age", argv, &optarg))) {
1643 revs->max_age = atoi(optarg);
1644 return argcount;
1645 } else if ((argcount = parse_long_opt("since", argv, &optarg))) {
1646 revs->max_age = approxidate(optarg);
1647 return argcount;
1648 } else if ((argcount = parse_long_opt("after", argv, &optarg))) {
1649 revs->max_age = approxidate(optarg);
1650 return argcount;
1651 } else if ((argcount = parse_long_opt("min-age", argv, &optarg))) {
1652 revs->min_age = atoi(optarg);
1653 return argcount;
1654 } else if ((argcount = parse_long_opt("before", argv, &optarg))) {
1655 revs->min_age = approxidate(optarg);
1656 return argcount;
1657 } else if ((argcount = parse_long_opt("until", argv, &optarg))) {
1658 revs->min_age = approxidate(optarg);
1659 return argcount;
02e54220
PH
1660 } else if (!strcmp(arg, "--first-parent")) {
1661 revs->first_parent_only = 1;
ebdc94f3
JH
1662 } else if (!strcmp(arg, "--ancestry-path")) {
1663 revs->ancestry_path = 1;
cb7529e1 1664 revs->simplify_history = 0;
ebdc94f3 1665 revs->limited = 1;
02e54220
PH
1666 } else if (!strcmp(arg, "-g") || !strcmp(arg, "--walk-reflogs")) {
1667 init_reflog_walk(&revs->reflog_info);
1668 } else if (!strcmp(arg, "--default")) {
1669 if (argc <= 1)
1670 return error("bad --default argument");
1671 revs->def = argv[1];
1672 return 2;
1673 } else if (!strcmp(arg, "--merge")) {
1674 revs->show_merge = 1;
1675 } else if (!strcmp(arg, "--topo-order")) {
08f704f2 1676 revs->sort_order = REV_SORT_IN_GRAPH_ORDER;
02e54220 1677 revs->topo_order = 1;
6546b593
JH
1678 } else if (!strcmp(arg, "--simplify-merges")) {
1679 revs->simplify_merges = 1;
a52f0071 1680 revs->topo_order = 1;
6546b593
JH
1681 revs->rewrite_parents = 1;
1682 revs->simplify_history = 0;
1683 revs->limited = 1;
78892e32
LT
1684 } else if (!strcmp(arg, "--simplify-by-decoration")) {
1685 revs->simplify_merges = 1;
a52f0071 1686 revs->topo_order = 1;
78892e32
LT
1687 revs->rewrite_parents = 1;
1688 revs->simplify_history = 0;
1689 revs->simplify_by_decoration = 1;
1690 revs->limited = 1;
1691 revs->prune = 1;
33e7018c 1692 load_ref_decorations(DECORATE_SHORT_REFS);
02e54220 1693 } else if (!strcmp(arg, "--date-order")) {
08f704f2 1694 revs->sort_order = REV_SORT_BY_COMMIT_DATE;
02e54220 1695 revs->topo_order = 1;
81c6b38b
JH
1696 } else if (!strcmp(arg, "--author-date-order")) {
1697 revs->sort_order = REV_SORT_BY_AUTHOR_DATE;
02e54220
PH
1698 revs->topo_order = 1;
1699 } else if (!prefixcmp(arg, "--early-output")) {
1700 int count = 100;
1701 switch (arg[14]) {
1702 case '=':
1703 count = atoi(arg+15);
1704 /* Fallthrough */
1705 case 0:
1706 revs->topo_order = 1;
1707 revs->early_output = count;
1708 }
1709 } else if (!strcmp(arg, "--parents")) {
1710 revs->rewrite_parents = 1;
1711 revs->print_parents = 1;
1712 } else if (!strcmp(arg, "--dense")) {
1713 revs->dense = 1;
1714 } else if (!strcmp(arg, "--sparse")) {
1715 revs->dense = 0;
1716 } else if (!strcmp(arg, "--show-all")) {
1717 revs->show_all = 1;
1718 } else if (!strcmp(arg, "--remove-empty")) {
1719 revs->remove_empty_trees = 1;
b8e8db28 1720 } else if (!strcmp(arg, "--merges")) {
ad5aeede 1721 revs->min_parents = 2;
02e54220 1722 } else if (!strcmp(arg, "--no-merges")) {
ad5aeede
MG
1723 revs->max_parents = 1;
1724 } else if (!prefixcmp(arg, "--min-parents=")) {
1725 revs->min_parents = atoi(arg+14);
1726 } else if (!prefixcmp(arg, "--no-min-parents")) {
1727 revs->min_parents = 0;
1728 } else if (!prefixcmp(arg, "--max-parents=")) {
1729 revs->max_parents = atoi(arg+14);
1730 } else if (!prefixcmp(arg, "--no-max-parents")) {
1731 revs->max_parents = -1;
02e54220
PH
1732 } else if (!strcmp(arg, "--boundary")) {
1733 revs->boundary = 1;
1734 } else if (!strcmp(arg, "--left-right")) {
1735 revs->left_right = 1;
60adf7d7 1736 } else if (!strcmp(arg, "--left-only")) {
24852d91 1737 if (revs->right_only)
94f605ec
MG
1738 die("--left-only is incompatible with --right-only"
1739 " or --cherry");
60adf7d7
MG
1740 revs->left_only = 1;
1741 } else if (!strcmp(arg, "--right-only")) {
24852d91
JH
1742 if (revs->left_only)
1743 die("--right-only is incompatible with --left-only");
60adf7d7 1744 revs->right_only = 1;
94f605ec
MG
1745 } else if (!strcmp(arg, "--cherry")) {
1746 if (revs->left_only)
1747 die("--cherry is incompatible with --left-only");
1748 revs->cherry_mark = 1;
1749 revs->right_only = 1;
ad5aeede 1750 revs->max_parents = 1;
94f605ec 1751 revs->limited = 1;
f69c5018
TR
1752 } else if (!strcmp(arg, "--count")) {
1753 revs->count = 1;
adbbb31e
MG
1754 } else if (!strcmp(arg, "--cherry-mark")) {
1755 if (revs->cherry_pick)
1756 die("--cherry-mark is incompatible with --cherry-pick");
1757 revs->cherry_mark = 1;
1758 revs->limited = 1; /* needs limit_list() */
02e54220 1759 } else if (!strcmp(arg, "--cherry-pick")) {
adbbb31e
MG
1760 if (revs->cherry_mark)
1761 die("--cherry-pick is incompatible with --cherry-mark");
02e54220
PH
1762 revs->cherry_pick = 1;
1763 revs->limited = 1;
1764 } else if (!strcmp(arg, "--objects")) {
1765 revs->tag_objects = 1;
1766 revs->tree_objects = 1;
1767 revs->blob_objects = 1;
1768 } else if (!strcmp(arg, "--objects-edge")) {
1769 revs->tag_objects = 1;
1770 revs->tree_objects = 1;
1771 revs->blob_objects = 1;
1772 revs->edge_hint = 1;
5a48d240
JH
1773 } else if (!strcmp(arg, "--verify-objects")) {
1774 revs->tag_objects = 1;
1775 revs->tree_objects = 1;
1776 revs->blob_objects = 1;
1777 revs->verify_objects = 1;
02e54220
PH
1778 } else if (!strcmp(arg, "--unpacked")) {
1779 revs->unpacked = 1;
03a9683d
JH
1780 } else if (!prefixcmp(arg, "--unpacked=")) {
1781 die("--unpacked=<packfile> no longer supported.");
02e54220
PH
1782 } else if (!strcmp(arg, "-r")) {
1783 revs->diff = 1;
1784 DIFF_OPT_SET(&revs->diffopt, RECURSIVE);
1785 } else if (!strcmp(arg, "-t")) {
1786 revs->diff = 1;
1787 DIFF_OPT_SET(&revs->diffopt, RECURSIVE);
1788 DIFF_OPT_SET(&revs->diffopt, TREE_IN_RECURSIVE);
1789 } else if (!strcmp(arg, "-m")) {
1790 revs->ignore_merges = 0;
1791 } else if (!strcmp(arg, "-c")) {
1792 revs->diff = 1;
1793 revs->dense_combined_merges = 0;
1794 revs->combine_merges = 1;
1795 } else if (!strcmp(arg, "--cc")) {
1796 revs->diff = 1;
1797 revs->dense_combined_merges = 1;
1798 revs->combine_merges = 1;
1799 } else if (!strcmp(arg, "-v")) {
1800 revs->verbose_header = 1;
1801 } else if (!strcmp(arg, "--pretty")) {
1802 revs->verbose_header = 1;
66b2ed09 1803 revs->pretty_given = 1;
02e54220 1804 get_commit_format(arg+8, revs);
3a4c1a5e 1805 } else if (!prefixcmp(arg, "--pretty=") || !prefixcmp(arg, "--format=")) {
7d7b86f7
MM
1806 /*
1807 * Detached form ("--pretty X" as opposed to "--pretty=X")
1808 * not allowed, since the argument is optional.
1809 */
02e54220 1810 revs->verbose_header = 1;
66b2ed09 1811 revs->pretty_given = 1;
02e54220 1812 get_commit_format(arg+9, revs);
7249e912 1813 } else if (!strcmp(arg, "--show-notes") || !strcmp(arg, "--notes")) {
66b2ed09
JH
1814 revs->show_notes = 1;
1815 revs->show_notes_given = 1;
3a03cf6b 1816 revs->notes_opt.use_default_notes = 1;
0c37f1fc
JH
1817 } else if (!strcmp(arg, "--show-signature")) {
1818 revs->show_signature = 1;
7249e912
JK
1819 } else if (!prefixcmp(arg, "--show-notes=") ||
1820 !prefixcmp(arg, "--notes=")) {
894a9d33
TR
1821 struct strbuf buf = STRBUF_INIT;
1822 revs->show_notes = 1;
1823 revs->show_notes_given = 1;
7249e912
JK
1824 if (!prefixcmp(arg, "--show-notes")) {
1825 if (revs->notes_opt.use_default_notes < 0)
1826 revs->notes_opt.use_default_notes = 1;
1827 strbuf_addstr(&buf, arg+13);
1828 }
1829 else
1830 strbuf_addstr(&buf, arg+8);
c063f0a9 1831 expand_notes_ref(&buf);
304cc11c 1832 string_list_append(&revs->notes_opt.extra_notes_refs,
1d2f80fa 1833 strbuf_detach(&buf, NULL));
66b2ed09
JH
1834 } else if (!strcmp(arg, "--no-notes")) {
1835 revs->show_notes = 0;
1836 revs->show_notes_given = 1;
92e0d425
JK
1837 revs->notes_opt.use_default_notes = -1;
1838 /* we have been strdup'ing ourselves, so trick
1839 * string_list into free()ing strings */
1840 revs->notes_opt.extra_notes_refs.strdup_strings = 1;
1841 string_list_clear(&revs->notes_opt.extra_notes_refs, 0);
1842 revs->notes_opt.extra_notes_refs.strdup_strings = 0;
894a9d33
TR
1843 } else if (!strcmp(arg, "--standard-notes")) {
1844 revs->show_notes_given = 1;
3a03cf6b 1845 revs->notes_opt.use_default_notes = 1;
894a9d33 1846 } else if (!strcmp(arg, "--no-standard-notes")) {
3a03cf6b 1847 revs->notes_opt.use_default_notes = 0;
de84accc
NS
1848 } else if (!strcmp(arg, "--oneline")) {
1849 revs->verbose_header = 1;
1850 get_commit_format("oneline", revs);
7dccadf3 1851 revs->pretty_given = 1;
de84accc 1852 revs->abbrev_commit = 1;
02e54220
PH
1853 } else if (!strcmp(arg, "--graph")) {
1854 revs->topo_order = 1;
1855 revs->rewrite_parents = 1;
1856 revs->graph = graph_init(revs);
1857 } else if (!strcmp(arg, "--root")) {
1858 revs->show_root_diff = 1;
1859 } else if (!strcmp(arg, "--no-commit-id")) {
1860 revs->no_commit_id = 1;
1861 } else if (!strcmp(arg, "--always")) {
1862 revs->always_show_header = 1;
1863 } else if (!strcmp(arg, "--no-abbrev")) {
1864 revs->abbrev = 0;
1865 } else if (!strcmp(arg, "--abbrev")) {
1866 revs->abbrev = DEFAULT_ABBREV;
1867 } else if (!prefixcmp(arg, "--abbrev=")) {
1868 revs->abbrev = strtoul(arg + 9, NULL, 10);
1869 if (revs->abbrev < MINIMUM_ABBREV)
1870 revs->abbrev = MINIMUM_ABBREV;
1871 else if (revs->abbrev > 40)
1872 revs->abbrev = 40;
1873 } else if (!strcmp(arg, "--abbrev-commit")) {
1874 revs->abbrev_commit = 1;
0c47695a
JS
1875 revs->abbrev_commit_given = 1;
1876 } else if (!strcmp(arg, "--no-abbrev-commit")) {
1877 revs->abbrev_commit = 0;
02e54220
PH
1878 } else if (!strcmp(arg, "--full-diff")) {
1879 revs->diff = 1;
1880 revs->full_diff = 1;
1881 } else if (!strcmp(arg, "--full-history")) {
1882 revs->simplify_history = 0;
1883 } else if (!strcmp(arg, "--relative-date")) {
1884 revs->date_mode = DATE_RELATIVE;
f4ea32f0 1885 revs->date_mode_explicit = 1;
7d7b86f7
MM
1886 } else if ((argcount = parse_long_opt("date", argv, &optarg))) {
1887 revs->date_mode = parse_date_format(optarg);
f4ea32f0 1888 revs->date_mode_explicit = 1;
7d7b86f7 1889 return argcount;
02e54220
PH
1890 } else if (!strcmp(arg, "--log-size")) {
1891 revs->show_log_size = 1;
1892 }
1893 /*
1894 * Grepping the commit log
1895 */
7d7b86f7
MM
1896 else if ((argcount = parse_long_opt("author", argv, &optarg))) {
1897 add_header_grep(revs, GREP_HEADER_AUTHOR, optarg);
1898 return argcount;
1899 } else if ((argcount = parse_long_opt("committer", argv, &optarg))) {
1900 add_header_grep(revs, GREP_HEADER_COMMITTER, optarg);
1901 return argcount;
72fd13f7
NTND
1902 } else if ((argcount = parse_long_opt("grep-reflog", argv, &optarg))) {
1903 add_header_grep(revs, GREP_HEADER_REFLOG, optarg);
1904 return argcount;
7d7b86f7
MM
1905 } else if ((argcount = parse_long_opt("grep", argv, &optarg))) {
1906 add_message_grep(revs, optarg);
1907 return argcount;
17bf35a3
JH
1908 } else if (!strcmp(arg, "--grep-debug")) {
1909 revs->grep_filter.debug = 1;
727b6fc3
JH
1910 } else if (!strcmp(arg, "--basic-regexp")) {
1911 grep_set_pattern_type_option(GREP_PATTERN_TYPE_BRE, &revs->grep_filter);
02e54220 1912 } else if (!strcmp(arg, "--extended-regexp") || !strcmp(arg, "-E")) {
34a4ae55 1913 grep_set_pattern_type_option(GREP_PATTERN_TYPE_ERE, &revs->grep_filter);
02e54220 1914 } else if (!strcmp(arg, "--regexp-ignore-case") || !strcmp(arg, "-i")) {
0843acfd 1915 revs->grep_filter.regflags |= REG_ICASE;
accccde4 1916 DIFF_OPT_SET(&revs->diffopt, PICKAXE_IGNORE_CASE);
02e54220 1917 } else if (!strcmp(arg, "--fixed-strings") || !strcmp(arg, "-F")) {
34a4ae55 1918 grep_set_pattern_type_option(GREP_PATTERN_TYPE_FIXED, &revs->grep_filter);
727b6fc3
JH
1919 } else if (!strcmp(arg, "--perl-regexp")) {
1920 grep_set_pattern_type_option(GREP_PATTERN_TYPE_PCRE, &revs->grep_filter);
02e54220 1921 } else if (!strcmp(arg, "--all-match")) {
0843acfd 1922 revs->grep_filter.all_match = 1;
7d7b86f7
MM
1923 } else if ((argcount = parse_long_opt("encoding", argv, &optarg))) {
1924 if (strcmp(optarg, "none"))
1925 git_log_output_encoding = xstrdup(optarg);
02e54220
PH
1926 else
1927 git_log_output_encoding = "";
7d7b86f7 1928 return argcount;
02e54220
PH
1929 } else if (!strcmp(arg, "--reverse")) {
1930 revs->reverse ^= 1;
1931 } else if (!strcmp(arg, "--children")) {
1932 revs->children.name = "children";
1933 revs->limited = 1;
cc243c3c
JH
1934 } else if (!strcmp(arg, "--ignore-missing")) {
1935 revs->ignore_missing = 1;
02e54220
PH
1936 } else {
1937 int opts = diff_opt_parse(&revs->diffopt, argv, argc);
1938 if (!opts)
1939 unkv[(*unkc)++] = arg;
1940 return opts;
1941 }
1942
1943 return 1;
1944}
1945
6b61ec05
PH
1946void parse_revision_opt(struct rev_info *revs, struct parse_opt_ctx_t *ctx,
1947 const struct option *options,
1948 const char * const usagestr[])
1949{
1950 int n = handle_revision_opt(revs, ctx->argc, ctx->argv,
1951 &ctx->cpidx, ctx->out);
1952 if (n <= 0) {
1953 error("unknown option `%s'", ctx->argv[0]);
1954 usage_with_options(usagestr, options);
1955 }
1956 ctx->argv += n;
1957 ctx->argc -= n;
1958}
1959
9ef6aeb0 1960static int for_each_bad_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data)
ad3f9a71 1961{
9ef6aeb0 1962 return for_each_ref_in_submodule(submodule, "refs/bisect/bad", fn, cb_data);
ad3f9a71
LT
1963}
1964
9ef6aeb0 1965static int for_each_good_bisect_ref(const char *submodule, each_ref_fn fn, void *cb_data)
ad3f9a71 1966{
9ef6aeb0 1967 return for_each_ref_in_submodule(submodule, "refs/bisect/good", fn, cb_data);
ad3f9a71
LT
1968}
1969
f6aca0dc
JN
1970static int handle_revision_pseudo_opt(const char *submodule,
1971 struct rev_info *revs,
1972 int argc, const char **argv, int *flags)
1973{
1974 const char *arg = argv[0];
1975 const char *optarg;
1976 int argcount;
1977
0fc63ec4
JN
1978 /*
1979 * NOTE!
1980 *
1981 * Commands like "git shortlog" will not accept the options below
1982 * unless parse_revision_opt queues them (as opposed to erroring
1983 * out).
1984 *
1985 * When implementing your new pseudo-option, remember to
1986 * register it in the list at the top of handle_revision_opt.
1987 */
f6aca0dc
JN
1988 if (!strcmp(arg, "--all")) {
1989 handle_refs(submodule, revs, *flags, for_each_ref_submodule);
1990 handle_refs(submodule, revs, *flags, head_ref_submodule);
e7b432c5 1991 clear_ref_exclusion(revs);
f6aca0dc
JN
1992 } else if (!strcmp(arg, "--branches")) {
1993 handle_refs(submodule, revs, *flags, for_each_branch_ref_submodule);
e7b432c5 1994 clear_ref_exclusion(revs);
f6aca0dc
JN
1995 } else if (!strcmp(arg, "--bisect")) {
1996 handle_refs(submodule, revs, *flags, for_each_bad_bisect_ref);
7f34a46f 1997 handle_refs(submodule, revs, *flags ^ (UNINTERESTING | BOTTOM), for_each_good_bisect_ref);
f6aca0dc
JN
1998 revs->bisect = 1;
1999 } else if (!strcmp(arg, "--tags")) {
2000 handle_refs(submodule, revs, *flags, for_each_tag_ref_submodule);
e7b432c5 2001 clear_ref_exclusion(revs);
f6aca0dc
JN
2002 } else if (!strcmp(arg, "--remotes")) {
2003 handle_refs(submodule, revs, *flags, for_each_remote_ref_submodule);
e7b432c5 2004 clear_ref_exclusion(revs);
f6aca0dc
JN
2005 } else if ((argcount = parse_long_opt("glob", argv, &optarg))) {
2006 struct all_refs_cb cb;
2007 init_all_refs_cb(&cb, revs, *flags);
2008 for_each_glob_ref(handle_one_ref, optarg, &cb);
e7b432c5
JH
2009 clear_ref_exclusion(revs);
2010 return argcount;
2011 } else if ((argcount = parse_long_opt("exclude", argv, &optarg))) {
2012 add_ref_exclusion(revs, optarg);
f6aca0dc
JN
2013 return argcount;
2014 } else if (!prefixcmp(arg, "--branches=")) {
2015 struct all_refs_cb cb;
2016 init_all_refs_cb(&cb, revs, *flags);
2017 for_each_glob_ref_in(handle_one_ref, arg + 11, "refs/heads/", &cb);
e7b432c5 2018 clear_ref_exclusion(revs);
f6aca0dc
JN
2019 } else if (!prefixcmp(arg, "--tags=")) {
2020 struct all_refs_cb cb;
2021 init_all_refs_cb(&cb, revs, *flags);
2022 for_each_glob_ref_in(handle_one_ref, arg + 7, "refs/tags/", &cb);
e7b432c5 2023 clear_ref_exclusion(revs);
f6aca0dc
JN
2024 } else if (!prefixcmp(arg, "--remotes=")) {
2025 struct all_refs_cb cb;
2026 init_all_refs_cb(&cb, revs, *flags);
2027 for_each_glob_ref_in(handle_one_ref, arg + 10, "refs/remotes/", &cb);
e7b432c5 2028 clear_ref_exclusion(revs);
f6aca0dc
JN
2029 } else if (!strcmp(arg, "--reflog")) {
2030 handle_reflog(revs, *flags);
2031 } else if (!strcmp(arg, "--not")) {
7f34a46f 2032 *flags ^= UNINTERESTING | BOTTOM;
f6aca0dc 2033 } else if (!strcmp(arg, "--no-walk")) {
ca92e59e
MZ
2034 revs->no_walk = REVISION_WALK_NO_WALK_SORTED;
2035 } else if (!prefixcmp(arg, "--no-walk=")) {
2036 /*
2037 * Detached form ("--no-walk X" as opposed to "--no-walk=X")
2038 * not allowed, since the argument is optional.
2039 */
2040 if (!strcmp(arg + 10, "sorted"))
2041 revs->no_walk = REVISION_WALK_NO_WALK_SORTED;
2042 else if (!strcmp(arg + 10, "unsorted"))
2043 revs->no_walk = REVISION_WALK_NO_WALK_UNSORTED;
2044 else
2045 return error("invalid argument to --no-walk");
f6aca0dc
JN
2046 } else if (!strcmp(arg, "--do-walk")) {
2047 revs->no_walk = 0;
2048 } else {
2049 return 0;
2050 }
2051
2052 return 1;
2053}
2054
ae563542
LT
2055/*
2056 * Parse revision information, filling in the "rev_info" structure,
2057 * and removing the used arguments from the argument list.
2058 *
765ac8ec
LT
2059 * Returns the number of arguments left that weren't recognized
2060 * (which are also moved to the head of the argument list)
ae563542 2061 */
32962c9b 2062int setup_revisions(int argc, const char **argv, struct rev_info *revs, struct setup_revision_opt *opt)
ae563542 2063{
8e676e8b 2064 int i, flags, left, seen_dashdash, read_from_stdin, got_rev_arg = 0, revarg_opt;
4da5af31 2065 struct cmdline_pathspec prune_data;
9ef6aeb0
HV
2066 const char *submodule = NULL;
2067
4da5af31 2068 memset(&prune_data, 0, sizeof(prune_data));
9ef6aeb0
HV
2069 if (opt)
2070 submodule = opt->submodule;
ae563542 2071
ae563542 2072 /* First, search for "--" */
6d5b93f2 2073 if (opt && opt->assume_dashdash) {
ae563542 2074 seen_dashdash = 1;
6d5b93f2
CB
2075 } else {
2076 seen_dashdash = 0;
2077 for (i = 1; i < argc; i++) {
2078 const char *arg = argv[i];
2079 if (strcmp(arg, "--"))
2080 continue;
2081 argv[i] = NULL;
2082 argc = i;
2083 if (argv[i + 1])
2084 append_prune_data(&prune_data, argv + i + 1);
2085 seen_dashdash = 1;
2086 break;
2087 }
ae563542
LT
2088 }
2089
02e54220
PH
2090 /* Second, deal with arguments and options */
2091 flags = 0;
d5f6b1d7
JH
2092 revarg_opt = opt ? opt->revarg_opt : 0;
2093 if (seen_dashdash)
2094 revarg_opt |= REVARG_CANNOT_BE_FILENAME;
8b3dce56 2095 read_from_stdin = 0;
02e54220 2096 for (left = i = 1; i < argc; i++) {
ae563542 2097 const char *arg = argv[i];
ae563542 2098 if (*arg == '-') {
cd2bdc53 2099 int opts;
02e54220 2100
f6aca0dc
JN
2101 opts = handle_revision_pseudo_opt(submodule,
2102 revs, argc - i, argv + i,
2103 &flags);
2104 if (opts > 0) {
2105 i += opts - 1;
8e64006e
JS
2106 continue;
2107 }
f6aca0dc 2108
8b3dce56
JH
2109 if (!strcmp(arg, "--stdin")) {
2110 if (revs->disable_stdin) {
2111 argv[left++] = arg;
2112 continue;
2113 }
2114 if (read_from_stdin++)
2115 die("--stdin given twice?");
60da8b15 2116 read_revisions_from_stdin(revs, &prune_data);
8b3dce56
JH
2117 continue;
2118 }
2d10c555 2119
02e54220 2120 opts = handle_revision_opt(revs, argc - i, argv + i, &left, argv);
cd2bdc53 2121 if (opts > 0) {
cd2bdc53
LT
2122 i += opts - 1;
2123 continue;
2124 }
02e54220
PH
2125 if (opts < 0)
2126 exit(128);
ae563542
LT
2127 continue;
2128 }
ae563542 2129
8e676e8b
JH
2130
2131 if (handle_revision_arg(arg, revs, flags, revarg_opt)) {
5d6f0935
JH
2132 int j;
2133 if (seen_dashdash || *arg == '^')
ae563542
LT
2134 die("bad revision '%s'", arg);
2135
ea92f41f
JH
2136 /* If we didn't have a "--":
2137 * (1) all filenames must exist;
2138 * (2) all rev-args must not be interpretable
2139 * as a valid filename.
2140 * but the latter we have checked in the main loop.
2141 */
e23d0b4a 2142 for (j = i; j < argc; j++)
023e37c3 2143 verify_filename(revs->prefix, argv[j], j == i);
e23d0b4a 2144
60da8b15 2145 append_prune_data(&prune_data, argv + i);
ae563542
LT
2146 break;
2147 }
8fcaca3f
DO
2148 else
2149 got_rev_arg = 1;
ae563542 2150 }
5d6f0935 2151
4da5af31 2152 if (prune_data.nr) {
93e7d672
JH
2153 /*
2154 * If we need to introduce the magic "a lone ':' means no
2155 * pathspec whatsoever", here is the place to do so.
2156 *
2157 * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) {
2158 * prune_data.nr = 0;
2159 * prune_data.alloc = 0;
2160 * free(prune_data.path);
2161 * prune_data.path = NULL;
2162 * } else {
2163 * terminate prune_data.alloc with NULL and
2164 * call init_pathspec() to set revs->prune_data here.
2165 * }
2166 */
4da5af31
JH
2167 ALLOC_GROW(prune_data.path, prune_data.nr+1, prune_data.alloc);
2168 prune_data.path[prune_data.nr++] = NULL;
8f2d4b19
JH
2169 init_pathspec(&revs->prune_data,
2170 get_pathspec(revs->prefix, prune_data.path));
4da5af31 2171 }
5486ef0e 2172
02e54220 2173 if (revs->def == NULL)
32962c9b 2174 revs->def = opt ? opt->def : NULL;
b4490059
JH
2175 if (opt && opt->tweak)
2176 opt->tweak(revs, opt);
02e54220 2177 if (revs->show_merge)
ae3e5e1e 2178 prepare_show_merge(revs);
8fcaca3f 2179 if (revs->def && !revs->pending.nr && !got_rev_arg) {
ae563542 2180 unsigned char sha1[20];
cd2bdc53 2181 struct object *object;
249c8f4a 2182 struct object_context oc;
33bd598c 2183 if (get_sha1_with_context(revs->def, 0, sha1, &oc))
02e54220
PH
2184 die("bad default revision '%s'", revs->def);
2185 object = get_reference(revs, revs->def, sha1, 0);
249c8f4a 2186 add_pending_object_with_mode(revs, object, revs->def, oc.mode);
ae563542 2187 }
8efdc326 2188
b7bb760d
LT
2189 /* Did the user ask for any diff output? Run the diff! */
2190 if (revs->diffopt.output_format & ~DIFF_FORMAT_NO_OUTPUT)
2191 revs->diff = 1;
2192
0faf2da7
AL
2193 /* Pickaxe, diff-filter and rename following need diffs */
2194 if (revs->diffopt.pickaxe ||
2195 revs->diffopt.filter ||
2196 DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES))
b7bb760d
LT
2197 revs->diff = 1;
2198
9dad9d2e 2199 if (revs->topo_order)
53069686
JH
2200 revs->limited = 1;
2201
afe069d1
NTND
2202 if (revs->prune_data.nr) {
2203 diff_tree_setup_paths(revs->prune_data.raw, &revs->pruning);
750f7b66 2204 /* Can't prune commits with rename following: the paths change.. */
8f67f8ae 2205 if (!DIFF_OPT_TST(&revs->diffopt, FOLLOW_RENAMES))
53b2c823 2206 revs->prune = 1;
cd2bdc53 2207 if (!revs->full_diff)
afe069d1 2208 diff_tree_setup_paths(revs->prune_data.raw, &revs->diffopt);
8efdc326 2209 }
b4490059 2210 if (revs->combine_merges)
cd2bdc53 2211 revs->ignore_merges = 0;
cd2bdc53 2212 revs->diffopt.abbrev = revs->abbrev;
12da1d1f
TR
2213
2214 if (revs->line_level_traverse) {
2215 revs->limited = 1;
2216 revs->topo_order = 1;
2217 }
2218
28452655 2219 diff_setup_done(&revs->diffopt);
8efdc326 2220
918d4e1c
JH
2221 grep_commit_pattern_type(GREP_PATTERN_TYPE_UNSPECIFIED,
2222 &revs->grep_filter);
0843acfd 2223 compile_grep_patterns(&revs->grep_filter);
bd95fcd3 2224
d56651c0
SP
2225 if (revs->reverse && revs->reflog_info)
2226 die("cannot combine --reverse with --walk-reflogs");
8bb65883 2227 if (revs->rewrite_parents && revs->children.name)
f35f5603 2228 die("cannot combine --parents and --children");
d56651c0 2229
7fefda5c
AS
2230 /*
2231 * Limitations on the graph functionality
2232 */
2233 if (revs->reverse && revs->graph)
2234 die("cannot combine --reverse with --graph");
2235
2236 if (revs->reflog_info && revs->graph)
2237 die("cannot combine --walk-reflogs with --graph");
baa6378f
JH
2238 if (!revs->reflog_info && revs->grep_filter.use_reflog_filter)
2239 die("cannot use --grep-reflog without --walk-reflogs");
7fefda5c 2240
ae563542
LT
2241 return left;
2242}
a4a88b2b 2243
f35f5603
JH
2244static void add_child(struct rev_info *revs, struct commit *parent, struct commit *child)
2245{
2246 struct commit_list *l = xcalloc(1, sizeof(*l));
2247
2248 l->item = child;
2249 l->next = add_decoration(&revs->children, &parent->object, l);
2250}
2251
d0af663e 2252static int remove_duplicate_parents(struct rev_info *revs, struct commit *commit)
6546b593 2253{
d0af663e 2254 struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object);
6546b593
JH
2255 struct commit_list **pp, *p;
2256 int surviving_parents;
2257
2258 /* Examine existing parents while marking ones we have seen... */
2259 pp = &commit->parents;
d0af663e 2260 surviving_parents = 0;
6546b593
JH
2261 while ((p = *pp) != NULL) {
2262 struct commit *parent = p->item;
2263 if (parent->object.flags & TMP_MARK) {
2264 *pp = p->next;
d0af663e
KB
2265 if (ts)
2266 compact_treesame(revs, commit, surviving_parents);
6546b593
JH
2267 continue;
2268 }
2269 parent->object.flags |= TMP_MARK;
d0af663e 2270 surviving_parents++;
6546b593
JH
2271 pp = &p->next;
2272 }
d0af663e 2273 /* clear the temporary mark */
6546b593
JH
2274 for (p = commit->parents; p; p = p->next) {
2275 p->item->object.flags &= ~TMP_MARK;
6546b593 2276 }
d0af663e 2277 /* no update_treesame() - removing duplicates can't affect TREESAME */
6546b593
JH
2278 return surviving_parents;
2279}
2280
faf0156b
JH
2281struct merge_simplify_state {
2282 struct commit *simplified;
2283};
2284
2285static struct merge_simplify_state *locate_simplify_state(struct rev_info *revs, struct commit *commit)
2286{
2287 struct merge_simplify_state *st;
2288
2289 st = lookup_decoration(&revs->merge_simplification, &commit->object);
2290 if (!st) {
2291 st = xcalloc(1, sizeof(*st));
2292 add_decoration(&revs->merge_simplification, &commit->object, st);
2293 }
2294 return st;
2295}
2296
d0af663e
KB
2297static int mark_redundant_parents(struct rev_info *revs, struct commit *commit)
2298{
2299 struct commit_list *h = reduce_heads(commit->parents);
2300 int i = 0, marked = 0;
2301 struct commit_list *po, *pn;
2302
2303 /* Want these for sanity-checking only */
2304 int orig_cnt = commit_list_count(commit->parents);
2305 int cnt = commit_list_count(h);
2306
2307 /*
2308 * Not ready to remove items yet, just mark them for now, based
2309 * on the output of reduce_heads(). reduce_heads outputs the reduced
2310 * set in its original order, so this isn't too hard.
2311 */
2312 po = commit->parents;
2313 pn = h;
2314 while (po) {
2315 if (pn && po->item == pn->item) {
2316 pn = pn->next;
2317 i++;
2318 } else {
2319 po->item->object.flags |= TMP_MARK;
2320 marked++;
2321 }
2322 po=po->next;
2323 }
2324
2325 if (i != cnt || cnt+marked != orig_cnt)
2326 die("mark_redundant_parents %d %d %d %d", orig_cnt, cnt, i, marked);
2327
2328 free_commit_list(h);
2329
2330 return marked;
2331}
2332
143f1eaf
KB
2333static int mark_treesame_root_parents(struct rev_info *revs, struct commit *commit)
2334{
2335 struct commit_list *p;
2336 int marked = 0;
2337
2338 for (p = commit->parents; p; p = p->next) {
2339 struct commit *parent = p->item;
2340 if (!parent->parents && (parent->object.flags & TREESAME)) {
2341 parent->object.flags |= TMP_MARK;
2342 marked++;
2343 }
2344 }
2345
2346 return marked;
2347}
2348
9c129eab
KB
2349/*
2350 * Awkward naming - this means one parent we are TREESAME to.
2351 * cf mark_treesame_root_parents: root parents that are TREESAME (to an
2352 * empty tree). Better name suggestions?
2353 */
2354static int leave_one_treesame_to_parent(struct rev_info *revs, struct commit *commit)
2355{
2356 struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object);
2357 struct commit *unmarked = NULL, *marked = NULL;
2358 struct commit_list *p;
2359 unsigned n;
2360
2361 for (p = commit->parents, n = 0; p; p = p->next, n++) {
2362 if (ts->treesame[n]) {
2363 if (p->item->object.flags & TMP_MARK) {
2364 if (!marked)
2365 marked = p->item;
2366 } else {
2367 if (!unmarked) {
2368 unmarked = p->item;
2369 break;
2370 }
2371 }
2372 }
2373 }
2374
2375 /*
2376 * If we are TREESAME to a marked-for-deletion parent, but not to any
2377 * unmarked parents, unmark the first TREESAME parent. This is the
2378 * parent that the default simplify_history==1 scan would have followed,
2379 * and it doesn't make sense to omit that path when asking for a
2380 * simplified full history. Retaining it improves the chances of
2381 * understanding odd missed merges that took an old version of a file.
2382 *
2383 * Example:
2384 *
2385 * I--------*X A modified the file, but mainline merge X used
2386 * \ / "-s ours", so took the version from I. X is
2387 * `-*A--' TREESAME to I and !TREESAME to A.
2388 *
2389 * Default log from X would produce "I". Without this check,
2390 * --full-history --simplify-merges would produce "I-A-X", showing
2391 * the merge commit X and that it changed A, but not making clear that
2392 * it had just taken the I version. With this check, the topology above
2393 * is retained.
2394 *
2395 * Note that it is possible that the simplification chooses a different
2396 * TREESAME parent from the default, in which case this test doesn't
2397 * activate, and we _do_ drop the default parent. Example:
2398 *
2399 * I------X A modified the file, but it was reverted in B,
2400 * \ / meaning mainline merge X is TREESAME to both
2401 * *A-*B parents.
2402 *
2403 * Default log would produce "I" by following the first parent;
2404 * --full-history --simplify-merges will produce "I-A-B". But this is a
2405 * reasonable result - it presents a logical full history leading from
2406 * I to X, and X is not an important merge.
2407 */
2408 if (!unmarked && marked) {
2409 marked->object.flags &= ~TMP_MARK;
2410 return 1;
2411 }
2412
2413 return 0;
2414}
2415
d0af663e
KB
2416static int remove_marked_parents(struct rev_info *revs, struct commit *commit)
2417{
2418 struct commit_list **pp, *p;
2419 int nth_parent, removed = 0;
2420
2421 pp = &commit->parents;
2422 nth_parent = 0;
2423 while ((p = *pp) != NULL) {
2424 struct commit *parent = p->item;
2425 if (parent->object.flags & TMP_MARK) {
2426 parent->object.flags &= ~TMP_MARK;
2427 *pp = p->next;
2428 free(p);
2429 removed++;
2430 compact_treesame(revs, commit, nth_parent);
2431 continue;
2432 }
2433 pp = &p->next;
2434 nth_parent++;
2435 }
2436
2437 /* Removing parents can only increase TREESAMEness */
2438 if (removed && !(commit->object.flags & TREESAME))
2439 update_treesame(revs, commit);
2440
2441 return nth_parent;
2442}
2443
faf0156b 2444static struct commit_list **simplify_one(struct rev_info *revs, struct commit *commit, struct commit_list **tail)
6546b593
JH
2445{
2446 struct commit_list *p;
4d826608 2447 struct commit *parent;
faf0156b 2448 struct merge_simplify_state *st, *pst;
6546b593
JH
2449 int cnt;
2450
faf0156b
JH
2451 st = locate_simplify_state(revs, commit);
2452
6546b593 2453 /*
6546b593
JH
2454 * Have we handled this one?
2455 */
faf0156b 2456 if (st->simplified)
6546b593
JH
2457 return tail;
2458
2459 /*
2460 * An UNINTERESTING commit simplifies to itself, so does a
2461 * root commit. We do not rewrite parents of such commit
2462 * anyway.
2463 */
2464 if ((commit->object.flags & UNINTERESTING) || !commit->parents) {
faf0156b 2465 st->simplified = commit;
6546b593
JH
2466 return tail;
2467 }
2468
2469 /*
6e513ba3
JH
2470 * Do we know what commit all of our parents that matter
2471 * should be rewritten to? Otherwise we are not ready to
2472 * rewrite this one yet.
6546b593
JH
2473 */
2474 for (cnt = 0, p = commit->parents; p; p = p->next) {
faf0156b
JH
2475 pst = locate_simplify_state(revs, p->item);
2476 if (!pst->simplified) {
6546b593
JH
2477 tail = &commit_list_insert(p->item, tail)->next;
2478 cnt++;
2479 }
6e513ba3
JH
2480 if (revs->first_parent_only)
2481 break;
6546b593 2482 }
53030f8d
JH
2483 if (cnt) {
2484 tail = &commit_list_insert(commit, tail)->next;
6546b593 2485 return tail;
53030f8d 2486 }
6546b593
JH
2487
2488 /*
d0af663e
KB
2489 * Rewrite our list of parents. Note that this cannot
2490 * affect our TREESAME flags in any way - a commit is
2491 * always TREESAME to its simplification.
6546b593 2492 */
faf0156b
JH
2493 for (p = commit->parents; p; p = p->next) {
2494 pst = locate_simplify_state(revs, p->item);
2495 p->item = pst->simplified;
6e513ba3
JH
2496 if (revs->first_parent_only)
2497 break;
faf0156b 2498 }
4b7f53da 2499
0290bf12 2500 if (revs->first_parent_only)
6e513ba3 2501 cnt = 1;
0290bf12 2502 else
d0af663e 2503 cnt = remove_duplicate_parents(revs, commit);
6546b593
JH
2504
2505 /*
2506 * It is possible that we are a merge and one side branch
2507 * does not have any commit that touches the given paths;
d0af663e
KB
2508 * in such a case, the immediate parent from that branch
2509 * will be rewritten to be the merge base.
6546b593
JH
2510 *
2511 * o----X X: the commit we are looking at;
2512 * / / o: a commit that touches the paths;
2513 * ---o----'
2514 *
143f1eaf
KB
2515 * Further, a merge of an independent branch that doesn't
2516 * touch the path will reduce to a treesame root parent:
2517 *
2518 * ----o----X X: the commit we are looking at;
2519 * / o: a commit that touches the paths;
2520 * r r: a root commit not touching the paths
2521 *
2522 * Detect and simplify both cases.
6546b593
JH
2523 */
2524 if (1 < cnt) {
d0af663e 2525 int marked = mark_redundant_parents(revs, commit);
143f1eaf 2526 marked += mark_treesame_root_parents(revs, commit);
9c129eab
KB
2527 if (marked)
2528 marked -= leave_one_treesame_to_parent(revs, commit);
d0af663e
KB
2529 if (marked)
2530 cnt = remove_marked_parents(revs, commit);
6546b593
JH
2531 }
2532
2533 /*
2534 * A commit simplifies to itself if it is a root, if it is
2535 * UNINTERESTING, if it touches the given paths, or if it is a
4d826608 2536 * merge and its parents don't simplify to one relevant commit
6546b593
JH
2537 * (the first two cases are already handled at the beginning of
2538 * this function).
2539 *
4d826608
KB
2540 * Otherwise, it simplifies to what its sole relevant parent
2541 * simplifies to.
6546b593
JH
2542 */
2543 if (!cnt ||
2544 (commit->object.flags & UNINTERESTING) ||
2545 !(commit->object.flags & TREESAME) ||
4d826608 2546 (parent = one_relevant_parent(revs, commit->parents)) == NULL)
faf0156b
JH
2547 st->simplified = commit;
2548 else {
4d826608 2549 pst = locate_simplify_state(revs, parent);
faf0156b
JH
2550 st->simplified = pst->simplified;
2551 }
6546b593
JH
2552 return tail;
2553}
2554
2555static void simplify_merges(struct rev_info *revs)
2556{
ab9d75a8 2557 struct commit_list *list, *next;
6546b593 2558 struct commit_list *yet_to_do, **tail;
ab9d75a8 2559 struct commit *commit;
6546b593 2560
5eac739e
JH
2561 if (!revs->prune)
2562 return;
65347030 2563
6546b593
JH
2564 /* feed the list reversed */
2565 yet_to_do = NULL;
ab9d75a8
JH
2566 for (list = revs->commits; list; list = next) {
2567 commit = list->item;
2568 next = list->next;
2569 /*
2570 * Do not free(list) here yet; the original list
2571 * is used later in this function.
2572 */
2573 commit_list_insert(commit, &yet_to_do);
2574 }
6546b593
JH
2575 while (yet_to_do) {
2576 list = yet_to_do;
2577 yet_to_do = NULL;
2578 tail = &yet_to_do;
2579 while (list) {
ab9d75a8
JH
2580 commit = list->item;
2581 next = list->next;
6546b593
JH
2582 free(list);
2583 list = next;
faf0156b 2584 tail = simplify_one(revs, commit, tail);
6546b593
JH
2585 }
2586 }
2587
2588 /* clean up the result, removing the simplified ones */
2589 list = revs->commits;
2590 revs->commits = NULL;
2591 tail = &revs->commits;
2592 while (list) {
faf0156b 2593 struct merge_simplify_state *st;
ab9d75a8
JH
2594
2595 commit = list->item;
2596 next = list->next;
6546b593
JH
2597 free(list);
2598 list = next;
faf0156b
JH
2599 st = locate_simplify_state(revs, commit);
2600 if (st->simplified == commit)
6546b593
JH
2601 tail = &commit_list_insert(commit, tail)->next;
2602 }
6546b593
JH
2603}
2604
f35f5603
JH
2605static void set_children(struct rev_info *revs)
2606{
2607 struct commit_list *l;
2608 for (l = revs->commits; l; l = l->next) {
2609 struct commit *commit = l->item;
2610 struct commit_list *p;
2611
2612 for (p = commit->parents; p; p = p->next)
2613 add_child(revs, p->item, commit);
2614 }
2615}
2616
bcc0a3ea
HV
2617void reset_revision_walk(void)
2618{
2619 clear_object_flags(SEEN | ADDED | SHOWN);
2620}
2621
cc0e6c5a 2622int prepare_revision_walk(struct rev_info *revs)
a4a88b2b 2623{
1f1e895f 2624 int nr = revs->pending.nr;
94d23673 2625 struct object_array_entry *e, *list;
2e7da8e9 2626 struct commit_list **next = &revs->commits;
cd2bdc53 2627
94d23673 2628 e = list = revs->pending.objects;
1f1e895f
LT
2629 revs->pending.nr = 0;
2630 revs->pending.alloc = 0;
2631 revs->pending.objects = NULL;
2632 while (--nr >= 0) {
94d23673 2633 struct commit *commit = handle_commit(revs, e->item, e->name);
cd2bdc53
LT
2634 if (commit) {
2635 if (!(commit->object.flags & SEEN)) {
2636 commit->object.flags |= SEEN;
2e7da8e9 2637 next = commit_list_append(commit, next);
cd2bdc53
LT
2638 }
2639 }
94d23673 2640 e++;
cd2bdc53 2641 }
4a43d374
RS
2642 if (!revs->leak_pending)
2643 free(list);
cd2bdc53 2644
d0af663e 2645 /* Signal whether we need per-parent treesame decoration */
4d826608
KB
2646 if (revs->simplify_merges ||
2647 (revs->limited && limiting_can_increase_treesame(revs)))
d0af663e
KB
2648 revs->treesame.name = "treesame";
2649
ca92e59e
MZ
2650 if (revs->no_walk != REVISION_WALK_NO_WALK_UNSORTED)
2651 commit_list_sort_by_date(&revs->commits);
ba1d4505 2652 if (revs->no_walk)
cc0e6c5a 2653 return 0;
a4a88b2b 2654 if (revs->limited)
cc0e6c5a
AR
2655 if (limit_list(revs) < 0)
2656 return -1;
a4a88b2b 2657 if (revs->topo_order)
08f704f2 2658 sort_in_topological_order(&revs->commits, revs->sort_order);
12da1d1f
TR
2659 if (revs->line_level_traverse)
2660 line_log_filter(revs);
6546b593
JH
2661 if (revs->simplify_merges)
2662 simplify_merges(revs);
f35f5603
JH
2663 if (revs->children.name)
2664 set_children(revs);
cc0e6c5a 2665 return 0;
a4a88b2b
LT
2666}
2667
cc0e6c5a 2668static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp)
765ac8ec 2669{
fce87ae5
AG
2670 struct commit_list *cache = NULL;
2671
765ac8ec
LT
2672 for (;;) {
2673 struct commit *p = *pp;
3381c790 2674 if (!revs->limited)
fce87ae5 2675 if (add_parents_to_list(revs, p, &revs->commits, &cache) < 0)
cc0e6c5a 2676 return rewrite_one_error;
7dc0fe3b
LT
2677 if (p->object.flags & UNINTERESTING)
2678 return rewrite_one_ok;
2679 if (!(p->object.flags & TREESAME))
cc0e6c5a 2680 return rewrite_one_ok;
765ac8ec 2681 if (!p->parents)
cc0e6c5a 2682 return rewrite_one_noparents;
4d826608
KB
2683 if ((p = one_relevant_parent(revs, p->parents)) == NULL)
2684 return rewrite_one_ok;
2685 *pp = p;
765ac8ec
LT
2686 }
2687}
2688
c7edcae0
BY
2689int rewrite_parents(struct rev_info *revs, struct commit *commit,
2690 rewrite_parent_fn_t rewrite_parent)
765ac8ec
LT
2691{
2692 struct commit_list **pp = &commit->parents;
2693 while (*pp) {
2694 struct commit_list *parent = *pp;
c7edcae0 2695 switch (rewrite_parent(revs, &parent->item)) {
cc0e6c5a
AR
2696 case rewrite_one_ok:
2697 break;
2698 case rewrite_one_noparents:
765ac8ec
LT
2699 *pp = parent->next;
2700 continue;
cc0e6c5a
AR
2701 case rewrite_one_error:
2702 return -1;
765ac8ec
LT
2703 }
2704 pp = &parent->next;
2705 }
d0af663e 2706 remove_duplicate_parents(revs, commit);
cc0e6c5a 2707 return 0;
765ac8ec
LT
2708}
2709
d72fbe81
AP
2710static int commit_rewrite_person(struct strbuf *buf, const char *what, struct string_list *mailmap)
2711{
2712 char *person, *endp;
2713 size_t len, namelen, maillen;
2714 const char *name;
2715 const char *mail;
2716 struct ident_split ident;
2717
2718 person = strstr(buf->buf, what);
2719 if (!person)
2720 return 0;
2721
2722 person += strlen(what);
2723 endp = strchr(person, '\n');
2724 if (!endp)
2725 return 0;
2726
2727 len = endp - person;
2728
2729 if (split_ident_line(&ident, person, len))
2730 return 0;
2731
2732 mail = ident.mail_begin;
2733 maillen = ident.mail_end - ident.mail_begin;
2734 name = ident.name_begin;
2735 namelen = ident.name_end - ident.name_begin;
2736
2737 if (map_user(mailmap, &mail, &maillen, &name, &namelen)) {
2738 struct strbuf namemail = STRBUF_INIT;
2739
2740 strbuf_addf(&namemail, "%.*s <%.*s>",
2741 (int)namelen, name, (int)maillen, mail);
2742
2743 strbuf_splice(buf, ident.name_begin - buf->buf,
2744 ident.mail_end - ident.name_begin + 1,
2745 namemail.buf, namemail.len);
2746
2747 strbuf_release(&namemail);
2748
2749 return 1;
2750 }
2751
2752 return 0;
2753}
2754
8ecae9b0
JH
2755static int commit_match(struct commit *commit, struct rev_info *opt)
2756{
72fd13f7 2757 int retval;
04deccda
JK
2758 const char *encoding;
2759 char *message;
72fd13f7 2760 struct strbuf buf = STRBUF_INIT;
04deccda 2761
80235ba7 2762 if (!opt->grep_filter.pattern_list && !opt->grep_filter.header_list)
8ecae9b0 2763 return 1;
baa6378f
JH
2764
2765 /* Prepend "fake" headers as needed */
2766 if (opt->grep_filter.use_reflog_filter) {
72fd13f7
NTND
2767 strbuf_addstr(&buf, "reflog ");
2768 get_reflog_message(&buf, opt->reflog_info);
2769 strbuf_addch(&buf, '\n');
72fd13f7 2770 }
baa6378f 2771
04deccda
JK
2772 /*
2773 * We grep in the user's output encoding, under the assumption that it
2774 * is the encoding they are most likely to write their grep pattern
2775 * for. In addition, it means we will match the "notes" encoding below,
2776 * so we will not end up with a buffer that has two different encodings
2777 * in it.
2778 */
2779 encoding = get_log_output_encoding();
5a10d236 2780 message = logmsg_reencode(commit, NULL, encoding);
04deccda 2781
baa6378f
JH
2782 /* Copy the commit to temporary if we are using "fake" headers */
2783 if (buf.len)
04deccda 2784 strbuf_addstr(&buf, message);
baa6378f 2785
df874fa8 2786 if (opt->grep_filter.header_list && opt->mailmap) {
d72fbe81 2787 if (!buf.len)
04deccda 2788 strbuf_addstr(&buf, message);
d72fbe81
AP
2789
2790 commit_rewrite_person(&buf, "\nauthor ", opt->mailmap);
2791 commit_rewrite_person(&buf, "\ncommitter ", opt->mailmap);
2792 }
2793
38cfe915
NTND
2794 /* Append "fake" message parts as needed */
2795 if (opt->show_notes) {
2796 if (!buf.len)
04deccda
JK
2797 strbuf_addstr(&buf, message);
2798 format_display_notes(commit->object.sha1, &buf, encoding, 1);
38cfe915
NTND
2799 }
2800
04deccda 2801 /* Find either in the original commit message, or in the temporary */
72fd13f7
NTND
2802 if (buf.len)
2803 retval = grep_buffer(&opt->grep_filter, buf.buf, buf.len);
2804 else
2805 retval = grep_buffer(&opt->grep_filter,
04deccda 2806 message, strlen(message));
72fd13f7 2807 strbuf_release(&buf);
04deccda 2808 logmsg_free(message, commit);
72fd13f7 2809 return retval;
8ecae9b0
JH
2810}
2811
f35f5603
JH
2812static inline int want_ancestry(struct rev_info *revs)
2813{
8bb65883 2814 return (revs->rewrite_parents || revs->children.name);
f35f5603
JH
2815}
2816
beb5af43 2817enum commit_action get_commit_action(struct rev_info *revs, struct commit *commit)
252a7c02
LT
2818{
2819 if (commit->object.flags & SHOWN)
2820 return commit_ignore;
4d6acb70 2821 if (revs->unpacked && has_sha1_pack(commit->object.sha1))
252a7c02 2822 return commit_ignore;
3131b713
LT
2823 if (revs->show_all)
2824 return commit_show;
252a7c02
LT
2825 if (commit->object.flags & UNINTERESTING)
2826 return commit_ignore;
2827 if (revs->min_age != -1 && (commit->date > revs->min_age))
2828 return commit_ignore;
ad5aeede 2829 if (revs->min_parents || (revs->max_parents >= 0)) {
bf3418b0 2830 int n = commit_list_count(commit->parents);
ad5aeede
MG
2831 if ((n < revs->min_parents) ||
2832 ((revs->max_parents >= 0) && (n > revs->max_parents)))
2833 return commit_ignore;
2834 }
252a7c02
LT
2835 if (!commit_match(commit, revs))
2836 return commit_ignore;
53b2c823 2837 if (revs->prune && revs->dense) {
252a7c02 2838 /* Commit without changes? */
7dc0fe3b 2839 if (commit->object.flags & TREESAME) {
bf3418b0
KB
2840 int n;
2841 struct commit_list *p;
252a7c02 2842 /* drop merges unless we want parenthood */
f35f5603 2843 if (!want_ancestry(revs))
252a7c02 2844 return commit_ignore;
bf3418b0
KB
2845 /*
2846 * If we want ancestry, then need to keep any merges
2847 * between relevant commits to tie together topology.
2848 * For consistency with TREESAME and simplification
2849 * use "relevant" here rather than just INTERESTING,
2850 * to treat bottom commit(s) as part of the topology.
2851 */
2852 for (n = 0, p = commit->parents; p; p = p->next)
2853 if (relevant_commit(p->item))
2854 if (++n >= 2)
2855 return commit_show;
2856 return commit_ignore;
252a7c02 2857 }
252a7c02
LT
2858 }
2859 return commit_show;
2860}
2861
beb5af43
AS
2862enum commit_action simplify_commit(struct rev_info *revs, struct commit *commit)
2863{
2864 enum commit_action action = get_commit_action(revs, commit);
2865
2866 if (action == commit_show &&
2867 !revs->show_all &&
2868 revs->prune && revs->dense && want_ancestry(revs)) {
c7edcae0 2869 if (rewrite_parents(revs, commit, rewrite_one) < 0)
beb5af43
AS
2870 return commit_error;
2871 }
2872 return action;
2873}
2874
d5db6c9e 2875static struct commit *get_revision_1(struct rev_info *revs)
a4a88b2b 2876{
d5db6c9e 2877 if (!revs->commits)
a4a88b2b 2878 return NULL;
a4a88b2b 2879
765ac8ec 2880 do {
cb115748
LT
2881 struct commit_list *entry = revs->commits;
2882 struct commit *commit = entry->item;
ea5ed3ab 2883
cb115748
LT
2884 revs->commits = entry->next;
2885 free(entry);
2a0925be 2886
ffa1eeae 2887 if (revs->reflog_info) {
8860fd42 2888 fake_reflog_parent(revs->reflog_info, commit);
ffa1eeae
JK
2889 commit->object.flags &= ~(ADDED | SEEN | SHOWN);
2890 }
8860fd42 2891
2a0925be
LT
2892 /*
2893 * If we haven't done the list limiting, we need to look at
be7db6e5
LT
2894 * the parents here. We also need to do the date-based limiting
2895 * that we'd otherwise have done in limit_list().
2a0925be 2896 */
be7db6e5 2897 if (!revs->limited) {
744f4985 2898 if (revs->max_age != -1 &&
86ab4906
JH
2899 (commit->date < revs->max_age))
2900 continue;
fce87ae5 2901 if (add_parents_to_list(revs, commit, &revs->commits, NULL) < 0)
ed62089c
JH
2902 die("Failed to traverse parents of commit %s",
2903 sha1_to_hex(commit->object.sha1));
be7db6e5 2904 }
744f4985 2905
252a7c02
LT
2906 switch (simplify_commit(revs, commit)) {
2907 case commit_ignore:
8ecae9b0 2908 continue;
252a7c02 2909 case commit_error:
ed62089c
JH
2910 die("Failed to simplify parents of commit %s",
2911 sha1_to_hex(commit->object.sha1));
252a7c02
LT
2912 default:
2913 return commit;
384e99a4 2914 }
765ac8ec
LT
2915 } while (revs->commits);
2916 return NULL;
2917}
d5db6c9e 2918
be6754c6
MH
2919/*
2920 * Return true for entries that have not yet been shown. (This is an
2921 * object_array_each_func_t.)
2922 */
2923static int entry_unshown(struct object_array_entry *entry, void *cb_data_unused)
86ab4906 2924{
be6754c6
MH
2925 return !(entry->item->flags & SHOWN);
2926}
86ab4906 2927
be6754c6
MH
2928/*
2929 * If array is on the verge of a realloc, garbage-collect any entries
2930 * that have already been shown to try to free up some space.
2931 */
2932static void gc_boundary(struct object_array *array)
2933{
2934 if (array->nr == array->alloc)
2935 object_array_filter(array, entry_unshown, NULL);
86ab4906
JH
2936}
2937
4603ec0f
AS
2938static void create_boundary_commit_list(struct rev_info *revs)
2939{
2940 unsigned i;
2941 struct commit *c;
2942 struct object_array *array = &revs->boundary_commits;
2943 struct object_array_entry *objects = array->objects;
2944
2945 /*
2946 * If revs->commits is non-NULL at this point, an error occurred in
2947 * get_revision_1(). Ignore the error and continue printing the
2948 * boundary commits anyway. (This is what the code has always
2949 * done.)
2950 */
2951 if (revs->commits) {
2952 free_commit_list(revs->commits);
2953 revs->commits = NULL;
2954 }
2955
2956 /*
2957 * Put all of the actual boundary commits from revs->boundary_commits
2958 * into revs->commits
2959 */
2960 for (i = 0; i < array->nr; i++) {
2961 c = (struct commit *)(objects[i].item);
2962 if (!c)
2963 continue;
2964 if (!(c->object.flags & CHILD_SHOWN))
2965 continue;
2966 if (c->object.flags & (SHOWN | BOUNDARY))
2967 continue;
2968 c->object.flags |= BOUNDARY;
2969 commit_list_insert(c, &revs->commits);
2970 }
2971
2972 /*
2973 * If revs->topo_order is set, sort the boundary commits
2974 * in topological order
2975 */
08f704f2 2976 sort_in_topological_order(&revs->commits, revs->sort_order);
4603ec0f
AS
2977}
2978
7fefda5c 2979static struct commit *get_revision_internal(struct rev_info *revs)
d5db6c9e
JH
2980{
2981 struct commit *c = NULL;
86ab4906
JH
2982 struct commit_list *l;
2983
2984 if (revs->boundary == 2) {
4603ec0f
AS
2985 /*
2986 * All of the normal commits have already been returned,
2987 * and we are now returning boundary commits.
2988 * create_boundary_commit_list() has populated
2989 * revs->commits with the remaining commits to return.
2990 */
2991 c = pop_commit(&revs->commits);
2992 if (c)
2993 c->object.flags |= SHOWN;
9c5e66e9
JS
2994 return c;
2995 }
2996
86ab4906 2997 /*
b72a1904
JK
2998 * If our max_count counter has reached zero, then we are done. We
2999 * don't simply return NULL because we still might need to show
3000 * boundary commits. But we want to avoid calling get_revision_1, which
3001 * might do a considerable amount of work finding the next commit only
3002 * for us to throw it away.
3003 *
3004 * If it is non-zero, then either we don't have a max_count at all
3005 * (-1), or it is still counting, in which case we decrement.
86ab4906 3006 */
b72a1904
JK
3007 if (revs->max_count) {
3008 c = get_revision_1(revs);
3009 if (c) {
3010 while (0 < revs->skip_count) {
3011 revs->skip_count--;
3012 c = get_revision_1(revs);
3013 if (!c)
3014 break;
3015 }
8839ac94 3016 }
86ab4906 3017
b72a1904
JK
3018 if (revs->max_count > 0)
3019 revs->max_count--;
d5db6c9e 3020 }
86ab4906 3021
c33d8593
JH
3022 if (c)
3023 c->object.flags |= SHOWN;
3024
3025 if (!revs->boundary) {
d5db6c9e 3026 return c;
c33d8593 3027 }
86ab4906
JH
3028
3029 if (!c) {
3030 /*
3031 * get_revision_1() runs out the commits, and
3032 * we are done computing the boundaries.
3033 * switch to boundary commits output mode.
3034 */
3035 revs->boundary = 2;
4603ec0f
AS
3036
3037 /*
3038 * Update revs->commits to contain the list of
3039 * boundary commits.
3040 */
3041 create_boundary_commit_list(revs);
3042
3c68d67b 3043 return get_revision_internal(revs);
86ab4906
JH
3044 }
3045
3046 /*
3047 * boundary commits are the commits that are parents of the
3048 * ones we got from get_revision_1() but they themselves are
3049 * not returned from get_revision_1(). Before returning
3050 * 'c', we need to mark its parents that they could be boundaries.
3051 */
3052
3053 for (l = c->parents; l; l = l->next) {
3054 struct object *p;
3055 p = &(l->item->object);
c33d8593 3056 if (p->flags & (CHILD_SHOWN | SHOWN))
86ab4906
JH
3057 continue;
3058 p->flags |= CHILD_SHOWN;
3059 gc_boundary(&revs->boundary_commits);
3060 add_object_array(p, NULL, &revs->boundary_commits);
3061 }
3062
3063 return c;
d5db6c9e 3064}
7fefda5c
AS
3065
3066struct commit *get_revision(struct rev_info *revs)
3067{
498bcd31
TR
3068 struct commit *c;
3069 struct commit_list *reversed;
3070
3071 if (revs->reverse) {
3072 reversed = NULL;
3073 while ((c = get_revision_internal(revs))) {
3074 commit_list_insert(c, &reversed);
3075 }
3076 revs->commits = reversed;
3077 revs->reverse = 0;
3078 revs->reverse_output_stage = 1;
3079 }
3080
3081 if (revs->reverse_output_stage)
3082 return pop_commit(&revs->commits);
3083
3084 c = get_revision_internal(revs);
7fefda5c
AS
3085 if (c && revs->graph)
3086 graph_update(revs->graph, c);
3087 return c;
3088}
1df2d656
MG
3089
3090char *get_revision_mark(const struct rev_info *revs, const struct commit *commit)
3091{
3092 if (commit->object.flags & BOUNDARY)
3093 return "-";
3094 else if (commit->object.flags & UNINTERESTING)
3095 return "^";
adbbb31e
MG
3096 else if (commit->object.flags & PATCHSAME)
3097 return "=";
1df2d656
MG
3098 else if (!revs || revs->left_right) {
3099 if (commit->object.flags & SYMMETRIC_LEFT)
3100 return "<";
3101 else
3102 return ">";
3103 } else if (revs->graph)
3104 return "*";
adbbb31e
MG
3105 else if (revs->cherry_mark)
3106 return "+";
1df2d656
MG
3107 return "";
3108}
b1b47554
MG
3109
3110void put_revision_mark(const struct rev_info *revs, const struct commit *commit)
3111{
3112 char *mark = get_revision_mark(revs, commit);
3113 if (!strlen(mark))
3114 return;
3115 fputs(mark, stdout);
3116 putchar(' ');
3117}