cache.h: remove this no-longer-used header
[alt-git.git] / builtin / show-branch.c
blobcd215f89af891a06743dcbd3c034c3bba294f558
1 #include "builtin.h"
2 #include "config.h"
3 #include "environment.h"
4 #include "gettext.h"
5 #include "hash.h"
6 #include "hex.h"
7 #include "pretty.h"
8 #include "refs.h"
9 #include "color.h"
10 #include "strvec.h"
11 #include "object-name.h"
12 #include "parse-options.h"
13 #include "repository.h"
14 #include "dir.h"
15 #include "commit-slab.h"
16 #include "date.h"
18 static const char* show_branch_usage[] = {
19 N_("git show-branch [-a | --all] [-r | --remotes] [--topo-order | --date-order]\n"
20 " [--current] [--color[=<when>] | --no-color] [--sparse]\n"
21 " [--more=<n> | --list | --independent | --merge-base]\n"
22 " [--no-name | --sha1-name] [--topics]\n"
23 " [(<rev> | <glob>)...]"),
24 N_("git show-branch (-g | --reflog)[=<n>[,<base>]] [--list] [<ref>]"),
25 NULL
28 static int showbranch_use_color = -1;
30 static struct strvec default_args = STRVEC_INIT;
33 * TODO: convert this use of commit->object.flags to commit-slab
34 * instead to store a pointer to ref name directly. Then use the same
35 * UNINTERESTING definition from revision.h here.
37 #define UNINTERESTING 01
39 #define REV_SHIFT 2
40 #define MAX_REVS (FLAG_BITS - REV_SHIFT) /* should not exceed bits_per_int - REV_SHIFT */
42 #define DEFAULT_REFLOG 4
44 static const char *get_color_code(int idx)
46 if (want_color(showbranch_use_color))
47 return column_colors_ansi[idx % column_colors_ansi_max];
48 return "";
51 static const char *get_color_reset_code(void)
53 if (want_color(showbranch_use_color))
54 return GIT_COLOR_RESET;
55 return "";
58 static struct commit *interesting(struct commit_list *list)
60 while (list) {
61 struct commit *commit = list->item;
62 list = list->next;
63 if (commit->object.flags & UNINTERESTING)
64 continue;
65 return commit;
67 return NULL;
70 struct commit_name {
71 const char *head_name; /* which head's ancestor? */
72 int generation; /* how many parents away from head_name */
75 define_commit_slab(commit_name_slab, struct commit_name *);
76 static struct commit_name_slab name_slab;
78 static struct commit_name *commit_to_name(struct commit *commit)
80 return *commit_name_slab_at(&name_slab, commit);
84 /* Name the commit as nth generation ancestor of head_name;
85 * we count only the first-parent relationship for naming purposes.
87 static void name_commit(struct commit *commit, const char *head_name, int nth)
89 struct commit_name *name;
91 name = *commit_name_slab_at(&name_slab, commit);
92 if (!name) {
93 name = xmalloc(sizeof(*name));
94 *commit_name_slab_at(&name_slab, commit) = name;
96 name->head_name = head_name;
97 name->generation = nth;
100 /* Parent is the first parent of the commit. We may name it
101 * as (n+1)th generation ancestor of the same head_name as
102 * commit is nth generation ancestor of, if that generation
103 * number is better than the name it already has.
105 static void name_parent(struct commit *commit, struct commit *parent)
107 struct commit_name *commit_name = commit_to_name(commit);
108 struct commit_name *parent_name = commit_to_name(parent);
109 if (!commit_name)
110 return;
111 if (!parent_name ||
112 commit_name->generation + 1 < parent_name->generation)
113 name_commit(parent, commit_name->head_name,
114 commit_name->generation + 1);
117 static int name_first_parent_chain(struct commit *c)
119 int i = 0;
120 while (c) {
121 struct commit *p;
122 if (!commit_to_name(c))
123 break;
124 if (!c->parents)
125 break;
126 p = c->parents->item;
127 if (!commit_to_name(p)) {
128 name_parent(c, p);
129 i++;
131 else
132 break;
133 c = p;
135 return i;
138 static void name_commits(struct commit_list *list,
139 struct commit **rev,
140 char **ref_name,
141 int num_rev)
143 struct commit_list *cl;
144 struct commit *c;
145 int i;
147 /* First give names to the given heads */
148 for (cl = list; cl; cl = cl->next) {
149 c = cl->item;
150 if (commit_to_name(c))
151 continue;
152 for (i = 0; i < num_rev; i++) {
153 if (rev[i] == c) {
154 name_commit(c, ref_name[i], 0);
155 break;
160 /* Then commits on the first parent ancestry chain */
161 do {
162 i = 0;
163 for (cl = list; cl; cl = cl->next) {
164 i += name_first_parent_chain(cl->item);
166 } while (i);
168 /* Finally, any unnamed commits */
169 do {
170 i = 0;
171 for (cl = list; cl; cl = cl->next) {
172 struct commit_list *parents;
173 struct commit_name *n;
174 int nth;
175 c = cl->item;
176 if (!commit_to_name(c))
177 continue;
178 n = commit_to_name(c);
179 parents = c->parents;
180 nth = 0;
181 while (parents) {
182 struct commit *p = parents->item;
183 struct strbuf newname = STRBUF_INIT;
184 parents = parents->next;
185 nth++;
186 if (commit_to_name(p))
187 continue;
188 switch (n->generation) {
189 case 0:
190 strbuf_addstr(&newname, n->head_name);
191 break;
192 case 1:
193 strbuf_addf(&newname, "%s^", n->head_name);
194 break;
195 default:
196 strbuf_addf(&newname, "%s~%d",
197 n->head_name, n->generation);
198 break;
200 if (nth == 1)
201 strbuf_addch(&newname, '^');
202 else
203 strbuf_addf(&newname, "^%d", nth);
204 name_commit(p, strbuf_detach(&newname, NULL), 0);
205 i++;
206 name_first_parent_chain(p);
209 } while (i);
212 static int mark_seen(struct commit *commit, struct commit_list **seen_p)
214 if (!commit->object.flags) {
215 commit_list_insert(commit, seen_p);
216 return 1;
218 return 0;
221 static void join_revs(struct commit_list **list_p,
222 struct commit_list **seen_p,
223 int num_rev, int extra)
225 int all_mask = ((1u << (REV_SHIFT + num_rev)) - 1);
226 int all_revs = all_mask & ~((1u << REV_SHIFT) - 1);
228 while (*list_p) {
229 struct commit_list *parents;
230 int still_interesting = !!interesting(*list_p);
231 struct commit *commit = pop_commit(list_p);
232 int flags = commit->object.flags & all_mask;
234 if (!still_interesting && extra <= 0)
235 break;
237 mark_seen(commit, seen_p);
238 if ((flags & all_revs) == all_revs)
239 flags |= UNINTERESTING;
240 parents = commit->parents;
242 while (parents) {
243 struct commit *p = parents->item;
244 int this_flag = p->object.flags;
245 parents = parents->next;
246 if ((this_flag & flags) == flags)
247 continue;
248 repo_parse_commit(the_repository, p);
249 if (mark_seen(p, seen_p) && !still_interesting)
250 extra--;
251 p->object.flags |= flags;
252 commit_list_insert_by_date(p, list_p);
257 * Postprocess to complete well-poisoning.
259 * At this point we have all the commits we have seen in
260 * seen_p list. Mark anything that can be reached from
261 * uninteresting commits not interesting.
263 for (;;) {
264 int changed = 0;
265 struct commit_list *s;
266 for (s = *seen_p; s; s = s->next) {
267 struct commit *c = s->item;
268 struct commit_list *parents;
270 if (((c->object.flags & all_revs) != all_revs) &&
271 !(c->object.flags & UNINTERESTING))
272 continue;
274 /* The current commit is either a merge base or
275 * already uninteresting one. Mark its parents
276 * as uninteresting commits _only_ if they are
277 * already parsed. No reason to find new ones
278 * here.
280 parents = c->parents;
281 while (parents) {
282 struct commit *p = parents->item;
283 parents = parents->next;
284 if (!(p->object.flags & UNINTERESTING)) {
285 p->object.flags |= UNINTERESTING;
286 changed = 1;
290 if (!changed)
291 break;
295 static void show_one_commit(struct commit *commit, int no_name)
297 struct strbuf pretty = STRBUF_INIT;
298 const char *pretty_str = "(unavailable)";
299 struct commit_name *name = commit_to_name(commit);
301 if (commit->object.parsed) {
302 pp_commit_easy(CMIT_FMT_ONELINE, commit, &pretty);
303 pretty_str = pretty.buf;
305 skip_prefix(pretty_str, "[PATCH] ", &pretty_str);
307 if (!no_name) {
308 if (name && name->head_name) {
309 printf("[%s", name->head_name);
310 if (name->generation) {
311 if (name->generation == 1)
312 printf("^");
313 else
314 printf("~%d", name->generation);
316 printf("] ");
318 else
319 printf("[%s] ",
320 repo_find_unique_abbrev(the_repository, &commit->object.oid,
321 DEFAULT_ABBREV));
323 puts(pretty_str);
324 strbuf_release(&pretty);
327 static char *ref_name[MAX_REVS + 1];
328 static int ref_name_cnt;
330 static const char *find_digit_prefix(const char *s, int *v)
332 const char *p;
333 int ver;
334 char ch;
336 for (p = s, ver = 0;
337 '0' <= (ch = *p) && ch <= '9';
338 p++)
339 ver = ver * 10 + ch - '0';
340 *v = ver;
341 return p;
345 static int version_cmp(const char *a, const char *b)
347 while (1) {
348 int va, vb;
350 a = find_digit_prefix(a, &va);
351 b = find_digit_prefix(b, &vb);
352 if (va != vb)
353 return va - vb;
355 while (1) {
356 int ca = *a;
357 int cb = *b;
358 if ('0' <= ca && ca <= '9')
359 ca = 0;
360 if ('0' <= cb && cb <= '9')
361 cb = 0;
362 if (ca != cb)
363 return ca - cb;
364 if (!ca)
365 break;
366 a++;
367 b++;
369 if (!*a && !*b)
370 return 0;
374 static int compare_ref_name(const void *a_, const void *b_)
376 const char * const*a = a_, * const*b = b_;
377 return version_cmp(*a, *b);
380 static void sort_ref_range(int bottom, int top)
382 QSORT(ref_name + bottom, top - bottom, compare_ref_name);
385 static int append_ref(const char *refname, const struct object_id *oid,
386 int allow_dups)
388 struct commit *commit = lookup_commit_reference_gently(the_repository,
389 oid, 1);
390 int i;
392 if (!commit)
393 return 0;
395 if (!allow_dups) {
396 /* Avoid adding the same thing twice */
397 for (i = 0; i < ref_name_cnt; i++)
398 if (!strcmp(refname, ref_name[i]))
399 return 0;
401 if (MAX_REVS <= ref_name_cnt) {
402 warning(Q_("ignoring %s; cannot handle more than %d ref",
403 "ignoring %s; cannot handle more than %d refs",
404 MAX_REVS), refname, MAX_REVS);
405 return 0;
407 ref_name[ref_name_cnt++] = xstrdup(refname);
408 ref_name[ref_name_cnt] = NULL;
409 return 0;
412 static int append_head_ref(const char *refname, const struct object_id *oid,
413 int flag UNUSED, void *cb_data UNUSED)
415 struct object_id tmp;
416 int ofs = 11;
417 if (!starts_with(refname, "refs/heads/"))
418 return 0;
419 /* If both heads/foo and tags/foo exists, get_sha1 would
420 * get confused.
422 if (repo_get_oid(the_repository, refname + ofs, &tmp) || !oideq(&tmp, oid))
423 ofs = 5;
424 return append_ref(refname + ofs, oid, 0);
427 static int append_remote_ref(const char *refname, const struct object_id *oid,
428 int flag UNUSED, void *cb_data UNUSED)
430 struct object_id tmp;
431 int ofs = 13;
432 if (!starts_with(refname, "refs/remotes/"))
433 return 0;
434 /* If both heads/foo and tags/foo exists, get_sha1 would
435 * get confused.
437 if (repo_get_oid(the_repository, refname + ofs, &tmp) || !oideq(&tmp, oid))
438 ofs = 5;
439 return append_ref(refname + ofs, oid, 0);
442 static int append_tag_ref(const char *refname, const struct object_id *oid,
443 int flag UNUSED, void *cb_data UNUSED)
445 if (!starts_with(refname, "refs/tags/"))
446 return 0;
447 return append_ref(refname + 5, oid, 0);
450 static const char *match_ref_pattern = NULL;
451 static int match_ref_slash = 0;
453 static int append_matching_ref(const char *refname, const struct object_id *oid,
454 int flag, void *cb_data)
456 /* we want to allow pattern hold/<asterisk> to show all
457 * branches under refs/heads/hold/, and v0.99.9? to show
458 * refs/tags/v0.99.9a and friends.
460 const char *tail;
461 int slash = count_slashes(refname);
462 for (tail = refname; *tail && match_ref_slash < slash; )
463 if (*tail++ == '/')
464 slash--;
465 if (!*tail)
466 return 0;
467 if (wildmatch(match_ref_pattern, tail, 0))
468 return 0;
469 if (starts_with(refname, "refs/heads/"))
470 return append_head_ref(refname, oid, flag, cb_data);
471 if (starts_with(refname, "refs/tags/"))
472 return append_tag_ref(refname, oid, flag, cb_data);
473 return append_ref(refname, oid, 0);
476 static void snarf_refs(int head, int remotes)
478 if (head) {
479 int orig_cnt = ref_name_cnt;
481 for_each_ref(append_head_ref, NULL);
482 sort_ref_range(orig_cnt, ref_name_cnt);
484 if (remotes) {
485 int orig_cnt = ref_name_cnt;
487 for_each_ref(append_remote_ref, NULL);
488 sort_ref_range(orig_cnt, ref_name_cnt);
492 static int rev_is_head(const char *head, const char *name)
494 if (!head)
495 return 0;
496 skip_prefix(head, "refs/heads/", &head);
497 if (!skip_prefix(name, "refs/heads/", &name))
498 skip_prefix(name, "heads/", &name);
499 return !strcmp(head, name);
502 static int show_merge_base(struct commit_list *seen, int num_rev)
504 int all_mask = ((1u << (REV_SHIFT + num_rev)) - 1);
505 int all_revs = all_mask & ~((1u << REV_SHIFT) - 1);
506 int exit_status = 1;
508 while (seen) {
509 struct commit *commit = pop_commit(&seen);
510 int flags = commit->object.flags & all_mask;
511 if (!(flags & UNINTERESTING) &&
512 ((flags & all_revs) == all_revs)) {
513 puts(oid_to_hex(&commit->object.oid));
514 exit_status = 0;
515 commit->object.flags |= UNINTERESTING;
518 return exit_status;
521 static int show_independent(struct commit **rev,
522 int num_rev,
523 unsigned int *rev_mask)
525 int i;
527 for (i = 0; i < num_rev; i++) {
528 struct commit *commit = rev[i];
529 unsigned int flag = rev_mask[i];
531 if (commit->object.flags == flag)
532 puts(oid_to_hex(&commit->object.oid));
533 commit->object.flags |= UNINTERESTING;
535 return 0;
538 static void append_one_rev(const char *av)
540 struct object_id revkey;
541 if (!repo_get_oid(the_repository, av, &revkey)) {
542 append_ref(av, &revkey, 0);
543 return;
545 if (strpbrk(av, "*?[")) {
546 /* glob style match */
547 int saved_matches = ref_name_cnt;
549 match_ref_pattern = av;
550 match_ref_slash = count_slashes(av);
551 for_each_ref(append_matching_ref, NULL);
552 if (saved_matches == ref_name_cnt &&
553 ref_name_cnt < MAX_REVS)
554 error(_("no matching refs with %s"), av);
555 sort_ref_range(saved_matches, ref_name_cnt);
556 return;
558 die("bad sha1 reference %s", av);
561 static int git_show_branch_config(const char *var, const char *value, void *cb)
563 if (!strcmp(var, "showbranch.default")) {
564 if (!value)
565 return config_error_nonbool(var);
567 * default_arg is now passed to parse_options(), so we need to
568 * mimic the real argv a bit better.
570 if (!default_args.nr)
571 strvec_push(&default_args, "show-branch");
572 strvec_push(&default_args, value);
573 return 0;
576 if (!strcmp(var, "color.showbranch")) {
577 showbranch_use_color = git_config_colorbool(var, value);
578 return 0;
581 return git_color_default_config(var, value, cb);
584 static int omit_in_dense(struct commit *commit, struct commit **rev, int n)
586 /* If the commit is tip of the named branches, do not
587 * omit it.
588 * Otherwise, if it is a merge that is reachable from only one
589 * tip, it is not that interesting.
591 int i, flag, count;
592 for (i = 0; i < n; i++)
593 if (rev[i] == commit)
594 return 0;
595 flag = commit->object.flags;
596 for (i = count = 0; i < n; i++) {
597 if (flag & (1u << (i + REV_SHIFT)))
598 count++;
600 if (count == 1)
601 return 1;
602 return 0;
605 static int reflog = 0;
607 static int parse_reflog_param(const struct option *opt, const char *arg,
608 int unset)
610 char *ep;
611 const char **base = (const char **)opt->value;
612 BUG_ON_OPT_NEG(unset);
613 if (!arg)
614 arg = "";
615 reflog = strtoul(arg, &ep, 10);
616 if (*ep == ',')
617 *base = ep + 1;
618 else if (*ep)
619 return error("unrecognized reflog param '%s'", arg);
620 else
621 *base = NULL;
622 if (reflog <= 0)
623 reflog = DEFAULT_REFLOG;
624 return 0;
627 int cmd_show_branch(int ac, const char **av, const char *prefix)
629 struct commit *rev[MAX_REVS], *commit;
630 char *reflog_msg[MAX_REVS];
631 struct commit_list *list = NULL, *seen = NULL;
632 unsigned int rev_mask[MAX_REVS];
633 int num_rev, i, extra = 0;
634 int all_heads = 0, all_remotes = 0;
635 int all_mask, all_revs;
636 enum rev_sort_order sort_order = REV_SORT_IN_GRAPH_ORDER;
637 char *head;
638 struct object_id head_oid;
639 int merge_base = 0;
640 int independent = 0;
641 int no_name = 0;
642 int sha1_name = 0;
643 int shown_merge_point = 0;
644 int with_current_branch = 0;
645 int head_at = -1;
646 int topics = 0;
647 int dense = 1;
648 const char *reflog_base = NULL;
649 struct option builtin_show_branch_options[] = {
650 OPT_BOOL('a', "all", &all_heads,
651 N_("show remote-tracking and local branches")),
652 OPT_BOOL('r', "remotes", &all_remotes,
653 N_("show remote-tracking branches")),
654 OPT__COLOR(&showbranch_use_color,
655 N_("color '*!+-' corresponding to the branch")),
656 { OPTION_INTEGER, 0, "more", &extra, N_("n"),
657 N_("show <n> more commits after the common ancestor"),
658 PARSE_OPT_OPTARG, NULL, (intptr_t)1 },
659 OPT_SET_INT(0, "list", &extra, N_("synonym to more=-1"), -1),
660 OPT_BOOL(0, "no-name", &no_name, N_("suppress naming strings")),
661 OPT_BOOL(0, "current", &with_current_branch,
662 N_("include the current branch")),
663 OPT_BOOL(0, "sha1-name", &sha1_name,
664 N_("name commits with their object names")),
665 OPT_BOOL(0, "merge-base", &merge_base,
666 N_("show possible merge bases")),
667 OPT_BOOL(0, "independent", &independent,
668 N_("show refs unreachable from any other ref")),
669 OPT_SET_INT(0, "topo-order", &sort_order,
670 N_("show commits in topological order"),
671 REV_SORT_IN_GRAPH_ORDER),
672 OPT_BOOL(0, "topics", &topics,
673 N_("show only commits not on the first branch")),
674 OPT_SET_INT(0, "sparse", &dense,
675 N_("show merges reachable from only one tip"), 0),
676 OPT_SET_INT(0, "date-order", &sort_order,
677 N_("topologically sort, maintaining date order "
678 "where possible"),
679 REV_SORT_BY_COMMIT_DATE),
680 OPT_CALLBACK_F('g', "reflog", &reflog_base, N_("<n>[,<base>]"),
681 N_("show <n> most recent ref-log entries starting at "
682 "base"),
683 PARSE_OPT_OPTARG | PARSE_OPT_NONEG,
684 parse_reflog_param),
685 OPT_END()
688 init_commit_name_slab(&name_slab);
690 git_config(git_show_branch_config, NULL);
692 /* If nothing is specified, try the default first */
693 if (ac == 1 && default_args.nr) {
694 ac = default_args.nr;
695 av = default_args.v;
698 ac = parse_options(ac, av, prefix, builtin_show_branch_options,
699 show_branch_usage, PARSE_OPT_STOP_AT_NON_OPTION);
700 if (all_heads)
701 all_remotes = 1;
703 if (extra || reflog) {
704 /* "listing" mode is incompatible with
705 * independent nor merge-base modes.
707 if (independent || merge_base)
708 usage_with_options(show_branch_usage,
709 builtin_show_branch_options);
710 if (reflog && ((0 < extra) || all_heads || all_remotes))
712 * Asking for --more in reflog mode does not
713 * make sense. --list is Ok.
715 * Also --all and --remotes do not make sense either.
717 die(_("options '%s' and '%s' cannot be used together"), "--reflog",
718 "--all/--remotes/--independent/--merge-base");
721 if (with_current_branch && reflog)
722 die(_("options '%s' and '%s' cannot be used together"),
723 "--reflog", "--current");
725 /* If nothing is specified, show all branches by default */
726 if (ac <= topics && all_heads + all_remotes == 0)
727 all_heads = 1;
729 if (reflog) {
730 struct object_id oid;
731 char *ref;
732 int base = 0;
733 unsigned int flags = 0;
735 if (ac == 0) {
736 static const char *fake_av[2];
738 fake_av[0] = resolve_refdup("HEAD",
739 RESOLVE_REF_READING, &oid,
740 NULL);
741 fake_av[1] = NULL;
742 av = fake_av;
743 ac = 1;
744 if (!*av)
745 die(_("no branches given, and HEAD is not valid"));
747 if (ac != 1)
748 die(_("--reflog option needs one branch name"));
750 if (MAX_REVS < reflog)
751 die(Q_("only %d entry can be shown at one time.",
752 "only %d entries can be shown at one time.",
753 MAX_REVS), MAX_REVS);
754 if (!repo_dwim_ref(the_repository, *av, strlen(*av), &oid,
755 &ref, 0))
756 die(_("no such ref %s"), *av);
758 /* Has the base been specified? */
759 if (reflog_base) {
760 char *ep;
761 base = strtoul(reflog_base, &ep, 10);
762 if (*ep) {
763 /* Ah, that is a date spec... */
764 timestamp_t at;
765 at = approxidate(reflog_base);
766 read_ref_at(get_main_ref_store(the_repository),
767 ref, flags, at, -1, &oid, NULL,
768 NULL, NULL, &base);
772 for (i = 0; i < reflog; i++) {
773 char *logmsg;
774 char *nth_desc;
775 const char *msg;
776 char *end;
777 timestamp_t timestamp;
778 int tz;
780 if (read_ref_at(get_main_ref_store(the_repository),
781 ref, flags, 0, base + i, &oid, &logmsg,
782 &timestamp, &tz, NULL)) {
783 reflog = i;
784 break;
787 end = strchr(logmsg, '\n');
788 if (end)
789 *end = '\0';
791 msg = (*logmsg == '\0') ? "(none)" : logmsg;
792 reflog_msg[i] = xstrfmt("(%s) %s",
793 show_date(timestamp, tz,
794 DATE_MODE(RELATIVE)),
795 msg);
796 free(logmsg);
798 nth_desc = xstrfmt("%s@{%d}", *av, base+i);
799 append_ref(nth_desc, &oid, 1);
800 free(nth_desc);
802 free(ref);
804 else {
805 while (0 < ac) {
806 append_one_rev(*av);
807 ac--; av++;
809 if (all_heads + all_remotes)
810 snarf_refs(all_heads, all_remotes);
813 head = resolve_refdup("HEAD", RESOLVE_REF_READING,
814 &head_oid, NULL);
816 if (with_current_branch && head) {
817 int has_head = 0;
818 for (i = 0; !has_head && i < ref_name_cnt; i++) {
819 /* We are only interested in adding the branch
820 * HEAD points at.
822 if (rev_is_head(head, ref_name[i]))
823 has_head++;
825 if (!has_head) {
826 const char *name = head;
827 skip_prefix(name, "refs/heads/", &name);
828 append_one_rev(name);
832 if (!ref_name_cnt) {
833 fprintf(stderr, "No revs to be shown.\n");
834 exit(0);
837 for (num_rev = 0; ref_name[num_rev]; num_rev++) {
838 struct object_id revkey;
839 unsigned int flag = 1u << (num_rev + REV_SHIFT);
841 if (MAX_REVS <= num_rev)
842 die(Q_("cannot handle more than %d rev.",
843 "cannot handle more than %d revs.",
844 MAX_REVS), MAX_REVS);
845 if (repo_get_oid(the_repository, ref_name[num_rev], &revkey))
846 die(_("'%s' is not a valid ref."), ref_name[num_rev]);
847 commit = lookup_commit_reference(the_repository, &revkey);
848 if (!commit)
849 die(_("cannot find commit %s (%s)"),
850 ref_name[num_rev], oid_to_hex(&revkey));
851 repo_parse_commit(the_repository, commit);
852 mark_seen(commit, &seen);
854 /* rev#0 uses bit REV_SHIFT, rev#1 uses bit REV_SHIFT+1,
855 * and so on. REV_SHIFT bits from bit 0 are used for
856 * internal bookkeeping.
858 commit->object.flags |= flag;
859 if (commit->object.flags == flag)
860 commit_list_insert_by_date(commit, &list);
861 rev[num_rev] = commit;
863 for (i = 0; i < num_rev; i++)
864 rev_mask[i] = rev[i]->object.flags;
866 if (0 <= extra)
867 join_revs(&list, &seen, num_rev, extra);
869 commit_list_sort_by_date(&seen);
871 if (merge_base)
872 return show_merge_base(seen, num_rev);
874 if (independent)
875 return show_independent(rev, num_rev, rev_mask);
877 /* Show list; --more=-1 means list-only */
878 if (1 < num_rev || extra < 0) {
879 for (i = 0; i < num_rev; i++) {
880 int j;
881 int is_head = rev_is_head(head, ref_name[i]) &&
882 oideq(&head_oid, &rev[i]->object.oid);
883 if (extra < 0)
884 printf("%c [%s] ",
885 is_head ? '*' : ' ', ref_name[i]);
886 else {
887 for (j = 0; j < i; j++)
888 putchar(' ');
889 printf("%s%c%s [%s] ",
890 get_color_code(i),
891 is_head ? '*' : '!',
892 get_color_reset_code(), ref_name[i]);
895 if (!reflog) {
896 /* header lines never need name */
897 show_one_commit(rev[i], 1);
899 else
900 puts(reflog_msg[i]);
902 if (is_head)
903 head_at = i;
905 if (0 <= extra) {
906 for (i = 0; i < num_rev; i++)
907 putchar('-');
908 putchar('\n');
911 if (extra < 0)
912 exit(0);
914 /* Sort topologically */
915 sort_in_topological_order(&seen, sort_order);
917 /* Give names to commits */
918 if (!sha1_name && !no_name)
919 name_commits(seen, rev, ref_name, num_rev);
921 all_mask = ((1u << (REV_SHIFT + num_rev)) - 1);
922 all_revs = all_mask & ~((1u << REV_SHIFT) - 1);
924 while (seen) {
925 struct commit *commit = pop_commit(&seen);
926 int this_flag = commit->object.flags;
927 int is_merge_point = ((this_flag & all_revs) == all_revs);
929 shown_merge_point |= is_merge_point;
931 if (1 < num_rev) {
932 int is_merge = !!(commit->parents &&
933 commit->parents->next);
934 if (topics &&
935 !is_merge_point &&
936 (this_flag & (1u << REV_SHIFT)))
937 continue;
938 if (dense && is_merge &&
939 omit_in_dense(commit, rev, num_rev))
940 continue;
941 for (i = 0; i < num_rev; i++) {
942 int mark;
943 if (!(this_flag & (1u << (i + REV_SHIFT))))
944 mark = ' ';
945 else if (is_merge)
946 mark = '-';
947 else if (i == head_at)
948 mark = '*';
949 else
950 mark = '+';
951 if (mark == ' ')
952 putchar(mark);
953 else
954 printf("%s%c%s",
955 get_color_code(i),
956 mark, get_color_reset_code());
958 putchar(' ');
960 show_one_commit(commit, no_name);
962 if (shown_merge_point && --extra < 0)
963 break;
965 free(head);
966 return 0;