6 static const char show_branch_usage
[] =
7 "git-show-branch [--sparse] [--current] [--all] [--remotes] [--topo-order] [--more=count | --list | --independent | --merge-base ] [--topics] [<refs>...] | --reflog[=n[,b]] <branch>";
8 static const char show_branch_usage_reflog
[] =
9 "--reflog is incompatible with --all, --remotes, --independent or --merge-base";
11 static int default_num
;
12 static int default_alloc
;
13 static const char **default_arg
;
15 #define UNINTERESTING 01
18 #define MAX_REVS (FLAG_BITS - REV_SHIFT) /* should not exceed bits_per_int - REV_SHIFT */
20 #define DEFAULT_REFLOG 4
22 static struct commit
*interesting(struct commit_list
*list
)
25 struct commit
*commit
= list
->item
;
27 if (commit
->object
.flags
& UNINTERESTING
)
34 static struct commit
*pop_one_commit(struct commit_list
**list_p
)
36 struct commit
*commit
;
37 struct commit_list
*list
;
46 const char *head_name
; /* which head's ancestor? */
47 int generation
; /* how many parents away from head_name */
50 /* Name the commit as nth generation ancestor of head_name;
51 * we count only the first-parent relationship for naming purposes.
53 static void name_commit(struct commit
*commit
, const char *head_name
, int nth
)
55 struct commit_name
*name
;
57 commit
->util
= xmalloc(sizeof(struct commit_name
));
59 name
->head_name
= head_name
;
60 name
->generation
= nth
;
63 /* Parent is the first parent of the commit. We may name it
64 * as (n+1)th generation ancestor of the same head_name as
65 * commit is nth generation ancestor of, if that generation
66 * number is better than the name it already has.
68 static void name_parent(struct commit
*commit
, struct commit
*parent
)
70 struct commit_name
*commit_name
= commit
->util
;
71 struct commit_name
*parent_name
= parent
->util
;
75 commit_name
->generation
+ 1 < parent_name
->generation
)
76 name_commit(parent
, commit_name
->head_name
,
77 commit_name
->generation
+ 1);
80 static int name_first_parent_chain(struct commit
*c
)
101 static void name_commits(struct commit_list
*list
,
106 struct commit_list
*cl
;
110 /* First give names to the given heads */
111 for (cl
= list
; cl
; cl
= cl
->next
) {
115 for (i
= 0; i
< num_rev
; i
++) {
117 name_commit(c
, ref_name
[i
], 0);
123 /* Then commits on the first parent ancestry chain */
126 for (cl
= list
; cl
; cl
= cl
->next
) {
127 i
+= name_first_parent_chain(cl
->item
);
131 /* Finally, any unnamed commits */
134 for (cl
= list
; cl
; cl
= cl
->next
) {
135 struct commit_list
*parents
;
136 struct commit_name
*n
;
142 parents
= c
->parents
;
145 struct commit
*p
= parents
->item
;
146 char newname
[1000], *en
;
147 parents
= parents
->next
;
152 switch (n
->generation
) {
154 en
+= sprintf(en
, "%s", n
->head_name
);
157 en
+= sprintf(en
, "%s^", n
->head_name
);
160 en
+= sprintf(en
, "%s~%d",
161 n
->head_name
, n
->generation
);
165 en
+= sprintf(en
, "^");
167 en
+= sprintf(en
, "^%d", nth
);
168 name_commit(p
, xstrdup(newname
), 0);
170 name_first_parent_chain(p
);
176 static int mark_seen(struct commit
*commit
, struct commit_list
**seen_p
)
178 if (!commit
->object
.flags
) {
179 commit_list_insert(commit
, seen_p
);
185 static void join_revs(struct commit_list
**list_p
,
186 struct commit_list
**seen_p
,
187 int num_rev
, int extra
)
189 int all_mask
= ((1u << (REV_SHIFT
+ num_rev
)) - 1);
190 int all_revs
= all_mask
& ~((1u << REV_SHIFT
) - 1);
193 struct commit_list
*parents
;
194 int still_interesting
= !!interesting(*list_p
);
195 struct commit
*commit
= pop_one_commit(list_p
);
196 int flags
= commit
->object
.flags
& all_mask
;
198 if (!still_interesting
&& extra
<= 0)
201 mark_seen(commit
, seen_p
);
202 if ((flags
& all_revs
) == all_revs
)
203 flags
|= UNINTERESTING
;
204 parents
= commit
->parents
;
207 struct commit
*p
= parents
->item
;
208 int this_flag
= p
->object
.flags
;
209 parents
= parents
->next
;
210 if ((this_flag
& flags
) == flags
)
212 if (!p
->object
.parsed
)
214 if (mark_seen(p
, seen_p
) && !still_interesting
)
216 p
->object
.flags
|= flags
;
217 insert_by_date(p
, list_p
);
222 * Postprocess to complete well-poisoning.
224 * At this point we have all the commits we have seen in
225 * seen_p list. Mark anything that can be reached from
226 * uninteresting commits not interesting.
230 struct commit_list
*s
;
231 for (s
= *seen_p
; s
; s
= s
->next
) {
232 struct commit
*c
= s
->item
;
233 struct commit_list
*parents
;
235 if (((c
->object
.flags
& all_revs
) != all_revs
) &&
236 !(c
->object
.flags
& UNINTERESTING
))
239 /* The current commit is either a merge base or
240 * already uninteresting one. Mark its parents
241 * as uninteresting commits _only_ if they are
242 * already parsed. No reason to find new ones
245 parents
= c
->parents
;
247 struct commit
*p
= parents
->item
;
248 parents
= parents
->next
;
249 if (!(p
->object
.flags
& UNINTERESTING
)) {
250 p
->object
.flags
|= UNINTERESTING
;
260 static void show_one_commit(struct commit
*commit
, int no_name
)
262 struct strbuf pretty
;
263 const char *pretty_str
= "(unavailable)";
264 struct commit_name
*name
= commit
->util
;
266 strbuf_init(&pretty
, 0);
267 if (commit
->object
.parsed
) {
268 pretty_print_commit(CMIT_FMT_ONELINE
, commit
,
269 &pretty
, 0, NULL
, NULL
, 0);
270 pretty_str
= pretty
.buf
;
272 if (!prefixcmp(pretty_str
, "[PATCH] "))
276 if (name
&& name
->head_name
) {
277 printf("[%s", name
->head_name
);
278 if (name
->generation
) {
279 if (name
->generation
== 1)
282 printf("~%d", name
->generation
);
288 find_unique_abbrev(commit
->object
.sha1
, 7));
291 strbuf_release(&pretty
);
294 static char *ref_name
[MAX_REVS
+ 1];
295 static int ref_name_cnt
;
297 static const char *find_digit_prefix(const char *s
, int *v
)
304 '0' <= (ch
= *p
) && ch
<= '9';
306 ver
= ver
* 10 + ch
- '0';
312 static int version_cmp(const char *a
, const char *b
)
317 a
= find_digit_prefix(a
, &va
);
318 b
= find_digit_prefix(b
, &vb
);
325 if ('0' <= ca
&& ca
<= '9')
327 if ('0' <= cb
&& cb
<= '9')
341 static int compare_ref_name(const void *a_
, const void *b_
)
343 const char * const*a
= a_
, * const*b
= b_
;
344 return version_cmp(*a
, *b
);
347 static void sort_ref_range(int bottom
, int top
)
349 qsort(ref_name
+ bottom
, top
- bottom
, sizeof(ref_name
[0]),
353 static int append_ref(const char *refname
, const unsigned char *sha1
,
356 struct commit
*commit
= lookup_commit_reference_gently(sha1
, 1);
363 /* Avoid adding the same thing twice */
364 for (i
= 0; i
< ref_name_cnt
; i
++)
365 if (!strcmp(refname
, ref_name
[i
]))
368 if (MAX_REVS
<= ref_name_cnt
) {
369 fprintf(stderr
, "warning: ignoring %s; "
370 "cannot handle more than %d refs\n",
374 ref_name
[ref_name_cnt
++] = xstrdup(refname
);
375 ref_name
[ref_name_cnt
] = NULL
;
379 static int append_head_ref(const char *refname
, const unsigned char *sha1
, int flag
, void *cb_data
)
381 unsigned char tmp
[20];
383 if (prefixcmp(refname
, "refs/heads/"))
385 /* If both heads/foo and tags/foo exists, get_sha1 would
388 if (get_sha1(refname
+ ofs
, tmp
) || hashcmp(tmp
, sha1
))
390 return append_ref(refname
+ ofs
, sha1
, 0);
393 static int append_remote_ref(const char *refname
, const unsigned char *sha1
, int flag
, void *cb_data
)
395 unsigned char tmp
[20];
397 if (prefixcmp(refname
, "refs/remotes/"))
399 /* If both heads/foo and tags/foo exists, get_sha1 would
402 if (get_sha1(refname
+ ofs
, tmp
) || hashcmp(tmp
, sha1
))
404 return append_ref(refname
+ ofs
, sha1
, 0);
407 static int append_tag_ref(const char *refname
, const unsigned char *sha1
, int flag
, void *cb_data
)
409 if (prefixcmp(refname
, "refs/tags/"))
411 return append_ref(refname
+ 5, sha1
, 0);
414 static const char *match_ref_pattern
= NULL
;
415 static int match_ref_slash
= 0;
416 static int count_slash(const char *s
)
425 static int append_matching_ref(const char *refname
, const unsigned char *sha1
, int flag
, void *cb_data
)
427 /* we want to allow pattern hold/<asterisk> to show all
428 * branches under refs/heads/hold/, and v0.99.9? to show
429 * refs/tags/v0.99.9a and friends.
432 int slash
= count_slash(refname
);
433 for (tail
= refname
; *tail
&& match_ref_slash
< slash
; )
438 if (fnmatch(match_ref_pattern
, tail
, 0))
440 if (!prefixcmp(refname
, "refs/heads/"))
441 return append_head_ref(refname
, sha1
, flag
, cb_data
);
442 if (!prefixcmp(refname
, "refs/tags/"))
443 return append_tag_ref(refname
, sha1
, flag
, cb_data
);
444 return append_ref(refname
, sha1
, 0);
447 static void snarf_refs(int head
, int remotes
)
450 int orig_cnt
= ref_name_cnt
;
451 for_each_ref(append_head_ref
, NULL
);
452 sort_ref_range(orig_cnt
, ref_name_cnt
);
455 int orig_cnt
= ref_name_cnt
;
456 for_each_ref(append_remote_ref
, NULL
);
457 sort_ref_range(orig_cnt
, ref_name_cnt
);
461 static int rev_is_head(char *head
, int headlen
, char *name
,
462 unsigned char *head_sha1
, unsigned char *sha1
)
465 (head_sha1
&& sha1
&& hashcmp(head_sha1
, sha1
)))
467 if (!prefixcmp(head
, "refs/heads/"))
469 if (!prefixcmp(name
, "refs/heads/"))
471 else if (!prefixcmp(name
, "heads/"))
473 return !strcmp(head
, name
);
476 static int show_merge_base(struct commit_list
*seen
, int num_rev
)
478 int all_mask
= ((1u << (REV_SHIFT
+ num_rev
)) - 1);
479 int all_revs
= all_mask
& ~((1u << REV_SHIFT
) - 1);
483 struct commit
*commit
= pop_one_commit(&seen
);
484 int flags
= commit
->object
.flags
& all_mask
;
485 if (!(flags
& UNINTERESTING
) &&
486 ((flags
& all_revs
) == all_revs
)) {
487 puts(sha1_to_hex(commit
->object
.sha1
));
489 commit
->object
.flags
|= UNINTERESTING
;
495 static int show_independent(struct commit
**rev
,
498 unsigned int *rev_mask
)
502 for (i
= 0; i
< num_rev
; i
++) {
503 struct commit
*commit
= rev
[i
];
504 unsigned int flag
= rev_mask
[i
];
506 if (commit
->object
.flags
== flag
)
507 puts(sha1_to_hex(commit
->object
.sha1
));
508 commit
->object
.flags
|= UNINTERESTING
;
513 static void append_one_rev(const char *av
)
515 unsigned char revkey
[20];
516 if (!get_sha1(av
, revkey
)) {
517 append_ref(av
, revkey
, 0);
520 if (strchr(av
, '*') || strchr(av
, '?') || strchr(av
, '[')) {
521 /* glob style match */
522 int saved_matches
= ref_name_cnt
;
523 match_ref_pattern
= av
;
524 match_ref_slash
= count_slash(av
);
525 for_each_ref(append_matching_ref
, NULL
);
526 if (saved_matches
== ref_name_cnt
&&
527 ref_name_cnt
< MAX_REVS
)
528 error("no matching refs with %s", av
);
529 if (saved_matches
+ 1 < ref_name_cnt
)
530 sort_ref_range(saved_matches
, ref_name_cnt
);
533 die("bad sha1 reference %s", av
);
536 static int git_show_branch_config(const char *var
, const char *value
)
538 if (!strcmp(var
, "showbranch.default")) {
539 if (default_alloc
<= default_num
+ 1) {
540 default_alloc
= default_alloc
* 3 / 2 + 20;
541 default_arg
= xrealloc(default_arg
, sizeof *default_arg
* default_alloc
);
543 default_arg
[default_num
++] = xstrdup(value
);
544 default_arg
[default_num
] = NULL
;
548 return git_default_config(var
, value
);
551 static int omit_in_dense(struct commit
*commit
, struct commit
**rev
, int n
)
553 /* If the commit is tip of the named branches, do not
555 * Otherwise, if it is a merge that is reachable from only one
556 * tip, it is not that interesting.
559 for (i
= 0; i
< n
; i
++)
560 if (rev
[i
] == commit
)
562 flag
= commit
->object
.flags
;
563 for (i
= count
= 0; i
< n
; i
++) {
564 if (flag
& (1u << (i
+ REV_SHIFT
)))
572 static void parse_reflog_param(const char *arg
, int *cnt
, const char **base
)
575 *cnt
= strtoul(arg
, &ep
, 10);
579 die("unrecognized reflog param '%s'", arg
+ 9);
583 *cnt
= DEFAULT_REFLOG
;
586 int cmd_show_branch(int ac
, const char **av
, const char *prefix
)
588 struct commit
*rev
[MAX_REVS
], *commit
;
589 char *reflog_msg
[MAX_REVS
];
590 struct commit_list
*list
= NULL
, *seen
= NULL
;
591 unsigned int rev_mask
[MAX_REVS
];
592 int num_rev
, i
, extra
= 0;
593 int all_heads
= 0, all_remotes
= 0;
594 int all_mask
, all_revs
;
599 unsigned char head_sha1
[20];
604 int shown_merge_point
= 0;
605 int with_current_branch
= 0;
610 const char *reflog_base
= NULL
;
612 git_config(git_show_branch_config
);
614 /* If nothing is specified, try the default first */
615 if (ac
== 1 && default_num
) {
616 ac
= default_num
+ 1;
617 av
= default_arg
- 1; /* ick; we would not address av[0] */
620 while (1 < ac
&& av
[1][0] == '-') {
621 const char *arg
= av
[1];
622 if (!strcmp(arg
, "--")) {
626 else if (!strcmp(arg
, "--all") || !strcmp(arg
, "-a"))
627 all_heads
= all_remotes
= 1;
628 else if (!strcmp(arg
, "--remotes") || !strcmp(arg
, "-r"))
630 else if (!strcmp(arg
, "--more"))
632 else if (!strcmp(arg
, "--list"))
634 else if (!strcmp(arg
, "--no-name"))
636 else if (!strcmp(arg
, "--current"))
637 with_current_branch
= 1;
638 else if (!strcmp(arg
, "--sha1-name"))
640 else if (!prefixcmp(arg
, "--more="))
641 extra
= atoi(arg
+ 7);
642 else if (!strcmp(arg
, "--merge-base"))
644 else if (!strcmp(arg
, "--independent"))
646 else if (!strcmp(arg
, "--topo-order"))
648 else if (!strcmp(arg
, "--topics"))
650 else if (!strcmp(arg
, "--sparse"))
652 else if (!strcmp(arg
, "--date-order"))
654 else if (!strcmp(arg
, "--reflog") || !strcmp(arg
, "-g")) {
655 reflog
= DEFAULT_REFLOG
;
657 else if (!prefixcmp(arg
, "--reflog="))
658 parse_reflog_param(arg
+ 9, &reflog
, &reflog_base
);
659 else if (!prefixcmp(arg
, "-g="))
660 parse_reflog_param(arg
+ 3, &reflog
, &reflog_base
);
662 usage(show_branch_usage
);
667 if (extra
|| reflog
) {
668 /* "listing" mode is incompatible with
669 * independent nor merge-base modes.
671 if (independent
|| merge_base
)
672 usage(show_branch_usage
);
673 if (reflog
&& ((0 < extra
) || all_heads
|| all_remotes
))
675 * Asking for --more in reflog mode does not
676 * make sense. --list is Ok.
678 * Also --all and --remotes do not make sense either.
680 usage(show_branch_usage_reflog
);
683 /* If nothing is specified, show all branches by default */
684 if (ac
+ all_heads
+ all_remotes
== 0)
688 unsigned char sha1
[20];
694 static const char *fake_av
[2];
697 refname
= resolve_ref("HEAD", sha1
, 1, NULL
);
698 fake_av
[0] = xstrdup(refname
);
704 die("--reflog option needs one branch name");
706 if (MAX_REVS
< reflog
)
707 die("Only %d entries can be shown at one time.",
709 if (!dwim_ref(*av
, strlen(*av
), sha1
, &ref
))
710 die("No such ref %s", *av
);
712 /* Has the base been specified? */
715 base
= strtoul(reflog_base
, &ep
, 10);
717 /* Ah, that is a date spec... */
719 at
= approxidate(reflog_base
);
720 read_ref_at(ref
, at
, -1, sha1
, NULL
,
725 for (i
= 0; i
< reflog
; i
++) {
728 unsigned long timestamp
;
731 if (read_ref_at(ref
, 0, base
+i
, sha1
, &logmsg
,
732 ×tamp
, &tz
, NULL
)) {
736 msg
= strchr(logmsg
, '\t');
741 m
= xmalloc(strlen(msg
) + 200);
742 sprintf(m
, "(%s) %s",
743 show_date(timestamp
, tz
, 1),
747 sprintf(nth_desc
, "%s@{%d}", *av
, base
+i
);
748 append_ref(nth_desc
, sha1
, 1);
751 else if (all_heads
+ all_remotes
)
752 snarf_refs(all_heads
, all_remotes
);
760 head_p
= resolve_ref("HEAD", head_sha1
, 1, NULL
);
762 head_len
= strlen(head_p
);
763 memcpy(head
, head_p
, head_len
+ 1);
770 if (with_current_branch
&& head_p
) {
772 for (i
= 0; !has_head
&& i
< ref_name_cnt
; i
++) {
773 /* We are only interested in adding the branch
776 if (rev_is_head(head
,
783 int pfxlen
= strlen("refs/heads/");
784 append_one_rev(head
+ pfxlen
);
789 fprintf(stderr
, "No revs to be shown.\n");
793 for (num_rev
= 0; ref_name
[num_rev
]; num_rev
++) {
794 unsigned char revkey
[20];
795 unsigned int flag
= 1u << (num_rev
+ REV_SHIFT
);
797 if (MAX_REVS
<= num_rev
)
798 die("cannot handle more than %d revs.", MAX_REVS
);
799 if (get_sha1(ref_name
[num_rev
], revkey
))
800 die("'%s' is not a valid ref.", ref_name
[num_rev
]);
801 commit
= lookup_commit_reference(revkey
);
803 die("cannot find commit %s (%s)",
804 ref_name
[num_rev
], revkey
);
805 parse_commit(commit
);
806 mark_seen(commit
, &seen
);
808 /* rev#0 uses bit REV_SHIFT, rev#1 uses bit REV_SHIFT+1,
809 * and so on. REV_SHIFT bits from bit 0 are used for
810 * internal bookkeeping.
812 commit
->object
.flags
|= flag
;
813 if (commit
->object
.flags
== flag
)
814 insert_by_date(commit
, &list
);
815 rev
[num_rev
] = commit
;
817 for (i
= 0; i
< num_rev
; i
++)
818 rev_mask
[i
] = rev
[i
]->object
.flags
;
821 join_revs(&list
, &seen
, num_rev
, extra
);
826 return show_merge_base(seen
, num_rev
);
829 return show_independent(rev
, num_rev
, ref_name
, rev_mask
);
831 /* Show list; --more=-1 means list-only */
832 if (1 < num_rev
|| extra
< 0) {
833 for (i
= 0; i
< num_rev
; i
++) {
835 int is_head
= rev_is_head(head
,
839 rev
[i
]->object
.sha1
);
842 is_head
? '*' : ' ', ref_name
[i
]);
844 for (j
= 0; j
< i
; j
++)
847 is_head
? '*' : '!', ref_name
[i
]);
851 /* header lines never need name */
852 show_one_commit(rev
[i
], 1);
861 for (i
= 0; i
< num_rev
; i
++)
869 /* Sort topologically */
870 sort_in_topological_order(&seen
, lifo
);
872 /* Give names to commits */
873 if (!sha1_name
&& !no_name
)
874 name_commits(seen
, rev
, ref_name
, num_rev
);
876 all_mask
= ((1u << (REV_SHIFT
+ num_rev
)) - 1);
877 all_revs
= all_mask
& ~((1u << REV_SHIFT
) - 1);
880 struct commit
*commit
= pop_one_commit(&seen
);
881 int this_flag
= commit
->object
.flags
;
882 int is_merge_point
= ((this_flag
& all_revs
) == all_revs
);
884 shown_merge_point
|= is_merge_point
;
887 int is_merge
= !!(commit
->parents
&&
888 commit
->parents
->next
);
891 (this_flag
& (1u << REV_SHIFT
)))
893 if (dense
&& is_merge
&&
894 omit_in_dense(commit
, rev
, num_rev
))
896 for (i
= 0; i
< num_rev
; i
++) {
898 if (!(this_flag
& (1u << (i
+ REV_SHIFT
))))
902 else if (i
== head_at
)
910 show_one_commit(commit
, no_name
);
912 if (shown_merge_point
&& --extra
< 0)