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

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

#define CUTOFF_DATE_SLOP 86400 /* one day */

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

static long cutoff = LONG_MAX;

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

static void name_rev(struct commit *commit,
		const char *tip_name, int generation, int distance,
		int deref)
{
	struct rev_name *name = (struct rev_name *)commit->util;
	struct commit_list *parents;
	int parent_number = 1;

	if (!commit->object.parsed)
		parse_commit(commit);

	if (commit->date < cutoff)
		return;

	if (deref) {
		char *new_name = xmalloc(strlen(tip_name)+3);
		strcpy(new_name, tip_name);
		strcat(new_name, "^0");
		tip_name = new_name;

		if (generation)
			die("generation: %d, but deref?", generation);
	}

	if (name == NULL) {
		name = xmalloc(sizeof(rev_name));
		commit->util = name;
		goto copy_data;
	} else if (name->distance > distance) {
copy_data:
		name->tip_name = tip_name;
		name->generation = generation;
		name->distance = distance;
	} else
		return;

	for (parents = commit->parents;
			parents;
			parents = parents->next, parent_number++) {
		if (parent_number > 1) {
			int len = strlen(tip_name);
			char *new_name = xmalloc(len +
				1 + decimal_length(generation) +  /* ~<n> */
				1 + 2 +				  /* ^NN */
				1);

			if (len > 2 && !strcmp(tip_name + len - 2, "^0"))
				len -= 2;
			if (generation > 0)
				sprintf(new_name, "%.*s~%d^%d", len, tip_name,
						generation, parent_number);
			else
				sprintf(new_name, "%.*s^%d", len, tip_name,
						parent_number);

			name_rev(parents->item, new_name, 0,
				distance + MERGE_TRAVERSAL_WEIGHT, 0);
		} else {
			name_rev(parents->item, tip_name, generation + 1,
				distance + 1, 0);
		}
	}
}

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

	while (subpath) {
		if (!fnmatch(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 (!prefixcmp(refname, "refs/heads/"))
		refname = refname + 11;
	else if (!prefixcmp(refname, "refs/"))
		refname = refname + 5;
	return refname;
}

struct name_ref_data {
	int tags_only;
	int name_only;
	const char *ref_filter;
};

static struct tip_table {
	struct tip_table_entry {
		unsigned char sha1[20];
		const char *refname;
	} *table;
	int nr;
	int alloc;
	int sorted;
} tip_table;

static void add_to_tip_table(const unsigned char *sha1, 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);
	hashcpy(tip_table.table[tip_table.nr].sha1, sha1);
	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 hashcmp(a->sha1, b->sha1);
}

static int name_ref(const char *path, const unsigned char *sha1, int flags, void *cb_data)
{
	struct object *o = parse_object(sha1);
	struct name_ref_data *data = cb_data;
	int can_abbreviate_output = data->tags_only && data->name_only;
	int deref = 0;

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

	if (data->ref_filter) {
		switch (subpath_matches(path, data->ref_filter)) {
		case -1: /* did not match */
			return 0;
		case 0:  /* matched fully */
			break;
		default: /* matched subpath */
			can_abbreviate_output = 1;
			break;
		}
	}

	add_to_tip_table(sha1, 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(t->tagged->sha1);
		deref = 1;
	}
	if (o && o->type == OBJ_COMMIT) {
		struct commit *commit = (struct commit *)o;

		path = name_ref_abbrev(path, can_abbreviate_output);
		name_rev(commit, xstrdup(path), 0, 0, 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].sha1;
}

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, sizeof(*tip_table.table),
		      tipcmp);
		tip_table.sorted = 1;
	}

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

/* returns a static buffer */
static const char *get_rev_name(const struct object *o)
{
	static char buffer[1024];
	struct rev_name *n;
	struct commit *c;

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

	if (!n->generation)
		return n->tip_name;
	else {
		int len = strlen(n->tip_name);
		if (len > 2 && !strcmp(n->tip_name + len - 2, "^0"))
			len -= 2;
		snprintf(buffer, sizeof(buffer), "%.*s~%d", len, n->tip_name,
				n->generation);

		return buffer;
	}
}

static void show_name(const struct object *obj,
		      const char *caller_name,
		      int always, int allow_undefined, int name_only)
{
	const char *name;
	const unsigned char *sha1 = obj->sha1;

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

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)
{
	int forty = 0;
	char *p_start;
	for (p_start = p; *p; p++) {
#define ishex(x) (isdigit((x)) || ((x) >= 'a' && (x) <= 'f'))
		if (!ishex(*p))
			forty = 0;
		else if (++forty == 40 &&
			 !ishex(*(p+1))) {
			unsigned char sha1[40];
			const char *name = NULL;
			char c = *(p+1);
			int p_len = p - p_start + 1;

			forty = 0;

			*(p+1) = 0;
			if (!get_sha1(p - 39, sha1)) {
				struct object *o =
					lookup_object(sha1);
				if (o)
					name = get_rev_name(o);
			}
			*(p+1) = c;

			if (!name)
				continue;

			if (data->name_only)
				printf("%.*s%s", p_len - 40, 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);
}

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, NULL };
	struct option opts[] = {
		OPT_BOOLEAN(0, "name-only", &data.name_only, N_("print only names (no SHA-1)")),
		OPT_BOOLEAN(0, "tags", &data.tags_only, N_("only use tags to name the commits")),
		OPT_STRING(0, "refs", &data.ref_filter, N_("pattern"),
				   N_("only use refs matching <pattern>")),
		OPT_GROUP(""),
		OPT_BOOLEAN(0, "all", &all, N_("list all commits reachable from all refs")),
		OPT_BOOLEAN(0, "stdin", &transform_stdin, N_("read from stdin")),
		OPT_BOOLEAN(0, "undefined", &allow_undefined, N_("allow to print `undefined` names")),
		OPT_BOOLEAN(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(),
	};

	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++) {
		unsigned char sha1[20];
		struct object *object;
		struct commit *commit;

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

		commit = NULL;
		object = parse_object(sha1);
		if (object) {
			struct object *peeled = deref_tag(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)
		cutoff = cutoff - CUTOFF_DATE_SLOP;
	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);
	}

	return 0;
}
Commit	Line	Data
d6b64ed0	1	#include "builtin.h"
bd321bcc JS	2	#include "cache.h"
	3	#include "commit.h"
	4	#include "tag.h"
	5	#include "refs.h"
edefb1a2	6	#include "parse-options.h"
b23e0b93	7	#include "sha1-lookup.h"
bd321bcc	8
c075aea5 JH	9	#define CUTOFF_DATE_SLOP 86400 /* one day */
c075aea5 JH	10
bd321bcc JS	11	typedef struct rev_name {
bd321bcc JS	12	const char *tip_name;
bd321bcc	13	int generation;
ac076c29	14	int distance;
bd321bcc JS	15	} rev_name;
	16
	17	static long cutoff = LONG_MAX;
	18
ac076c29 JS	19	/* How many generations are maximally preferred over _one_ merge traversal? */
	20	#define MERGE_TRAVERSAL_WEIGHT 65535
	21
bd321bcc	22	static void name_rev(struct commit *commit,
ac076c29	23	const char *tip_name, int generation, int distance,
bd321bcc JS	24	int deref)
bd321bcc JS	25	{
d3ff6f55	26	struct rev_name name = (struct rev_name )commit->util;
bd321bcc	27	struct commit_list *parents;
f2e6f1c9	28	int parent_number = 1;
bd321bcc JS	29
	30	if (!commit->object.parsed)
	31	parse_commit(commit);
	32
	33	if (commit->date < cutoff)
	34	return;
	35
	36	if (deref) {
	37	char *new_name = xmalloc(strlen(tip_name)+3);
	38	strcpy(new_name, tip_name);
	39	strcat(new_name, "^0");
	40	tip_name = new_name;
	41
	42	if (generation)
	43	die("generation: %d, but deref?", generation);
	44	}
	45
	46	if (name == NULL) {
	47	name = xmalloc(sizeof(rev_name));
d3ff6f55	48	commit->util = name;
bd321bcc	49	goto copy_data;
ac076c29	50	} else if (name->distance > distance) {
bd321bcc JS	51	copy_data:
bd321bcc JS	52	name->tip_name = tip_name;
bd321bcc	53	name->generation = generation;
ac076c29	54	name->distance = distance;
bd321bcc JS	55	} else
	56	return;
	57
	58	for (parents = commit->parents;
	59	parents;
	60	parents = parents->next, parent_number++) {
f2e6f1c9	61	if (parent_number > 1) {
59d3f541	62	int len = strlen(tip_name);
cf606e3d AW	63	char *new_name = xmalloc(len +
	64	1 + decimal_length(generation) + /* ~<n> */
	65	1 + 2 + /* ^NN */
	66	1);
bd321bcc	67
59d3f541 JS	68	if (len > 2 && !strcmp(tip_name + len - 2, "^0"))
59d3f541 JS	69	len -= 2;
bd321bcc	70	if (generation > 0)
59d3f541	71	sprintf(new_name, "%.*s~%d^%d", len, tip_name,
bd321bcc JS	72	generation, parent_number);
bd321bcc JS	73	else
59d3f541 JS	74	sprintf(new_name, "%.*s^%d", len, tip_name,
59d3f541 JS	75	parent_number);
bd321bcc	76
ac076c29 JS	77	name_rev(parents->item, new_name, 0,
ac076c29 JS	78	distance + MERGE_TRAVERSAL_WEIGHT, 0);
bd321bcc	79	} else {
ac076c29 JS	80	name_rev(parents->item, tip_name, generation + 1,
ac076c29 JS	81	distance + 1, 0);
bd321bcc JS	82	}
	83	}
	84	}
	85
98c5c4ad NK	86	static int subpath_matches(const char path, const char filter)
	87	{
	88	const char *subpath = path;
	89
	90	while (subpath) {
	91	if (!fnmatch(filter, subpath, 0))
	92	return subpath - path;
	93	subpath = strchr(subpath, '/');
	94	if (subpath)
	95	subpath++;
	96	}
	97	return -1;
	98	}
	99
9608a190 JH	100	static const char name_ref_abbrev(const char refname, int shorten_unambiguous)
	101	{
	102	if (shorten_unambiguous)
	103	refname = shorten_unambiguous_ref(refname, 0);
	104	else if (!prefixcmp(refname, "refs/heads/"))
	105	refname = refname + 11;
	106	else if (!prefixcmp(refname, "refs/"))
	107	refname = refname + 5;
	108	return refname;
	109	}
	110
2afc29aa JS	111	struct name_ref_data {
2afc29aa JS	112	int tags_only;
23615708	113	int name_only;
2afc29aa JS	114	const char *ref_filter;
	115	};
	116
b23e0b93 JH	117	static struct tip_table {
	118	struct tip_table_entry {
	119	unsigned char sha1[20];
	120	const char *refname;
	121	} *table;
	122	int nr;
	123	int alloc;
	124	int sorted;
	125	} tip_table;
	126
	127	static void add_to_tip_table(const unsigned char sha1, const char refname,
	128	int shorten_unambiguous)
	129	{
	130	refname = name_ref_abbrev(refname, shorten_unambiguous);
	131
	132	ALLOC_GROW(tip_table.table, tip_table.nr + 1, tip_table.alloc);
	133	hashcpy(tip_table.table[tip_table.nr].sha1, sha1);
	134	tip_table.table[tip_table.nr].refname = xstrdup(refname);
	135	tip_table.nr++;
	136	tip_table.sorted = 0;
	137	}
	138
	139	static int tipcmp(const void a_, const void b_)
	140	{
	141	const struct tip_table_entry a = a_, b = b_;
	142	return hashcmp(a->sha1, b->sha1);
	143	}
	144
8da19775	145	static int name_ref(const char path, const unsigned char sha1, int flags, void *cb_data)
bd321bcc JS	146	{
bd321bcc JS	147	struct object *o = parse_object(sha1);
2afc29aa	148	struct name_ref_data *data = cb_data;
98c5c4ad	149	int can_abbreviate_output = data->tags_only && data->name_only;
bd321bcc JS	150	int deref = 0;
bd321bcc JS	151
cc44c765	152	if (data->tags_only && prefixcmp(path, "refs/tags/"))
2afc29aa JS	153	return 0;
2afc29aa JS	154
98c5c4ad NK	155	if (data->ref_filter) {
	156	switch (subpath_matches(path, data->ref_filter)) {
	157	case -1: /* did not match */
	158	return 0;
	159	case 0: /* matched fully */
	160	break;
	161	default: /* matched subpath */
	162	can_abbreviate_output = 1;
	163	break;
	164	}
	165	}
bd321bcc	166
b23e0b93 JH	167	add_to_tip_table(sha1, path, can_abbreviate_output);
b23e0b93 JH	168
1974632c	169	while (o && o->type == OBJ_TAG) {
bd321bcc JS	170	struct tag t = (struct tag ) o;
	171	if (!t->tagged)
	172	break; /* broken repository */
	173	o = parse_object(t->tagged->sha1);
	174	deref = 1;
	175	}
1974632c	176	if (o && o->type == OBJ_COMMIT) {
bd321bcc	177	struct commit commit = (struct commit )o;
bd321bcc	178
9608a190	179	path = name_ref_abbrev(path, can_abbreviate_output);
9befac47	180	name_rev(commit, xstrdup(path), 0, 0, deref);
bd321bcc JS	181	}
	182	return 0;
	183	}
	184
b23e0b93 JH	185	static const unsigned char nth_tip_table_ent(size_t ix, void table_)
	186	{
	187	struct tip_table_entry *table = table_;
	188	return table[ix].sha1;
	189	}
	190
	191	static const char get_exact_ref_match(const struct object o)
	192	{
	193	int found;
	194
	195	if (!tip_table.table \|\| !tip_table.nr)
	196	return NULL;
	197
	198	if (!tip_table.sorted) {
	199	qsort(tip_table.table, tip_table.nr, sizeof(*tip_table.table),
	200	tipcmp);
	201	tip_table.sorted = 1;
	202	}
	203
	204	found = sha1_pos(o->sha1, tip_table.table, tip_table.nr,
	205	nth_tip_table_ent);
	206	if (0 <= found)
	207	return tip_table.table[found].refname;
	208	return NULL;
	209	}
	210
bd321bcc	211	/* returns a static buffer */
da2478db	212	static const char get_rev_name(const struct object o)
bd321bcc JS	213	{
bd321bcc JS	214	static char buffer[1024];
d3ff6f55 LT	215	struct rev_name *n;
	216	struct commit *c;
	217
1974632c	218	if (o->type != OBJ_COMMIT)
b23e0b93	219	return get_exact_ref_match(o);
d3ff6f55 LT	220	c = (struct commit *) o;
d3ff6f55 LT	221	n = c->util;
bd321bcc	222	if (!n)
a2cf9f44	223	return NULL;
bd321bcc JS	224
	225	if (!n->generation)
	226	return n->tip_name;
59d3f541 JS	227	else {
	228	int len = strlen(n->tip_name);
	229	if (len > 2 && !strcmp(n->tip_name + len - 2, "^0"))
	230	len -= 2;
	231	snprintf(buffer, sizeof(buffer), "%.*s~%d", len, n->tip_name,
	232	n->generation);
	233
	234	return buffer;
	235	}
bd321bcc	236	}
1f1e895f	237
da2478db JH	238	static void show_name(const struct object *obj,
	239	const char *caller_name,
	240	int always, int allow_undefined, int name_only)
	241	{
	242	const char *name;
	243	const unsigned char *sha1 = obj->sha1;
	244
	245	if (!name_only)
	246	printf("%s ", caller_name ? caller_name : sha1_to_hex(sha1));
	247	name = get_rev_name(obj);
	248	if (name)
	249	printf("%s\n", name);
	250	else if (allow_undefined)
	251	printf("undefined\n");
	252	else if (always)
	253	printf("%s\n", find_unique_abbrev(sha1, DEFAULT_ABBREV));
	254	else
	255	die("cannot describe '%s'", sha1_to_hex(sha1));
	256	}
	257
edefb1a2	258	static char const * const name_rev_usage[] = {
422cad0a NTND	259	N_("git name-rev [options] <commit>..."),
	260	N_("git name-rev [options] --all"),
	261	N_("git name-rev [options] --stdin"),
edefb1a2 PH	262	NULL
	263	};
	264
e8b55fab JH	265	static void name_rev_line(char p, struct name_ref_data data)
	266	{
	267	int forty = 0;
	268	char *p_start;
	269	for (p_start = p; *p; p++) {
	270	#define ishex(x) (isdigit((x)) \|\| ((x) >= 'a' && (x) <= 'f'))
	271	if (!ishex(*p))
	272	forty = 0;
	273	else if (++forty == 40 &&
	274	!ishex(*(p+1))) {
	275	unsigned char sha1[40];
	276	const char *name = NULL;
	277	char c = *(p+1);
7c5b1675	278	int p_len = p - p_start + 1;
e8b55fab JH	279
	280	forty = 0;
	281
	282	*(p+1) = 0;
	283	if (!get_sha1(p - 39, sha1)) {
	284	struct object *o =
	285	lookup_object(sha1);
	286	if (o)
	287	name = get_rev_name(o);
	288	}
	289	*(p+1) = c;
	290
	291	if (!name)
	292	continue;
	293
7c5b1675 RS	294	if (data->name_only)
	295	printf("%.*s%s", p_len - 40, p_start, name);
	296	else
	297	printf("%.*s (%s)", p_len, p_start, name);
e8b55fab JH	298	p_start = p + 1;
	299	}
	300	}
	301
	302	/* flush */
	303	if (p_start != p)
	304	fwrite(p_start, p - p_start, 1, stdout);
	305	}
	306
d6b64ed0	307	int cmd_name_rev(int argc, const char *argv, const char prefix)
bd321bcc	308	{
3cd47459	309	struct object_array revs = OBJECT_ARRAY_INIT;
adfc1857	310	int all = 0, transform_stdin = 0, allow_undefined = 1, always = 0, peel_tag = 0;
23615708	311	struct name_ref_data data = { 0, 0, NULL };
edefb1a2	312	struct option opts[] = {
422cad0a NTND	313	OPT_BOOLEAN(0, "name-only", &data.name_only, N_("print only names (no SHA-1)")),
	314	OPT_BOOLEAN(0, "tags", &data.tags_only, N_("only use tags to name the commits")),
	315	OPT_STRING(0, "refs", &data.ref_filter, N_("pattern"),
	316	N_("only use refs matching <pattern>")),
edefb1a2	317	OPT_GROUP(""),
422cad0a NTND	318	OPT_BOOLEAN(0, "all", &all, N_("list all commits reachable from all refs")),
	319	OPT_BOOLEAN(0, "stdin", &transform_stdin, N_("read from stdin")),
	320	OPT_BOOLEAN(0, "undefined", &allow_undefined, N_("allow to print `undefined` names")),
da2478db	321	OPT_BOOLEAN(0, "always", &always,
422cad0a	322	N_("show abbreviated commit object as fallback")),
adfc1857 JH	323	{
	324	/* A Hidden OPT_BOOL */
	325	OPTION_SET_INT, 0, "peel-tag", &peel_tag, NULL,
	326	N_("dereference tags in the input (internal use)"),
	327	PARSE_OPT_NOARG \| PARSE_OPT_HIDDEN, NULL, 1,
	328	},
edefb1a2 PH	329	OPT_END(),
edefb1a2 PH	330	};
bd321bcc	331
ef90d6d4	332	git_config(git_default_config, NULL);
37782920	333	argc = parse_options(argc, argv, prefix, opts, name_rev_usage, 0);
edefb1a2 PH	334	if (!!all + !!transform_stdin + !!argc > 1) {
	335	error("Specify either a list, or --all, not both!");
	336	usage_with_options(name_rev_usage, opts);
	337	}
	338	if (all \|\| transform_stdin)
	339	cutoff = 0;
bd321bcc	340
edefb1a2	341	for (; argc; argc--, argv++) {
bd321bcc	342	unsigned char sha1[20];
118aa4ac	343	struct object *object;
bd321bcc JS	344	struct commit *commit;
bd321bcc JS	345
bd321bcc JS	346	if (get_sha1(*argv, sha1)) {
	347	fprintf(stderr, "Could not get sha1 for %s. Skipping.\n",
	348	*argv);
	349	continue;
	350	}
	351
118aa4ac JH	352	commit = NULL;
	353	object = parse_object(sha1);
	354	if (object) {
	355	struct object peeled = deref_tag(object, argv, 0);
	356	if (peeled && peeled->type == OBJ_COMMIT)
	357	commit = (struct commit *)peeled;
	358	}
	359
	360	if (!object) {
	361	fprintf(stderr, "Could not get object for %s. Skipping.\n",
bd321bcc JS	362	*argv);
	363	continue;
	364	}
	365
118aa4ac JH	366	if (commit) {
	367	if (cutoff > commit->date)
	368	cutoff = commit->date;
	369	}
adfc1857 JH	370
	371	if (peel_tag) {
	372	if (!commit) {
	373	fprintf(stderr, "Could not get commit for %s. Skipping.\n",
	374	*argv);
	375	continue;
	376	}
	377	object = (struct object *)commit;
	378	}
118aa4ac	379	add_object_array(object, *argv, &revs);
bd321bcc JS	380	}
bd321bcc JS	381
c075aea5 JH	382	if (cutoff)
c075aea5 JH	383	cutoff = cutoff - CUTOFF_DATE_SLOP;
2afc29aa	384	for_each_ref(name_ref, &data);
bd321bcc JS	385
	386	if (transform_stdin) {
	387	char buffer[2048];
bd321bcc JS	388
bd321bcc JS	389	while (!feof(stdin)) {
e8b55fab	390	char *p = fgets(buffer, sizeof(buffer), stdin);
bd321bcc JS	391	if (!p)
bd321bcc JS	392	break;
e8b55fab	393	name_rev_line(p, &data);
bd321bcc JS	394	}
bd321bcc JS	395	} else if (all) {
fc046a75	396	int i, max;
bd321bcc	397
fc046a75	398	max = get_max_object_index();
a83123de BS	399	for (i = 0; i < max; i++) {
a83123de BS	400	struct object *obj = get_indexed_object(i);
e8b14d7e	401	if (!obj \|\| obj->type != OBJ_COMMIT)
a83123de BS	402	continue;
a83123de BS	403	show_name(obj, NULL,
da2478db	404	always, allow_undefined, data.name_only);
a83123de	405	}
1f1e895f LT	406	} else {
1f1e895f LT	407	int i;
da2478db JH	408	for (i = 0; i < revs.nr; i++)
	409	show_name(revs.objects[i].item, revs.objects[i].name,
	410	always, allow_undefined, data.name_only);
1f1e895f	411	}
bd321bcc JS	412
	413	return 0;
	414	}