tag: factor out get_tagged_oid()
[git/git.git] / revision.c
1 #include "cache.h"
2 #include "object-store.h"
3 #include "tag.h"
4 #include "blob.h"
5 #include "tree.h"
6 #include "commit.h"
7 #include "diff.h"
8 #include "refs.h"
9 #include "revision.h"
10 #include "repository.h"
11 #include "graph.h"
12 #include "grep.h"
13 #include "reflog-walk.h"
14 #include "patch-ids.h"
15 #include "decorate.h"
16 #include "log-tree.h"
17 #include "string-list.h"
18 #include "line-log.h"
19 #include "mailmap.h"
20 #include "commit-slab.h"
21 #include "dir.h"
22 #include "cache-tree.h"
23 #include "bisect.h"
24 #include "packfile.h"
25 #include "worktree.h"
26 #include "argv-array.h"
27 #include "commit-reach.h"
28 #include "commit-graph.h"
29 #include "prio-queue.h"
30 #include "hashmap.h"
31
32 volatile show_early_output_fn_t show_early_output;
33
34 static const char *term_bad;
35 static const char *term_good;
36
37 implement_shared_commit_slab(revision_sources, char *);
38
39 void show_object_with_name(FILE *out, struct object *obj, const char *name)
40 {
41 const char *p;
42
43 fprintf(out, "%s ", oid_to_hex(&obj->oid));
44 for (p = name; *p && *p != '\n'; p++)
45 fputc(*p, out);
46 fputc('\n', out);
47 }
48
49 static void mark_blob_uninteresting(struct blob *blob)
50 {
51 if (!blob)
52 return;
53 if (blob->object.flags & UNINTERESTING)
54 return;
55 blob->object.flags |= UNINTERESTING;
56 }
57
58 static void mark_tree_contents_uninteresting(struct repository *r,
59 struct tree *tree)
60 {
61 struct tree_desc desc;
62 struct name_entry entry;
63
64 if (parse_tree_gently(tree, 1) < 0)
65 return;
66
67 init_tree_desc(&desc, tree->buffer, tree->size);
68 while (tree_entry(&desc, &entry)) {
69 switch (object_type(entry.mode)) {
70 case OBJ_TREE:
71 mark_tree_uninteresting(r, lookup_tree(r, &entry.oid));
72 break;
73 case OBJ_BLOB:
74 mark_blob_uninteresting(lookup_blob(r, &entry.oid));
75 break;
76 default:
77 /* Subproject commit - not in this repository */
78 break;
79 }
80 }
81
82 /*
83 * We don't care about the tree any more
84 * after it has been marked uninteresting.
85 */
86 free_tree_buffer(tree);
87 }
88
89 void mark_tree_uninteresting(struct repository *r, struct tree *tree)
90 {
91 struct object *obj;
92
93 if (!tree)
94 return;
95
96 obj = &tree->object;
97 if (obj->flags & UNINTERESTING)
98 return;
99 obj->flags |= UNINTERESTING;
100 mark_tree_contents_uninteresting(r, tree);
101 }
102
103 struct path_and_oids_entry {
104 struct hashmap_entry ent;
105 char *path;
106 struct oidset trees;
107 };
108
109 static int path_and_oids_cmp(const void *hashmap_cmp_fn_data,
110 const struct path_and_oids_entry *e1,
111 const struct path_and_oids_entry *e2,
112 const void *keydata)
113 {
114 return strcmp(e1->path, e2->path);
115 }
116
117 static void paths_and_oids_init(struct hashmap *map)
118 {
119 hashmap_init(map, (hashmap_cmp_fn) path_and_oids_cmp, NULL, 0);
120 }
121
122 static void paths_and_oids_clear(struct hashmap *map)
123 {
124 struct hashmap_iter iter;
125 struct path_and_oids_entry *entry;
126 hashmap_iter_init(map, &iter);
127
128 while ((entry = (struct path_and_oids_entry *)hashmap_iter_next(&iter))) {
129 oidset_clear(&entry->trees);
130 free(entry->path);
131 }
132
133 hashmap_free(map, 1);
134 }
135
136 static void paths_and_oids_insert(struct hashmap *map,
137 const char *path,
138 const struct object_id *oid)
139 {
140 int hash = strhash(path);
141 struct path_and_oids_entry key;
142 struct path_and_oids_entry *entry;
143
144 hashmap_entry_init(&key, hash);
145
146 /* use a shallow copy for the lookup */
147 key.path = (char *)path;
148 oidset_init(&key.trees, 0);
149
150 if (!(entry = (struct path_and_oids_entry *)hashmap_get(map, &key, NULL))) {
151 entry = xcalloc(1, sizeof(struct path_and_oids_entry));
152 hashmap_entry_init(entry, hash);
153 entry->path = xstrdup(key.path);
154 oidset_init(&entry->trees, 16);
155 hashmap_put(map, entry);
156 }
157
158 oidset_insert(&entry->trees, oid);
159 }
160
161 static void add_children_by_path(struct repository *r,
162 struct tree *tree,
163 struct hashmap *map)
164 {
165 struct tree_desc desc;
166 struct name_entry entry;
167
168 if (!tree)
169 return;
170
171 if (parse_tree_gently(tree, 1) < 0)
172 return;
173
174 init_tree_desc(&desc, tree->buffer, tree->size);
175 while (tree_entry(&desc, &entry)) {
176 switch (object_type(entry.mode)) {
177 case OBJ_TREE:
178 paths_and_oids_insert(map, entry.path, &entry.oid);
179
180 if (tree->object.flags & UNINTERESTING) {
181 struct tree *child = lookup_tree(r, &entry.oid);
182 if (child)
183 child->object.flags |= UNINTERESTING;
184 }
185 break;
186 case OBJ_BLOB:
187 if (tree->object.flags & UNINTERESTING) {
188 struct blob *child = lookup_blob(r, &entry.oid);
189 if (child)
190 child->object.flags |= UNINTERESTING;
191 }
192 break;
193 default:
194 /* Subproject commit - not in this repository */
195 break;
196 }
197 }
198
199 free_tree_buffer(tree);
200 }
201
202 void mark_trees_uninteresting_sparse(struct repository *r,
203 struct oidset *trees)
204 {
205 unsigned has_interesting = 0, has_uninteresting = 0;
206 struct hashmap map;
207 struct hashmap_iter map_iter;
208 struct path_and_oids_entry *entry;
209 struct object_id *oid;
210 struct oidset_iter iter;
211
212 oidset_iter_init(trees, &iter);
213 while ((!has_interesting || !has_uninteresting) &&
214 (oid = oidset_iter_next(&iter))) {
215 struct tree *tree = lookup_tree(r, oid);
216
217 if (!tree)
218 continue;
219
220 if (tree->object.flags & UNINTERESTING)
221 has_uninteresting = 1;
222 else
223 has_interesting = 1;
224 }
225
226 /* Do not walk unless we have both types of trees. */
227 if (!has_uninteresting || !has_interesting)
228 return;
229
230 paths_and_oids_init(&map);
231
232 oidset_iter_init(trees, &iter);
233 while ((oid = oidset_iter_next(&iter))) {
234 struct tree *tree = lookup_tree(r, oid);
235 add_children_by_path(r, tree, &map);
236 }
237
238 hashmap_iter_init(&map, &map_iter);
239 while ((entry = hashmap_iter_next(&map_iter)))
240 mark_trees_uninteresting_sparse(r, &entry->trees);
241
242 paths_and_oids_clear(&map);
243 }
244
245 struct commit_stack {
246 struct commit **items;
247 size_t nr, alloc;
248 };
249 #define COMMIT_STACK_INIT { NULL, 0, 0 }
250
251 static void commit_stack_push(struct commit_stack *stack, struct commit *commit)
252 {
253 ALLOC_GROW(stack->items, stack->nr + 1, stack->alloc);
254 stack->items[stack->nr++] = commit;
255 }
256
257 static struct commit *commit_stack_pop(struct commit_stack *stack)
258 {
259 return stack->nr ? stack->items[--stack->nr] : NULL;
260 }
261
262 static void commit_stack_clear(struct commit_stack *stack)
263 {
264 FREE_AND_NULL(stack->items);
265 stack->nr = stack->alloc = 0;
266 }
267
268 static void mark_one_parent_uninteresting(struct commit *commit,
269 struct commit_stack *pending)
270 {
271 struct commit_list *l;
272
273 if (commit->object.flags & UNINTERESTING)
274 return;
275 commit->object.flags |= UNINTERESTING;
276
277 /*
278 * Normally we haven't parsed the parent
279 * yet, so we won't have a parent of a parent
280 * here. However, it may turn out that we've
281 * reached this commit some other way (where it
282 * wasn't uninteresting), in which case we need
283 * to mark its parents recursively too..
284 */
285 for (l = commit->parents; l; l = l->next)
286 commit_stack_push(pending, l->item);
287 }
288
289 void mark_parents_uninteresting(struct commit *commit)
290 {
291 struct commit_stack pending = COMMIT_STACK_INIT;
292 struct commit_list *l;
293
294 for (l = commit->parents; l; l = l->next)
295 mark_one_parent_uninteresting(l->item, &pending);
296
297 while (pending.nr > 0)
298 mark_one_parent_uninteresting(commit_stack_pop(&pending),
299 &pending);
300
301 commit_stack_clear(&pending);
302 }
303
304 static void add_pending_object_with_path(struct rev_info *revs,
305 struct object *obj,
306 const char *name, unsigned mode,
307 const char *path)
308 {
309 if (!obj)
310 return;
311 if (revs->no_walk && (obj->flags & UNINTERESTING))
312 revs->no_walk = 0;
313 if (revs->reflog_info && obj->type == OBJ_COMMIT) {
314 struct strbuf buf = STRBUF_INIT;
315 int len = interpret_branch_name(name, 0, &buf, 0);
316
317 if (0 < len && name[len] && buf.len)
318 strbuf_addstr(&buf, name + len);
319 add_reflog_for_walk(revs->reflog_info,
320 (struct commit *)obj,
321 buf.buf[0] ? buf.buf: name);
322 strbuf_release(&buf);
323 return; /* do not add the commit itself */
324 }
325 add_object_array_with_path(obj, name, &revs->pending, mode, path);
326 }
327
328 static void add_pending_object_with_mode(struct rev_info *revs,
329 struct object *obj,
330 const char *name, unsigned mode)
331 {
332 add_pending_object_with_path(revs, obj, name, mode, NULL);
333 }
334
335 void add_pending_object(struct rev_info *revs,
336 struct object *obj, const char *name)
337 {
338 add_pending_object_with_mode(revs, obj, name, S_IFINVALID);
339 }
340
341 void add_head_to_pending(struct rev_info *revs)
342 {
343 struct object_id oid;
344 struct object *obj;
345 if (get_oid("HEAD", &oid))
346 return;
347 obj = parse_object(revs->repo, &oid);
348 if (!obj)
349 return;
350 add_pending_object(revs, obj, "HEAD");
351 }
352
353 static struct object *get_reference(struct rev_info *revs, const char *name,
354 const struct object_id *oid,
355 unsigned int flags)
356 {
357 struct object *object;
358
359 /*
360 * If the repository has commit graphs, repo_parse_commit() avoids
361 * reading the object buffer, so use it whenever possible.
362 */
363 if (oid_object_info(revs->repo, oid, NULL) == OBJ_COMMIT) {
364 struct commit *c = lookup_commit(revs->repo, oid);
365 if (!repo_parse_commit(revs->repo, c))
366 object = (struct object *) c;
367 else
368 object = NULL;
369 } else {
370 object = parse_object(revs->repo, oid);
371 }
372
373 if (!object) {
374 if (revs->ignore_missing)
375 return object;
376 if (revs->exclude_promisor_objects && is_promisor_object(oid))
377 return NULL;
378 die("bad object %s", name);
379 }
380 object->flags |= flags;
381 return object;
382 }
383
384 void add_pending_oid(struct rev_info *revs, const char *name,
385 const struct object_id *oid, unsigned int flags)
386 {
387 struct object *object = get_reference(revs, name, oid, flags);
388 add_pending_object(revs, object, name);
389 }
390
391 static struct commit *handle_commit(struct rev_info *revs,
392 struct object_array_entry *entry)
393 {
394 struct object *object = entry->item;
395 const char *name = entry->name;
396 const char *path = entry->path;
397 unsigned int mode = entry->mode;
398 unsigned long flags = object->flags;
399
400 /*
401 * Tag object? Look what it points to..
402 */
403 while (object->type == OBJ_TAG) {
404 struct tag *tag = (struct tag *) object;
405 if (revs->tag_objects && !(flags & UNINTERESTING))
406 add_pending_object(revs, object, tag->tag);
407 object = parse_object(revs->repo, get_tagged_oid(tag));
408 if (!object) {
409 if (revs->ignore_missing_links || (flags & UNINTERESTING))
410 return NULL;
411 if (revs->exclude_promisor_objects &&
412 is_promisor_object(&tag->tagged->oid))
413 return NULL;
414 die("bad object %s", oid_to_hex(&tag->tagged->oid));
415 }
416 object->flags |= flags;
417 /*
418 * We'll handle the tagged object by looping or dropping
419 * through to the non-tag handlers below. Do not
420 * propagate path data from the tag's pending entry.
421 */
422 path = NULL;
423 mode = 0;
424 }
425
426 /*
427 * Commit object? Just return it, we'll do all the complex
428 * reachability crud.
429 */
430 if (object->type == OBJ_COMMIT) {
431 struct commit *commit = (struct commit *)object;
432
433 if (parse_commit(commit) < 0)
434 die("unable to parse commit %s", name);
435 if (flags & UNINTERESTING) {
436 mark_parents_uninteresting(commit);
437
438 if (!revs->topo_order || !generation_numbers_enabled(the_repository))
439 revs->limited = 1;
440 }
441 if (revs->sources) {
442 char **slot = revision_sources_at(revs->sources, commit);
443
444 if (!*slot)
445 *slot = xstrdup(name);
446 }
447 return commit;
448 }
449
450 /*
451 * Tree object? Either mark it uninteresting, or add it
452 * to the list of objects to look at later..
453 */
454 if (object->type == OBJ_TREE) {
455 struct tree *tree = (struct tree *)object;
456 if (!revs->tree_objects)
457 return NULL;
458 if (flags & UNINTERESTING) {
459 mark_tree_contents_uninteresting(revs->repo, tree);
460 return NULL;
461 }
462 add_pending_object_with_path(revs, object, name, mode, path);
463 return NULL;
464 }
465
466 /*
467 * Blob object? You know the drill by now..
468 */
469 if (object->type == OBJ_BLOB) {
470 if (!revs->blob_objects)
471 return NULL;
472 if (flags & UNINTERESTING)
473 return NULL;
474 add_pending_object_with_path(revs, object, name, mode, path);
475 return NULL;
476 }
477 die("%s is unknown object", name);
478 }
479
480 static int everybody_uninteresting(struct commit_list *orig,
481 struct commit **interesting_cache)
482 {
483 struct commit_list *list = orig;
484
485 if (*interesting_cache) {
486 struct commit *commit = *interesting_cache;
487 if (!(commit->object.flags & UNINTERESTING))
488 return 0;
489 }
490
491 while (list) {
492 struct commit *commit = list->item;
493 list = list->next;
494 if (commit->object.flags & UNINTERESTING)
495 continue;
496
497 *interesting_cache = commit;
498 return 0;
499 }
500 return 1;
501 }
502
503 /*
504 * A definition of "relevant" commit that we can use to simplify limited graphs
505 * by eliminating side branches.
506 *
507 * A "relevant" commit is one that is !UNINTERESTING (ie we are including it
508 * in our list), or that is a specified BOTTOM commit. Then after computing
509 * a limited list, during processing we can generally ignore boundary merges
510 * coming from outside the graph, (ie from irrelevant parents), and treat
511 * those merges as if they were single-parent. TREESAME is defined to consider
512 * only relevant parents, if any. If we are TREESAME to our on-graph parents,
513 * we don't care if we were !TREESAME to non-graph parents.
514 *
515 * Treating bottom commits as relevant ensures that a limited graph's
516 * connection to the actual bottom commit is not viewed as a side branch, but
517 * treated as part of the graph. For example:
518 *
519 * ....Z...A---X---o---o---B
520 * . /
521 * W---Y
522 *
523 * When computing "A..B", the A-X connection is at least as important as
524 * Y-X, despite A being flagged UNINTERESTING.
525 *
526 * And when computing --ancestry-path "A..B", the A-X connection is more
527 * important than Y-X, despite both A and Y being flagged UNINTERESTING.
528 */
529 static inline int relevant_commit(struct commit *commit)
530 {
531 return (commit->object.flags & (UNINTERESTING | BOTTOM)) != UNINTERESTING;
532 }
533
534 /*
535 * Return a single relevant commit from a parent list. If we are a TREESAME
536 * commit, and this selects one of our parents, then we can safely simplify to
537 * that parent.
538 */
539 static struct commit *one_relevant_parent(const struct rev_info *revs,
540 struct commit_list *orig)
541 {
542 struct commit_list *list = orig;
543 struct commit *relevant = NULL;
544
545 if (!orig)
546 return NULL;
547
548 /*
549 * For 1-parent commits, or if first-parent-only, then return that
550 * first parent (even if not "relevant" by the above definition).
551 * TREESAME will have been set purely on that parent.
552 */
553 if (revs->first_parent_only || !orig->next)
554 return orig->item;
555
556 /*
557 * For multi-parent commits, identify a sole relevant parent, if any.
558 * If we have only one relevant parent, then TREESAME will be set purely
559 * with regard to that parent, and we can simplify accordingly.
560 *
561 * If we have more than one relevant parent, or no relevant parents
562 * (and multiple irrelevant ones), then we can't select a parent here
563 * and return NULL.
564 */
565 while (list) {
566 struct commit *commit = list->item;
567 list = list->next;
568 if (relevant_commit(commit)) {
569 if (relevant)
570 return NULL;
571 relevant = commit;
572 }
573 }
574 return relevant;
575 }
576
577 /*
578 * The goal is to get REV_TREE_NEW as the result only if the
579 * diff consists of all '+' (and no other changes), REV_TREE_OLD
580 * if the whole diff is removal of old data, and otherwise
581 * REV_TREE_DIFFERENT (of course if the trees are the same we
582 * want REV_TREE_SAME).
583 *
584 * The only time we care about the distinction is when
585 * remove_empty_trees is in effect, in which case we care only about
586 * whether the whole change is REV_TREE_NEW, or if there's another type
587 * of change. Which means we can stop the diff early in either of these
588 * cases:
589 *
590 * 1. We're not using remove_empty_trees at all.
591 *
592 * 2. We saw anything except REV_TREE_NEW.
593 */
594 static int tree_difference = REV_TREE_SAME;
595
596 static void file_add_remove(struct diff_options *options,
597 int addremove, unsigned mode,
598 const struct object_id *oid,
599 int oid_valid,
600 const char *fullpath, unsigned dirty_submodule)
601 {
602 int diff = addremove == '+' ? REV_TREE_NEW : REV_TREE_OLD;
603 struct rev_info *revs = options->change_fn_data;
604
605 tree_difference |= diff;
606 if (!revs->remove_empty_trees || tree_difference != REV_TREE_NEW)
607 options->flags.has_changes = 1;
608 }
609
610 static void file_change(struct diff_options *options,
611 unsigned old_mode, unsigned new_mode,
612 const struct object_id *old_oid,
613 const struct object_id *new_oid,
614 int old_oid_valid, int new_oid_valid,
615 const char *fullpath,
616 unsigned old_dirty_submodule, unsigned new_dirty_submodule)
617 {
618 tree_difference = REV_TREE_DIFFERENT;
619 options->flags.has_changes = 1;
620 }
621
622 static int rev_compare_tree(struct rev_info *revs,
623 struct commit *parent, struct commit *commit)
624 {
625 struct tree *t1 = get_commit_tree(parent);
626 struct tree *t2 = get_commit_tree(commit);
627
628 if (!t1)
629 return REV_TREE_NEW;
630 if (!t2)
631 return REV_TREE_OLD;
632
633 if (revs->simplify_by_decoration) {
634 /*
635 * If we are simplifying by decoration, then the commit
636 * is worth showing if it has a tag pointing at it.
637 */
638 if (get_name_decoration(&commit->object))
639 return REV_TREE_DIFFERENT;
640 /*
641 * A commit that is not pointed by a tag is uninteresting
642 * if we are not limited by path. This means that you will
643 * see the usual "commits that touch the paths" plus any
644 * tagged commit by specifying both --simplify-by-decoration
645 * and pathspec.
646 */
647 if (!revs->prune_data.nr)
648 return REV_TREE_SAME;
649 }
650
651 tree_difference = REV_TREE_SAME;
652 revs->pruning.flags.has_changes = 0;
653 if (diff_tree_oid(&t1->object.oid, &t2->object.oid, "",
654 &revs->pruning) < 0)
655 return REV_TREE_DIFFERENT;
656 return tree_difference;
657 }
658
659 static int rev_same_tree_as_empty(struct rev_info *revs, struct commit *commit)
660 {
661 int retval;
662 struct tree *t1 = get_commit_tree(commit);
663
664 if (!t1)
665 return 0;
666
667 tree_difference = REV_TREE_SAME;
668 revs->pruning.flags.has_changes = 0;
669 retval = diff_tree_oid(NULL, &t1->object.oid, "", &revs->pruning);
670
671 return retval >= 0 && (tree_difference == REV_TREE_SAME);
672 }
673
674 struct treesame_state {
675 unsigned int nparents;
676 unsigned char treesame[FLEX_ARRAY];
677 };
678
679 static struct treesame_state *initialise_treesame(struct rev_info *revs, struct commit *commit)
680 {
681 unsigned n = commit_list_count(commit->parents);
682 struct treesame_state *st = xcalloc(1, st_add(sizeof(*st), n));
683 st->nparents = n;
684 add_decoration(&revs->treesame, &commit->object, st);
685 return st;
686 }
687
688 /*
689 * Must be called immediately after removing the nth_parent from a commit's
690 * parent list, if we are maintaining the per-parent treesame[] decoration.
691 * This does not recalculate the master TREESAME flag - update_treesame()
692 * should be called to update it after a sequence of treesame[] modifications
693 * that may have affected it.
694 */
695 static int compact_treesame(struct rev_info *revs, struct commit *commit, unsigned nth_parent)
696 {
697 struct treesame_state *st;
698 int old_same;
699
700 if (!commit->parents) {
701 /*
702 * Have just removed the only parent from a non-merge.
703 * Different handling, as we lack decoration.
704 */
705 if (nth_parent != 0)
706 die("compact_treesame %u", nth_parent);
707 old_same = !!(commit->object.flags & TREESAME);
708 if (rev_same_tree_as_empty(revs, commit))
709 commit->object.flags |= TREESAME;
710 else
711 commit->object.flags &= ~TREESAME;
712 return old_same;
713 }
714
715 st = lookup_decoration(&revs->treesame, &commit->object);
716 if (!st || nth_parent >= st->nparents)
717 die("compact_treesame %u", nth_parent);
718
719 old_same = st->treesame[nth_parent];
720 memmove(st->treesame + nth_parent,
721 st->treesame + nth_parent + 1,
722 st->nparents - nth_parent - 1);
723
724 /*
725 * If we've just become a non-merge commit, update TREESAME
726 * immediately, and remove the no-longer-needed decoration.
727 * If still a merge, defer update until update_treesame().
728 */
729 if (--st->nparents == 1) {
730 if (commit->parents->next)
731 die("compact_treesame parents mismatch");
732 if (st->treesame[0] && revs->dense)
733 commit->object.flags |= TREESAME;
734 else
735 commit->object.flags &= ~TREESAME;
736 free(add_decoration(&revs->treesame, &commit->object, NULL));
737 }
738
739 return old_same;
740 }
741
742 static unsigned update_treesame(struct rev_info *revs, struct commit *commit)
743 {
744 if (commit->parents && commit->parents->next) {
745 unsigned n;
746 struct treesame_state *st;
747 struct commit_list *p;
748 unsigned relevant_parents;
749 unsigned relevant_change, irrelevant_change;
750
751 st = lookup_decoration(&revs->treesame, &commit->object);
752 if (!st)
753 die("update_treesame %s", oid_to_hex(&commit->object.oid));
754 relevant_parents = 0;
755 relevant_change = irrelevant_change = 0;
756 for (p = commit->parents, n = 0; p; n++, p = p->next) {
757 if (relevant_commit(p->item)) {
758 relevant_change |= !st->treesame[n];
759 relevant_parents++;
760 } else
761 irrelevant_change |= !st->treesame[n];
762 }
763 if (relevant_parents ? relevant_change : irrelevant_change)
764 commit->object.flags &= ~TREESAME;
765 else
766 commit->object.flags |= TREESAME;
767 }
768
769 return commit->object.flags & TREESAME;
770 }
771
772 static inline int limiting_can_increase_treesame(const struct rev_info *revs)
773 {
774 /*
775 * TREESAME is irrelevant unless prune && dense;
776 * if simplify_history is set, we can't have a mixture of TREESAME and
777 * !TREESAME INTERESTING parents (and we don't have treesame[]
778 * decoration anyway);
779 * if first_parent_only is set, then the TREESAME flag is locked
780 * against the first parent (and again we lack treesame[] decoration).
781 */
782 return revs->prune && revs->dense &&
783 !revs->simplify_history &&
784 !revs->first_parent_only;
785 }
786
787 static void try_to_simplify_commit(struct rev_info *revs, struct commit *commit)
788 {
789 struct commit_list **pp, *parent;
790 struct treesame_state *ts = NULL;
791 int relevant_change = 0, irrelevant_change = 0;
792 int relevant_parents, nth_parent;
793
794 /*
795 * If we don't do pruning, everything is interesting
796 */
797 if (!revs->prune)
798 return;
799
800 if (!get_commit_tree(commit))
801 return;
802
803 if (!commit->parents) {
804 if (rev_same_tree_as_empty(revs, commit))
805 commit->object.flags |= TREESAME;
806 return;
807 }
808
809 /*
810 * Normal non-merge commit? If we don't want to make the
811 * history dense, we consider it always to be a change..
812 */
813 if (!revs->dense && !commit->parents->next)
814 return;
815
816 for (pp = &commit->parents, nth_parent = 0, relevant_parents = 0;
817 (parent = *pp) != NULL;
818 pp = &parent->next, nth_parent++) {
819 struct commit *p = parent->item;
820 if (relevant_commit(p))
821 relevant_parents++;
822
823 if (nth_parent == 1) {
824 /*
825 * This our second loop iteration - so we now know
826 * we're dealing with a merge.
827 *
828 * Do not compare with later parents when we care only about
829 * the first parent chain, in order to avoid derailing the
830 * traversal to follow a side branch that brought everything
831 * in the path we are limited to by the pathspec.
832 */
833 if (revs->first_parent_only)
834 break;
835 /*
836 * If this will remain a potentially-simplifiable
837 * merge, remember per-parent treesame if needed.
838 * Initialise the array with the comparison from our
839 * first iteration.
840 */
841 if (revs->treesame.name &&
842 !revs->simplify_history &&
843 !(commit->object.flags & UNINTERESTING)) {
844 ts = initialise_treesame(revs, commit);
845 if (!(irrelevant_change || relevant_change))
846 ts->treesame[0] = 1;
847 }
848 }
849 if (parse_commit(p) < 0)
850 die("cannot simplify commit %s (because of %s)",
851 oid_to_hex(&commit->object.oid),
852 oid_to_hex(&p->object.oid));
853 switch (rev_compare_tree(revs, p, commit)) {
854 case REV_TREE_SAME:
855 if (!revs->simplify_history || !relevant_commit(p)) {
856 /* Even if a merge with an uninteresting
857 * side branch brought the entire change
858 * we are interested in, we do not want
859 * to lose the other branches of this
860 * merge, so we just keep going.
861 */
862 if (ts)
863 ts->treesame[nth_parent] = 1;
864 continue;
865 }
866 parent->next = NULL;
867 commit->parents = parent;
868 commit->object.flags |= TREESAME;
869 return;
870
871 case REV_TREE_NEW:
872 if (revs->remove_empty_trees &&
873 rev_same_tree_as_empty(revs, p)) {
874 /* We are adding all the specified
875 * paths from this parent, so the
876 * history beyond this parent is not
877 * interesting. Remove its parents
878 * (they are grandparents for us).
879 * IOW, we pretend this parent is a
880 * "root" commit.
881 */
882 if (parse_commit(p) < 0)
883 die("cannot simplify commit %s (invalid %s)",
884 oid_to_hex(&commit->object.oid),
885 oid_to_hex(&p->object.oid));
886 p->parents = NULL;
887 }
888 /* fallthrough */
889 case REV_TREE_OLD:
890 case REV_TREE_DIFFERENT:
891 if (relevant_commit(p))
892 relevant_change = 1;
893 else
894 irrelevant_change = 1;
895 continue;
896 }
897 die("bad tree compare for commit %s", oid_to_hex(&commit->object.oid));
898 }
899
900 /*
901 * TREESAME is straightforward for single-parent commits. For merge
902 * commits, it is most useful to define it so that "irrelevant"
903 * parents cannot make us !TREESAME - if we have any relevant
904 * parents, then we only consider TREESAMEness with respect to them,
905 * allowing irrelevant merges from uninteresting branches to be
906 * simplified away. Only if we have only irrelevant parents do we
907 * base TREESAME on them. Note that this logic is replicated in
908 * update_treesame, which should be kept in sync.
909 */
910 if (relevant_parents ? !relevant_change : !irrelevant_change)
911 commit->object.flags |= TREESAME;
912 }
913
914 static int process_parents(struct rev_info *revs, struct commit *commit,
915 struct commit_list **list, struct prio_queue *queue)
916 {
917 struct commit_list *parent = commit->parents;
918 unsigned left_flag;
919
920 if (commit->object.flags & ADDED)
921 return 0;
922 commit->object.flags |= ADDED;
923
924 if (revs->include_check &&
925 !revs->include_check(commit, revs->include_check_data))
926 return 0;
927
928 /*
929 * If the commit is uninteresting, don't try to
930 * prune parents - we want the maximal uninteresting
931 * set.
932 *
933 * Normally we haven't parsed the parent
934 * yet, so we won't have a parent of a parent
935 * here. However, it may turn out that we've
936 * reached this commit some other way (where it
937 * wasn't uninteresting), in which case we need
938 * to mark its parents recursively too..
939 */
940 if (commit->object.flags & UNINTERESTING) {
941 while (parent) {
942 struct commit *p = parent->item;
943 parent = parent->next;
944 if (p)
945 p->object.flags |= UNINTERESTING;
946 if (parse_commit_gently(p, 1) < 0)
947 continue;
948 if (p->parents)
949 mark_parents_uninteresting(p);
950 if (p->object.flags & SEEN)
951 continue;
952 p->object.flags |= SEEN;
953 if (list)
954 commit_list_insert_by_date(p, list);
955 if (queue)
956 prio_queue_put(queue, p);
957 }
958 return 0;
959 }
960
961 /*
962 * Ok, the commit wasn't uninteresting. Try to
963 * simplify the commit history and find the parent
964 * that has no differences in the path set if one exists.
965 */
966 try_to_simplify_commit(revs, commit);
967
968 if (revs->no_walk)
969 return 0;
970
971 left_flag = (commit->object.flags & SYMMETRIC_LEFT);
972
973 for (parent = commit->parents; parent; parent = parent->next) {
974 struct commit *p = parent->item;
975 int gently = revs->ignore_missing_links ||
976 revs->exclude_promisor_objects;
977 if (parse_commit_gently(p, gently) < 0) {
978 if (revs->exclude_promisor_objects &&
979 is_promisor_object(&p->object.oid)) {
980 if (revs->first_parent_only)
981 break;
982 continue;
983 }
984 return -1;
985 }
986 if (revs->sources) {
987 char **slot = revision_sources_at(revs->sources, p);
988
989 if (!*slot)
990 *slot = *revision_sources_at(revs->sources, commit);
991 }
992 p->object.flags |= left_flag;
993 if (!(p->object.flags & SEEN)) {
994 p->object.flags |= SEEN;
995 if (list)
996 commit_list_insert_by_date(p, list);
997 if (queue)
998 prio_queue_put(queue, p);
999 }
1000 if (revs->first_parent_only)
1001 break;
1002 }
1003 return 0;
1004 }
1005
1006 static void cherry_pick_list(struct commit_list *list, struct rev_info *revs)
1007 {
1008 struct commit_list *p;
1009 int left_count = 0, right_count = 0;
1010 int left_first;
1011 struct patch_ids ids;
1012 unsigned cherry_flag;
1013
1014 /* First count the commits on the left and on the right */
1015 for (p = list; p; p = p->next) {
1016 struct commit *commit = p->item;
1017 unsigned flags = commit->object.flags;
1018 if (flags & BOUNDARY)
1019 ;
1020 else if (flags & SYMMETRIC_LEFT)
1021 left_count++;
1022 else
1023 right_count++;
1024 }
1025
1026 if (!left_count || !right_count)
1027 return;
1028
1029 left_first = left_count < right_count;
1030 init_patch_ids(revs->repo, &ids);
1031 ids.diffopts.pathspec = revs->diffopt.pathspec;
1032
1033 /* Compute patch-ids for one side */
1034 for (p = list; p; p = p->next) {
1035 struct commit *commit = p->item;
1036 unsigned flags = commit->object.flags;
1037
1038 if (flags & BOUNDARY)
1039 continue;
1040 /*
1041 * If we have fewer left, left_first is set and we omit
1042 * commits on the right branch in this loop. If we have
1043 * fewer right, we skip the left ones.
1044 */
1045 if (left_first != !!(flags & SYMMETRIC_LEFT))
1046 continue;
1047 add_commit_patch_id(commit, &ids);
1048 }
1049
1050 /* either cherry_mark or cherry_pick are true */
1051 cherry_flag = revs->cherry_mark ? PATCHSAME : SHOWN;
1052
1053 /* Check the other side */
1054 for (p = list; p; p = p->next) {
1055 struct commit *commit = p->item;
1056 struct patch_id *id;
1057 unsigned flags = commit->object.flags;
1058
1059 if (flags & BOUNDARY)
1060 continue;
1061 /*
1062 * If we have fewer left, left_first is set and we omit
1063 * commits on the left branch in this loop.
1064 */
1065 if (left_first == !!(flags & SYMMETRIC_LEFT))
1066 continue;
1067
1068 /*
1069 * Have we seen the same patch id?
1070 */
1071 id = has_commit_patch_id(commit, &ids);
1072 if (!id)
1073 continue;
1074
1075 commit->object.flags |= cherry_flag;
1076 id->commit->object.flags |= cherry_flag;
1077 }
1078
1079 free_patch_ids(&ids);
1080 }
1081
1082 /* How many extra uninteresting commits we want to see.. */
1083 #define SLOP 5
1084
1085 static int still_interesting(struct commit_list *src, timestamp_t date, int slop,
1086 struct commit **interesting_cache)
1087 {
1088 /*
1089 * No source list at all? We're definitely done..
1090 */
1091 if (!src)
1092 return 0;
1093
1094 /*
1095 * Does the destination list contain entries with a date
1096 * before the source list? Definitely _not_ done.
1097 */
1098 if (date <= src->item->date)
1099 return SLOP;
1100
1101 /*
1102 * Does the source list still have interesting commits in
1103 * it? Definitely not done..
1104 */
1105 if (!everybody_uninteresting(src, interesting_cache))
1106 return SLOP;
1107
1108 /* Ok, we're closing in.. */
1109 return slop-1;
1110 }
1111
1112 /*
1113 * "rev-list --ancestry-path A..B" computes commits that are ancestors
1114 * of B but not ancestors of A but further limits the result to those
1115 * that are descendants of A. This takes the list of bottom commits and
1116 * the result of "A..B" without --ancestry-path, and limits the latter
1117 * further to the ones that can reach one of the commits in "bottom".
1118 */
1119 static void limit_to_ancestry(struct commit_list *bottom, struct commit_list *list)
1120 {
1121 struct commit_list *p;
1122 struct commit_list *rlist = NULL;
1123 int made_progress;
1124
1125 /*
1126 * Reverse the list so that it will be likely that we would
1127 * process parents before children.
1128 */
1129 for (p = list; p; p = p->next)
1130 commit_list_insert(p->item, &rlist);
1131
1132 for (p = bottom; p; p = p->next)
1133 p->item->object.flags |= TMP_MARK;
1134
1135 /*
1136 * Mark the ones that can reach bottom commits in "list",
1137 * in a bottom-up fashion.
1138 */
1139 do {
1140 made_progress = 0;
1141 for (p = rlist; p; p = p->next) {
1142 struct commit *c = p->item;
1143 struct commit_list *parents;
1144 if (c->object.flags & (TMP_MARK | UNINTERESTING))
1145 continue;
1146 for (parents = c->parents;
1147 parents;
1148 parents = parents->next) {
1149 if (!(parents->item->object.flags & TMP_MARK))
1150 continue;
1151 c->object.flags |= TMP_MARK;
1152 made_progress = 1;
1153 break;
1154 }
1155 }
1156 } while (made_progress);
1157
1158 /*
1159 * NEEDSWORK: decide if we want to remove parents that are
1160 * not marked with TMP_MARK from commit->parents for commits
1161 * in the resulting list. We may not want to do that, though.
1162 */
1163
1164 /*
1165 * The ones that are not marked with TMP_MARK are uninteresting
1166 */
1167 for (p = list; p; p = p->next) {
1168 struct commit *c = p->item;
1169 if (c->object.flags & TMP_MARK)
1170 continue;
1171 c->object.flags |= UNINTERESTING;
1172 }
1173
1174 /* We are done with the TMP_MARK */
1175 for (p = list; p; p = p->next)
1176 p->item->object.flags &= ~TMP_MARK;
1177 for (p = bottom; p; p = p->next)
1178 p->item->object.flags &= ~TMP_MARK;
1179 free_commit_list(rlist);
1180 }
1181
1182 /*
1183 * Before walking the history, keep the set of "negative" refs the
1184 * caller has asked to exclude.
1185 *
1186 * This is used to compute "rev-list --ancestry-path A..B", as we need
1187 * to filter the result of "A..B" further to the ones that can actually
1188 * reach A.
1189 */
1190 static struct commit_list *collect_bottom_commits(struct commit_list *list)
1191 {
1192 struct commit_list *elem, *bottom = NULL;
1193 for (elem = list; elem; elem = elem->next)
1194 if (elem->item->object.flags & BOTTOM)
1195 commit_list_insert(elem->item, &bottom);
1196 return bottom;
1197 }
1198
1199 /* Assumes either left_only or right_only is set */
1200 static void limit_left_right(struct commit_list *list, struct rev_info *revs)
1201 {
1202 struct commit_list *p;
1203
1204 for (p = list; p; p = p->next) {
1205 struct commit *commit = p->item;
1206
1207 if (revs->right_only) {
1208 if (commit->object.flags & SYMMETRIC_LEFT)
1209 commit->object.flags |= SHOWN;
1210 } else /* revs->left_only is set */
1211 if (!(commit->object.flags & SYMMETRIC_LEFT))
1212 commit->object.flags |= SHOWN;
1213 }
1214 }
1215
1216 static int limit_list(struct rev_info *revs)
1217 {
1218 int slop = SLOP;
1219 timestamp_t date = TIME_MAX;
1220 struct commit_list *list = revs->commits;
1221 struct commit_list *newlist = NULL;
1222 struct commit_list **p = &newlist;
1223 struct commit_list *bottom = NULL;
1224 struct commit *interesting_cache = NULL;
1225
1226 if (revs->ancestry_path) {
1227 bottom = collect_bottom_commits(list);
1228 if (!bottom)
1229 die("--ancestry-path given but there are no bottom commits");
1230 }
1231
1232 while (list) {
1233 struct commit *commit = pop_commit(&list);
1234 struct object *obj = &commit->object;
1235 show_early_output_fn_t show;
1236
1237 if (commit == interesting_cache)
1238 interesting_cache = NULL;
1239
1240 if (revs->max_age != -1 && (commit->date < revs->max_age))
1241 obj->flags |= UNINTERESTING;
1242 if (process_parents(revs, commit, &list, NULL) < 0)
1243 return -1;
1244 if (obj->flags & UNINTERESTING) {
1245 mark_parents_uninteresting(commit);
1246 slop = still_interesting(list, date, slop, &interesting_cache);
1247 if (slop)
1248 continue;
1249 break;
1250 }
1251 if (revs->min_age != -1 && (commit->date > revs->min_age))
1252 continue;
1253 date = commit->date;
1254 p = &commit_list_insert(commit, p)->next;
1255
1256 show = show_early_output;
1257 if (!show)
1258 continue;
1259
1260 show(revs, newlist);
1261 show_early_output = NULL;
1262 }
1263 if (revs->cherry_pick || revs->cherry_mark)
1264 cherry_pick_list(newlist, revs);
1265
1266 if (revs->left_only || revs->right_only)
1267 limit_left_right(newlist, revs);
1268
1269 if (bottom) {
1270 limit_to_ancestry(bottom, newlist);
1271 free_commit_list(bottom);
1272 }
1273
1274 /*
1275 * Check if any commits have become TREESAME by some of their parents
1276 * becoming UNINTERESTING.
1277 */
1278 if (limiting_can_increase_treesame(revs))
1279 for (list = newlist; list; list = list->next) {
1280 struct commit *c = list->item;
1281 if (c->object.flags & (UNINTERESTING | TREESAME))
1282 continue;
1283 update_treesame(revs, c);
1284 }
1285
1286 revs->commits = newlist;
1287 return 0;
1288 }
1289
1290 /*
1291 * Add an entry to refs->cmdline with the specified information.
1292 * *name is copied.
1293 */
1294 static void add_rev_cmdline(struct rev_info *revs,
1295 struct object *item,
1296 const char *name,
1297 int whence,
1298 unsigned flags)
1299 {
1300 struct rev_cmdline_info *info = &revs->cmdline;
1301 unsigned int nr = info->nr;
1302
1303 ALLOC_GROW(info->rev, nr + 1, info->alloc);
1304 info->rev[nr].item = item;
1305 info->rev[nr].name = xstrdup(name);
1306 info->rev[nr].whence = whence;
1307 info->rev[nr].flags = flags;
1308 info->nr++;
1309 }
1310
1311 static void add_rev_cmdline_list(struct rev_info *revs,
1312 struct commit_list *commit_list,
1313 int whence,
1314 unsigned flags)
1315 {
1316 while (commit_list) {
1317 struct object *object = &commit_list->item->object;
1318 add_rev_cmdline(revs, object, oid_to_hex(&object->oid),
1319 whence, flags);
1320 commit_list = commit_list->next;
1321 }
1322 }
1323
1324 struct all_refs_cb {
1325 int all_flags;
1326 int warned_bad_reflog;
1327 struct rev_info *all_revs;
1328 const char *name_for_errormsg;
1329 struct worktree *wt;
1330 };
1331
1332 int ref_excluded(struct string_list *ref_excludes, const char *path)
1333 {
1334 struct string_list_item *item;
1335
1336 if (!ref_excludes)
1337 return 0;
1338 for_each_string_list_item(item, ref_excludes) {
1339 if (!wildmatch(item->string, path, 0))
1340 return 1;
1341 }
1342 return 0;
1343 }
1344
1345 static int handle_one_ref(const char *path, const struct object_id *oid,
1346 int flag, void *cb_data)
1347 {
1348 struct all_refs_cb *cb = cb_data;
1349 struct object *object;
1350
1351 if (ref_excluded(cb->all_revs->ref_excludes, path))
1352 return 0;
1353
1354 object = get_reference(cb->all_revs, path, oid, cb->all_flags);
1355 add_rev_cmdline(cb->all_revs, object, path, REV_CMD_REF, cb->all_flags);
1356 add_pending_oid(cb->all_revs, path, oid, cb->all_flags);
1357 return 0;
1358 }
1359
1360 static void init_all_refs_cb(struct all_refs_cb *cb, struct rev_info *revs,
1361 unsigned flags)
1362 {
1363 cb->all_revs = revs;
1364 cb->all_flags = flags;
1365 revs->rev_input_given = 1;
1366 cb->wt = NULL;
1367 }
1368
1369 void clear_ref_exclusion(struct string_list **ref_excludes_p)
1370 {
1371 if (*ref_excludes_p) {
1372 string_list_clear(*ref_excludes_p, 0);
1373 free(*ref_excludes_p);
1374 }
1375 *ref_excludes_p = NULL;
1376 }
1377
1378 void add_ref_exclusion(struct string_list **ref_excludes_p, const char *exclude)
1379 {
1380 if (!*ref_excludes_p) {
1381 *ref_excludes_p = xcalloc(1, sizeof(**ref_excludes_p));
1382 (*ref_excludes_p)->strdup_strings = 1;
1383 }
1384 string_list_append(*ref_excludes_p, exclude);
1385 }
1386
1387 static void handle_refs(struct ref_store *refs,
1388 struct rev_info *revs, unsigned flags,
1389 int (*for_each)(struct ref_store *, each_ref_fn, void *))
1390 {
1391 struct all_refs_cb cb;
1392
1393 if (!refs) {
1394 /* this could happen with uninitialized submodules */
1395 return;
1396 }
1397
1398 init_all_refs_cb(&cb, revs, flags);
1399 for_each(refs, handle_one_ref, &cb);
1400 }
1401
1402 static void handle_one_reflog_commit(struct object_id *oid, void *cb_data)
1403 {
1404 struct all_refs_cb *cb = cb_data;
1405 if (!is_null_oid(oid)) {
1406 struct object *o = parse_object(cb->all_revs->repo, oid);
1407 if (o) {
1408 o->flags |= cb->all_flags;
1409 /* ??? CMDLINEFLAGS ??? */
1410 add_pending_object(cb->all_revs, o, "");
1411 }
1412 else if (!cb->warned_bad_reflog) {
1413 warning("reflog of '%s' references pruned commits",
1414 cb->name_for_errormsg);
1415 cb->warned_bad_reflog = 1;
1416 }
1417 }
1418 }
1419
1420 static int handle_one_reflog_ent(struct object_id *ooid, struct object_id *noid,
1421 const char *email, timestamp_t timestamp, int tz,
1422 const char *message, void *cb_data)
1423 {
1424 handle_one_reflog_commit(ooid, cb_data);
1425 handle_one_reflog_commit(noid, cb_data);
1426 return 0;
1427 }
1428
1429 static int handle_one_reflog(const char *refname_in_wt,
1430 const struct object_id *oid,
1431 int flag, void *cb_data)
1432 {
1433 struct all_refs_cb *cb = cb_data;
1434 struct strbuf refname = STRBUF_INIT;
1435
1436 cb->warned_bad_reflog = 0;
1437 strbuf_worktree_ref(cb->wt, &refname, refname_in_wt);
1438 cb->name_for_errormsg = refname.buf;
1439 refs_for_each_reflog_ent(get_main_ref_store(the_repository),
1440 refname.buf,
1441 handle_one_reflog_ent, cb_data);
1442 strbuf_release(&refname);
1443 return 0;
1444 }
1445
1446 static void add_other_reflogs_to_pending(struct all_refs_cb *cb)
1447 {
1448 struct worktree **worktrees, **p;
1449
1450 worktrees = get_worktrees(0);
1451 for (p = worktrees; *p; p++) {
1452 struct worktree *wt = *p;
1453
1454 if (wt->is_current)
1455 continue;
1456
1457 cb->wt = wt;
1458 refs_for_each_reflog(get_worktree_ref_store(wt),
1459 handle_one_reflog,
1460 cb);
1461 }
1462 free_worktrees(worktrees);
1463 }
1464
1465 void add_reflogs_to_pending(struct rev_info *revs, unsigned flags)
1466 {
1467 struct all_refs_cb cb;
1468
1469 cb.all_revs = revs;
1470 cb.all_flags = flags;
1471 cb.wt = NULL;
1472 for_each_reflog(handle_one_reflog, &cb);
1473
1474 if (!revs->single_worktree)
1475 add_other_reflogs_to_pending(&cb);
1476 }
1477
1478 static void add_cache_tree(struct cache_tree *it, struct rev_info *revs,
1479 struct strbuf *path, unsigned int flags)
1480 {
1481 size_t baselen = path->len;
1482 int i;
1483
1484 if (it->entry_count >= 0) {
1485 struct tree *tree = lookup_tree(revs->repo, &it->oid);
1486 tree->object.flags |= flags;
1487 add_pending_object_with_path(revs, &tree->object, "",
1488 040000, path->buf);
1489 }
1490
1491 for (i = 0; i < it->subtree_nr; i++) {
1492 struct cache_tree_sub *sub = it->down[i];
1493 strbuf_addf(path, "%s%s", baselen ? "/" : "", sub->name);
1494 add_cache_tree(sub->cache_tree, revs, path, flags);
1495 strbuf_setlen(path, baselen);
1496 }
1497
1498 }
1499
1500 static void do_add_index_objects_to_pending(struct rev_info *revs,
1501 struct index_state *istate,
1502 unsigned int flags)
1503 {
1504 int i;
1505
1506 for (i = 0; i < istate->cache_nr; i++) {
1507 struct cache_entry *ce = istate->cache[i];
1508 struct blob *blob;
1509
1510 if (S_ISGITLINK(ce->ce_mode))
1511 continue;
1512
1513 blob = lookup_blob(revs->repo, &ce->oid);
1514 if (!blob)
1515 die("unable to add index blob to traversal");
1516 blob->object.flags |= flags;
1517 add_pending_object_with_path(revs, &blob->object, "",
1518 ce->ce_mode, ce->name);
1519 }
1520
1521 if (istate->cache_tree) {
1522 struct strbuf path = STRBUF_INIT;
1523 add_cache_tree(istate->cache_tree, revs, &path, flags);
1524 strbuf_release(&path);
1525 }
1526 }
1527
1528 void add_index_objects_to_pending(struct rev_info *revs, unsigned int flags)
1529 {
1530 struct worktree **worktrees, **p;
1531
1532 repo_read_index(revs->repo);
1533 do_add_index_objects_to_pending(revs, revs->repo->index, flags);
1534
1535 if (revs->single_worktree)
1536 return;
1537
1538 worktrees = get_worktrees(0);
1539 for (p = worktrees; *p; p++) {
1540 struct worktree *wt = *p;
1541 struct index_state istate = { NULL };
1542
1543 if (wt->is_current)
1544 continue; /* current index already taken care of */
1545
1546 if (read_index_from(&istate,
1547 worktree_git_path(wt, "index"),
1548 get_worktree_git_dir(wt)) > 0)
1549 do_add_index_objects_to_pending(revs, &istate, flags);
1550 discard_index(&istate);
1551 }
1552 free_worktrees(worktrees);
1553 }
1554
1555 struct add_alternate_refs_data {
1556 struct rev_info *revs;
1557 unsigned int flags;
1558 };
1559
1560 static void add_one_alternate_ref(const struct object_id *oid,
1561 void *vdata)
1562 {
1563 const char *name = ".alternate";
1564 struct add_alternate_refs_data *data = vdata;
1565 struct object *obj;
1566
1567 obj = get_reference(data->revs, name, oid, data->flags);
1568 add_rev_cmdline(data->revs, obj, name, REV_CMD_REV, data->flags);
1569 add_pending_object(data->revs, obj, name);
1570 }
1571
1572 static void add_alternate_refs_to_pending(struct rev_info *revs,
1573 unsigned int flags)
1574 {
1575 struct add_alternate_refs_data data;
1576 data.revs = revs;
1577 data.flags = flags;
1578 for_each_alternate_ref(add_one_alternate_ref, &data);
1579 }
1580
1581 static int add_parents_only(struct rev_info *revs, const char *arg_, int flags,
1582 int exclude_parent)
1583 {
1584 struct object_id oid;
1585 struct object *it;
1586 struct commit *commit;
1587 struct commit_list *parents;
1588 int parent_number;
1589 const char *arg = arg_;
1590
1591 if (*arg == '^') {
1592 flags ^= UNINTERESTING | BOTTOM;
1593 arg++;
1594 }
1595 if (get_oid_committish(arg, &oid))
1596 return 0;
1597 while (1) {
1598 it = get_reference(revs, arg, &oid, 0);
1599 if (!it && revs->ignore_missing)
1600 return 0;
1601 if (it->type != OBJ_TAG)
1602 break;
1603 if (!((struct tag*)it)->tagged)
1604 return 0;
1605 oidcpy(&oid, &((struct tag*)it)->tagged->oid);
1606 }
1607 if (it->type != OBJ_COMMIT)
1608 return 0;
1609 commit = (struct commit *)it;
1610 if (exclude_parent &&
1611 exclude_parent > commit_list_count(commit->parents))
1612 return 0;
1613 for (parents = commit->parents, parent_number = 1;
1614 parents;
1615 parents = parents->next, parent_number++) {
1616 if (exclude_parent && parent_number != exclude_parent)
1617 continue;
1618
1619 it = &parents->item->object;
1620 it->flags |= flags;
1621 add_rev_cmdline(revs, it, arg_, REV_CMD_PARENTS_ONLY, flags);
1622 add_pending_object(revs, it, arg);
1623 }
1624 return 1;
1625 }
1626
1627 void repo_init_revisions(struct repository *r,
1628 struct rev_info *revs,
1629 const char *prefix)
1630 {
1631 memset(revs, 0, sizeof(*revs));
1632
1633 revs->repo = r;
1634 revs->abbrev = DEFAULT_ABBREV;
1635 revs->ignore_merges = 1;
1636 revs->simplify_history = 1;
1637 revs->pruning.repo = r;
1638 revs->pruning.flags.recursive = 1;
1639 revs->pruning.flags.quick = 1;
1640 revs->pruning.add_remove = file_add_remove;
1641 revs->pruning.change = file_change;
1642 revs->pruning.change_fn_data = revs;
1643 revs->sort_order = REV_SORT_IN_GRAPH_ORDER;
1644 revs->dense = 1;
1645 revs->prefix = prefix;
1646 revs->max_age = -1;
1647 revs->min_age = -1;
1648 revs->skip_count = -1;
1649 revs->max_count = -1;
1650 revs->max_parents = -1;
1651 revs->expand_tabs_in_log = -1;
1652
1653 revs->commit_format = CMIT_FMT_DEFAULT;
1654 revs->expand_tabs_in_log_default = 8;
1655
1656 init_grep_defaults(revs->repo);
1657 grep_init(&revs->grep_filter, revs->repo, prefix);
1658 revs->grep_filter.status_only = 1;
1659
1660 repo_diff_setup(revs->repo, &revs->diffopt);
1661 if (prefix && !revs->diffopt.prefix) {
1662 revs->diffopt.prefix = prefix;
1663 revs->diffopt.prefix_length = strlen(prefix);
1664 }
1665
1666 revs->notes_opt.use_default_notes = -1;
1667 }
1668
1669 static void add_pending_commit_list(struct rev_info *revs,
1670 struct commit_list *commit_list,
1671 unsigned int flags)
1672 {
1673 while (commit_list) {
1674 struct object *object = &commit_list->item->object;
1675 object->flags |= flags;
1676 add_pending_object(revs, object, oid_to_hex(&object->oid));
1677 commit_list = commit_list->next;
1678 }
1679 }
1680
1681 static void prepare_show_merge(struct rev_info *revs)
1682 {
1683 struct commit_list *bases;
1684 struct commit *head, *other;
1685 struct object_id oid;
1686 const char **prune = NULL;
1687 int i, prune_num = 1; /* counting terminating NULL */
1688 struct index_state *istate = revs->repo->index;
1689
1690 if (get_oid("HEAD", &oid))
1691 die("--merge without HEAD?");
1692 head = lookup_commit_or_die(&oid, "HEAD");
1693 if (get_oid("MERGE_HEAD", &oid))
1694 die("--merge without MERGE_HEAD?");
1695 other = lookup_commit_or_die(&oid, "MERGE_HEAD");
1696 add_pending_object(revs, &head->object, "HEAD");
1697 add_pending_object(revs, &other->object, "MERGE_HEAD");
1698 bases = get_merge_bases(head, other);
1699 add_rev_cmdline_list(revs, bases, REV_CMD_MERGE_BASE, UNINTERESTING | BOTTOM);
1700 add_pending_commit_list(revs, bases, UNINTERESTING | BOTTOM);
1701 free_commit_list(bases);
1702 head->object.flags |= SYMMETRIC_LEFT;
1703
1704 if (!istate->cache_nr)
1705 repo_read_index(revs->repo);
1706 for (i = 0; i < istate->cache_nr; i++) {
1707 const struct cache_entry *ce = istate->cache[i];
1708 if (!ce_stage(ce))
1709 continue;
1710 if (ce_path_match(istate, ce, &revs->prune_data, NULL)) {
1711 prune_num++;
1712 REALLOC_ARRAY(prune, prune_num);
1713 prune[prune_num-2] = ce->name;
1714 prune[prune_num-1] = NULL;
1715 }
1716 while ((i+1 < istate->cache_nr) &&
1717 ce_same_name(ce, istate->cache[i+1]))
1718 i++;
1719 }
1720 clear_pathspec(&revs->prune_data);
1721 parse_pathspec(&revs->prune_data, PATHSPEC_ALL_MAGIC & ~PATHSPEC_LITERAL,
1722 PATHSPEC_PREFER_FULL | PATHSPEC_LITERAL_PATH, "", prune);
1723 revs->limited = 1;
1724 }
1725
1726 static int dotdot_missing(const char *arg, char *dotdot,
1727 struct rev_info *revs, int symmetric)
1728 {
1729 if (revs->ignore_missing)
1730 return 0;
1731 /* de-munge so we report the full argument */
1732 *dotdot = '.';
1733 die(symmetric
1734 ? "Invalid symmetric difference expression %s"
1735 : "Invalid revision range %s", arg);
1736 }
1737
1738 static int handle_dotdot_1(const char *arg, char *dotdot,
1739 struct rev_info *revs, int flags,
1740 int cant_be_filename,
1741 struct object_context *a_oc,
1742 struct object_context *b_oc)
1743 {
1744 const char *a_name, *b_name;
1745 struct object_id a_oid, b_oid;
1746 struct object *a_obj, *b_obj;
1747 unsigned int a_flags, b_flags;
1748 int symmetric = 0;
1749 unsigned int flags_exclude = flags ^ (UNINTERESTING | BOTTOM);
1750 unsigned int oc_flags = GET_OID_COMMITTISH | GET_OID_RECORD_PATH;
1751
1752 a_name = arg;
1753 if (!*a_name)
1754 a_name = "HEAD";
1755
1756 b_name = dotdot + 2;
1757 if (*b_name == '.') {
1758 symmetric = 1;
1759 b_name++;
1760 }
1761 if (!*b_name)
1762 b_name = "HEAD";
1763
1764 if (get_oid_with_context(revs->repo, a_name, oc_flags, &a_oid, a_oc) ||
1765 get_oid_with_context(revs->repo, b_name, oc_flags, &b_oid, b_oc))
1766 return -1;
1767
1768 if (!cant_be_filename) {
1769 *dotdot = '.';
1770 verify_non_filename(revs->prefix, arg);
1771 *dotdot = '\0';
1772 }
1773
1774 a_obj = parse_object(revs->repo, &a_oid);
1775 b_obj = parse_object(revs->repo, &b_oid);
1776 if (!a_obj || !b_obj)
1777 return dotdot_missing(arg, dotdot, revs, symmetric);
1778
1779 if (!symmetric) {
1780 /* just A..B */
1781 b_flags = flags;
1782 a_flags = flags_exclude;
1783 } else {
1784 /* A...B -- find merge bases between the two */
1785 struct commit *a, *b;
1786 struct commit_list *exclude;
1787
1788 a = lookup_commit_reference(revs->repo, &a_obj->oid);
1789 b = lookup_commit_reference(revs->repo, &b_obj->oid);
1790 if (!a || !b)
1791 return dotdot_missing(arg, dotdot, revs, symmetric);
1792
1793 exclude = get_merge_bases(a, b);
1794 add_rev_cmdline_list(revs, exclude, REV_CMD_MERGE_BASE,
1795 flags_exclude);
1796 add_pending_commit_list(revs, exclude, flags_exclude);
1797 free_commit_list(exclude);
1798
1799 b_flags = flags;
1800 a_flags = flags | SYMMETRIC_LEFT;
1801 }
1802
1803 a_obj->flags |= a_flags;
1804 b_obj->flags |= b_flags;
1805 add_rev_cmdline(revs, a_obj, a_name, REV_CMD_LEFT, a_flags);
1806 add_rev_cmdline(revs, b_obj, b_name, REV_CMD_RIGHT, b_flags);
1807 add_pending_object_with_path(revs, a_obj, a_name, a_oc->mode, a_oc->path);
1808 add_pending_object_with_path(revs, b_obj, b_name, b_oc->mode, b_oc->path);
1809 return 0;
1810 }
1811
1812 static int handle_dotdot(const char *arg,
1813 struct rev_info *revs, int flags,
1814 int cant_be_filename)
1815 {
1816 struct object_context a_oc, b_oc;
1817 char *dotdot = strstr(arg, "..");
1818 int ret;
1819
1820 if (!dotdot)
1821 return -1;
1822
1823 memset(&a_oc, 0, sizeof(a_oc));
1824 memset(&b_oc, 0, sizeof(b_oc));
1825
1826 *dotdot = '\0';
1827 ret = handle_dotdot_1(arg, dotdot, revs, flags, cant_be_filename,
1828 &a_oc, &b_oc);
1829 *dotdot = '.';
1830
1831 free(a_oc.path);
1832 free(b_oc.path);
1833
1834 return ret;
1835 }
1836
1837 int handle_revision_arg(const char *arg_, struct rev_info *revs, int flags, unsigned revarg_opt)
1838 {
1839 struct object_context oc;
1840 char *mark;
1841 struct object *object;
1842 struct object_id oid;
1843 int local_flags;
1844 const char *arg = arg_;
1845 int cant_be_filename = revarg_opt & REVARG_CANNOT_BE_FILENAME;
1846 unsigned get_sha1_flags = GET_OID_RECORD_PATH;
1847
1848 flags = flags & UNINTERESTING ? flags | BOTTOM : flags & ~BOTTOM;
1849
1850 if (!cant_be_filename && !strcmp(arg, "..")) {
1851 /*
1852 * Just ".."? That is not a range but the
1853 * pathspec for the parent directory.
1854 */
1855 return -1;
1856 }
1857
1858 if (!handle_dotdot(arg, revs, flags, revarg_opt))
1859 return 0;
1860
1861 mark = strstr(arg, "^@");
1862 if (mark && !mark[2]) {
1863 *mark = 0;
1864 if (add_parents_only(revs, arg, flags, 0))
1865 return 0;
1866 *mark = '^';
1867 }
1868 mark = strstr(arg, "^!");
1869 if (mark && !mark[2]) {
1870 *mark = 0;
1871 if (!add_parents_only(revs, arg, flags ^ (UNINTERESTING | BOTTOM), 0))
1872 *mark = '^';
1873 }
1874 mark = strstr(arg, "^-");
1875 if (mark) {
1876 int exclude_parent = 1;
1877
1878 if (mark[2]) {
1879 char *end;
1880 exclude_parent = strtoul(mark + 2, &end, 10);
1881 if (*end != '\0' || !exclude_parent)
1882 return -1;
1883 }
1884
1885 *mark = 0;
1886 if (!add_parents_only(revs, arg, flags ^ (UNINTERESTING | BOTTOM), exclude_parent))
1887 *mark = '^';
1888 }
1889
1890 local_flags = 0;
1891 if (*arg == '^') {
1892 local_flags = UNINTERESTING | BOTTOM;
1893 arg++;
1894 }
1895
1896 if (revarg_opt & REVARG_COMMITTISH)
1897 get_sha1_flags |= GET_OID_COMMITTISH;
1898
1899 if (get_oid_with_context(revs->repo, arg, get_sha1_flags, &oid, &oc))
1900 return revs->ignore_missing ? 0 : -1;
1901 if (!cant_be_filename)
1902 verify_non_filename(revs->prefix, arg);
1903 object = get_reference(revs, arg, &oid, flags ^ local_flags);
1904 if (!object)
1905 return revs->ignore_missing ? 0 : -1;
1906 add_rev_cmdline(revs, object, arg_, REV_CMD_REV, flags ^ local_flags);
1907 add_pending_object_with_path(revs, object, arg, oc.mode, oc.path);
1908 free(oc.path);
1909 return 0;
1910 }
1911
1912 static void read_pathspec_from_stdin(struct strbuf *sb,
1913 struct argv_array *prune)
1914 {
1915 while (strbuf_getline(sb, stdin) != EOF)
1916 argv_array_push(prune, sb->buf);
1917 }
1918
1919 static void read_revisions_from_stdin(struct rev_info *revs,
1920 struct argv_array *prune)
1921 {
1922 struct strbuf sb;
1923 int seen_dashdash = 0;
1924 int save_warning;
1925
1926 save_warning = warn_on_object_refname_ambiguity;
1927 warn_on_object_refname_ambiguity = 0;
1928
1929 strbuf_init(&sb, 1000);
1930 while (strbuf_getline(&sb, stdin) != EOF) {
1931 int len = sb.len;
1932 if (!len)
1933 break;
1934 if (sb.buf[0] == '-') {
1935 if (len == 2 && sb.buf[1] == '-') {
1936 seen_dashdash = 1;
1937 break;
1938 }
1939 die("options not supported in --stdin mode");
1940 }
1941 if (handle_revision_arg(sb.buf, revs, 0,
1942 REVARG_CANNOT_BE_FILENAME))
1943 die("bad revision '%s'", sb.buf);
1944 }
1945 if (seen_dashdash)
1946 read_pathspec_from_stdin(&sb, prune);
1947
1948 strbuf_release(&sb);
1949 warn_on_object_refname_ambiguity = save_warning;
1950 }
1951
1952 static void add_grep(struct rev_info *revs, const char *ptn, enum grep_pat_token what)
1953 {
1954 append_grep_pattern(&revs->grep_filter, ptn, "command line", 0, what);
1955 }
1956
1957 static void add_header_grep(struct rev_info *revs, enum grep_header_field field, const char *pattern)
1958 {
1959 append_header_grep_pattern(&revs->grep_filter, field, pattern);
1960 }
1961
1962 static void add_message_grep(struct rev_info *revs, const char *pattern)
1963 {
1964 add_grep(revs, pattern, GREP_PATTERN_BODY);
1965 }
1966
1967 static int handle_revision_opt(struct rev_info *revs, int argc, const char **argv,
1968 int *unkc, const char **unkv,
1969 const struct setup_revision_opt* opt)
1970 {
1971 const char *arg = argv[0];
1972 const char *optarg;
1973 int argcount;
1974 const unsigned hexsz = the_hash_algo->hexsz;
1975
1976 /* pseudo revision arguments */
1977 if (!strcmp(arg, "--all") || !strcmp(arg, "--branches") ||
1978 !strcmp(arg, "--tags") || !strcmp(arg, "--remotes") ||
1979 !strcmp(arg, "--reflog") || !strcmp(arg, "--not") ||
1980 !strcmp(arg, "--no-walk") || !strcmp(arg, "--do-walk") ||
1981 !strcmp(arg, "--bisect") || starts_with(arg, "--glob=") ||
1982 !strcmp(arg, "--indexed-objects") ||
1983 !strcmp(arg, "--alternate-refs") ||
1984 starts_with(arg, "--exclude=") ||
1985 starts_with(arg, "--branches=") || starts_with(arg, "--tags=") ||
1986 starts_with(arg, "--remotes=") || starts_with(arg, "--no-walk="))
1987 {
1988 unkv[(*unkc)++] = arg;
1989 return 1;
1990 }
1991
1992 if ((argcount = parse_long_opt("max-count", argv, &optarg))) {
1993 revs->max_count = atoi(optarg);
1994 revs->no_walk = 0;
1995 return argcount;
1996 } else if ((argcount = parse_long_opt("skip", argv, &optarg))) {
1997 revs->skip_count = atoi(optarg);
1998 return argcount;
1999 } else if ((*arg == '-') && isdigit(arg[1])) {
2000 /* accept -<digit>, like traditional "head" */
2001 if (strtol_i(arg + 1, 10, &revs->max_count) < 0 ||
2002 revs->max_count < 0)
2003 die("'%s': not a non-negative integer", arg + 1);
2004 revs->no_walk = 0;
2005 } else if (!strcmp(arg, "-n")) {
2006 if (argc <= 1)
2007 return error("-n requires an argument");
2008 revs->max_count = atoi(argv[1]);
2009 revs->no_walk = 0;
2010 return 2;
2011 } else if (skip_prefix(arg, "-n", &optarg)) {
2012 revs->max_count = atoi(optarg);
2013 revs->no_walk = 0;
2014 } else if ((argcount = parse_long_opt("max-age", argv, &optarg))) {
2015 revs->max_age = atoi(optarg);
2016 return argcount;
2017 } else if ((argcount = parse_long_opt("since", argv, &optarg))) {
2018 revs->max_age = approxidate(optarg);
2019 return argcount;
2020 } else if ((argcount = parse_long_opt("after", argv, &optarg))) {
2021 revs->max_age = approxidate(optarg);
2022 return argcount;
2023 } else if ((argcount = parse_long_opt("min-age", argv, &optarg))) {
2024 revs->min_age = atoi(optarg);
2025 return argcount;
2026 } else if ((argcount = parse_long_opt("before", argv, &optarg))) {
2027 revs->min_age = approxidate(optarg);
2028 return argcount;
2029 } else if ((argcount = parse_long_opt("until", argv, &optarg))) {
2030 revs->min_age = approxidate(optarg);
2031 return argcount;
2032 } else if (!strcmp(arg, "--first-parent")) {
2033 revs->first_parent_only = 1;
2034 } else if (!strcmp(arg, "--ancestry-path")) {
2035 revs->ancestry_path = 1;
2036 revs->simplify_history = 0;
2037 revs->limited = 1;
2038 } else if (!strcmp(arg, "-g") || !strcmp(arg, "--walk-reflogs")) {
2039 init_reflog_walk(&revs->reflog_info);
2040 } else if (!strcmp(arg, "--default")) {
2041 if (argc <= 1)
2042 return error("bad --default argument");
2043 revs->def = argv[1];
2044 return 2;
2045 } else if (!strcmp(arg, "--merge")) {
2046 revs->show_merge = 1;
2047 } else if (!strcmp(arg, "--topo-order")) {
2048 revs->sort_order = REV_SORT_IN_GRAPH_ORDER;
2049 revs->topo_order = 1;
2050 } else if (!strcmp(arg, "--simplify-merges")) {
2051 revs->simplify_merges = 1;
2052 revs->topo_order = 1;
2053 revs->rewrite_parents = 1;
2054 revs->simplify_history = 0;
2055 revs->limited = 1;
2056 } else if (!strcmp(arg, "--simplify-by-decoration")) {
2057 revs->simplify_merges = 1;
2058 revs->topo_order = 1;
2059 revs->rewrite_parents = 1;
2060 revs->simplify_history = 0;
2061 revs->simplify_by_decoration = 1;
2062 revs->limited = 1;
2063 revs->prune = 1;
2064 load_ref_decorations(NULL, DECORATE_SHORT_REFS);
2065 } else if (!strcmp(arg, "--date-order")) {
2066 revs->sort_order = REV_SORT_BY_COMMIT_DATE;
2067 revs->topo_order = 1;
2068 } else if (!strcmp(arg, "--author-date-order")) {
2069 revs->sort_order = REV_SORT_BY_AUTHOR_DATE;
2070 revs->topo_order = 1;
2071 } else if (!strcmp(arg, "--early-output")) {
2072 revs->early_output = 100;
2073 revs->topo_order = 1;
2074 } else if (skip_prefix(arg, "--early-output=", &optarg)) {
2075 if (strtoul_ui(optarg, 10, &revs->early_output) < 0)
2076 die("'%s': not a non-negative integer", optarg);
2077 revs->topo_order = 1;
2078 } else if (!strcmp(arg, "--parents")) {
2079 revs->rewrite_parents = 1;
2080 revs->print_parents = 1;
2081 } else if (!strcmp(arg, "--dense")) {
2082 revs->dense = 1;
2083 } else if (!strcmp(arg, "--sparse")) {
2084 revs->dense = 0;
2085 } else if (!strcmp(arg, "--in-commit-order")) {
2086 revs->tree_blobs_in_commit_order = 1;
2087 } else if (!strcmp(arg, "--remove-empty")) {
2088 revs->remove_empty_trees = 1;
2089 } else if (!strcmp(arg, "--merges")) {
2090 revs->min_parents = 2;
2091 } else if (!strcmp(arg, "--no-merges")) {
2092 revs->max_parents = 1;
2093 } else if (skip_prefix(arg, "--min-parents=", &optarg)) {
2094 revs->min_parents = atoi(optarg);
2095 } else if (!strcmp(arg, "--no-min-parents")) {
2096 revs->min_parents = 0;
2097 } else if (skip_prefix(arg, "--max-parents=", &optarg)) {
2098 revs->max_parents = atoi(optarg);
2099 } else if (!strcmp(arg, "--no-max-parents")) {
2100 revs->max_parents = -1;
2101 } else if (!strcmp(arg, "--boundary")) {
2102 revs->boundary = 1;
2103 } else if (!strcmp(arg, "--left-right")) {
2104 revs->left_right = 1;
2105 } else if (!strcmp(arg, "--left-only")) {
2106 if (revs->right_only)
2107 die("--left-only is incompatible with --right-only"
2108 " or --cherry");
2109 revs->left_only = 1;
2110 } else if (!strcmp(arg, "--right-only")) {
2111 if (revs->left_only)
2112 die("--right-only is incompatible with --left-only");
2113 revs->right_only = 1;
2114 } else if (!strcmp(arg, "--cherry")) {
2115 if (revs->left_only)
2116 die("--cherry is incompatible with --left-only");
2117 revs->cherry_mark = 1;
2118 revs->right_only = 1;
2119 revs->max_parents = 1;
2120 revs->limited = 1;
2121 } else if (!strcmp(arg, "--count")) {
2122 revs->count = 1;
2123 } else if (!strcmp(arg, "--cherry-mark")) {
2124 if (revs->cherry_pick)
2125 die("--cherry-mark is incompatible with --cherry-pick");
2126 revs->cherry_mark = 1;
2127 revs->limited = 1; /* needs limit_list() */
2128 } else if (!strcmp(arg, "--cherry-pick")) {
2129 if (revs->cherry_mark)
2130 die("--cherry-pick is incompatible with --cherry-mark");
2131 revs->cherry_pick = 1;
2132 revs->limited = 1;
2133 } else if (!strcmp(arg, "--objects")) {
2134 revs->tag_objects = 1;
2135 revs->tree_objects = 1;
2136 revs->blob_objects = 1;
2137 } else if (!strcmp(arg, "--objects-edge")) {
2138 revs->tag_objects = 1;
2139 revs->tree_objects = 1;
2140 revs->blob_objects = 1;
2141 revs->edge_hint = 1;
2142 } else if (!strcmp(arg, "--objects-edge-aggressive")) {
2143 revs->tag_objects = 1;
2144 revs->tree_objects = 1;
2145 revs->blob_objects = 1;
2146 revs->edge_hint = 1;
2147 revs->edge_hint_aggressive = 1;
2148 } else if (!strcmp(arg, "--verify-objects")) {
2149 revs->tag_objects = 1;
2150 revs->tree_objects = 1;
2151 revs->blob_objects = 1;
2152 revs->verify_objects = 1;
2153 } else if (!strcmp(arg, "--unpacked")) {
2154 revs->unpacked = 1;
2155 } else if (starts_with(arg, "--unpacked=")) {
2156 die("--unpacked=<packfile> no longer supported.");
2157 } else if (!strcmp(arg, "-r")) {
2158 revs->diff = 1;
2159 revs->diffopt.flags.recursive = 1;
2160 } else if (!strcmp(arg, "-t")) {
2161 revs->diff = 1;
2162 revs->diffopt.flags.recursive = 1;
2163 revs->diffopt.flags.tree_in_recursive = 1;
2164 } else if (!strcmp(arg, "-m")) {
2165 revs->ignore_merges = 0;
2166 } else if (!strcmp(arg, "-c")) {
2167 revs->diff = 1;
2168 revs->dense_combined_merges = 0;
2169 revs->combine_merges = 1;
2170 } else if (!strcmp(arg, "--combined-all-paths")) {
2171 revs->diff = 1;
2172 revs->combined_all_paths = 1;
2173 } else if (!strcmp(arg, "--cc")) {
2174 revs->diff = 1;
2175 revs->dense_combined_merges = 1;
2176 revs->combine_merges = 1;
2177 } else if (!strcmp(arg, "-v")) {
2178 revs->verbose_header = 1;
2179 } else if (!strcmp(arg, "--pretty")) {
2180 revs->verbose_header = 1;
2181 revs->pretty_given = 1;
2182 get_commit_format(NULL, revs);
2183 } else if (skip_prefix(arg, "--pretty=", &optarg) ||
2184 skip_prefix(arg, "--format=", &optarg)) {
2185 /*
2186 * Detached form ("--pretty X" as opposed to "--pretty=X")
2187 * not allowed, since the argument is optional.
2188 */
2189 revs->verbose_header = 1;
2190 revs->pretty_given = 1;
2191 get_commit_format(optarg, revs);
2192 } else if (!strcmp(arg, "--expand-tabs")) {
2193 revs->expand_tabs_in_log = 8;
2194 } else if (!strcmp(arg, "--no-expand-tabs")) {
2195 revs->expand_tabs_in_log = 0;
2196 } else if (skip_prefix(arg, "--expand-tabs=", &arg)) {
2197 int val;
2198 if (strtol_i(arg, 10, &val) < 0 || val < 0)
2199 die("'%s': not a non-negative integer", arg);
2200 revs->expand_tabs_in_log = val;
2201 } else if (!strcmp(arg, "--show-notes") || !strcmp(arg, "--notes")) {
2202 revs->show_notes = 1;
2203 revs->show_notes_given = 1;
2204 revs->notes_opt.use_default_notes = 1;
2205 } else if (!strcmp(arg, "--show-signature")) {
2206 revs->show_signature = 1;
2207 } else if (!strcmp(arg, "--no-show-signature")) {
2208 revs->show_signature = 0;
2209 } else if (!strcmp(arg, "--show-linear-break")) {
2210 revs->break_bar = " ..........";
2211 revs->track_linear = 1;
2212 revs->track_first_time = 1;
2213 } else if (skip_prefix(arg, "--show-linear-break=", &optarg)) {
2214 revs->break_bar = xstrdup(optarg);
2215 revs->track_linear = 1;
2216 revs->track_first_time = 1;
2217 } else if (skip_prefix(arg, "--show-notes=", &optarg) ||
2218 skip_prefix(arg, "--notes=", &optarg)) {
2219 struct strbuf buf = STRBUF_INIT;
2220 revs->show_notes = 1;
2221 revs->show_notes_given = 1;
2222 if (starts_with(arg, "--show-notes=") &&
2223 revs->notes_opt.use_default_notes < 0)
2224 revs->notes_opt.use_default_notes = 1;
2225 strbuf_addstr(&buf, optarg);
2226 expand_notes_ref(&buf);
2227 string_list_append(&revs->notes_opt.extra_notes_refs,
2228 strbuf_detach(&buf, NULL));
2229 } else if (!strcmp(arg, "--no-notes")) {
2230 revs->show_notes = 0;
2231 revs->show_notes_given = 1;
2232 revs->notes_opt.use_default_notes = -1;
2233 /* we have been strdup'ing ourselves, so trick
2234 * string_list into free()ing strings */
2235 revs->notes_opt.extra_notes_refs.strdup_strings = 1;
2236 string_list_clear(&revs->notes_opt.extra_notes_refs, 0);
2237 revs->notes_opt.extra_notes_refs.strdup_strings = 0;
2238 } else if (!strcmp(arg, "--standard-notes")) {
2239 revs->show_notes_given = 1;
2240 revs->notes_opt.use_default_notes = 1;
2241 } else if (!strcmp(arg, "--no-standard-notes")) {
2242 revs->notes_opt.use_default_notes = 0;
2243 } else if (!strcmp(arg, "--oneline")) {
2244 revs->verbose_header = 1;
2245 get_commit_format("oneline", revs);
2246 revs->pretty_given = 1;
2247 revs->abbrev_commit = 1;
2248 } else if (!strcmp(arg, "--graph")) {
2249 revs->topo_order = 1;
2250 revs->rewrite_parents = 1;
2251 revs->graph = graph_init(revs);
2252 } else if (!strcmp(arg, "--root")) {
2253 revs->show_root_diff = 1;
2254 } else if (!strcmp(arg, "--no-commit-id")) {
2255 revs->no_commit_id = 1;
2256 } else if (!strcmp(arg, "--always")) {
2257 revs->always_show_header = 1;
2258 } else if (!strcmp(arg, "--no-abbrev")) {
2259 revs->abbrev = 0;
2260 } else if (!strcmp(arg, "--abbrev")) {
2261 revs->abbrev = DEFAULT_ABBREV;
2262 } else if (skip_prefix(arg, "--abbrev=", &optarg)) {
2263 revs->abbrev = strtoul(optarg, NULL, 10);
2264 if (revs->abbrev < MINIMUM_ABBREV)
2265 revs->abbrev = MINIMUM_ABBREV;
2266 else if (revs->abbrev > hexsz)
2267 revs->abbrev = hexsz;
2268 } else if (!strcmp(arg, "--abbrev-commit")) {
2269 revs->abbrev_commit = 1;
2270 revs->abbrev_commit_given = 1;
2271 } else if (!strcmp(arg, "--no-abbrev-commit")) {
2272 revs->abbrev_commit = 0;
2273 } else if (!strcmp(arg, "--full-diff")) {
2274 revs->diff = 1;
2275 revs->full_diff = 1;
2276 } else if (!strcmp(arg, "--full-history")) {
2277 revs->simplify_history = 0;
2278 } else if (!strcmp(arg, "--relative-date")) {
2279 revs->date_mode.type = DATE_RELATIVE;
2280 revs->date_mode_explicit = 1;
2281 } else if ((argcount = parse_long_opt("date", argv, &optarg))) {
2282 parse_date_format(optarg, &revs->date_mode);
2283 revs->date_mode_explicit = 1;
2284 return argcount;
2285 } else if (!strcmp(arg, "--log-size")) {
2286 revs->show_log_size = 1;
2287 }
2288 /*
2289 * Grepping the commit log
2290 */
2291 else if ((argcount = parse_long_opt("author", argv, &optarg))) {
2292 add_header_grep(revs, GREP_HEADER_AUTHOR, optarg);
2293 return argcount;
2294 } else if ((argcount = parse_long_opt("committer", argv, &optarg))) {
2295 add_header_grep(revs, GREP_HEADER_COMMITTER, optarg);
2296 return argcount;
2297 } else if ((argcount = parse_long_opt("grep-reflog", argv, &optarg))) {
2298 add_header_grep(revs, GREP_HEADER_REFLOG, optarg);
2299 return argcount;
2300 } else if ((argcount = parse_long_opt("grep", argv, &optarg))) {
2301 add_message_grep(revs, optarg);
2302 return argcount;
2303 } else if (!strcmp(arg, "--grep-debug")) {
2304 revs->grep_filter.debug = 1;
2305 } else if (!strcmp(arg, "--basic-regexp")) {
2306 revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_BRE;
2307 } else if (!strcmp(arg, "--extended-regexp") || !strcmp(arg, "-E")) {
2308 revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_ERE;
2309 } else if (!strcmp(arg, "--regexp-ignore-case") || !strcmp(arg, "-i")) {
2310 revs->grep_filter.ignore_case = 1;
2311 revs->diffopt.pickaxe_opts |= DIFF_PICKAXE_IGNORE_CASE;
2312 } else if (!strcmp(arg, "--fixed-strings") || !strcmp(arg, "-F")) {
2313 revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_FIXED;
2314 } else if (!strcmp(arg, "--perl-regexp") || !strcmp(arg, "-P")) {
2315 revs->grep_filter.pattern_type_option = GREP_PATTERN_TYPE_PCRE;
2316 } else if (!strcmp(arg, "--all-match")) {
2317 revs->grep_filter.all_match = 1;
2318 } else if (!strcmp(arg, "--invert-grep")) {
2319 revs->invert_grep = 1;
2320 } else if ((argcount = parse_long_opt("encoding", argv, &optarg))) {
2321 if (strcmp(optarg, "none"))
2322 git_log_output_encoding = xstrdup(optarg);
2323 else
2324 git_log_output_encoding = "";
2325 return argcount;
2326 } else if (!strcmp(arg, "--reverse")) {
2327 revs->reverse ^= 1;
2328 } else if (!strcmp(arg, "--children")) {
2329 revs->children.name = "children";
2330 revs->limited = 1;
2331 } else if (!strcmp(arg, "--ignore-missing")) {
2332 revs->ignore_missing = 1;
2333 } else if (opt && opt->allow_exclude_promisor_objects &&
2334 !strcmp(arg, "--exclude-promisor-objects")) {
2335 if (fetch_if_missing)
2336 BUG("exclude_promisor_objects can only be used when fetch_if_missing is 0");
2337 revs->exclude_promisor_objects = 1;
2338 } else {
2339 int opts = diff_opt_parse(&revs->diffopt, argv, argc, revs->prefix);
2340 if (!opts)
2341 unkv[(*unkc)++] = arg;
2342 return opts;
2343 }
2344 if (revs->graph && revs->track_linear)
2345 die("--show-linear-break and --graph are incompatible");
2346
2347 return 1;
2348 }
2349
2350 void parse_revision_opt(struct rev_info *revs, struct parse_opt_ctx_t *ctx,
2351 const struct option *options,
2352 const char * const usagestr[])
2353 {
2354 int n = handle_revision_opt(revs, ctx->argc, ctx->argv,
2355 &ctx->cpidx, ctx->out, NULL);
2356 if (n <= 0) {
2357 error("unknown option `%s'", ctx->argv[0]);
2358 usage_with_options(usagestr, options);
2359 }
2360 ctx->argv += n;
2361 ctx->argc -= n;
2362 }
2363
2364 static int for_each_bisect_ref(struct ref_store *refs, each_ref_fn fn,
2365 void *cb_data, const char *term)
2366 {
2367 struct strbuf bisect_refs = STRBUF_INIT;
2368 int status;
2369 strbuf_addf(&bisect_refs, "refs/bisect/%s", term);
2370 status = refs_for_each_fullref_in(refs, bisect_refs.buf, fn, cb_data, 0);
2371 strbuf_release(&bisect_refs);
2372 return status;
2373 }
2374
2375 static int for_each_bad_bisect_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
2376 {
2377 return for_each_bisect_ref(refs, fn, cb_data, term_bad);
2378 }
2379
2380 static int for_each_good_bisect_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
2381 {
2382 return for_each_bisect_ref(refs, fn, cb_data, term_good);
2383 }
2384
2385 static int handle_revision_pseudo_opt(const char *submodule,
2386 struct rev_info *revs,
2387 int argc, const char **argv, int *flags)
2388 {
2389 const char *arg = argv[0];
2390 const char *optarg;
2391 struct ref_store *refs;
2392 int argcount;
2393
2394 if (submodule) {
2395 /*
2396 * We need some something like get_submodule_worktrees()
2397 * before we can go through all worktrees of a submodule,
2398 * .e.g with adding all HEADs from --all, which is not
2399 * supported right now, so stick to single worktree.
2400 */
2401 if (!revs->single_worktree)
2402 BUG("--single-worktree cannot be used together with submodule");
2403 refs = get_submodule_ref_store(submodule);
2404 } else
2405 refs = get_main_ref_store(revs->repo);
2406
2407 /*
2408 * NOTE!
2409 *
2410 * Commands like "git shortlog" will not accept the options below
2411 * unless parse_revision_opt queues them (as opposed to erroring
2412 * out).
2413 *
2414 * When implementing your new pseudo-option, remember to
2415 * register it in the list at the top of handle_revision_opt.
2416 */
2417 if (!strcmp(arg, "--all")) {
2418 handle_refs(refs, revs, *flags, refs_for_each_ref);
2419 handle_refs(refs, revs, *flags, refs_head_ref);
2420 if (!revs->single_worktree) {
2421 struct all_refs_cb cb;
2422
2423 init_all_refs_cb(&cb, revs, *flags);
2424 other_head_refs(handle_one_ref, &cb);
2425 }
2426 clear_ref_exclusion(&revs->ref_excludes);
2427 } else if (!strcmp(arg, "--branches")) {
2428 handle_refs(refs, revs, *flags, refs_for_each_branch_ref);
2429 clear_ref_exclusion(&revs->ref_excludes);
2430 } else if (!strcmp(arg, "--bisect")) {
2431 read_bisect_terms(&term_bad, &term_good);
2432 handle_refs(refs, revs, *flags, for_each_bad_bisect_ref);
2433 handle_refs(refs, revs, *flags ^ (UNINTERESTING | BOTTOM),
2434 for_each_good_bisect_ref);
2435 revs->bisect = 1;
2436 } else if (!strcmp(arg, "--tags")) {
2437 handle_refs(refs, revs, *flags, refs_for_each_tag_ref);
2438 clear_ref_exclusion(&revs->ref_excludes);
2439 } else if (!strcmp(arg, "--remotes")) {
2440 handle_refs(refs, revs, *flags, refs_for_each_remote_ref);
2441 clear_ref_exclusion(&revs->ref_excludes);
2442 } else if ((argcount = parse_long_opt("glob", argv, &optarg))) {
2443 struct all_refs_cb cb;
2444 init_all_refs_cb(&cb, revs, *flags);
2445 for_each_glob_ref(handle_one_ref, optarg, &cb);
2446 clear_ref_exclusion(&revs->ref_excludes);
2447 return argcount;
2448 } else if ((argcount = parse_long_opt("exclude", argv, &optarg))) {
2449 add_ref_exclusion(&revs->ref_excludes, optarg);
2450 return argcount;
2451 } else if (skip_prefix(arg, "--branches=", &optarg)) {
2452 struct all_refs_cb cb;
2453 init_all_refs_cb(&cb, revs, *flags);
2454 for_each_glob_ref_in(handle_one_ref, optarg, "refs/heads/", &cb);
2455 clear_ref_exclusion(&revs->ref_excludes);
2456 } else if (skip_prefix(arg, "--tags=", &optarg)) {
2457 struct all_refs_cb cb;
2458 init_all_refs_cb(&cb, revs, *flags);
2459 for_each_glob_ref_in(handle_one_ref, optarg, "refs/tags/", &cb);
2460 clear_ref_exclusion(&revs->ref_excludes);
2461 } else if (skip_prefix(arg, "--remotes=", &optarg)) {
2462 struct all_refs_cb cb;
2463 init_all_refs_cb(&cb, revs, *flags);
2464 for_each_glob_ref_in(handle_one_ref, optarg, "refs/remotes/", &cb);
2465 clear_ref_exclusion(&revs->ref_excludes);
2466 } else if (!strcmp(arg, "--reflog")) {
2467 add_reflogs_to_pending(revs, *flags);
2468 } else if (!strcmp(arg, "--indexed-objects")) {
2469 add_index_objects_to_pending(revs, *flags);
2470 } else if (!strcmp(arg, "--alternate-refs")) {
2471 add_alternate_refs_to_pending(revs, *flags);
2472 } else if (!strcmp(arg, "--not")) {
2473 *flags ^= UNINTERESTING | BOTTOM;
2474 } else if (!strcmp(arg, "--no-walk")) {
2475 revs->no_walk = REVISION_WALK_NO_WALK_SORTED;
2476 } else if (skip_prefix(arg, "--no-walk=", &optarg)) {
2477 /*
2478 * Detached form ("--no-walk X" as opposed to "--no-walk=X")
2479 * not allowed, since the argument is optional.
2480 */
2481 if (!strcmp(optarg, "sorted"))
2482 revs->no_walk = REVISION_WALK_NO_WALK_SORTED;
2483 else if (!strcmp(optarg, "unsorted"))
2484 revs->no_walk = REVISION_WALK_NO_WALK_UNSORTED;
2485 else
2486 return error("invalid argument to --no-walk");
2487 } else if (!strcmp(arg, "--do-walk")) {
2488 revs->no_walk = 0;
2489 } else if (!strcmp(arg, "--single-worktree")) {
2490 revs->single_worktree = 1;
2491 } else {
2492 return 0;
2493 }
2494
2495 return 1;
2496 }
2497
2498 static void NORETURN diagnose_missing_default(const char *def)
2499 {
2500 int flags;
2501 const char *refname;
2502
2503 refname = resolve_ref_unsafe(def, 0, NULL, &flags);
2504 if (!refname || !(flags & REF_ISSYMREF) || (flags & REF_ISBROKEN))
2505 die(_("your current branch appears to be broken"));
2506
2507 skip_prefix(refname, "refs/heads/", &refname);
2508 die(_("your current branch '%s' does not have any commits yet"),
2509 refname);
2510 }
2511
2512 /*
2513 * Parse revision information, filling in the "rev_info" structure,
2514 * and removing the used arguments from the argument list.
2515 *
2516 * Returns the number of arguments left that weren't recognized
2517 * (which are also moved to the head of the argument list)
2518 */
2519 int setup_revisions(int argc, const char **argv, struct rev_info *revs, struct setup_revision_opt *opt)
2520 {
2521 int i, flags, left, seen_dashdash, got_rev_arg = 0, revarg_opt;
2522 struct argv_array prune_data = ARGV_ARRAY_INIT;
2523 const char *submodule = NULL;
2524
2525 if (opt)
2526 submodule = opt->submodule;
2527
2528 /* First, search for "--" */
2529 if (opt && opt->assume_dashdash) {
2530 seen_dashdash = 1;
2531 } else {
2532 seen_dashdash = 0;
2533 for (i = 1; i < argc; i++) {
2534 const char *arg = argv[i];
2535 if (strcmp(arg, "--"))
2536 continue;
2537 argv[i] = NULL;
2538 argc = i;
2539 if (argv[i + 1])
2540 argv_array_pushv(&prune_data, argv + i + 1);
2541 seen_dashdash = 1;
2542 break;
2543 }
2544 }
2545
2546 /* Second, deal with arguments and options */
2547 flags = 0;
2548 revarg_opt = opt ? opt->revarg_opt : 0;
2549 if (seen_dashdash)
2550 revarg_opt |= REVARG_CANNOT_BE_FILENAME;
2551 for (left = i = 1; i < argc; i++) {
2552 const char *arg = argv[i];
2553 if (*arg == '-') {
2554 int opts;
2555
2556 opts = handle_revision_pseudo_opt(submodule,
2557 revs, argc - i, argv + i,
2558 &flags);
2559 if (opts > 0) {
2560 i += opts - 1;
2561 continue;
2562 }
2563
2564 if (!strcmp(arg, "--stdin")) {
2565 if (revs->disable_stdin) {
2566 argv[left++] = arg;
2567 continue;
2568 }
2569 if (revs->read_from_stdin++)
2570 die("--stdin given twice?");
2571 read_revisions_from_stdin(revs, &prune_data);
2572 continue;
2573 }
2574
2575 opts = handle_revision_opt(revs, argc - i, argv + i,
2576 &left, argv, opt);
2577 if (opts > 0) {
2578 i += opts - 1;
2579 continue;
2580 }
2581 if (opts < 0)
2582 exit(128);
2583 continue;
2584 }
2585
2586
2587 if (handle_revision_arg(arg, revs, flags, revarg_opt)) {
2588 int j;
2589 if (seen_dashdash || *arg == '^')
2590 die("bad revision '%s'", arg);
2591
2592 /* If we didn't have a "--":
2593 * (1) all filenames must exist;
2594 * (2) all rev-args must not be interpretable
2595 * as a valid filename.
2596 * but the latter we have checked in the main loop.
2597 */
2598 for (j = i; j < argc; j++)
2599 verify_filename(revs->prefix, argv[j], j == i);
2600
2601 argv_array_pushv(&prune_data, argv + i);
2602 break;
2603 }
2604 else
2605 got_rev_arg = 1;
2606 }
2607
2608 if (prune_data.argc) {
2609 /*
2610 * If we need to introduce the magic "a lone ':' means no
2611 * pathspec whatsoever", here is the place to do so.
2612 *
2613 * if (prune_data.nr == 1 && !strcmp(prune_data[0], ":")) {
2614 * prune_data.nr = 0;
2615 * prune_data.alloc = 0;
2616 * free(prune_data.path);
2617 * prune_data.path = NULL;
2618 * } else {
2619 * terminate prune_data.alloc with NULL and
2620 * call init_pathspec() to set revs->prune_data here.
2621 * }
2622 */
2623 parse_pathspec(&revs->prune_data, 0, 0,
2624 revs->prefix, prune_data.argv);
2625 }
2626 argv_array_clear(&prune_data);
2627
2628 if (revs->def == NULL)
2629 revs->def = opt ? opt->def : NULL;
2630 if (opt && opt->tweak)
2631 opt->tweak(revs, opt);
2632 if (revs->show_merge)
2633 prepare_show_merge(revs);
2634 if (revs->def && !revs->pending.nr && !revs->rev_input_given && !got_rev_arg) {
2635 struct object_id oid;
2636 struct object *object;
2637 struct object_context oc;
2638 if (get_oid_with_context(revs->repo, revs->def, 0, &oid, &oc))
2639 diagnose_missing_default(revs->def);
2640 object = get_reference(revs, revs->def, &oid, 0);
2641 add_pending_object_with_mode(revs, object, revs->def, oc.mode);
2642 }
2643
2644 /* Did the user ask for any diff output? Run the diff! */
2645 if (revs->diffopt.output_format & ~DIFF_FORMAT_NO_OUTPUT)
2646 revs->diff = 1;
2647
2648 /* Pickaxe, diff-filter and rename following need diffs */
2649 if ((revs->diffopt.pickaxe_opts & DIFF_PICKAXE_KINDS_MASK) ||
2650 revs->diffopt.filter ||
2651 revs->diffopt.flags.follow_renames)
2652 revs->diff = 1;
2653
2654 if (revs->diffopt.objfind)
2655 revs->simplify_history = 0;
2656
2657 if (revs->topo_order && !generation_numbers_enabled(the_repository))
2658 revs->limited = 1;
2659
2660 if (revs->prune_data.nr) {
2661 copy_pathspec(&revs->pruning.pathspec, &revs->prune_data);
2662 /* Can't prune commits with rename following: the paths change.. */
2663 if (!revs->diffopt.flags.follow_renames)
2664 revs->prune = 1;
2665 if (!revs->full_diff)
2666 copy_pathspec(&revs->diffopt.pathspec,
2667 &revs->prune_data);
2668 }
2669 if (revs->combine_merges)
2670 revs->ignore_merges = 0;
2671 if (revs->combined_all_paths && !revs->combine_merges)
2672 die("--combined-all-paths makes no sense without -c or --cc");
2673
2674 revs->diffopt.abbrev = revs->abbrev;
2675
2676 if (revs->line_level_traverse) {
2677 revs->limited = 1;
2678 revs->topo_order = 1;
2679 }
2680
2681 diff_setup_done(&revs->diffopt);
2682
2683 grep_commit_pattern_type(GREP_PATTERN_TYPE_UNSPECIFIED,
2684 &revs->grep_filter);
2685 compile_grep_patterns(&revs->grep_filter);
2686
2687 if (revs->reverse && revs->reflog_info)
2688 die("cannot combine --reverse with --walk-reflogs");
2689 if (revs->reflog_info && revs->limited)
2690 die("cannot combine --walk-reflogs with history-limiting options");
2691 if (revs->rewrite_parents && revs->children.name)
2692 die("cannot combine --parents and --children");
2693
2694 /*
2695 * Limitations on the graph functionality
2696 */
2697 if (revs->reverse && revs->graph)
2698 die("cannot combine --reverse with --graph");
2699
2700 if (revs->reflog_info && revs->graph)
2701 die("cannot combine --walk-reflogs with --graph");
2702 if (revs->no_walk && revs->graph)
2703 die("cannot combine --no-walk with --graph");
2704 if (!revs->reflog_info && revs->grep_filter.use_reflog_filter)
2705 die("cannot use --grep-reflog without --walk-reflogs");
2706
2707 if (revs->first_parent_only && revs->bisect)
2708 die(_("--first-parent is incompatible with --bisect"));
2709
2710 if (revs->line_level_traverse &&
2711 (revs->diffopt.output_format & ~(DIFF_FORMAT_PATCH | DIFF_FORMAT_NO_OUTPUT)))
2712 die(_("-L does not yet support diff formats besides -p and -s"));
2713
2714 if (revs->expand_tabs_in_log < 0)
2715 revs->expand_tabs_in_log = revs->expand_tabs_in_log_default;
2716
2717 return left;
2718 }
2719
2720 static void add_child(struct rev_info *revs, struct commit *parent, struct commit *child)
2721 {
2722 struct commit_list *l = xcalloc(1, sizeof(*l));
2723
2724 l->item = child;
2725 l->next = add_decoration(&revs->children, &parent->object, l);
2726 }
2727
2728 static int remove_duplicate_parents(struct rev_info *revs, struct commit *commit)
2729 {
2730 struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object);
2731 struct commit_list **pp, *p;
2732 int surviving_parents;
2733
2734 /* Examine existing parents while marking ones we have seen... */
2735 pp = &commit->parents;
2736 surviving_parents = 0;
2737 while ((p = *pp) != NULL) {
2738 struct commit *parent = p->item;
2739 if (parent->object.flags & TMP_MARK) {
2740 *pp = p->next;
2741 if (ts)
2742 compact_treesame(revs, commit, surviving_parents);
2743 continue;
2744 }
2745 parent->object.flags |= TMP_MARK;
2746 surviving_parents++;
2747 pp = &p->next;
2748 }
2749 /* clear the temporary mark */
2750 for (p = commit->parents; p; p = p->next) {
2751 p->item->object.flags &= ~TMP_MARK;
2752 }
2753 /* no update_treesame() - removing duplicates can't affect TREESAME */
2754 return surviving_parents;
2755 }
2756
2757 struct merge_simplify_state {
2758 struct commit *simplified;
2759 };
2760
2761 static struct merge_simplify_state *locate_simplify_state(struct rev_info *revs, struct commit *commit)
2762 {
2763 struct merge_simplify_state *st;
2764
2765 st = lookup_decoration(&revs->merge_simplification, &commit->object);
2766 if (!st) {
2767 st = xcalloc(1, sizeof(*st));
2768 add_decoration(&revs->merge_simplification, &commit->object, st);
2769 }
2770 return st;
2771 }
2772
2773 static int mark_redundant_parents(struct commit *commit)
2774 {
2775 struct commit_list *h = reduce_heads(commit->parents);
2776 int i = 0, marked = 0;
2777 struct commit_list *po, *pn;
2778
2779 /* Want these for sanity-checking only */
2780 int orig_cnt = commit_list_count(commit->parents);
2781 int cnt = commit_list_count(h);
2782
2783 /*
2784 * Not ready to remove items yet, just mark them for now, based
2785 * on the output of reduce_heads(). reduce_heads outputs the reduced
2786 * set in its original order, so this isn't too hard.
2787 */
2788 po = commit->parents;
2789 pn = h;
2790 while (po) {
2791 if (pn && po->item == pn->item) {
2792 pn = pn->next;
2793 i++;
2794 } else {
2795 po->item->object.flags |= TMP_MARK;
2796 marked++;
2797 }
2798 po=po->next;
2799 }
2800
2801 if (i != cnt || cnt+marked != orig_cnt)
2802 die("mark_redundant_parents %d %d %d %d", orig_cnt, cnt, i, marked);
2803
2804 free_commit_list(h);
2805
2806 return marked;
2807 }
2808
2809 static int mark_treesame_root_parents(struct commit *commit)
2810 {
2811 struct commit_list *p;
2812 int marked = 0;
2813
2814 for (p = commit->parents; p; p = p->next) {
2815 struct commit *parent = p->item;
2816 if (!parent->parents && (parent->object.flags & TREESAME)) {
2817 parent->object.flags |= TMP_MARK;
2818 marked++;
2819 }
2820 }
2821
2822 return marked;
2823 }
2824
2825 /*
2826 * Awkward naming - this means one parent we are TREESAME to.
2827 * cf mark_treesame_root_parents: root parents that are TREESAME (to an
2828 * empty tree). Better name suggestions?
2829 */
2830 static int leave_one_treesame_to_parent(struct rev_info *revs, struct commit *commit)
2831 {
2832 struct treesame_state *ts = lookup_decoration(&revs->treesame, &commit->object);
2833 struct commit *unmarked = NULL, *marked = NULL;
2834 struct commit_list *p;
2835 unsigned n;
2836
2837 for (p = commit->parents, n = 0; p; p = p->next, n++) {
2838 if (ts->treesame[n]) {
2839 if (p->item->object.flags & TMP_MARK) {
2840 if (!marked)
2841 marked = p->item;
2842 } else {
2843 if (!unmarked) {
2844 unmarked = p->item;
2845 break;
2846 }
2847 }
2848 }
2849 }
2850
2851 /*
2852 * If we are TREESAME to a marked-for-deletion parent, but not to any
2853 * unmarked parents, unmark the first TREESAME parent. This is the
2854 * parent that the default simplify_history==1 scan would have followed,
2855 * and it doesn't make sense to omit that path when asking for a
2856 * simplified full history. Retaining it improves the chances of
2857 * understanding odd missed merges that took an old version of a file.
2858 *
2859 * Example:
2860 *
2861 * I--------*X A modified the file, but mainline merge X used
2862 * \ / "-s ours", so took the version from I. X is
2863 * `-*A--' TREESAME to I and !TREESAME to A.
2864 *
2865 * Default log from X would produce "I". Without this check,
2866 * --full-history --simplify-merges would produce "I-A-X", showing
2867 * the merge commit X and that it changed A, but not making clear that
2868 * it had just taken the I version. With this check, the topology above
2869 * is retained.
2870 *
2871 * Note that it is possible that the simplification chooses a different
2872 * TREESAME parent from the default, in which case this test doesn't
2873 * activate, and we _do_ drop the default parent. Example:
2874 *
2875 * I------X A modified the file, but it was reverted in B,
2876 * \ / meaning mainline merge X is TREESAME to both
2877 * *A-*B parents.
2878 *
2879 * Default log would produce "I" by following the first parent;
2880 * --full-history --simplify-merges will produce "I-A-B". But this is a
2881 * reasonable result - it presents a logical full history leading from
2882 * I to X, and X is not an important merge.
2883 */
2884 if (!unmarked && marked) {
2885 marked->object.flags &= ~TMP_MARK;
2886 return 1;
2887 }
2888
2889 return 0;
2890 }
2891
2892 static int remove_marked_parents(struct rev_info *revs, struct commit *commit)
2893 {
2894 struct commit_list **pp, *p;
2895 int nth_parent, removed = 0;
2896
2897 pp = &commit->parents;
2898 nth_parent = 0;
2899 while ((p = *pp) != NULL) {
2900 struct commit *parent = p->item;
2901 if (parent->object.flags & TMP_MARK) {
2902 parent->object.flags &= ~TMP_MARK;
2903 *pp = p->next;
2904 free(p);
2905 removed++;
2906 compact_treesame(revs, commit, nth_parent);
2907 continue;
2908 }
2909 pp = &p->next;
2910 nth_parent++;
2911 }
2912
2913 /* Removing parents can only increase TREESAMEness */
2914 if (removed && !(commit->object.flags & TREESAME))
2915 update_treesame(revs, commit);
2916
2917 return nth_parent;
2918 }
2919
2920 static struct commit_list **simplify_one(struct rev_info *revs, struct commit *commit, struct commit_list **tail)
2921 {
2922 struct commit_list *p;
2923 struct commit *parent;
2924 struct merge_simplify_state *st, *pst;
2925 int cnt;
2926
2927 st = locate_simplify_state(revs, commit);
2928
2929 /*
2930 * Have we handled this one?
2931 */
2932 if (st->simplified)
2933 return tail;
2934
2935 /*
2936 * An UNINTERESTING commit simplifies to itself, so does a
2937 * root commit. We do not rewrite parents of such commit
2938 * anyway.
2939 */
2940 if ((commit->object.flags & UNINTERESTING) || !commit->parents) {
2941 st->simplified = commit;
2942 return tail;
2943 }
2944
2945 /*
2946 * Do we know what commit all of our parents that matter
2947 * should be rewritten to? Otherwise we are not ready to
2948 * rewrite this one yet.
2949 */
2950 for (cnt = 0, p = commit->parents; p; p = p->next) {
2951 pst = locate_simplify_state(revs, p->item);
2952 if (!pst->simplified) {
2953 tail = &commit_list_insert(p->item, tail)->next;
2954 cnt++;
2955 }
2956 if (revs->first_parent_only)
2957 break;
2958 }
2959 if (cnt) {
2960 tail = &commit_list_insert(commit, tail)->next;
2961 return tail;
2962 }
2963
2964 /*
2965 * Rewrite our list of parents. Note that this cannot
2966 * affect our TREESAME flags in any way - a commit is
2967 * always TREESAME to its simplification.
2968 */
2969 for (p = commit->parents; p; p = p->next) {
2970 pst = locate_simplify_state(revs, p->item);
2971 p->item = pst->simplified;
2972 if (revs->first_parent_only)
2973 break;
2974 }
2975
2976 if (revs->first_parent_only)
2977 cnt = 1;
2978 else
2979 cnt = remove_duplicate_parents(revs, commit);
2980
2981 /*
2982 * It is possible that we are a merge and one side branch
2983 * does not have any commit that touches the given paths;
2984 * in such a case, the immediate parent from that branch
2985 * will be rewritten to be the merge base.
2986 *
2987 * o----X X: the commit we are looking at;
2988 * / / o: a commit that touches the paths;
2989 * ---o----'
2990 *
2991 * Further, a merge of an independent branch that doesn't
2992 * touch the path will reduce to a treesame root parent:
2993 *
2994 * ----o----X X: the commit we are looking at;
2995 * / o: a commit that touches the paths;
2996 * r r: a root commit not touching the paths
2997 *
2998 * Detect and simplify both cases.
2999 */
3000 if (1 < cnt) {
3001 int marked = mark_redundant_parents(commit);
3002 marked += mark_treesame_root_parents(commit);
3003 if (marked)
3004 marked -= leave_one_treesame_to_parent(revs, commit);
3005 if (marked)
3006 cnt = remove_marked_parents(revs, commit);
3007 }
3008
3009 /*
3010 * A commit simplifies to itself if it is a root, if it is
3011 * UNINTERESTING, if it touches the given paths, or if it is a
3012 * merge and its parents don't simplify to one relevant commit
3013 * (the first two cases are already handled at the beginning of
3014 * this function).
3015 *
3016 * Otherwise, it simplifies to what its sole relevant parent
3017 * simplifies to.
3018 */
3019 if (!cnt ||
3020 (commit->object.flags & UNINTERESTING) ||
3021 !(commit->object.flags & TREESAME) ||
3022 (parent = one_relevant_parent(revs, commit->parents)) == NULL)
3023 st->simplified = commit;
3024 else {
3025 pst = locate_simplify_state(revs, parent);
3026 st->simplified = pst->simplified;
3027 }
3028 return tail;
3029 }
3030
3031 static void simplify_merges(struct rev_info *revs)
3032 {
3033 struct commit_list *list, *next;
3034 struct commit_list *yet_to_do, **tail;
3035 struct commit *commit;
3036
3037 if (!revs->prune)
3038 return;
3039
3040 /* feed the list reversed */
3041 yet_to_do = NULL;
3042 for (list = revs->commits; list; list = next) {
3043 commit = list->item;
3044 next = list->next;
3045 /*
3046 * Do not free(list) here yet; the original list
3047 * is used later in this function.
3048 */
3049 commit_list_insert(commit, &yet_to_do);
3050 }
3051 while (yet_to_do) {
3052 list = yet_to_do;
3053 yet_to_do = NULL;
3054 tail = &yet_to_do;
3055 while (list) {
3056 commit = pop_commit(&list);
3057 tail = simplify_one(revs, commit, tail);
3058 }
3059 }
3060
3061 /* clean up the result, removing the simplified ones */
3062 list = revs->commits;
3063 revs->commits = NULL;
3064 tail = &revs->commits;
3065 while (list) {
3066 struct merge_simplify_state *st;
3067
3068 commit = pop_commit(&list);
3069 st = locate_simplify_state(revs, commit);
3070 if (st->simplified == commit)
3071 tail = &commit_list_insert(commit, tail)->next;
3072 }
3073 }
3074
3075 static void set_children(struct rev_info *revs)
3076 {
3077 struct commit_list *l;
3078 for (l = revs->commits; l; l = l->next) {
3079 struct commit *commit = l->item;
3080 struct commit_list *p;
3081
3082 for (p = commit->parents; p; p = p->next)
3083 add_child(revs, p->item, commit);
3084 }
3085 }
3086
3087 void reset_revision_walk(void)
3088 {
3089 clear_object_flags(SEEN | ADDED | SHOWN);
3090 }
3091
3092 static int mark_uninteresting(const struct object_id *oid,
3093 struct packed_git *pack,
3094 uint32_t pos,
3095 void *cb)
3096 {
3097 struct rev_info *revs = cb;
3098 struct object *o = parse_object(revs->repo, oid);
3099 o->flags |= UNINTERESTING | SEEN;
3100 return 0;
3101 }
3102
3103 define_commit_slab(indegree_slab, int);
3104 define_commit_slab(author_date_slab, timestamp_t);
3105
3106 struct topo_walk_info {
3107 uint32_t min_generation;
3108 struct prio_queue explore_queue;
3109 struct prio_queue indegree_queue;
3110 struct prio_queue topo_queue;
3111 struct indegree_slab indegree;
3112 struct author_date_slab author_date;
3113 };
3114
3115 static inline void test_flag_and_insert(struct prio_queue *q, struct commit *c, int flag)
3116 {
3117 if (c->object.flags & flag)
3118 return;
3119
3120 c->object.flags |= flag;
3121 prio_queue_put(q, c);
3122 }
3123
3124 static void explore_walk_step(struct rev_info *revs)
3125 {
3126 struct topo_walk_info *info = revs->topo_walk_info;
3127 struct commit_list *p;
3128 struct commit *c = prio_queue_get(&info->explore_queue);
3129
3130 if (!c)
3131 return;
3132
3133 if (parse_commit_gently(c, 1) < 0)
3134 return;
3135
3136 if (revs->sort_order == REV_SORT_BY_AUTHOR_DATE)
3137 record_author_date(&info->author_date, c);
3138
3139 if (revs->max_age != -1 && (c->date < revs->max_age))
3140 c->object.flags |= UNINTERESTING;
3141
3142 if (process_parents(revs, c, NULL, NULL) < 0)
3143 return;
3144
3145 if (c->object.flags & UNINTERESTING)
3146 mark_parents_uninteresting(c);
3147
3148 for (p = c->parents; p; p = p->next)
3149 test_flag_and_insert(&info->explore_queue, p->item, TOPO_WALK_EXPLORED);
3150 }
3151
3152 static void explore_to_depth(struct rev_info *revs,
3153 uint32_t gen_cutoff)
3154 {
3155 struct topo_walk_info *info = revs->topo_walk_info;
3156 struct commit *c;
3157 while ((c = prio_queue_peek(&info->explore_queue)) &&
3158 c->generation >= gen_cutoff)
3159 explore_walk_step(revs);
3160 }
3161
3162 static void indegree_walk_step(struct rev_info *revs)
3163 {
3164 struct commit_list *p;
3165 struct topo_walk_info *info = revs->topo_walk_info;
3166 struct commit *c = prio_queue_get(&info->indegree_queue);
3167
3168 if (!c)
3169 return;
3170
3171 if (parse_commit_gently(c, 1) < 0)
3172 return;
3173
3174 explore_to_depth(revs, c->generation);
3175
3176 for (p = c->parents; p; p = p->next) {
3177 struct commit *parent = p->item;
3178 int *pi = indegree_slab_at(&info->indegree, parent);
3179
3180 if (*pi)
3181 (*pi)++;
3182 else
3183 *pi = 2;
3184
3185 test_flag_and_insert(&info->indegree_queue, parent, TOPO_WALK_INDEGREE);
3186
3187 if (revs->first_parent_only)
3188 return;
3189 }
3190 }
3191
3192 static void compute_indegrees_to_depth(struct rev_info *revs,
3193 uint32_t gen_cutoff)
3194 {
3195 struct topo_walk_info *info = revs->topo_walk_info;
3196 struct commit *c;
3197 while ((c = prio_queue_peek(&info->indegree_queue)) &&
3198 c->generation >= gen_cutoff)
3199 indegree_walk_step(revs);
3200 }
3201
3202 static void init_topo_walk(struct rev_info *revs)
3203 {
3204 struct topo_walk_info *info;
3205 struct commit_list *list;
3206 revs->topo_walk_info = xmalloc(sizeof(struct topo_walk_info));
3207 info = revs->topo_walk_info;
3208 memset(info, 0, sizeof(struct topo_walk_info));
3209
3210 init_indegree_slab(&info->indegree);
3211 memset(&info->explore_queue, 0, sizeof(info->explore_queue));
3212 memset(&info->indegree_queue, 0, sizeof(info->indegree_queue));
3213 memset(&info->topo_queue, 0, sizeof(info->topo_queue));
3214
3215 switch (revs->sort_order) {
3216 default: /* REV_SORT_IN_GRAPH_ORDER */
3217 info->topo_queue.compare = NULL;
3218 break;
3219 case REV_SORT_BY_COMMIT_DATE:
3220 info->topo_queue.compare = compare_commits_by_commit_date;
3221 break;
3222 case REV_SORT_BY_AUTHOR_DATE:
3223 init_author_date_slab(&info->author_date);
3224 info->topo_queue.compare = compare_commits_by_author_date;
3225 info->topo_queue.cb_data = &info->author_date;
3226 break;
3227 }
3228
3229 info->explore_queue.compare = compare_commits_by_gen_then_commit_date;
3230 info->indegree_queue.compare = compare_commits_by_gen_then_commit_date;
3231
3232 info->min_generation = GENERATION_NUMBER_INFINITY;
3233 for (list = revs->commits; list; list = list->next) {
3234 struct commit *c = list->item;
3235
3236 if (parse_commit_gently(c, 1))
3237 continue;
3238
3239 test_flag_and_insert(&info->explore_queue, c, TOPO_WALK_EXPLORED);
3240 test_flag_and_insert(&info->indegree_queue, c, TOPO_WALK_INDEGREE);
3241
3242 if (c->generation < info->min_generation)
3243 info->min_generation = c->generation;
3244
3245 *(indegree_slab_at(&info->indegree, c)) = 1;
3246
3247 if (revs->sort_order == REV_SORT_BY_AUTHOR_DATE)
3248 record_author_date(&info->author_date, c);
3249 }
3250 compute_indegrees_to_depth(revs, info->min_generation);
3251
3252 for (list = revs->commits; list; list = list->next) {
3253 struct commit *c = list->item;
3254
3255 if (*(indegree_slab_at(&info->indegree, c)) == 1)
3256 prio_queue_put(&info->topo_queue, c);
3257 }
3258
3259 /*
3260 * This is unfortunate; the initial tips need to be shown
3261 * in the order given from the revision traversal machinery.
3262 */
3263 if (revs->sort_order == REV_SORT_IN_GRAPH_ORDER)
3264 prio_queue_reverse(&info->topo_queue);
3265 }
3266
3267 static struct commit *next_topo_commit(struct rev_info *revs)
3268 {
3269 struct commit *c;
3270 struct topo_walk_info *info = revs->topo_walk_info;
3271
3272 /* pop next off of topo_queue */
3273 c = prio_queue_get(&info->topo_queue);
3274
3275 if (c)
3276 *(indegree_slab_at(&info->indegree, c)) = 0;
3277
3278 return c;
3279 }
3280
3281 static void expand_topo_walk(struct rev_info *revs, struct commit *commit)
3282 {
3283 struct commit_list *p;
3284 struct topo_walk_info *info = revs->topo_walk_info;
3285 if (process_parents(revs, commit, NULL, NULL) < 0) {
3286 if (!revs->ignore_missing_links)
3287 die("Failed to traverse parents of commit %s",
3288 oid_to_hex(&commit->object.oid));
3289 }
3290
3291 for (p = commit->parents; p; p = p->next) {
3292 struct commit *parent = p->item;
3293 int *pi;
3294
3295 if (parent->object.flags & UNINTERESTING)
3296 continue;
3297
3298 if (parse_commit_gently(parent, 1) < 0)
3299 continue;
3300
3301 if (parent->generation < info->min_generation) {
3302 info->min_generation = parent->generation;
3303 compute_indegrees_to_depth(revs, info->min_generation);
3304 }
3305
3306 pi = indegree_slab_at(&info->indegree, parent);
3307
3308 (*pi)--;
3309 if (*pi == 1)
3310 prio_queue_put(&info->topo_queue, parent);
3311
3312 if (revs->first_parent_only)
3313 return;
3314 }
3315 }
3316
3317 int prepare_revision_walk(struct rev_info *revs)
3318 {
3319 int i;
3320 struct object_array old_pending;
3321 struct commit_list **next = &revs->commits;
3322
3323 memcpy(&old_pending, &revs->pending, sizeof(old_pending));
3324 revs->pending.nr = 0;
3325 revs->pending.alloc = 0;
3326 revs->pending.objects = NULL;
3327 for (i = 0; i < old_pending.nr; i++) {
3328 struct object_array_entry *e = old_pending.objects + i;
3329 struct commit *commit = handle_commit(revs, e);
3330 if (commit) {
3331 if (!(commit->object.flags & SEEN)) {
3332 commit->object.flags |= SEEN;
3333 next = commit_list_append(commit, next);
3334 }
3335 }
3336 }
3337 object_array_clear(&old_pending);
3338
3339 /* Signal whether we need per-parent treesame decoration */
3340 if (revs->simplify_merges ||
3341 (revs->limited && limiting_can_increase_treesame(revs)))
3342 revs->treesame.name = "treesame";
3343
3344 if (revs->exclude_promisor_objects) {
3345 for_each_packed_object(mark_uninteresting, revs,
3346 FOR_EACH_OBJECT_PROMISOR_ONLY);
3347 }
3348
3349 if (revs->no_walk != REVISION_WALK_NO_WALK_UNSORTED)
3350 commit_list_sort_by_date(&revs->commits);
3351 if (revs->no_walk)
3352 return 0;
3353 if (revs->limited) {
3354 if (limit_list(revs) < 0)
3355 return -1;
3356 if (revs->topo_order)
3357 sort_in_topological_order(&revs->commits, revs->sort_order);
3358 } else if (revs->topo_order)
3359 init_topo_walk(revs);
3360 if (revs->line_level_traverse)
3361 line_log_filter(revs);
3362 if (revs->simplify_merges)
3363 simplify_merges(revs);
3364 if (revs->children.name)
3365 set_children(revs);
3366 return 0;
3367 }
3368
3369 static enum rewrite_result rewrite_one_1(struct rev_info *revs,
3370 struct commit **pp,
3371 struct prio_queue *queue)
3372 {
3373 for (;;) {
3374 struct commit *p = *pp;
3375 if (!revs->limited)
3376 if (process_parents(revs, p, NULL, queue) < 0)
3377 return rewrite_one_error;
3378 if (p->object.flags & UNINTERESTING)
3379 return rewrite_one_ok;
3380 if (!(p->object.flags & TREESAME))
3381 return rewrite_one_ok;
3382 if (!p->parents)
3383 return rewrite_one_noparents;
3384 if ((p = one_relevant_parent(revs, p->parents)) == NULL)
3385 return rewrite_one_ok;
3386 *pp = p;
3387 }
3388 }
3389
3390 static void merge_queue_into_list(struct prio_queue *q, struct commit_list **list)
3391 {
3392 while (q->nr) {
3393 struct commit *item = prio_queue_peek(q);
3394 struct commit_list *p = *list;
3395
3396 if (p && p->item->date >= item->date)
3397 list = &p->next;
3398 else {
3399 p = commit_list_insert(item, list);
3400 list = &p->next; /* skip newly added item */
3401 prio_queue_get(q); /* pop item */
3402 }
3403 }
3404 }
3405
3406 static enum rewrite_result rewrite_one(struct rev_info *revs, struct commit **pp)
3407 {
3408 struct prio_queue queue = { compare_commits_by_commit_date };
3409 enum rewrite_result ret = rewrite_one_1(revs, pp, &queue);
3410 merge_queue_into_list(&queue, &revs->commits);
3411 clear_prio_queue(&queue);
3412 return ret;
3413 }
3414
3415 int rewrite_parents(struct rev_info *revs, struct commit *commit,
3416 rewrite_parent_fn_t rewrite_parent)
3417 {
3418 struct commit_list **pp = &commit->parents;
3419 while (*pp) {
3420 struct commit_list *parent = *pp;
3421 switch (rewrite_parent(revs, &parent->item)) {
3422 case rewrite_one_ok:
3423 break;
3424 case rewrite_one_noparents:
3425 *pp = parent->next;
3426 continue;
3427 case rewrite_one_error:
3428 return -1;
3429 }
3430 pp = &parent->next;
3431 }
3432 remove_duplicate_parents(revs, commit);
3433 return 0;
3434 }
3435
3436 static int commit_rewrite_person(struct strbuf *buf, const char *what, struct string_list *mailmap)
3437 {
3438 char *person, *endp;
3439 size_t len, namelen, maillen;
3440 const char *name;
3441 const char *mail;
3442 struct ident_split ident;
3443
3444 person = strstr(buf->buf, what);
3445 if (!person)
3446 return 0;
3447
3448 person += strlen(what);
3449 endp = strchr(person, '\n');
3450 if (!endp)
3451 return 0;
3452
3453 len = endp - person;
3454
3455 if (split_ident_line(&ident, person, len))
3456 return 0;
3457
3458 mail = ident.mail_begin;
3459 maillen = ident.mail_end - ident.mail_begin;
3460 name = ident.name_begin;
3461 namelen = ident.name_end - ident.name_begin;
3462
3463 if (map_user(mailmap, &mail, &maillen, &name, &namelen)) {
3464 struct strbuf namemail = STRBUF_INIT;
3465
3466 strbuf_addf(&namemail, "%.*s <%.*s>",
3467 (int)namelen, name, (int)maillen, mail);
3468
3469 strbuf_splice(buf, ident.name_begin - buf->buf,
3470 ident.mail_end - ident.name_begin + 1,
3471 namemail.buf, namemail.len);
3472
3473 strbuf_release(&namemail);
3474
3475 return 1;
3476 }
3477
3478 return 0;
3479 }
3480
3481 static int commit_match(struct commit *commit, struct rev_info *opt)
3482 {
3483 int retval;
3484 const char *encoding;
3485 const char *message;
3486 struct strbuf buf = STRBUF_INIT;
3487
3488 if (!opt->grep_filter.pattern_list && !opt->grep_filter.header_list)
3489 return 1;
3490
3491 /* Prepend "fake" headers as needed */
3492 if (opt->grep_filter.use_reflog_filter) {
3493 strbuf_addstr(&buf, "reflog ");
3494 get_reflog_message(&buf, opt->reflog_info);
3495 strbuf_addch(&buf, '\n');
3496 }
3497
3498 /*
3499 * We grep in the user's output encoding, under the assumption that it
3500 * is the encoding they are most likely to write their grep pattern
3501 * for. In addition, it means we will match the "notes" encoding below,
3502 * so we will not end up with a buffer that has two different encodings
3503 * in it.
3504 */
3505 encoding = get_log_output_encoding();
3506 message = logmsg_reencode(commit, NULL, encoding);
3507
3508 /* Copy the commit to temporary if we are using "fake" headers */
3509 if (buf.len)
3510 strbuf_addstr(&buf, message);
3511
3512 if (opt->grep_filter.header_list && opt->mailmap) {
3513 if (!buf.len)
3514 strbuf_addstr(&buf, message);
3515
3516 commit_rewrite_person(&buf, "\nauthor ", opt->mailmap);
3517 commit_rewrite_person(&buf, "\ncommitter ", opt->mailmap);
3518 }
3519
3520 /* Append "fake" message parts as needed */
3521 if (opt->show_notes) {
3522 if (!buf.len)
3523 strbuf_addstr(&buf, message);
3524 format_display_notes(&commit->object.oid, &buf, encoding, 1);
3525 }
3526
3527 /*
3528 * Find either in the original commit message, or in the temporary.
3529 * Note that we cast away the constness of "message" here. It is
3530 * const because it may come from the cached commit buffer. That's OK,
3531 * because we know that it is modifiable heap memory, and that while
3532 * grep_buffer may modify it for speed, it will restore any
3533 * changes before returning.
3534 */
3535 if (buf.len)
3536 retval = grep_buffer(&opt->grep_filter, buf.buf, buf.len);
3537 else
3538 retval = grep_buffer(&opt->grep_filter,
3539 (char *)message, strlen(message));
3540 strbuf_release(&buf);
3541 unuse_commit_buffer(commit, message);
3542 return opt->invert_grep ? !retval : retval;
3543 }
3544
3545 static inline int want_ancestry(const struct rev_info *revs)
3546 {
3547 return (revs->rewrite_parents || revs->children.name);
3548 }
3549
3550 /*
3551 * Return a timestamp to be used for --since/--until comparisons for this
3552 * commit, based on the revision options.
3553 */
3554 static timestamp_t comparison_date(const struct rev_info *revs,
3555 struct commit *commit)
3556 {
3557 return revs->reflog_info ?
3558 get_reflog_timestamp(revs->reflog_info) :
3559 commit->date;
3560 }
3561
3562 enum commit_action get_commit_action(struct rev_info *revs, struct commit *commit)
3563 {
3564 if (commit->object.flags & SHOWN)
3565 return commit_ignore;
3566 if (revs->unpacked && has_object_pack(&commit->object.oid))
3567 return commit_ignore;
3568 if (commit->object.flags & UNINTERESTING)
3569 return commit_ignore;
3570 if (revs->min_age != -1 &&
3571 comparison_date(revs, commit) > revs->min_age)
3572 return commit_ignore;
3573 if (revs->min_parents || (revs->max_parents >= 0)) {
3574 int n = commit_list_count(commit->parents);
3575 if ((n < revs->min_parents) ||
3576 ((revs->max_parents >= 0) && (n > revs->max_parents)))
3577 return commit_ignore;
3578 }
3579 if (!commit_match(commit, revs))
3580 return commit_ignore;
3581 if (revs->prune && revs->dense) {
3582 /* Commit without changes? */
3583 if (commit->object.flags & TREESAME) {
3584 int n;
3585 struct commit_list *p;
3586 /* drop merges unless we want parenthood */
3587 if (!want_ancestry(revs))
3588 return commit_ignore;
3589 /*
3590 * If we want ancestry, then need to keep any merges
3591 * between relevant commits to tie together topology.
3592 * For consistency with TREESAME and simplification
3593 * use "relevant" here rather than just INTERESTING,
3594 * to treat bottom commit(s) as part of the topology.
3595 */
3596 for (n = 0, p = commit->parents; p; p = p->next)
3597 if (relevant_commit(p->item))
3598 if (++n >= 2)
3599 return commit_show;
3600 return commit_ignore;
3601 }
3602 }
3603 return commit_show;
3604 }
3605
3606 define_commit_slab(saved_parents, struct commit_list *);
3607
3608 #define EMPTY_PARENT_LIST ((struct commit_list *)-1)
3609
3610 /*
3611 * You may only call save_parents() once per commit (this is checked
3612 * for non-root commits).
3613 */
3614 static void save_parents(struct rev_info *revs, struct commit *commit)
3615 {
3616 struct commit_list **pp;
3617
3618 if (!revs->saved_parents_slab) {
3619 revs->saved_parents_slab = xmalloc(sizeof(struct saved_parents));
3620 init_saved_parents(revs->saved_parents_slab);
3621 }
3622
3623 pp = saved_parents_at(revs->saved_parents_slab, commit);
3624
3625 /*
3626 * When walking with reflogs, we may visit the same commit
3627 * several times: once for each appearance in the reflog.
3628 *
3629 * In this case, save_parents() will be called multiple times.
3630 * We want to keep only the first set of parents. We need to
3631 * store a sentinel value for an empty (i.e., NULL) parent
3632 * list to distinguish it from a not-yet-saved list, however.
3633 */
3634 if (*pp)
3635 return;
3636 if (commit->parents)
3637 *pp = copy_commit_list(commit->parents);
3638 else
3639 *pp = EMPTY_PARENT_LIST;
3640 }
3641
3642 static void free_saved_parents(struct rev_info *revs)
3643 {
3644 if (revs->saved_parents_slab)
3645 clear_saved_parents(revs->saved_parents_slab);
3646 }
3647
3648 struct commit_list *get_saved_parents(struct rev_info *revs, const struct commit *commit)
3649 {
3650 struct commit_list *parents;
3651
3652 if (!revs->saved_parents_slab)
3653 return commit->parents;
3654
3655 parents = *saved_parents_at(revs->saved_parents_slab, commit);
3656 if (parents == EMPTY_PARENT_LIST)
3657 return NULL;
3658 return parents;
3659 }
3660
3661 enum commit_action simplify_commit(struct rev_info *revs, struct commit *commit)
3662 {
3663 enum commit_action action = get_commit_action(revs, commit);
3664
3665 if (action == commit_show &&
3666 revs->prune && revs->dense && want_ancestry(revs)) {
3667 /*
3668 * --full-diff on simplified parents is no good: it
3669 * will show spurious changes from the commits that
3670 * were elided. So we save the parents on the side
3671 * when --full-diff is in effect.
3672 */
3673 if (revs->full_diff)
3674 save_parents(revs, commit);
3675 if (rewrite_parents(revs, commit, rewrite_one) < 0)
3676 return commit_error;
3677 }
3678 return action;
3679 }
3680
3681 static void track_linear(struct rev_info *revs, struct commit *commit)
3682 {
3683 if (revs->track_first_time) {
3684 revs->linear = 1;
3685 revs->track_first_time = 0;
3686 } else {
3687 struct commit_list *p;
3688 for (p = revs->previous_parents; p; p = p->next)
3689 if (p->item == NULL || /* first commit */
3690 oideq(&p->item->object.oid, &commit->object.oid))
3691 break;
3692 revs->linear = p != NULL;
3693 }
3694 if (revs->reverse) {
3695 if (revs->linear)
3696 commit->object.flags |= TRACK_LINEAR;
3697 }
3698 free_commit_list(revs->previous_parents);
3699 revs->previous_parents = copy_commit_list(commit->parents);
3700 }
3701
3702 static struct commit *get_revision_1(struct rev_info *revs)
3703 {
3704 while (1) {
3705 struct commit *commit;
3706
3707 if (revs->reflog_info)
3708 commit = next_reflog_entry(revs->reflog_info);
3709 else if (revs->topo_walk_info)
3710 commit = next_topo_commit(revs);
3711 else
3712 commit = pop_commit(&revs->commits