[thirdparty/git.git] / builtin-describe.c

#include "cache.h"
#include "commit.h"
#include "tag.h"
#include "refs.h"
#include "builtin.h"
#include "exec_cmd.h"
#include "parse-options.h"

#define SEEN		(1u<<0)
#define MAX_TAGS	(FLAG_BITS - 1)

static const char * const describe_usage[] = {
	"git describe [options] <committish>*",
	NULL
};

static int debug;	/* Display lots of verbose info */
static int all;	/* Any valid ref can be used */
static int tags;	/* Allow lightweight tags */
static int longformat;
static int abbrev = DEFAULT_ABBREV;
static int max_candidates = 10;
static int found_names;
static const char *pattern;
static int always;

struct commit_name {
	struct tag *tag;
	int prio; /* annotated tag = 2, tag = 1, head = 0 */
	unsigned char sha1[20];
	char path[FLEX_ARRAY]; /* more */
};
static const char *prio_names[] = {
	"head", "lightweight", "annotated",
};

static void add_to_known_names(const char *path,
			       struct commit *commit,
			       int prio,
			       const unsigned char *sha1)
{
	struct commit_name *e = commit->util;
	if (!e || e->prio < prio) {
		size_t len = strlen(path)+1;
		free(e);
		e = xmalloc(sizeof(struct commit_name) + len);
		e->tag = NULL;
		e->prio = prio;
		hashcpy(e->sha1, sha1);
		memcpy(e->path, path, len);
		commit->util = e;
	}
	found_names = 1;
}

static int get_name(const char *path, const unsigned char *sha1, int flag, void *cb_data)
{
	int might_be_tag = !prefixcmp(path, "refs/tags/");
	struct commit *commit;
	struct object *object;
	unsigned char peeled[20];
	int is_tag, prio;

	if (!all && !might_be_tag)
		return 0;

	if (!peel_ref(path, peeled) && !is_null_sha1(peeled)) {
		commit = lookup_commit_reference_gently(peeled, 1);
		if (!commit)
			return 0;
		is_tag = !!hashcmp(sha1, commit->object.sha1);
	} else {
		commit = lookup_commit_reference_gently(sha1, 1);
		object = parse_object(sha1);
		if (!commit || !object)
			return 0;
		is_tag = object->type == OBJ_TAG;
	}

	/* If --all, then any refs are used.
	 * If --tags, then any tags are used.
	 * Otherwise only annotated tags are used.
	 */
	if (might_be_tag) {
		if (is_tag)
			prio = 2;
		else
			prio = 1;

		if (pattern && fnmatch(pattern, path + 10, 0))
			prio = 0;
	}
	else
		prio = 0;

	if (!all) {
		if (!prio)
			return 0;
		if (!tags && prio < 2)
			return 0;
	}
	add_to_known_names(all ? path + 5 : path + 10, commit, prio, sha1);
	return 0;
}

struct possible_tag {
	struct commit_name *name;
	int depth;
	int found_order;
	unsigned flag_within;
};

static int compare_pt(const void *a_, const void *b_)
{
	struct possible_tag *a = (struct possible_tag *)a_;
	struct possible_tag *b = (struct possible_tag *)b_;
	if (a->depth != b->depth)
		return a->depth - b->depth;
	if (a->found_order != b->found_order)
		return a->found_order - b->found_order;
	return 0;
}

static unsigned long finish_depth_computation(
	struct commit_list **list,
	struct possible_tag *best)
{
	unsigned long seen_commits = 0;
	while (*list) {
		struct commit *c = pop_commit(list);
		struct commit_list *parents = c->parents;
		seen_commits++;
		if (c->object.flags & best->flag_within) {
			struct commit_list *a = *list;
			while (a) {
				struct commit *i = a->item;
				if (!(i->object.flags & best->flag_within))
					break;
				a = a->next;
			}
			if (!a)
				break;
		} else
			best->depth++;
		while (parents) {
			struct commit *p = parents->item;
			parse_commit(p);
			if (!(p->object.flags & SEEN))
				insert_by_date(p, list);
			p->object.flags |= c->object.flags;
			parents = parents->next;
		}
	}
	return seen_commits;
}

static void display_name(struct commit_name *n)
{
	if (n->prio == 2 && !n->tag) {
		n->tag = lookup_tag(n->sha1);
		if (!n->tag || parse_tag(n->tag) || !n->tag->tag)
			die("annotated tag %s not available", n->path);
		if (strcmp(n->tag->tag, all ? n->path + 5 : n->path))
			warning("tag '%s' is really '%s' here", n->tag->tag, n->path);
	}

	if (n->tag)
		printf("%s", n->tag->tag);
	else
		printf("%s", n->path);
}

static void show_suffix(int depth, const unsigned char *sha1)
{
	printf("-%d-g%s", depth, find_unique_abbrev(sha1, abbrev));
}

static void describe(const char *arg, int last_one)
{
	unsigned char sha1[20];
	struct commit *cmit, *gave_up_on = NULL;
	struct commit_list *list;
	struct commit_name *n;
	struct possible_tag all_matches[MAX_TAGS];
	unsigned int match_cnt = 0, annotated_cnt = 0, cur_match;
	unsigned long seen_commits = 0;

	if (get_sha1(arg, sha1))
		die("Not a valid object name %s", arg);
	cmit = lookup_commit_reference(sha1);
	if (!cmit)
		die("%s is not a valid '%s' object", arg, commit_type);

	n = cmit->util;
	if (n) {
		/*
		 * Exact match to an existing ref.
		 */
		display_name(n);
		if (longformat)
			show_suffix(0, n->tag ? n->tag->tagged->sha1 : sha1);
		printf("\n");
		return;
	}

	if (!max_candidates)
		die("no tag exactly matches '%s'", sha1_to_hex(cmit->object.sha1));
	if (debug)
		fprintf(stderr, "searching to describe %s\n", arg);

	list = NULL;
	cmit->object.flags = SEEN;
	commit_list_insert(cmit, &list);
	while (list) {
		struct commit *c = pop_commit(&list);
		struct commit_list *parents = c->parents;
		seen_commits++;
		n = c->util;
		if (n) {
			if (match_cnt < max_candidates) {
				struct possible_tag *t = &all_matches[match_cnt++];
				t->name = n;
				t->depth = seen_commits - 1;
				t->flag_within = 1u << match_cnt;
				t->found_order = match_cnt;
				c->object.flags |= t->flag_within;
				if (n->prio == 2)
					annotated_cnt++;
			}
			else {
				gave_up_on = c;
				break;
			}
		}
		for (cur_match = 0; cur_match < match_cnt; cur_match++) {
			struct possible_tag *t = &all_matches[cur_match];
			if (!(c->object.flags & t->flag_within))
				t->depth++;
		}
		if (annotated_cnt && !list) {
			if (debug)
				fprintf(stderr, "finished search at %s\n",
					sha1_to_hex(c->object.sha1));
			break;
		}
		while (parents) {
			struct commit *p = parents->item;
			parse_commit(p);
			if (!(p->object.flags & SEEN))
				insert_by_date(p, &list);
			p->object.flags |= c->object.flags;
			parents = parents->next;
		}
	}

	if (!match_cnt) {
		const unsigned char *sha1 = cmit->object.sha1;
		if (always) {
			printf("%s\n", find_unique_abbrev(sha1, abbrev));
			return;
		}
		die("cannot describe '%s'", sha1_to_hex(sha1));
	}

	qsort(all_matches, match_cnt, sizeof(all_matches[0]), compare_pt);

	if (gave_up_on) {
		insert_by_date(gave_up_on, &list);
		seen_commits--;
	}
	seen_commits += finish_depth_computation(&list, &all_matches[0]);
	free_commit_list(list);

	if (debug) {
		for (cur_match = 0; cur_match < match_cnt; cur_match++) {
			struct possible_tag *t = &all_matches[cur_match];
			fprintf(stderr, " %-11s %8d %s\n",
				prio_names[t->name->prio],
				t->depth, t->name->path);
		}
		fprintf(stderr, "traversed %lu commits\n", seen_commits);
		if (gave_up_on) {
			fprintf(stderr,
				"more than %i tags found; listed %i most recent\n"
				"gave up search at %s\n",
				max_candidates, max_candidates,
				sha1_to_hex(gave_up_on->object.sha1));
		}
	}

	display_name(all_matches[0].name);
	if (abbrev)
		show_suffix(all_matches[0].depth, cmit->object.sha1);
	printf("\n");

	if (!last_one)
		clear_commit_marks(cmit, -1);
}

int cmd_describe(int argc, const char **argv, const char *prefix)
{
	int contains = 0;
	struct option options[] = {
		OPT_BOOLEAN(0, "contains",   &contains, "find the tag that comes after the commit"),
		OPT_BOOLEAN(0, "debug",      &debug, "debug search strategy on stderr"),
		OPT_BOOLEAN(0, "all",        &all, "use any ref in .git/refs"),
		OPT_BOOLEAN(0, "tags",       &tags, "use any tag in .git/refs/tags"),
		OPT_BOOLEAN(0, "long",       &longformat, "always use long format"),
		OPT__ABBREV(&abbrev),
		OPT_SET_INT(0, "exact-match", &max_candidates,
			    "only output exact matches", 0),
		OPT_INTEGER(0, "candidates", &max_candidates,
			    "consider <n> most recent tags (default: 10)"),
		OPT_STRING(0, "match",       &pattern, "pattern",
			   "only consider tags matching <pattern>"),
		OPT_BOOLEAN(0, "always",     &always,
			   "show abbreviated commit object as fallback"),
		OPT_END(),
	};

	argc = parse_options(argc, argv, prefix, options, describe_usage, 0);
	if (max_candidates < 0)
		max_candidates = 0;
	else if (max_candidates > MAX_TAGS)
		max_candidates = MAX_TAGS;

	save_commit_buffer = 0;

	if (longformat && abbrev == 0)
		die("--long is incompatible with --abbrev=0");

	if (contains) {
		const char **args = xmalloc((7 + argc) * sizeof(char *));
		int i = 0;
		args[i++] = "name-rev";
		args[i++] = "--name-only";
		args[i++] = "--no-undefined";
		if (always)
			args[i++] = "--always";
		if (!all) {
			args[i++] = "--tags";
			if (pattern) {
				char *s = xmalloc(strlen("--refs=refs/tags/") + strlen(pattern) + 1);
				sprintf(s, "--refs=refs/tags/%s", pattern);
				args[i++] = s;
			}
		}
		memcpy(args + i, argv, argc * sizeof(char *));
		args[i + argc] = NULL;
		return cmd_name_rev(i + argc, args, prefix);
	}

	for_each_ref(get_name, NULL);
	if (!found_names)
		die("No names found, cannot describe anything.");

	if (argc == 0) {
		describe("HEAD", 1);
	} else {
		while (argc-- > 0) {
			describe(*argv++, argc == 0);
		}
	}
	return 0;
}
Commit	Line	Data
908e5310 LT	1	#include "cache.h"
908e5310 LT	2	#include "commit.h"
635d4134	3	#include "tag.h"
908e5310	4	#include "refs.h"
9a0eaf83	5	#include "builtin.h"
23615708	6	#include "exec_cmd.h"
166185be	7	#include "parse-options.h"
908e5310	8
8713ab30 SP	9	#define SEEN (1u<<0)
	10	#define MAX_TAGS (FLAG_BITS - 1)
	11
166185be	12	static const char * const describe_usage[] = {
1b1dd23f	13	"git describe [options] <committish>*",
166185be PH	14	NULL
166185be PH	15	};
908e5310	16
8713ab30	17	static int debug; /* Display lots of verbose info */
7e425c4f SP	18	static int all; /* Any valid ref can be used */
7e425c4f SP	19	static int tags; /* Allow lightweight tags */
518120e3	20	static int longformat;
2d9e7c9f	21	static int abbrev = DEFAULT_ABBREV;
8713ab30	22	static int max_candidates = 10;
d68dc34c	23	static int found_names;
cb2a1cc2	24	static const char *pattern;
da2478db	25	static int always;
908e5310	26
e7eb5034	27	struct commit_name {
212945d4	28	struct tag *tag;
64deb858	29	int prio; /* annotated tag = 2, tag = 1, head = 0 */
212945d4	30	unsigned char sha1[20];
5a2282de	31	char path[FLEX_ARRAY]; /* more */
e7eb5034	32	};
cf69fd49 SP	33	static const char *prio_names[] = {
	34	"head", "lightweight", "annotated",
	35	};
908e5310	36
64deb858	37	static void add_to_known_names(const char *path,
80dbae03	38	struct commit *commit,
212945d4 SP	39	int prio,
212945d4 SP	40	const unsigned char *sha1)
908e5310	41	{
e7eb5034 SP	42	struct commit_name *e = commit->util;
	43	if (!e \|\| e->prio < prio) {
	44	size_t len = strlen(path)+1;
	45	free(e);
	46	e = xmalloc(sizeof(struct commit_name) + len);
212945d4	47	e->tag = NULL;
e7eb5034	48	e->prio = prio;
212945d4	49	hashcpy(e->sha1, sha1);
e7eb5034 SP	50	memcpy(e->path, path, len);
e7eb5034 SP	51	commit->util = e;
908e5310	52	}
d68dc34c	53	found_names = 1;
908e5310 LT	54	}
908e5310 LT	55
8da19775	56	static int get_name(const char path, const unsigned char sha1, int flag, void *cb_data)
908e5310	57	{
8a5a1884	58	int might_be_tag = !prefixcmp(path, "refs/tags/");
feededd0	59	struct commit *commit;
64deb858	60	struct object *object;
feededd0 SP	61	unsigned char peeled[20];
	62	int is_tag, prio;
	63
8a5a1884 SP	64	if (!all && !might_be_tag)
	65	return 0;
	66
feededd0 SP	67	if (!peel_ref(path, peeled) && !is_null_sha1(peeled)) {
	68	commit = lookup_commit_reference_gently(peeled, 1);
	69	if (!commit)
	70	return 0;
	71	is_tag = !!hashcmp(sha1, commit->object.sha1);
	72	} else {
	73	commit = lookup_commit_reference_gently(sha1, 1);
	74	object = parse_object(sha1);
	75	if (!commit \|\| !object)
	76	return 0;
	77	is_tag = object->type == OBJ_TAG;
	78	}
64deb858	79
2d9e7c9f JH	80	/* If --all, then any refs are used.
	81	* If --tags, then any tags are used.
	82	* Otherwise only annotated tags are used.
	83	*/
8a5a1884	84	if (might_be_tag) {
4ed19a3c	85	if (is_tag)
64deb858	86	prio = 2;
4ed19a3c	87	else
64deb858	88	prio = 1;
4ed19a3c MD	89
	90	if (pattern && fnmatch(pattern, path + 10, 0))
	91	prio = 0;
64deb858 JH	92	}
	93	else
	94	prio = 0;
	95
635d4134	96	if (!all) {
64deb858 JH	97	if (!prio)
	98	return 0;
	99	if (!tags && prio < 2)
635d4134	100	return 0;
635d4134	101	}
212945d4	102	add_to_known_names(all ? path + 5 : path + 10, commit, prio, sha1);
908e5310 LT	103	return 0;
	104	}
	105
80dbae03	106	struct possible_tag {
80dbae03	107	struct commit_name *name;
cf69fd49 SP	108	int depth;
cf69fd49 SP	109	int found_order;
8713ab30	110	unsigned flag_within;
80dbae03 SP	111	};
80dbae03 SP	112
cf69fd49 SP	113	static int compare_pt(const void a_, const void b_)
	114	{
	115	struct possible_tag a = (struct possible_tag )a_;
	116	struct possible_tag b = (struct possible_tag )b_;
cf69fd49 SP	117	if (a->depth != b->depth)
	118	return a->depth - b->depth;
	119	if (a->found_order != b->found_order)
	120	return a->found_order - b->found_order;
	121	return 0;
	122	}
	123
1b600e65 SP	124	static unsigned long finish_depth_computation(
	125	struct commit_list **list,
	126	struct possible_tag *best)
	127	{
	128	unsigned long seen_commits = 0;
	129	while (*list) {
	130	struct commit *c = pop_commit(list);
	131	struct commit_list *parents = c->parents;
	132	seen_commits++;
	133	if (c->object.flags & best->flag_within) {
	134	struct commit_list a = list;
	135	while (a) {
	136	struct commit *i = a->item;
	137	if (!(i->object.flags & best->flag_within))
	138	break;
	139	a = a->next;
	140	}
	141	if (!a)
	142	break;
	143	} else
	144	best->depth++;
	145	while (parents) {
	146	struct commit *p = parents->item;
	147	parse_commit(p);
	148	if (!(p->object.flags & SEEN))
	149	insert_by_date(p, list);
	150	p->object.flags \|= c->object.flags;
	151	parents = parents->next;
	152	}
	153	}
	154	return seen_commits;
	155	}
	156
212945d4 SP	157	static void display_name(struct commit_name *n)
	158	{
	159	if (n->prio == 2 && !n->tag) {
	160	n->tag = lookup_tag(n->sha1);
3167d725	161	if (!n->tag \|\| parse_tag(n->tag) \|\| !n->tag->tag)
212945d4	162	die("annotated tag %s not available", n->path);
81dc223d	163	if (strcmp(n->tag->tag, all ? n->path + 5 : n->path))
212945d4 SP	164	warning("tag '%s' is really '%s' here", n->tag->tag, n->path);
	165	}
	166
	167	if (n->tag)
	168	printf("%s", n->tag->tag);
	169	else
	170	printf("%s", n->path);
870cf7d6 JH	171	}
	172
	173	static void show_suffix(int depth, const unsigned char *sha1)
	174	{
	175	printf("-%d-g%s", depth, find_unique_abbrev(sha1, abbrev));
212945d4 SP	176	}
212945d4 SP	177
554fe20d	178	static void describe(const char *arg, int last_one)
908e5310	179	{
4c34a2c5	180	unsigned char sha1[20];
8713ab30	181	struct commit cmit, gave_up_on = NULL;
908e5310	182	struct commit_list *list;
908e5310	183	struct commit_name *n;
cf69fd49	184	struct possible_tag all_matches[MAX_TAGS];
8713ab30 SP	185	unsigned int match_cnt = 0, annotated_cnt = 0, cur_match;
8713ab30 SP	186	unsigned long seen_commits = 0;
908e5310	187
31fff305 DL	188	if (get_sha1(arg, sha1))
31fff305 DL	189	die("Not a valid object name %s", arg);
4c34a2c5 JH	190	cmit = lookup_commit_reference(sha1);
4c34a2c5 JH	191	if (!cmit)
31fff305	192	die("%s is not a valid '%s' object", arg, commit_type);
4c34a2c5	193
e7eb5034	194	n = cmit->util;
908e5310	195	if (n) {
870cf7d6 JH	196	/*
	197	* Exact match to an existing ref.
	198	*/
212945d4	199	display_name(n);
870cf7d6	200	if (longformat)
14d4642e	201	show_suffix(0, n->tag ? n->tag->tagged->sha1 : sha1);
212945d4	202	printf("\n");
908e5310 LT	203	return;
	204	}
	205
2c33f757 SP	206	if (!max_candidates)
2c33f757 SP	207	die("no tag exactly matches '%s'", sha1_to_hex(cmit->object.sha1));
8713ab30 SP	208	if (debug)
	209	fprintf(stderr, "searching to describe %s\n", arg);
	210
908e5310	211	list = NULL;
8713ab30	212	cmit->object.flags = SEEN;
908e5310 LT	213	commit_list_insert(cmit, &list);
908e5310 LT	214	while (list) {
80dbae03	215	struct commit *c = pop_commit(&list);
dccd0c2a	216	struct commit_list *parents = c->parents;
8713ab30	217	seen_commits++;
e7eb5034	218	n = c->util;
908e5310	219	if (n) {
8713ab30 SP	220	if (match_cnt < max_candidates) {
	221	struct possible_tag *t = &all_matches[match_cnt++];
	222	t->name = n;
	223	t->depth = seen_commits - 1;
	224	t->flag_within = 1u << match_cnt;
8a8169c0	225	t->found_order = match_cnt;
8713ab30 SP	226	c->object.flags \|= t->flag_within;
	227	if (n->prio == 2)
	228	annotated_cnt++;
	229	}
	230	else {
	231	gave_up_on = c;
	232	break;
	233	}
	234	}
	235	for (cur_match = 0; cur_match < match_cnt; cur_match++) {
	236	struct possible_tag *t = &all_matches[cur_match];
	237	if (!(c->object.flags & t->flag_within))
	238	t->depth++;
	239	}
	240	if (annotated_cnt && !list) {
	241	if (debug)
	242	fprintf(stderr, "finished search at %s\n",
	243	sha1_to_hex(c->object.sha1));
	244	break;
dccd0c2a SP	245	}
	246	while (parents) {
	247	struct commit *p = parents->item;
	248	parse_commit(p);
8713ab30	249	if (!(p->object.flags & SEEN))
dccd0c2a	250	insert_by_date(p, &list);
8713ab30	251	p->object.flags \|= c->object.flags;
dccd0c2a	252	parents = parents->next;
80dbae03 SP	253	}
	254	}
	255
da2478db JH	256	if (!match_cnt) {
	257	const unsigned char *sha1 = cmit->object.sha1;
	258	if (always) {
	259	printf("%s\n", find_unique_abbrev(sha1, abbrev));
	260	return;
	261	}
	262	die("cannot describe '%s'", sha1_to_hex(sha1));
	263	}
80dbae03	264
cf69fd49	265	qsort(all_matches, match_cnt, sizeof(all_matches[0]), compare_pt);
1b600e65 SP	266
	267	if (gave_up_on) {
	268	insert_by_date(gave_up_on, &list);
	269	seen_commits--;
	270	}
	271	seen_commits += finish_depth_computation(&list, &all_matches[0]);
	272	free_commit_list(list);
	273
8713ab30 SP	274	if (debug) {
	275	for (cur_match = 0; cur_match < match_cnt; cur_match++) {
	276	struct possible_tag *t = &all_matches[cur_match];
cf69fd49 SP	277	fprintf(stderr, " %-11s %8d %s\n",
cf69fd49 SP	278	prio_names[t->name->prio],
8713ab30 SP	279	t->depth, t->name->path);
	280	}
	281	fprintf(stderr, "traversed %lu commits\n", seen_commits);
	282	if (gave_up_on) {
	283	fprintf(stderr,
	284	"more than %i tags found; listed %i most recent\n"
	285	"gave up search at %s\n",
	286	max_candidates, max_candidates,
	287	sha1_to_hex(gave_up_on->object.sha1));
	288	}
80dbae03	289	}
212945d4 SP	290
	291	display_name(all_matches[0].name);
	292	if (abbrev)
870cf7d6	293	show_suffix(all_matches[0].depth, cmit->object.sha1);
212945d4	294	printf("\n");
80dbae03	295
8713ab30 SP	296	if (!last_one)
8713ab30 SP	297	clear_commit_marks(cmit, -1);
908e5310 LT	298	}
908e5310 LT	299
9a0eaf83	300	int cmd_describe(int argc, const char *argv, const char prefix)
908e5310	301	{
23615708	302	int contains = 0;
166185be PH	303	struct option options[] = {
	304	OPT_BOOLEAN(0, "contains", &contains, "find the tag that comes after the commit"),
	305	OPT_BOOLEAN(0, "debug", &debug, "debug search strategy on stderr"),
	306	OPT_BOOLEAN(0, "all", &all, "use any ref in .git/refs"),
	307	OPT_BOOLEAN(0, "tags", &tags, "use any tag in .git/refs/tags"),
518120e3	308	OPT_BOOLEAN(0, "long", &longformat, "always use long format"),
166185be	309	OPT__ABBREV(&abbrev),
2c33f757 SP	310	OPT_SET_INT(0, "exact-match", &max_candidates,
2c33f757 SP	311	"only output exact matches", 0),
166185be	312	OPT_INTEGER(0, "candidates", &max_candidates,
30ffa603 PH	313	"consider <n> most recent tags (default: 10)"),
	314	OPT_STRING(0, "match", &pattern, "pattern",
	315	"only consider tags matching <pattern>"),
da2478db JH	316	OPT_BOOLEAN(0, "always", &always,
da2478db JH	317	"show abbreviated commit object as fallback"),
166185be PH	318	OPT_END(),
166185be PH	319	};
908e5310	320
37782920	321	argc = parse_options(argc, argv, prefix, options, describe_usage, 0);
2c33f757 SP	322	if (max_candidates < 0)
2c33f757 SP	323	max_candidates = 0;
166185be PH	324	else if (max_candidates > MAX_TAGS)
166185be PH	325	max_candidates = MAX_TAGS;
4c34a2c5	326
8c599c74	327	save_commit_buffer = 0;
8112894d	328
518120e3 SB	329	if (longformat && abbrev == 0)
	330	die("--long is incompatible with --abbrev=0");
	331
23615708	332	if (contains) {
4b25d091	333	const char *args = xmalloc((7 + argc) sizeof(char *));
3f7701a4 NP	334	int i = 0;
	335	args[i++] = "name-rev";
	336	args[i++] = "--name-only";
a2cf9f44	337	args[i++] = "--no-undefined";
da2478db JH	338	if (always)
da2478db JH	339	args[i++] = "--always";
30ffa603	340	if (!all) {
3f7701a4	341	args[i++] = "--tags";
30ffa603 PH	342	if (pattern) {
	343	char *s = xmalloc(strlen("--refs=refs/tags/") + strlen(pattern) + 1);
	344	sprintf(s, "--refs=refs/tags/%s", pattern);
	345	args[i++] = s;
	346	}
	347	}
4b25d091	348	memcpy(args + i, argv, argc * sizeof(char *));
3f7701a4 NP	349	args[i + argc] = NULL;
3f7701a4 NP	350	return cmd_name_rev(i + argc, args, prefix);
23615708 SP	351	}
23615708 SP	352
fb423da0 RS	353	for_each_ref(get_name, NULL);
	354	if (!found_names)
	355	die("No names found, cannot describe anything.");
	356
166185be	357	if (argc == 0) {
fec9ebf1	358	describe("HEAD", 1);
166185be PH	359	} else {
	360	while (argc-- > 0) {
	361	describe(*argv++, argc == 0);
fec9ebf1	362	}
166185be	363	}
908e5310 LT	364	return 0;
908e5310 LT	365	}