[thirdparty/git.git] / builtin / name-rev.c

#include "builtin.h"
#include "cache.h"
#include "repository.h"
#include "config.h"
#include "commit.h"
#include "tag.h"
#include "refs.h"
#include "parse-options.h"
#include "prio-queue.h"
#include "sha1-lookup.h"
#include "commit-slab.h"

/*
 * One day.  See the 'name a rev shortly after epoch' test in t6120 when
 * changing this value
 */
#define CUTOFF_DATE_SLOP 86400

typedef struct rev_name {
	const char *tip_name;
	timestamp_t taggerdate;
	int generation;
	int distance;
	int from_tag;
} rev_name;

define_commit_slab(commit_rev_name, struct rev_name *);

static timestamp_t cutoff = TIME_MAX;
static struct commit_rev_name rev_names;

/* How many generations are maximally preferred over _one_ merge traversal? */
#define MERGE_TRAVERSAL_WEIGHT 65535

static struct rev_name *get_commit_rev_name(struct commit *commit)
{
	struct rev_name **slot = commit_rev_name_peek(&rev_names, commit);

	return slot ? *slot : NULL;
}

static void set_commit_rev_name(struct commit *commit, struct rev_name *name)
{
	*commit_rev_name_at(&rev_names, commit) = name;
}

static int is_better_name(struct rev_name *name,
			  timestamp_t taggerdate,
			  int distance,
			  int from_tag)
{
	/*
	 * When comparing names based on tags, prefer names
	 * based on the older tag, even if it is farther away.
	 */
	if (from_tag && name->from_tag)
		return (name->taggerdate > taggerdate ||
			(name->taggerdate == taggerdate &&
			 name->distance > distance));

	/*
	 * We know that at least one of them is a non-tag at this point.
	 * favor a tag over a non-tag.
	 */
	if (name->from_tag != from_tag)
		return from_tag;

	/*
	 * We are now looking at two non-tags.  Tiebreak to favor
	 * shorter hops.
	 */
	if (name->distance != distance)
		return name->distance > distance;

	/* ... or tiebreak to favor older date */
	if (name->taggerdate != taggerdate)
		return name->taggerdate > taggerdate;

	/* keep the current one if we cannot decide */
	return 0;
}

static struct rev_name *create_or_update_name(struct commit *commit,
					      const char *tip_name,
					      timestamp_t taggerdate,
					      int generation, int distance,
					      int from_tag)
{
	struct rev_name *name = get_commit_rev_name(commit);

	if (name == NULL) {
		name = xmalloc(sizeof(*name));
		set_commit_rev_name(commit, name);
		goto copy_data;
	} else if (is_better_name(name, taggerdate, distance, from_tag)) {
copy_data:
		name->tip_name = tip_name;
		name->taggerdate = taggerdate;
		name->generation = generation;
		name->distance = distance;
		name->from_tag = from_tag;

		return name;
	} else
		return NULL;
}

static void name_rev(struct commit *start_commit,
		const char *tip_name, timestamp_t taggerdate,
		int from_tag, int deref)
{
	struct prio_queue queue;
	struct commit *commit;
	struct commit **parents_to_queue = NULL;
	size_t parents_to_queue_nr, parents_to_queue_alloc = 0;
	char *to_free = NULL;

	parse_commit(start_commit);
	if (start_commit->date < cutoff)
		return;

	if (deref)
		tip_name = to_free = xstrfmt("%s^0", tip_name);

	if (!create_or_update_name(start_commit, tip_name, taggerdate, 0, 0,
				   from_tag)) {
		free(to_free);
		return;
	}

	memset(&queue, 0, sizeof(queue)); /* Use the prio_queue as LIFO */
	prio_queue_put(&queue, start_commit);

	while ((commit = prio_queue_get(&queue))) {
		struct rev_name *name = get_commit_rev_name(commit);
		struct commit_list *parents;
		int parent_number = 1;

		parents_to_queue_nr = 0;

		for (parents = commit->parents;
				parents;
				parents = parents->next, parent_number++) {
			struct commit *parent = parents->item;
			const char *new_name;
			int generation, distance;

			parse_commit(parent);
			if (parent->date < cutoff)
				continue;

			if (parent_number > 1) {
				size_t len;

				strip_suffix(name->tip_name, "^0", &len);
				if (name->generation > 0)
					new_name = xstrfmt("%.*s~%d^%d",
							   (int)len,
							   name->tip_name,
							   name->generation,
							   parent_number);
				else
					new_name = xstrfmt("%.*s^%d", (int)len,
							   name->tip_name,
							   parent_number);
				generation = 0;
				distance = name->distance + MERGE_TRAVERSAL_WEIGHT;
			} else {
				new_name = name->tip_name;
				generation = name->generation + 1;
				distance = name->distance + 1;
			}

			if (create_or_update_name(parent, new_name, taggerdate,
						  generation, distance,
						  from_tag)) {
				ALLOC_GROW(parents_to_queue,
					   parents_to_queue_nr + 1,
					   parents_to_queue_alloc);
				parents_to_queue[parents_to_queue_nr] = parent;
				parents_to_queue_nr++;
			}
		}

		/* The first parent must come out first from the prio_queue */
		while (parents_to_queue_nr)
			prio_queue_put(&queue,
				       parents_to_queue[--parents_to_queue_nr]);
	}

	clear_prio_queue(&queue);
	free(parents_to_queue);
}

static int subpath_matches(const char *path, const char *filter)
{
	const char *subpath = path;

	while (subpath) {
		if (!wildmatch(filter, subpath, 0))
			return subpath - path;
		subpath = strchr(subpath, '/');
		if (subpath)
			subpath++;
	}
	return -1;
}

static const char *name_ref_abbrev(const char *refname, int shorten_unambiguous)
{
	if (shorten_unambiguous)
		refname = shorten_unambiguous_ref(refname, 0);
	else if (skip_prefix(refname, "refs/heads/", &refname))
		; /* refname already advanced */
	else
		skip_prefix(refname, "refs/", &refname);
	return refname;
}

struct name_ref_data {
	int tags_only;
	int name_only;
	struct string_list ref_filters;
	struct string_list exclude_filters;
};

static struct tip_table {
	struct tip_table_entry {
		struct object_id oid;
		const char *refname;
	} *table;
	int nr;
	int alloc;
	int sorted;
} tip_table;

static void add_to_tip_table(const struct object_id *oid, const char *refname,
			     int shorten_unambiguous)
{
	refname = name_ref_abbrev(refname, shorten_unambiguous);

	ALLOC_GROW(tip_table.table, tip_table.nr + 1, tip_table.alloc);
	oidcpy(&tip_table.table[tip_table.nr].oid, oid);
	tip_table.table[tip_table.nr].refname = xstrdup(refname);
	tip_table.nr++;
	tip_table.sorted = 0;
}

static int tipcmp(const void *a_, const void *b_)
{
	const struct tip_table_entry *a = a_, *b = b_;
	return oidcmp(&a->oid, &b->oid);
}

static int name_ref(const char *path, const struct object_id *oid, int flags, void *cb_data)
{
	struct object *o = parse_object(the_repository, oid);
	struct name_ref_data *data = cb_data;
	int can_abbreviate_output = data->tags_only && data->name_only;
	int deref = 0;
	timestamp_t taggerdate = TIME_MAX;

	if (data->tags_only && !starts_with(path, "refs/tags/"))
		return 0;

	if (data->exclude_filters.nr) {
		struct string_list_item *item;

		for_each_string_list_item(item, &data->exclude_filters) {
			if (subpath_matches(path, item->string) >= 0)
				return 0;
		}
	}

	if (data->ref_filters.nr) {
		struct string_list_item *item;
		int matched = 0;

		/* See if any of the patterns match. */
		for_each_string_list_item(item, &data->ref_filters) {
			/*
			 * Check all patterns even after finding a match, so
			 * that we can see if a match with a subpath exists.
			 * When a user asked for 'refs/tags/v*' and 'v1.*',
			 * both of which match, the user is showing her
			 * willingness to accept a shortened output by having
			 * the 'v1.*' in the acceptable refnames, so we
			 * shouldn't stop when seeing 'refs/tags/v1.4' matches
			 * 'refs/tags/v*'.  We should show it as 'v1.4'.
			 */
			switch (subpath_matches(path, item->string)) {
			case -1: /* did not match */
				break;
			case 0: /* matched fully */
				matched = 1;
				break;
			default: /* matched subpath */
				matched = 1;
				can_abbreviate_output = 1;
				break;
			}
		}

		/* If none of the patterns matched, stop now */
		if (!matched)
			return 0;
	}

	add_to_tip_table(oid, path, can_abbreviate_output);

	while (o && o->type == OBJ_TAG) {
		struct tag *t = (struct tag *) o;
		if (!t->tagged)
			break; /* broken repository */
		o = parse_object(the_repository, &t->tagged->oid);
		deref = 1;
		taggerdate = t->date;
	}
	if (o && o->type == OBJ_COMMIT) {
		struct commit *commit = (struct commit *)o;
		int from_tag = starts_with(path, "refs/tags/");

		if (taggerdate == TIME_MAX)
			taggerdate = commit->date;
		path = name_ref_abbrev(path, can_abbreviate_output);
		name_rev(commit, xstrdup(path), taggerdate, from_tag, deref);
	}
	return 0;
}

static const unsigned char *nth_tip_table_ent(size_t ix, void *table_)
{
	struct tip_table_entry *table = table_;
	return table[ix].oid.hash;
}

static const char *get_exact_ref_match(const struct object *o)
{
	int found;

	if (!tip_table.table || !tip_table.nr)
		return NULL;

	if (!tip_table.sorted) {
		QSORT(tip_table.table, tip_table.nr, tipcmp);
		tip_table.sorted = 1;
	}

	found = sha1_pos(o->oid.hash, tip_table.table, tip_table.nr,
			 nth_tip_table_ent);
	if (0 <= found)
		return tip_table.table[found].refname;
	return NULL;
}

/* may return a constant string or use "buf" as scratch space */
static const char *get_rev_name(const struct object *o, struct strbuf *buf)
{
	struct rev_name *n;
	struct commit *c;

	if (o->type != OBJ_COMMIT)
		return get_exact_ref_match(o);
	c = (struct commit *) o;
	n = get_commit_rev_name(c);
	if (!n)
		return NULL;

	if (!n->generation)
		return n->tip_name;
	else {
		strbuf_reset(buf);
		strbuf_addstr(buf, n->tip_name);
		strbuf_strip_suffix(buf, "^0");
		strbuf_addf(buf, "~%d", n->generation);
		return buf->buf;
	}
}

static void show_name(const struct object *obj,
		      const char *caller_name,
		      int always, int allow_undefined, int name_only)
{
	const char *name;
	const struct object_id *oid = &obj->oid;
	struct strbuf buf = STRBUF_INIT;

	if (!name_only)
		printf("%s ", caller_name ? caller_name : oid_to_hex(oid));
	name = get_rev_name(obj, &buf);
	if (name)
		printf("%s\n", name);
	else if (allow_undefined)
		printf("undefined\n");
	else if (always)
		printf("%s\n", find_unique_abbrev(oid, DEFAULT_ABBREV));
	else
		die("cannot describe '%s'", oid_to_hex(oid));
	strbuf_release(&buf);
}

static char const * const name_rev_usage[] = {
	N_("git name-rev [<options>] <commit>..."),
	N_("git name-rev [<options>] --all"),
	N_("git name-rev [<options>] --stdin"),
	NULL
};

static void name_rev_line(char *p, struct name_ref_data *data)
{
	struct strbuf buf = STRBUF_INIT;
	int counter = 0;
	char *p_start;
	const unsigned hexsz = the_hash_algo->hexsz;

	for (p_start = p; *p; p++) {
#define ishex(x) (isdigit((x)) || ((x) >= 'a' && (x) <= 'f'))
		if (!ishex(*p))
			counter = 0;
		else if (++counter == hexsz &&
			 !ishex(*(p+1))) {
			struct object_id oid;
			const char *name = NULL;
			char c = *(p+1);
			int p_len = p - p_start + 1;

			counter = 0;

			*(p+1) = 0;
			if (!get_oid(p - (hexsz - 1), &oid)) {
				struct object *o =
					lookup_object(the_repository, &oid);
				if (o)
					name = get_rev_name(o, &buf);
			}
			*(p+1) = c;

			if (!name)
				continue;

			if (data->name_only)
				printf("%.*s%s", p_len - hexsz, p_start, name);
			else
				printf("%.*s (%s)", p_len, p_start, name);
			p_start = p + 1;
		}
	}

	/* flush */
	if (p_start != p)
		fwrite(p_start, p - p_start, 1, stdout);

	strbuf_release(&buf);
}

int cmd_name_rev(int argc, const char **argv, const char *prefix)
{
	struct object_array revs = OBJECT_ARRAY_INIT;
	int all = 0, transform_stdin = 0, allow_undefined = 1, always = 0, peel_tag = 0;
	struct name_ref_data data = { 0, 0, STRING_LIST_INIT_NODUP, STRING_LIST_INIT_NODUP };
	struct option opts[] = {
		OPT_BOOL(0, "name-only", &data.name_only, N_("print only names (no SHA-1)")),
		OPT_BOOL(0, "tags", &data.tags_only, N_("only use tags to name the commits")),
		OPT_STRING_LIST(0, "refs", &data.ref_filters, N_("pattern"),
				   N_("only use refs matching <pattern>")),
		OPT_STRING_LIST(0, "exclude", &data.exclude_filters, N_("pattern"),
				   N_("ignore refs matching <pattern>")),
		OPT_GROUP(""),
		OPT_BOOL(0, "all", &all, N_("list all commits reachable from all refs")),
		OPT_BOOL(0, "stdin", &transform_stdin, N_("read from stdin")),
		OPT_BOOL(0, "undefined", &allow_undefined, N_("allow to print `undefined` names (default)")),
		OPT_BOOL(0, "always",     &always,
			   N_("show abbreviated commit object as fallback")),
		{
			/* A Hidden OPT_BOOL */
			OPTION_SET_INT, 0, "peel-tag", &peel_tag, NULL,
			N_("dereference tags in the input (internal use)"),
			PARSE_OPT_NOARG | PARSE_OPT_HIDDEN, NULL, 1,
		},
		OPT_END(),
	};

	init_commit_rev_name(&rev_names);
	git_config(git_default_config, NULL);
	argc = parse_options(argc, argv, prefix, opts, name_rev_usage, 0);
	if (all + transform_stdin + !!argc > 1) {
		error("Specify either a list, or --all, not both!");
		usage_with_options(name_rev_usage, opts);
	}
	if (all || transform_stdin)
		cutoff = 0;

	for (; argc; argc--, argv++) {
		struct object_id oid;
		struct object *object;
		struct commit *commit;

		if (get_oid(*argv, &oid)) {
			fprintf(stderr, "Could not get sha1 for %s. Skipping.\n",
					*argv);
			continue;
		}

		commit = NULL;
		object = parse_object(the_repository, &oid);
		if (object) {
			struct object *peeled = deref_tag(the_repository,
							  object, *argv, 0);
			if (peeled && peeled->type == OBJ_COMMIT)
				commit = (struct commit *)peeled;
		}

		if (!object) {
			fprintf(stderr, "Could not get object for %s. Skipping.\n",
					*argv);
			continue;
		}

		if (commit) {
			if (cutoff > commit->date)
				cutoff = commit->date;
		}

		if (peel_tag) {
			if (!commit) {
				fprintf(stderr, "Could not get commit for %s. Skipping.\n",
					*argv);
				continue;
			}
			object = (struct object *)commit;
		}
		add_object_array(object, *argv, &revs);
	}

	if (cutoff) {
		/* check for undeflow */
		if (cutoff > TIME_MIN + CUTOFF_DATE_SLOP)
			cutoff = cutoff - CUTOFF_DATE_SLOP;
		else
			cutoff = TIME_MIN;
	}
	for_each_ref(name_ref, &data);

	if (transform_stdin) {
		char buffer[2048];

		while (!feof(stdin)) {
			char *p = fgets(buffer, sizeof(buffer), stdin);
			if (!p)
				break;
			name_rev_line(p, &data);
		}
	} else if (all) {
		int i, max;

		max = get_max_object_index();
		for (i = 0; i < max; i++) {
			struct object *obj = get_indexed_object(i);
			if (!obj || obj->type != OBJ_COMMIT)
				continue;
			show_name(obj, NULL,
				  always, allow_undefined, data.name_only);
		}
	} else {
		int i;
		for (i = 0; i < revs.nr; i++)
			show_name(revs.objects[i].item, revs.objects[i].name,
				  always, allow_undefined, data.name_only);
	}

	UNLEAK(revs);
	return 0;
}
Commit	Line	Data
d6b64ed0	1	#include "builtin.h"
bd321bcc	2	#include "cache.h"
109cd76d	3	#include "repository.h"
b2141fc1	4	#include "config.h"
bd321bcc JS	5	#include "commit.h"
	6	#include "tag.h"
	7	#include "refs.h"
edefb1a2	8	#include "parse-options.h"
49f7a2fd	9	#include "prio-queue.h"
b23e0b93	10	#include "sha1-lookup.h"
8fd79a73	11	#include "commit-slab.h"
bd321bcc	12
2e09c012 SG	13	/*
	14	* One day. See the 'name a rev shortly after epoch' test in t6120 when
	15	* changing this value
	16	*/
	17	#define CUTOFF_DATE_SLOP 86400
c075aea5	18
bd321bcc JS	19	typedef struct rev_name {
bd321bcc JS	20	const char *tip_name;
dddbad72	21	timestamp_t taggerdate;
bd321bcc	22	int generation;
ac076c29	23	int distance;
ef1e7406	24	int from_tag;
bd321bcc JS	25	} rev_name;
bd321bcc JS	26
8fd79a73 NTND	27	define_commit_slab(commit_rev_name, struct rev_name *);
8fd79a73 NTND	28
5589e87f	29	static timestamp_t cutoff = TIME_MAX;
8fd79a73	30	static struct commit_rev_name rev_names;
bd321bcc	31
ac076c29 JS	32	/* How many generations are maximally preferred over _one_ merge traversal? */
	33	#define MERGE_TRAVERSAL_WEIGHT 65535
	34
8fd79a73 NTND	35	static struct rev_name get_commit_rev_name(struct commit commit)
	36	{
	37	struct rev_name **slot = commit_rev_name_peek(&rev_names, commit);
	38
	39	return slot ? *slot : NULL;
	40	}
	41
	42	static void set_commit_rev_name(struct commit commit, struct rev_name name)
	43	{
	44	*commit_rev_name_at(&rev_names, commit) = name;
	45	}
	46
0041bf65	47	static int is_better_name(struct rev_name *name,
78089b71	48	timestamp_t taggerdate,
ef1e7406 JH	49	int distance,
ef1e7406 JH	50	int from_tag)
0041bf65	51	{
ef1e7406 JH	52	/*
	53	* When comparing names based on tags, prefer names
	54	* based on the older tag, even if it is farther away.
	55	*/
	56	if (from_tag && name->from_tag)
	57	return (name->taggerdate > taggerdate \|\|
	58	(name->taggerdate == taggerdate &&
	59	name->distance > distance));
	60
	61	/*
	62	* We know that at least one of them is a non-tag at this point.
	63	* favor a tag over a non-tag.
	64	*/
	65	if (name->from_tag != from_tag)
	66	return from_tag;
	67
	68	/*
	69	* We are now looking at two non-tags. Tiebreak to favor
	70	* shorter hops.
	71	*/
	72	if (name->distance != distance)
	73	return name->distance > distance;
	74
	75	/* ... or tiebreak to favor older date */
	76	if (name->taggerdate != taggerdate)
	77	return name->taggerdate > taggerdate;
	78
	79	/* keep the current one if we cannot decide */
	80	return 0;
0041bf65 JH	81	}
0041bf65 JH	82
766f9e39 SG	83	static struct rev_name create_or_update_name(struct commit commit,
	84	const char *tip_name,
	85	timestamp_t taggerdate,
	86	int generation, int distance,
	87	int from_tag)
bd321bcc	88	{
8fd79a73	89	struct rev_name *name = get_commit_rev_name(commit);
bd321bcc JS	90
bd321bcc JS	91	if (name == NULL) {
766f9e39	92	name = xmalloc(sizeof(*name));
8fd79a73	93	set_commit_rev_name(commit, name);
bd321bcc	94	goto copy_data;
c0165798	95	} else if (is_better_name(name, taggerdate, distance, from_tag)) {
bd321bcc JS	96	copy_data:
bd321bcc JS	97	name->tip_name = tip_name;
75504248	98	name->taggerdate = taggerdate;
bd321bcc	99	name->generation = generation;
ac076c29	100	name->distance = distance;
ef1e7406	101	name->from_tag = from_tag;
766f9e39 SG	102
	103	return name;
	104	} else
	105	return NULL;
	106	}
	107
49f7a2fd	108	static void name_rev(struct commit *start_commit,
dddbad72	109	const char *tip_name, timestamp_t taggerdate,
2866fd28	110	int from_tag, int deref)
bd321bcc	111	{
49f7a2fd SG	112	struct prio_queue queue;
	113	struct commit *commit;
	114	struct commit **parents_to_queue = NULL;
	115	size_t parents_to_queue_nr, parents_to_queue_alloc = 0;
2866fd28 SG	116	char *to_free = NULL;
	117
	118	parse_commit(start_commit);
	119	if (start_commit->date < cutoff)
	120	return;
	121
	122	if (deref)
	123	tip_name = to_free = xstrfmt("%s^0", tip_name);
	124
	125	if (!create_or_update_name(start_commit, tip_name, taggerdate, 0, 0,
	126	from_tag)) {
53082246	127	free(to_free);
bd321bcc	128	return;
53082246	129	}
bd321bcc	130
49f7a2fd SG	131	memset(&queue, 0, sizeof(queue)); /* Use the prio_queue as LIFO */
	132	prio_queue_put(&queue, start_commit);
	133
	134	while ((commit = prio_queue_get(&queue))) {
	135	struct rev_name *name = get_commit_rev_name(commit);
	136	struct commit_list *parents;
	137	int parent_number = 1;
	138
	139	parents_to_queue_nr = 0;
	140
	141	for (parents = commit->parents;
	142	parents;
	143	parents = parents->next, parent_number++) {
	144	struct commit *parent = parents->item;
	145	const char *new_name;
	146	int generation, distance;
	147
	148	parse_commit(parent);
	149	if (parent->date < cutoff)
	150	continue;
	151
	152	if (parent_number > 1) {
	153	size_t len;
	154
	155	strip_suffix(name->tip_name, "^0", &len);
	156	if (name->generation > 0)
	157	new_name = xstrfmt("%.*s~%d^%d",
	158	(int)len,
	159	name->tip_name,
	160	name->generation,
	161	parent_number);
	162	else
	163	new_name = xstrfmt("%.*s^%d", (int)len,
	164	name->tip_name,
	165	parent_number);
	166	generation = 0;
	167	distance = name->distance + MERGE_TRAVERSAL_WEIGHT;
	168	} else {
	169	new_name = name->tip_name;
	170	generation = name->generation + 1;
	171	distance = name->distance + 1;
	172	}
	173
	174	if (create_or_update_name(parent, new_name, taggerdate,
	175	generation, distance,
	176	from_tag)) {
	177	ALLOC_GROW(parents_to_queue,
	178	parents_to_queue_nr + 1,
	179	parents_to_queue_alloc);
	180	parents_to_queue[parents_to_queue_nr] = parent;
	181	parents_to_queue_nr++;
	182	}
bd321bcc	183	}
3a521503	184
49f7a2fd SG	185	/* The first parent must come out first from the prio_queue */
	186	while (parents_to_queue_nr)
	187	prio_queue_put(&queue,
	188	parents_to_queue[--parents_to_queue_nr]);
bd321bcc	189	}
49f7a2fd SG	190
	191	clear_prio_queue(&queue);
	192	free(parents_to_queue);
bd321bcc JS	193	}
bd321bcc JS	194
98c5c4ad NK	195	static int subpath_matches(const char path, const char filter)
	196	{
	197	const char *subpath = path;
	198
	199	while (subpath) {
55d34269	200	if (!wildmatch(filter, subpath, 0))
98c5c4ad NK	201	return subpath - path;
	202	subpath = strchr(subpath, '/');
	203	if (subpath)
	204	subpath++;
	205	}
	206	return -1;
	207	}
	208
9608a190 JH	209	static const char name_ref_abbrev(const char refname, int shorten_unambiguous)
	210	{
	211	if (shorten_unambiguous)
	212	refname = shorten_unambiguous_ref(refname, 0);
2059e79c RS	213	else if (skip_prefix(refname, "refs/heads/", &refname))
	214	; /* refname already advanced */
	215	else
	216	skip_prefix(refname, "refs/", &refname);
9608a190 JH	217	return refname;
	218	}
	219
2afc29aa JS	220	struct name_ref_data {
2afc29aa JS	221	int tags_only;
23615708	222	int name_only;
290be667	223	struct string_list ref_filters;
96415b49	224	struct string_list exclude_filters;
2afc29aa JS	225	};
2afc29aa JS	226
b23e0b93 JH	227	static struct tip_table {
b23e0b93 JH	228	struct tip_table_entry {
511dca80	229	struct object_id oid;
b23e0b93 JH	230	const char *refname;
	231	} *table;
	232	int nr;
	233	int alloc;
	234	int sorted;
	235	} tip_table;
	236
511dca80	237	static void add_to_tip_table(const struct object_id oid, const char refname,
b23e0b93 JH	238	int shorten_unambiguous)
	239	{
	240	refname = name_ref_abbrev(refname, shorten_unambiguous);
	241
	242	ALLOC_GROW(tip_table.table, tip_table.nr + 1, tip_table.alloc);
511dca80	243	oidcpy(&tip_table.table[tip_table.nr].oid, oid);
b23e0b93 JH	244	tip_table.table[tip_table.nr].refname = xstrdup(refname);
	245	tip_table.nr++;
	246	tip_table.sorted = 0;
	247	}
	248
	249	static int tipcmp(const void a_, const void b_)
	250	{
	251	const struct tip_table_entry a = a_, b = b_;
511dca80	252	return oidcmp(&a->oid, &b->oid);
b23e0b93 JH	253	}
b23e0b93 JH	254
73868486	255	static int name_ref(const char path, const struct object_id oid, int flags, void *cb_data)
bd321bcc	256	{
109cd76d	257	struct object *o = parse_object(the_repository, oid);
2afc29aa	258	struct name_ref_data *data = cb_data;
98c5c4ad	259	int can_abbreviate_output = data->tags_only && data->name_only;
bd321bcc	260	int deref = 0;
dddbad72	261	timestamp_t taggerdate = TIME_MAX;
bd321bcc	262
59556548	263	if (data->tags_only && !starts_with(path, "refs/tags/"))
2afc29aa JS	264	return 0;
2afc29aa JS	265
96415b49 JK	266	if (data->exclude_filters.nr) {
	267	struct string_list_item *item;
	268
	269	for_each_string_list_item(item, &data->exclude_filters) {
	270	if (subpath_matches(path, item->string) >= 0)
	271	return 0;
	272	}
	273	}
	274
290be667 JK	275	if (data->ref_filters.nr) {
	276	struct string_list_item *item;
	277	int matched = 0;
	278
	279	/* See if any of the patterns match. */
	280	for_each_string_list_item(item, &data->ref_filters) {
	281	/*
	282	* Check all patterns even after finding a match, so
	283	* that we can see if a match with a subpath exists.
	284	* When a user asked for 'refs/tags/v' and 'v1.',
	285	* both of which match, the user is showing her
	286	* willingness to accept a shortened output by having
	287	* the 'v1.*' in the acceptable refnames, so we
	288	* shouldn't stop when seeing 'refs/tags/v1.4' matches
	289	* 'refs/tags/v*'. We should show it as 'v1.4'.
	290	*/
	291	switch (subpath_matches(path, item->string)) {
	292	case -1: /* did not match */
	293	break;
	294	case 0: /* matched fully */
	295	matched = 1;
	296	break;
	297	default: /* matched subpath */
	298	matched = 1;
	299	can_abbreviate_output = 1;
	300	break;
	301	}
98c5c4ad	302	}
290be667 JK	303
	304	/* If none of the patterns matched, stop now */
	305	if (!matched)
	306	return 0;
98c5c4ad	307	}
bd321bcc	308
511dca80	309	add_to_tip_table(oid, path, can_abbreviate_output);
b23e0b93	310
1974632c	311	while (o && o->type == OBJ_TAG) {
bd321bcc JS	312	struct tag t = (struct tag ) o;
	313	if (!t->tagged)
	314	break; /* broken repository */
109cd76d	315	o = parse_object(the_repository, &t->tagged->oid);
bd321bcc	316	deref = 1;
75504248	317	taggerdate = t->date;
bd321bcc	318	}
1974632c	319	if (o && o->type == OBJ_COMMIT) {
bd321bcc	320	struct commit commit = (struct commit )o;
ef1e7406	321	int from_tag = starts_with(path, "refs/tags/");
bd321bcc	322
5554451d	323	if (taggerdate == TIME_MAX)
e0c4da6f	324	taggerdate = commit->date;
9608a190	325	path = name_ref_abbrev(path, can_abbreviate_output);
2866fd28	326	name_rev(commit, xstrdup(path), taggerdate, from_tag, deref);
bd321bcc JS	327	}
	328	return 0;
	329	}
	330
b23e0b93 JH	331	static const unsigned char nth_tip_table_ent(size_t ix, void table_)
	332	{
	333	struct tip_table_entry *table = table_;
511dca80	334	return table[ix].oid.hash;
b23e0b93 JH	335	}
	336
	337	static const char get_exact_ref_match(const struct object o)
	338	{
	339	int found;
	340
	341	if (!tip_table.table \|\| !tip_table.nr)
	342	return NULL;
	343
	344	if (!tip_table.sorted) {
9ed0d8d6	345	QSORT(tip_table.table, tip_table.nr, tipcmp);
b23e0b93 JH	346	tip_table.sorted = 1;
	347	}
	348
ed1c9977	349	found = sha1_pos(o->oid.hash, tip_table.table, tip_table.nr,
b23e0b93 JH	350	nth_tip_table_ent);
	351	if (0 <= found)
	352	return tip_table.table[found].refname;
	353	return NULL;
	354	}
	355
903fc7da JK	356	/* may return a constant string or use "buf" as scratch space */
903fc7da JK	357	static const char get_rev_name(const struct object o, struct strbuf *buf)
bd321bcc	358	{
d3ff6f55 LT	359	struct rev_name *n;
	360	struct commit *c;
	361
1974632c	362	if (o->type != OBJ_COMMIT)
b23e0b93	363	return get_exact_ref_match(o);
d3ff6f55	364	c = (struct commit *) o;
8fd79a73	365	n = get_commit_rev_name(c);
bd321bcc	366	if (!n)
a2cf9f44	367	return NULL;
bd321bcc JS	368
	369	if (!n->generation)
	370	return n->tip_name;
59d3f541	371	else {
903fc7da	372	strbuf_reset(buf);
c3794d4c RS	373	strbuf_addstr(buf, n->tip_name);
	374	strbuf_strip_suffix(buf, "^0");
	375	strbuf_addf(buf, "~%d", n->generation);
903fc7da	376	return buf->buf;
59d3f541	377	}
bd321bcc	378	}
1f1e895f	379
da2478db JH	380	static void show_name(const struct object *obj,
	381	const char *caller_name,
	382	int always, int allow_undefined, int name_only)
	383	{
	384	const char *name;
f2fd0760	385	const struct object_id *oid = &obj->oid;
903fc7da	386	struct strbuf buf = STRBUF_INIT;
da2478db JH	387
da2478db JH	388	if (!name_only)
f2fd0760	389	printf("%s ", caller_name ? caller_name : oid_to_hex(oid));
903fc7da	390	name = get_rev_name(obj, &buf);
da2478db JH	391	if (name)
	392	printf("%s\n", name);
	393	else if (allow_undefined)
	394	printf("undefined\n");
	395	else if (always)
aab9583f	396	printf("%s\n", find_unique_abbrev(oid, DEFAULT_ABBREV));
da2478db	397	else
f2fd0760	398	die("cannot describe '%s'", oid_to_hex(oid));
903fc7da	399	strbuf_release(&buf);
da2478db JH	400	}
da2478db JH	401
edefb1a2	402	static char const * const name_rev_usage[] = {
9c9b4f2f AH	403	N_("git name-rev [<options>] <commit>..."),
	404	N_("git name-rev [<options>] --all"),
	405	N_("git name-rev [<options>] --stdin"),
edefb1a2 PH	406	NULL
	407	};
	408
e8b55fab JH	409	static void name_rev_line(char p, struct name_ref_data data)
e8b55fab JH	410	{
903fc7da	411	struct strbuf buf = STRBUF_INIT;
1c4675dc	412	int counter = 0;
e8b55fab	413	char *p_start;
1c4675dc	414	const unsigned hexsz = the_hash_algo->hexsz;
1c4675dc	415
e8b55fab JH	416	for (p_start = p; *p; p++) {
	417	#define ishex(x) (isdigit((x)) \|\| ((x) >= 'a' && (x) <= 'f'))
	418	if (!ishex(*p))
1c4675dc	419	counter = 0;
1c4675dc	420	else if (++counter == hexsz &&
e8b55fab	421	!ishex(*(p+1))) {
511dca80	422	struct object_id oid;
e8b55fab JH	423	const char *name = NULL;
e8b55fab JH	424	char c = *(p+1);
7c5b1675	425	int p_len = p - p_start + 1;
e8b55fab	426
1c4675dc	427	counter = 0;
e8b55fab JH	428
e8b55fab JH	429	*(p+1) = 0;
1c4675dc	430	if (!get_oid(p - (hexsz - 1), &oid)) {
e8b55fab	431	struct object *o =
d0229abd	432	lookup_object(the_repository, &oid);
e8b55fab	433	if (o)
903fc7da	434	name = get_rev_name(o, &buf);
e8b55fab JH	435	}
	436	*(p+1) = c;
	437
	438	if (!name)
	439	continue;
	440
7c5b1675	441	if (data->name_only)
1c4675dc	442	printf("%.*s%s", p_len - hexsz, p_start, name);
7c5b1675 RS	443	else
7c5b1675 RS	444	printf("%.*s (%s)", p_len, p_start, name);
e8b55fab JH	445	p_start = p + 1;
	446	}
	447	}
	448
	449	/* flush */
	450	if (p_start != p)
	451	fwrite(p_start, p - p_start, 1, stdout);
903fc7da JK	452
903fc7da JK	453	strbuf_release(&buf);
e8b55fab JH	454	}
e8b55fab JH	455
d6b64ed0	456	int cmd_name_rev(int argc, const char *argv, const char prefix)
bd321bcc	457	{
3cd47459	458	struct object_array revs = OBJECT_ARRAY_INIT;
adfc1857	459	int all = 0, transform_stdin = 0, allow_undefined = 1, always = 0, peel_tag = 0;
96415b49	460	struct name_ref_data data = { 0, 0, STRING_LIST_INIT_NODUP, STRING_LIST_INIT_NODUP };
edefb1a2	461	struct option opts[] = {
d5d09d47 SB	462	OPT_BOOL(0, "name-only", &data.name_only, N_("print only names (no SHA-1)")),
d5d09d47 SB	463	OPT_BOOL(0, "tags", &data.tags_only, N_("only use tags to name the commits")),
290be667	464	OPT_STRING_LIST(0, "refs", &data.ref_filters, N_("pattern"),
422cad0a	465	N_("only use refs matching <pattern>")),
96415b49 JK	466	OPT_STRING_LIST(0, "exclude", &data.exclude_filters, N_("pattern"),
96415b49 JK	467	N_("ignore refs matching <pattern>")),
edefb1a2	468	OPT_GROUP(""),
d5d09d47 SB	469	OPT_BOOL(0, "all", &all, N_("list all commits reachable from all refs")),
	470	OPT_BOOL(0, "stdin", &transform_stdin, N_("read from stdin")),
	471	OPT_BOOL(0, "undefined", &allow_undefined, N_("allow to print `undefined` names (default)")),
	472	OPT_BOOL(0, "always", &always,
422cad0a	473	N_("show abbreviated commit object as fallback")),
adfc1857 JH	474	{
	475	/* A Hidden OPT_BOOL */
	476	OPTION_SET_INT, 0, "peel-tag", &peel_tag, NULL,
	477	N_("dereference tags in the input (internal use)"),
	478	PARSE_OPT_NOARG \| PARSE_OPT_HIDDEN, NULL, 1,
	479	},
edefb1a2 PH	480	OPT_END(),
edefb1a2 PH	481	};
bd321bcc	482
8fd79a73	483	init_commit_rev_name(&rev_names);
ef90d6d4	484	git_config(git_default_config, NULL);
37782920	485	argc = parse_options(argc, argv, prefix, opts, name_rev_usage, 0);
05efb7b7	486	if (all + transform_stdin + !!argc > 1) {
edefb1a2 PH	487	error("Specify either a list, or --all, not both!");
	488	usage_with_options(name_rev_usage, opts);
	489	}
	490	if (all \|\| transform_stdin)
	491	cutoff = 0;
bd321bcc	492
edefb1a2	493	for (; argc; argc--, argv++) {
511dca80	494	struct object_id oid;
118aa4ac	495	struct object *object;
bd321bcc JS	496	struct commit *commit;
bd321bcc JS	497
511dca80	498	if (get_oid(*argv, &oid)) {
bd321bcc JS	499	fprintf(stderr, "Could not get sha1 for %s. Skipping.\n",
	500	*argv);
	501	continue;
	502	}
	503
118aa4ac	504	commit = NULL;
109cd76d	505	object = parse_object(the_repository, &oid);
118aa4ac	506	if (object) {
a74093da SB	507	struct object *peeled = deref_tag(the_repository,
a74093da SB	508	object, *argv, 0);
118aa4ac JH	509	if (peeled && peeled->type == OBJ_COMMIT)
	510	commit = (struct commit *)peeled;
	511	}
	512
	513	if (!object) {
	514	fprintf(stderr, "Could not get object for %s. Skipping.\n",
bd321bcc JS	515	*argv);
	516	continue;
	517	}
	518
118aa4ac JH	519	if (commit) {
	520	if (cutoff > commit->date)
	521	cutoff = commit->date;
	522	}
adfc1857 JH	523
	524	if (peel_tag) {
	525	if (!commit) {
	526	fprintf(stderr, "Could not get commit for %s. Skipping.\n",
	527	*argv);
	528	continue;
	529	}
	530	object = (struct object *)commit;
	531	}
118aa4ac	532	add_object_array(object, *argv, &revs);
bd321bcc JS	533	}
bd321bcc JS	534
2e09c012 SG	535	if (cutoff) {
	536	/* check for undeflow */
	537	if (cutoff > TIME_MIN + CUTOFF_DATE_SLOP)
	538	cutoff = cutoff - CUTOFF_DATE_SLOP;
	539	else
	540	cutoff = TIME_MIN;
	541	}
73868486	542	for_each_ref(name_ref, &data);
bd321bcc JS	543
	544	if (transform_stdin) {
	545	char buffer[2048];
bd321bcc JS	546
bd321bcc JS	547	while (!feof(stdin)) {
e8b55fab	548	char *p = fgets(buffer, sizeof(buffer), stdin);
bd321bcc JS	549	if (!p)
bd321bcc JS	550	break;
e8b55fab	551	name_rev_line(p, &data);
bd321bcc JS	552	}
bd321bcc JS	553	} else if (all) {
fc046a75	554	int i, max;
bd321bcc	555
fc046a75	556	max = get_max_object_index();
a83123de BS	557	for (i = 0; i < max; i++) {
a83123de BS	558	struct object *obj = get_indexed_object(i);
e8b14d7e	559	if (!obj \|\| obj->type != OBJ_COMMIT)
a83123de BS	560	continue;
a83123de BS	561	show_name(obj, NULL,
da2478db	562	always, allow_undefined, data.name_only);
a83123de	563	}
1f1e895f LT	564	} else {
1f1e895f LT	565	int i;
da2478db JH	566	for (i = 0; i < revs.nr; i++)
	567	show_name(revs.objects[i].item, revs.objects[i].name,
	568	always, allow_undefined, data.name_only);
1f1e895f	569	}
bd321bcc	570
886e1084	571	UNLEAK(revs);
bd321bcc JS	572	return 0;
bd321bcc JS	573	}