[thirdparty/git.git] / rev-list.c

#include "cache.h"
#include "refs.h"
#include "tag.h"
#include "commit.h"
#include "tree.h"
#include "blob.h"
#include "epoch.h"

#define SEEN		(1u << 0)
#define INTERESTING	(1u << 1)
#define COUNTED		(1u << 2)
#define SHOWN		(1u << 3)

static const char rev_list_usage[] =
	"git-rev-list [OPTION] commit-id <commit-id>\n"
		      "  --max-count=nr\n"
		      "  --max-age=epoch\n"
		      "  --min-age=epoch\n"
		      "  --parents\n"
		      "  --bisect\n"
		      "  --objects\n"
		      "  --unpacked\n"
		      "  --header\n"
		      "  --pretty\n"
		      "  --no-merges\n"
		      "  --merge-order [ --show-breaks ]\n"
		      "  --topo-order";

static int unpacked = 0;
static int bisect_list = 0;
static int tag_objects = 0;
static int tree_objects = 0;
static int blob_objects = 0;
static int verbose_header = 0;
static int show_parents = 0;
static int hdr_termination = 0;
static const char *commit_prefix = "";
static unsigned long max_age = -1;
static unsigned long min_age = -1;
static int max_count = -1;
static enum cmit_fmt commit_format = CMIT_FMT_RAW;
static int merge_order = 0;
static int show_breaks = 0;
static int stop_traversal = 0;
static int topo_order = 0;
static int no_merges = 0;

static void show_commit(struct commit *commit)
{
	commit->object.flags |= SHOWN;
	if (show_breaks) {
		commit_prefix = "| ";
		if (commit->object.flags & DISCONTINUITY) {
			commit_prefix = "^ ";     
		} else if (commit->object.flags & BOUNDARY) {
			commit_prefix = "= ";
		} 
        }        		
	printf("%s%s", commit_prefix, sha1_to_hex(commit->object.sha1));
	if (show_parents) {
		struct commit_list *parents = commit->parents;
		while (parents) {
			printf(" %s", sha1_to_hex(parents->item->object.sha1));
			parents = parents->next;
		}
	}
	if (commit_format == CMIT_FMT_ONELINE)
		putchar(' ');
	else
		putchar('\n');

	if (verbose_header) {
		static char pretty_header[16384];
		pretty_print_commit(commit_format, commit->buffer, ~0, pretty_header, sizeof(pretty_header));
		printf("%s%c", pretty_header, hdr_termination);
	}
	fflush(stdout);
}

static int filter_commit(struct commit * commit)
{
	if (stop_traversal && (commit->object.flags & BOUNDARY))
		return STOP;
	if (commit->object.flags & (UNINTERESTING|SHOWN))
		return CONTINUE;
	if (min_age != -1 && (commit->date > min_age))
		return CONTINUE;
	if (max_age != -1 && (commit->date < max_age)) {
		stop_traversal=1;
		return CONTINUE;
	}
	if (max_count != -1 && !max_count--)
		return STOP;
	if (no_merges && (commit->parents && commit->parents->next))
		return CONTINUE;
	return DO;
}

static int process_commit(struct commit * commit)
{
	int action=filter_commit(commit);

	if (action == STOP) {
		return STOP;
	}

	if (action == CONTINUE) {
		return CONTINUE;
	}

	show_commit(commit);

	return CONTINUE;
}

static struct object_list **add_object(struct object *obj, struct object_list **p, const char *name)
{
	struct object_list *entry = xmalloc(sizeof(*entry));
	entry->item = obj;
	entry->next = *p;
	entry->name = name;
	*p = entry;
	return &entry->next;
}

static struct object_list **process_blob(struct blob *blob, struct object_list **p, const char *name)
{
	struct object *obj = &blob->object;

	if (!blob_objects)
		return p;
	if (obj->flags & (UNINTERESTING | SEEN))
		return p;
	obj->flags |= SEEN;
	return add_object(obj, p, name);
}

static struct object_list **process_tree(struct tree *tree, struct object_list **p, const char *name)
{
	struct object *obj = &tree->object;
	struct tree_entry_list *entry;

	if (!tree_objects)
		return p;
	if (obj->flags & (UNINTERESTING | SEEN))
		return p;
	if (parse_tree(tree) < 0)
		die("bad tree object %s", sha1_to_hex(obj->sha1));
	obj->flags |= SEEN;
	p = add_object(obj, p, name);
	entry = tree->entries;
	tree->entries = NULL;
	while (entry) {
		struct tree_entry_list *next = entry->next;
		if (entry->directory)
			p = process_tree(entry->item.tree, p, entry->name);
		else
			p = process_blob(entry->item.blob, p, entry->name);
		free(entry);
		entry = next;
	}
	return p;
}

static struct object_list *pending_objects = NULL;

static void show_commit_list(struct commit_list *list)
{
	struct object_list *objects = NULL, **p = &objects, *pending;
	while (list) {
		struct commit *commit = pop_most_recent_commit(&list, SEEN);

		p = process_tree(commit->tree, p, "");
		if (process_commit(commit) == STOP)
			break;
	}
	for (pending = pending_objects; pending; pending = pending->next) {
		struct object *obj = pending->item;
		const char *name = pending->name;
		if (obj->flags & (UNINTERESTING | SEEN))
			continue;
		if (obj->type == tag_type) {
			obj->flags |= SEEN;
			p = add_object(obj, p, name);
			continue;
		}
		if (obj->type == tree_type) {
			p = process_tree((struct tree *)obj, p, name);
			continue;
		}
		if (obj->type == blob_type) {
			p = process_blob((struct blob *)obj, p, name);
			continue;
		}
		die("unknown pending object %s (%s)", sha1_to_hex(obj->sha1), name);
	}
	while (objects) {
		/* An object with name "foo\n0000000000000000000000000000000000000000"
		 * can be used confuse downstream git-pack-objects very badly.
		 */
		const char *ep = strchr(objects->name, '\n');
		if (ep) {
			printf("%s %.*s\n", sha1_to_hex(objects->item->sha1),
			       (int) (ep - objects->name),
			       objects->name);
		}
		else
			printf("%s %s\n", sha1_to_hex(objects->item->sha1), objects->name);
		objects = objects->next;
	}
}

static void mark_blob_uninteresting(struct blob *blob)
{
	if (!blob_objects)
		return;
	if (blob->object.flags & UNINTERESTING)
		return;
	blob->object.flags |= UNINTERESTING;
}

static void mark_tree_uninteresting(struct tree *tree)
{
	struct object *obj = &tree->object;
	struct tree_entry_list *entry;

	if (!tree_objects)
		return;
	if (obj->flags & UNINTERESTING)
		return;
	obj->flags |= UNINTERESTING;
	if (!has_sha1_file(obj->sha1))
		return;
	if (parse_tree(tree) < 0)
		die("bad tree %s", sha1_to_hex(obj->sha1));
	entry = tree->entries;
	tree->entries = NULL;
	while (entry) {
		struct tree_entry_list *next = entry->next;
		if (entry->directory)
			mark_tree_uninteresting(entry->item.tree);
		else
			mark_blob_uninteresting(entry->item.blob);
		free(entry);
		entry = next;
	}
}

static void mark_parents_uninteresting(struct commit *commit)
{
	struct commit_list *parents = commit->parents;

	while (parents) {
		struct commit *commit = parents->item;
		commit->object.flags |= UNINTERESTING;

		/*
		 * Normally we haven't parsed the parent
		 * yet, so we won't have a parent of a parent
		 * here. However, it may turn out that we've
		 * reached this commit some other way (where it
		 * wasn't uninteresting), in which case we need
		 * to mark its parents recursively too..
		 */
		if (commit->parents)
			mark_parents_uninteresting(commit);

		/*
		 * A missing commit is ok iff its parent is marked 
		 * uninteresting.
		 *
		 * We just mark such a thing parsed, so that when
		 * it is popped next time around, we won't be trying
		 * to parse it and get an error.
		 */
		if (!has_sha1_file(commit->object.sha1))
			commit->object.parsed = 1;
		parents = parents->next;
	}
}

static int everybody_uninteresting(struct commit_list *orig)
{
	struct commit_list *list = orig;
	while (list) {
		struct commit *commit = list->item;
		list = list->next;
		if (commit->object.flags & UNINTERESTING)
			continue;
		return 0;
	}
	return 1;
}

/*
 * This is a truly stupid algorithm, but it's only
 * used for bisection, and we just don't care enough.
 *
 * We care just barely enough to avoid recursing for
 * non-merge entries.
 */
static int count_distance(struct commit_list *entry)
{
	int nr = 0;

	while (entry) {
		struct commit *commit = entry->item;
		struct commit_list *p;

		if (commit->object.flags & (UNINTERESTING | COUNTED))
			break;
		nr++;
		commit->object.flags |= COUNTED;
		p = commit->parents;
		entry = p;
		if (p) {
			p = p->next;
			while (p) {
				nr += count_distance(p);
				p = p->next;
			}
		}
	}
	return nr;
}

static void clear_distance(struct commit_list *list)
{
	while (list) {
		struct commit *commit = list->item;
		commit->object.flags &= ~COUNTED;
		list = list->next;
	}
}

static struct commit_list *find_bisection(struct commit_list *list)
{
	int nr, closest;
	struct commit_list *p, *best;

	nr = 0;
	p = list;
	while (p) {
		nr++;
		p = p->next;
	}
	closest = 0;
	best = list;

	p = list;
	while (p) {
		int distance = count_distance(p);
		clear_distance(list);
		if (nr - distance < distance)
			distance = nr - distance;
		if (distance > closest) {
			best = p;
			closest = distance;
		}
		p = p->next;
	}
	if (best)
		best->next = NULL;
	return best;
}

static void mark_edges_uninteresting(struct commit_list *list)
{
	for ( ; list; list = list->next) {
		struct commit_list *parents = list->item->parents;

		for ( ; parents; parents = parents->next) {
			struct commit *commit = parents->item;
			if (commit->object.flags & UNINTERESTING)
				mark_tree_uninteresting(commit->tree);
		}
	}
}

static struct commit_list *limit_list(struct commit_list *list)
{
	struct commit_list *newlist = NULL;
	struct commit_list **p = &newlist;
	while (list) {
		struct commit *commit = pop_most_recent_commit(&list, SEEN);
		struct object *obj = &commit->object;

		if (max_age != -1 && (commit->date < max_age))
			obj->flags |= UNINTERESTING;
		if (unpacked && has_sha1_pack(obj->sha1))
			obj->flags |= UNINTERESTING;
		if (obj->flags & UNINTERESTING) {
			mark_parents_uninteresting(commit);
			if (everybody_uninteresting(list))
				break;
			continue;
		}
		if (min_age != -1 && (commit->date > min_age))
			continue;
		p = &commit_list_insert(commit, p)->next;
	}
	if (tree_objects)
		mark_edges_uninteresting(newlist);
	if (bisect_list)
		newlist = find_bisection(newlist);
	return newlist;
}

static void add_pending_object(struct object *obj, const char *name)
{
	add_object(obj, &pending_objects, name);
}

static struct commit *get_commit_reference(const char *name, unsigned int flags)
{
	unsigned char sha1[20];
	struct object *object;

	if (get_sha1(name, sha1))
		usage(rev_list_usage);
	object = parse_object(sha1);
	if (!object)
		die("bad object %s", name);

	/*
	 * Tag object? Look what it points to..
	 */
	while (object->type == tag_type) {
		struct tag *tag = (struct tag *) object;
		object->flags |= flags;
		if (tag_objects && !(object->flags & UNINTERESTING))
			add_pending_object(object, tag->tag);
		object = parse_object(tag->tagged->sha1);
		if (!object)
			die("bad object %s", sha1_to_hex(tag->tagged->sha1));
	}

	/*
	 * Commit object? Just return it, we'll do all the complex
	 * reachability crud.
	 */
	if (object->type == commit_type) {
		struct commit *commit = (struct commit *)object;
		object->flags |= flags;
		if (parse_commit(commit) < 0)
			die("unable to parse commit %s", name);
		if (flags & UNINTERESTING)
			mark_parents_uninteresting(commit);
		return commit;
	}

	/*
	 * Tree object? Either mark it uniniteresting, or add it
	 * to the list of objects to look at later..
	 */
	if (object->type == tree_type) {
		struct tree *tree = (struct tree *)object;
		if (!tree_objects)
			return NULL;
		if (flags & UNINTERESTING) {
			mark_tree_uninteresting(tree);
			return NULL;
		}
		add_pending_object(object, "");
		return NULL;
	}

	/*
	 * Blob object? You know the drill by now..
	 */
	if (object->type == blob_type) {
		struct blob *blob = (struct blob *)object;
		if (!blob_objects)
			return NULL;
		if (flags & UNINTERESTING) {
			mark_blob_uninteresting(blob);
			return NULL;
		}
		add_pending_object(object, "");
		return NULL;
	}
	die("%s is unknown object", name);
}

static void handle_one_commit(struct commit *com, struct commit_list **lst)
{
	if (!com || com->object.flags & SEEN)
		return;
	com->object.flags |= SEEN;
	commit_list_insert(com, lst);
}

/* for_each_ref() callback does not allow user data -- Yuck. */
static struct commit_list **global_lst;

static int include_one_commit(const char *path, const unsigned char *sha1)
{
	struct commit *com = get_commit_reference(path, 0);
	handle_one_commit(com, global_lst);
	return 0;
}

static void handle_all(struct commit_list **lst)
{
	global_lst = lst;
	for_each_ref(include_one_commit);
	global_lst = NULL;
}

int main(int argc, char **argv)
{
	struct commit_list *list = NULL;
	int i, limited = 0;

	setup_git_directory();
	for (i = 1 ; i < argc; i++) {
		int flags;
		char *arg = argv[i];
		char *dotdot;
		struct commit *commit;

		if (!strncmp(arg, "--max-count=", 12)) {
			max_count = atoi(arg + 12);
			continue;
		}
		if (!strncmp(arg, "--max-age=", 10)) {
			max_age = atoi(arg + 10);
			limited = 1;
			continue;
		}
		if (!strncmp(arg, "--min-age=", 10)) {
			min_age = atoi(arg + 10);
			limited = 1;
			continue;
		}
		if (!strcmp(arg, "--header")) {
			verbose_header = 1;
			continue;
		}
		if (!strncmp(arg, "--pretty", 8)) {
			commit_format = get_commit_format(arg+8);
			verbose_header = 1;
			hdr_termination = '\n';
			if (commit_format == CMIT_FMT_ONELINE)
				commit_prefix = "";
			else
				commit_prefix = "commit ";
			continue;
		}
		if (!strncmp(arg, "--no-merges", 11)) {
			no_merges = 1;
			continue;
		}
		if (!strcmp(arg, "--parents")) {
			show_parents = 1;
			continue;
		}
		if (!strcmp(arg, "--bisect")) {
			bisect_list = 1;
			continue;
		}
		if (!strcmp(arg, "--all")) {
			handle_all(&list);
			continue;
		}
		if (!strcmp(arg, "--objects")) {
			tag_objects = 1;
			tree_objects = 1;
			blob_objects = 1;
			continue;
		}
		if (!strcmp(arg, "--unpacked")) {
			unpacked = 1;
			limited = 1;
			continue;
		}
		if (!strcmp(arg, "--merge-order")) {
		        merge_order = 1;
			continue;
		}
		if (!strcmp(arg, "--show-breaks")) {
			show_breaks = 1;
			continue;
		}
		if (!strcmp(arg, "--topo-order")) {
		        topo_order = 1;
		        limited = 1;
			continue;
		}

		if (show_breaks && !merge_order)
			usage(rev_list_usage);

		flags = 0;
		dotdot = strstr(arg, "..");
		if (dotdot) {
			char *next = dotdot + 2;
			struct commit *exclude = NULL;
			struct commit *include = NULL;
			*dotdot = 0;
			if (!*next)
				next = "HEAD";
			exclude = get_commit_reference(arg, UNINTERESTING);
			include = get_commit_reference(next, 0);
			if (exclude && include) {
				limited = 1;
				handle_one_commit(exclude, &list);
				handle_one_commit(include, &list);
				continue;
			}
			*dotdot = '.';
		}
		if (*arg == '^') {
			flags = UNINTERESTING;
			arg++;
			limited = 1;
		}
		commit = get_commit_reference(arg, flags);
		handle_one_commit(commit, &list);
	}

	save_commit_buffer = verbose_header;
	track_object_refs = 0;

	if (!merge_order) {		
		sort_by_date(&list);
		if (list && !limited && max_count == 1 &&
		    !tag_objects && !tree_objects && !blob_objects) {
			show_commit(list->item);
			return 0;
		}
	        if (limited)
			list = limit_list(list);
		if (topo_order)
			sort_in_topological_order(&list);
		show_commit_list(list);
	} else {
#ifndef NO_OPENSSL
		if (sort_list_in_merge_order(list, &process_commit)) {
			die("merge order sort failed\n");
		}
#else
		die("merge order sort unsupported, OpenSSL not linked");
#endif
	}

	return 0;
}
Commit	Line	Data
64745109	1	#include "cache.h"
e091eb93	2	#include "refs.h"
36f8d174	3	#include "tag.h"
64745109	4	#include "commit.h"
9de48752 LT	5	#include "tree.h"
9de48752 LT	6	#include "blob.h"
a3437b8c	7	#include "epoch.h"
64745109	8
8906300f LT	9	#define SEEN (1u << 0)
8906300f LT	10	#define INTERESTING (1u << 1)
8b3a1e05	11	#define COUNTED (1u << 2)
bce62866	12	#define SHOWN (1u << 3)
8906300f	13
a6f68d47	14	static const char rev_list_usage[] =
54c6870e	15	"git-rev-list [OPTION] commit-id <commit-id>\n"
a6f68d47 LT	16	" --max-count=nr\n"
	17	" --max-age=epoch\n"
	18	" --min-age=epoch\n"
76cd8eb6	19	" --parents\n"
12d2a187 LT	20	" --bisect\n"
	21	" --objects\n"
	22	" --unpacked\n"
9d97aa64	23	" --header\n"
a3437b8c	24	" --pretty\n"
76cd8eb6 JS	25	" --no-merges\n"
	26	" --merge-order [ --show-breaks ]\n"
	27	" --topo-order";
a6f68d47	28
12d2a187	29	static int unpacked = 0;
8b3a1e05	30	static int bisect_list = 0;
3c90f03d	31	static int tag_objects = 0;
9de48752 LT	32	static int tree_objects = 0;
9de48752 LT	33	static int blob_objects = 0;
81f2bb1f LT	34	static int verbose_header = 0;
81f2bb1f LT	35	static int show_parents = 0;
81f2bb1f	36	static int hdr_termination = 0;
d998a089	37	static const char *commit_prefix = "";
81f2bb1f LT	38	static unsigned long max_age = -1;
	39	static unsigned long min_age = -1;
	40	static int max_count = -1;
000182ea	41	static enum cmit_fmt commit_format = CMIT_FMT_RAW;
a3437b8c JS	42	static int merge_order = 0;
a3437b8c JS	43	static int show_breaks = 0;
5e749e25	44	static int stop_traversal = 0;
d2d02a49	45	static int topo_order = 0;
76cd8eb6	46	static int no_merges = 0;
81f2bb1f LT	47
	48	static void show_commit(struct commit *commit)
	49	{
51b1e171	50	commit->object.flags \|= SHOWN;
a3437b8c	51	if (show_breaks) {
d998a089	52	commit_prefix = "\| ";
a3437b8c	53	if (commit->object.flags & DISCONTINUITY) {
d998a089	54	commit_prefix = "^ ";
a3437b8c	55	} else if (commit->object.flags & BOUNDARY) {
d998a089	56	commit_prefix = "= ";
a3437b8c JS	57	}
a3437b8c JS	58	}
d998a089	59	printf("%s%s", commit_prefix, sha1_to_hex(commit->object.sha1));
81f2bb1f LT	60	if (show_parents) {
	61	struct commit_list *parents = commit->parents;
	62	while (parents) {
	63	printf(" %s", sha1_to_hex(parents->item->object.sha1));
	64	parents = parents->next;
	65	}
	66	}
d87449c5 JH	67	if (commit_format == CMIT_FMT_ONELINE)
	68	putchar(' ');
	69	else
	70	putchar('\n');
	71
81f2bb1f	72	if (verbose_header) {
000182ea LT	73	static char pretty_header[16384];
	74	pretty_print_commit(commit_format, commit->buffer, ~0, pretty_header, sizeof(pretty_header));
	75	printf("%s%c", pretty_header, hdr_termination);
7620d39f LT	76	}
7620d39f LT	77	fflush(stdout);
a3437b8c JS	78	}
	79
	80	static int filter_commit(struct commit * commit)
	81	{
d2775a81	82	if (stop_traversal && (commit->object.flags & BOUNDARY))
5e749e25	83	return STOP;
51b1e171	84	if (commit->object.flags & (UNINTERESTING\|SHOWN))
a3437b8c JS	85	return CONTINUE;
	86	if (min_age != -1 && (commit->date > min_age))
	87	return CONTINUE;
5e749e25	88	if (max_age != -1 && (commit->date < max_age)) {
d2775a81	89	stop_traversal=1;
27cfe2e2	90	return CONTINUE;
5e749e25	91	}
a3437b8c JS	92	if (max_count != -1 && !max_count--)
a3437b8c JS	93	return STOP;
76cd8eb6 JS	94	if (no_merges && (commit->parents && commit->parents->next))
76cd8eb6 JS	95	return CONTINUE;
a3437b8c JS	96	return DO;
	97	}
	98
	99	static int process_commit(struct commit * commit)
	100	{
	101	int action=filter_commit(commit);
	102
	103	if (action == STOP) {
	104	return STOP;
	105	}
	106
	107	if (action == CONTINUE) {
	108	return CONTINUE;
81f2bb1f	109	}
a3437b8c JS	110
	111	show_commit(commit);
	112
	113	return CONTINUE;
81f2bb1f LT	114	}
81f2bb1f LT	115
9ce43d1c	116	static struct object_list *add_object(struct object obj, struct object_list *p, const char name)
9de48752 LT	117	{
	118	struct object_list entry = xmalloc(sizeof(entry));
	119	entry->item = obj;
36f8d174	120	entry->next = *p;
9ce43d1c	121	entry->name = name;
9de48752 LT	122	*p = entry;
	123	return &entry->next;
	124	}
	125
9ce43d1c	126	static struct object_list *process_blob(struct blob blob, struct object_list *p, const char name)
9de48752 LT	127	{
	128	struct object *obj = &blob->object;
	129
	130	if (!blob_objects)
	131	return p;
	132	if (obj->flags & (UNINTERESTING \| SEEN))
	133	return p;
	134	obj->flags \|= SEEN;
9ce43d1c	135	return add_object(obj, p, name);
9de48752 LT	136	}
9de48752 LT	137
9ce43d1c	138	static struct object_list *process_tree(struct tree tree, struct object_list *p, const char name)
9de48752 LT	139	{
	140	struct object *obj = &tree->object;
	141	struct tree_entry_list *entry;
	142
	143	if (!tree_objects)
	144	return p;
	145	if (obj->flags & (UNINTERESTING \| SEEN))
	146	return p;
	147	if (parse_tree(tree) < 0)
	148	die("bad tree object %s", sha1_to_hex(obj->sha1));
	149	obj->flags \|= SEEN;
9ce43d1c	150	p = add_object(obj, p, name);
b0d8923e LT	151	entry = tree->entries;
	152	tree->entries = NULL;
	153	while (entry) {
	154	struct tree_entry_list *next = entry->next;
9de48752	155	if (entry->directory)
9ce43d1c	156	p = process_tree(entry->item.tree, p, entry->name);
9de48752	157	else
9ce43d1c	158	p = process_blob(entry->item.blob, p, entry->name);
b0d8923e LT	159	free(entry);
b0d8923e LT	160	entry = next;
9de48752 LT	161	}
	162	return p;
	163	}
	164
36f8d174 LT	165	static struct object_list *pending_objects = NULL;
36f8d174 LT	166
81f2bb1f LT	167	static void show_commit_list(struct commit_list *list)
81f2bb1f LT	168	{
36f8d174	169	struct object_list objects = NULL, p = &objects, pending;
81f2bb1f LT	170	while (list) {
	171	struct commit *commit = pop_most_recent_commit(&list, SEEN);
	172
9ce43d1c	173	p = process_tree(commit->tree, p, "");
a3437b8c	174	if (process_commit(commit) == STOP)
81f2bb1f	175	break;
81f2bb1f	176	}
36f8d174 LT	177	for (pending = pending_objects; pending; pending = pending->next) {
	178	struct object *obj = pending->item;
	179	const char *name = pending->name;
	180	if (obj->flags & (UNINTERESTING \| SEEN))
	181	continue;
	182	if (obj->type == tag_type) {
	183	obj->flags \|= SEEN;
	184	p = add_object(obj, p, name);
	185	continue;
	186	}
	187	if (obj->type == tree_type) {
	188	p = process_tree((struct tree *)obj, p, name);
	189	continue;
	190	}
	191	if (obj->type == blob_type) {
	192	p = process_blob((struct blob *)obj, p, name);
	193	continue;
	194	}
	195	die("unknown pending object %s (%s)", sha1_to_hex(obj->sha1), name);
	196	}
9de48752	197	while (objects) {
c807f771 JH	198	/* An object with name "foo\n0000000000000000000000000000000000000000"
	199	* can be used confuse downstream git-pack-objects very badly.
	200	*/
	201	const char *ep = strchr(objects->name, '\n');
	202	if (ep) {
	203	printf("%s %.*s\n", sha1_to_hex(objects->item->sha1),
	204	(int) (ep - objects->name),
	205	objects->name);
	206	}
	207	else
	208	printf("%s %s\n", sha1_to_hex(objects->item->sha1), objects->name);
9de48752 LT	209	objects = objects->next;
	210	}
	211	}
	212
	213	static void mark_blob_uninteresting(struct blob *blob)
	214	{
	215	if (!blob_objects)
	216	return;
	217	if (blob->object.flags & UNINTERESTING)
	218	return;
	219	blob->object.flags \|= UNINTERESTING;
	220	}
	221
	222	static void mark_tree_uninteresting(struct tree *tree)
	223	{
	224	struct object *obj = &tree->object;
	225	struct tree_entry_list *entry;
	226
	227	if (!tree_objects)
	228	return;
	229	if (obj->flags & UNINTERESTING)
	230	return;
	231	obj->flags \|= UNINTERESTING;
454fbbcd LT	232	if (!has_sha1_file(obj->sha1))
454fbbcd LT	233	return;
9de48752 LT	234	if (parse_tree(tree) < 0)
	235	die("bad tree %s", sha1_to_hex(obj->sha1));
	236	entry = tree->entries;
b0d8923e	237	tree->entries = NULL;
9de48752	238	while (entry) {
b0d8923e	239	struct tree_entry_list *next = entry->next;
9de48752 LT	240	if (entry->directory)
	241	mark_tree_uninteresting(entry->item.tree);
	242	else
	243	mark_blob_uninteresting(entry->item.blob);
b0d8923e LT	244	free(entry);
b0d8923e LT	245	entry = next;
9de48752	246	}
81f2bb1f LT	247	}
81f2bb1f LT	248
8906300f LT	249	static void mark_parents_uninteresting(struct commit *commit)
	250	{
	251	struct commit_list *parents = commit->parents;
	252
	253	while (parents) {
	254	struct commit *commit = parents->item;
	255	commit->object.flags \|= UNINTERESTING;
454fbbcd	256
6c3b84c8 LT	257	/*
	258	* Normally we haven't parsed the parent
	259	* yet, so we won't have a parent of a parent
	260	* here. However, it may turn out that we've
	261	* reached this commit some other way (where it
	262	* wasn't uninteresting), in which case we need
	263	* to mark its parents recursively too..
	264	*/
	265	if (commit->parents)
	266	mark_parents_uninteresting(commit);
	267
454fbbcd LT	268	/*
	269	* A missing commit is ok iff its parent is marked
	270	* uninteresting.
	271	*
	272	* We just mark such a thing parsed, so that when
	273	* it is popped next time around, we won't be trying
	274	* to parse it and get an error.
	275	*/
	276	if (!has_sha1_file(commit->object.sha1))
	277	commit->object.parsed = 1;
8906300f LT	278	parents = parents->next;
	279	}
	280	}
	281
4311d328	282	static int everybody_uninteresting(struct commit_list *orig)
8906300f	283	{
4311d328	284	struct commit_list *list = orig;
8906300f LT	285	while (list) {
	286	struct commit *commit = list->item;
	287	list = list->next;
	288	if (commit->object.flags & UNINTERESTING)
	289	continue;
	290	return 0;
	291	}
	292	return 1;
	293	}
	294
8b3a1e05 LT	295	/*
	296	* This is a truly stupid algorithm, but it's only
	297	* used for bisection, and we just don't care enough.
	298	*
	299	* We care just barely enough to avoid recursing for
	300	* non-merge entries.
	301	*/
	302	static int count_distance(struct commit_list *entry)
	303	{
	304	int nr = 0;
	305
	306	while (entry) {
	307	struct commit *commit = entry->item;
	308	struct commit_list *p;
	309
	310	if (commit->object.flags & (UNINTERESTING \| COUNTED))
	311	break;
	312	nr++;
	313	commit->object.flags \|= COUNTED;
	314	p = commit->parents;
	315	entry = p;
	316	if (p) {
	317	p = p->next;
	318	while (p) {
	319	nr += count_distance(p);
	320	p = p->next;
	321	}
	322	}
	323	}
	324	return nr;
	325	}
	326
3d958064	327	static void clear_distance(struct commit_list *list)
8b3a1e05 LT	328	{
	329	while (list) {
	330	struct commit *commit = list->item;
	331	commit->object.flags &= ~COUNTED;
	332	list = list->next;
	333	}
	334	}
	335
	336	static struct commit_list find_bisection(struct commit_list list)
	337	{
	338	int nr, closest;
	339	struct commit_list p, best;
	340
	341	nr = 0;
	342	p = list;
	343	while (p) {
	344	nr++;
	345	p = p->next;
	346	}
	347	closest = 0;
	348	best = list;
	349
	350	p = list;
	351	while (p) {
	352	int distance = count_distance(p);
	353	clear_distance(list);
	354	if (nr - distance < distance)
	355	distance = nr - distance;
	356	if (distance > closest) {
	357	best = p;
	358	closest = distance;
	359	}
	360	p = p->next;
	361	}
	362	if (best)
	363	best->next = NULL;
	364	return best;
	365	}
	366
5bdbaaa4 LT	367	static void mark_edges_uninteresting(struct commit_list *list)
	368	{
	369	for ( ; list; list = list->next) {
	370	struct commit_list *parents = list->item->parents;
	371
	372	for ( ; parents; parents = parents->next) {
	373	struct commit *commit = parents->item;
	374	if (commit->object.flags & UNINTERESTING)
	375	mark_tree_uninteresting(commit->tree);
	376	}
	377	}
	378	}
	379
6da4016a	380	static struct commit_list limit_list(struct commit_list list)
3b42a63c LT	381	{
	382	struct commit_list *newlist = NULL;
	383	struct commit_list **p = &newlist;
36f8d174	384	while (list) {
3b42a63c LT	385	struct commit *commit = pop_most_recent_commit(&list, SEEN);
	386	struct object *obj = &commit->object;
	387
27cfe2e2 LT	388	if (max_age != -1 && (commit->date < max_age))
27cfe2e2 LT	389	obj->flags \|= UNINTERESTING;
12d2a187 LT	390	if (unpacked && has_sha1_pack(obj->sha1))
12d2a187 LT	391	obj->flags \|= UNINTERESTING;
337cb3fb	392	if (obj->flags & UNINTERESTING) {
3b42a63c LT	393	mark_parents_uninteresting(commit);
	394	if (everybody_uninteresting(list))
	395	break;
	396	continue;
	397	}
27cfe2e2 LT	398	if (min_age != -1 && (commit->date > min_age))
27cfe2e2 LT	399	continue;
3b42a63c	400	p = &commit_list_insert(commit, p)->next;
36f8d174	401	}
5bdbaaa4 LT	402	if (tree_objects)
5bdbaaa4 LT	403	mark_edges_uninteresting(newlist);
8b3a1e05 LT	404	if (bisect_list)
8b3a1e05 LT	405	newlist = find_bisection(newlist);
3b42a63c LT	406	return newlist;
	407	}
	408
36f8d174 LT	409	static void add_pending_object(struct object obj, const char name)
	410	{
	411	add_object(obj, &pending_objects, name);
	412	}
	413
3c90f03d LT	414	static struct commit get_commit_reference(const char name, unsigned int flags)
	415	{
	416	unsigned char sha1[20];
36f8d174	417	struct object *object;
3c90f03d LT	418
	419	if (get_sha1(name, sha1))
	420	usage(rev_list_usage);
36f8d174 LT	421	object = parse_object(sha1);
	422	if (!object)
	423	die("bad object %s", name);
	424
	425	/*
	426	* Tag object? Look what it points to..
	427	*/
013aab82	428	while (object->type == tag_type) {
36f8d174 LT	429	struct tag tag = (struct tag ) object;
	430	object->flags \|= flags;
	431	if (tag_objects && !(object->flags & UNINTERESTING))
	432	add_pending_object(object, tag->tag);
013aab82	433	object = parse_object(tag->tagged->sha1);
7f1335c7 SV	434	if (!object)
7f1335c7 SV	435	die("bad object %s", sha1_to_hex(tag->tagged->sha1));
36f8d174 LT	436	}
	437
	438	/*
	439	* Commit object? Just return it, we'll do all the complex
	440	* reachability crud.
	441	*/
	442	if (object->type == commit_type) {
	443	struct commit commit = (struct commit )object;
	444	object->flags \|= flags;
	445	if (parse_commit(commit) < 0)
	446	die("unable to parse commit %s", name);
454fbbcd LT	447	if (flags & UNINTERESTING)
454fbbcd LT	448	mark_parents_uninteresting(commit);
36f8d174 LT	449	return commit;
	450	}
	451
	452	/*
	453	* Tree object? Either mark it uniniteresting, or add it
	454	* to the list of objects to look at later..
	455	*/
	456	if (object->type == tree_type) {
	457	struct tree tree = (struct tree )object;
	458	if (!tree_objects)
960bba0d	459	return NULL;
36f8d174 LT	460	if (flags & UNINTERESTING) {
	461	mark_tree_uninteresting(tree);
	462	return NULL;
	463	}
	464	add_pending_object(object, "");
	465	return NULL;
	466	}
	467
	468	/*
	469	* Blob object? You know the drill by now..
	470	*/
	471	if (object->type == blob_type) {
	472	struct blob blob = (struct blob )object;
	473	if (!blob_objects)
960bba0d	474	return NULL;
36f8d174 LT	475	if (flags & UNINTERESTING) {
	476	mark_blob_uninteresting(blob);
	477	return NULL;
	478	}
	479	add_pending_object(object, "");
	480	return NULL;
	481	}
	482	die("%s is unknown object", name);
3c90f03d LT	483	}
3c90f03d LT	484
1215879c JH	485	static void handle_one_commit(struct commit com, struct commit_list *lst)
	486	{
	487	if (!com \|\| com->object.flags & SEEN)
	488	return;
	489	com->object.flags \|= SEEN;
	490	commit_list_insert(com, lst);
	491	}
	492
e091eb93 JH	493	/* for_each_ref() callback does not allow user data -- Yuck. */
	494	static struct commit_list **global_lst;
	495
	496	static int include_one_commit(const char path, const unsigned char sha1)
	497	{
	498	struct commit *com = get_commit_reference(path, 0);
	499	handle_one_commit(com, global_lst);
	500	return 0;
	501	}
	502
	503	static void handle_all(struct commit_list **lst)
	504	{
	505	global_lst = lst;
	506	for_each_ref(include_one_commit);
	507	global_lst = NULL;
	508	}
1215879c	509
64745109 LT	510	int main(int argc, char **argv)
64745109 LT	511	{
64745109	512	struct commit_list *list = NULL;
337cb3fb	513	int i, limited = 0;
64745109	514
d998a089	515	setup_git_directory();
fcfda02b	516	for (i = 1 ; i < argc; i++) {
337cb3fb	517	int flags;
fcfda02b	518	char *arg = argv[i];
1215879c	519	char *dotdot;
337cb3fb	520	struct commit *commit;
fcfda02b KS	521
	522	if (!strncmp(arg, "--max-count=", 12)) {
	523	max_count = atoi(arg + 12);
a6f68d47 LT	524	continue;
	525	}
	526	if (!strncmp(arg, "--max-age=", 10)) {
fcfda02b	527	max_age = atoi(arg + 10);
27cfe2e2	528	limited = 1;
a6f68d47 LT	529	continue;
	530	}
	531	if (!strncmp(arg, "--min-age=", 10)) {
fcfda02b	532	min_age = atoi(arg + 10);
27cfe2e2	533	limited = 1;
a6f68d47	534	continue;
fcfda02b	535	}
a6f68d47 LT	536	if (!strcmp(arg, "--header")) {
	537	verbose_header = 1;
	538	continue;
	539	}
000182ea LT	540	if (!strncmp(arg, "--pretty", 8)) {
000182ea LT	541	commit_format = get_commit_format(arg+8);
9d97aa64	542	verbose_header = 1;
9d97aa64	543	hdr_termination = '\n';
d87449c5	544	if (commit_format == CMIT_FMT_ONELINE)
d998a089	545	commit_prefix = "";
d87449c5	546	else
d998a089	547	commit_prefix = "commit ";
9d97aa64 LT	548	continue;
9d97aa64 LT	549	}
76cd8eb6 JS	550	if (!strncmp(arg, "--no-merges", 11)) {
	551	no_merges = 1;
	552	continue;
	553	}
97658004 LT	554	if (!strcmp(arg, "--parents")) {
	555	show_parents = 1;
	556	continue;
	557	}
8b3a1e05 LT	558	if (!strcmp(arg, "--bisect")) {
	559	bisect_list = 1;
	560	continue;
	561	}
e091eb93 JH	562	if (!strcmp(arg, "--all")) {
	563	handle_all(&list);
	564	continue;
	565	}
9de48752	566	if (!strcmp(arg, "--objects")) {
3c90f03d	567	tag_objects = 1;
9de48752 LT	568	tree_objects = 1;
	569	blob_objects = 1;
	570	continue;
	571	}
12d2a187 LT	572	if (!strcmp(arg, "--unpacked")) {
	573	unpacked = 1;
	574	limited = 1;
	575	continue;
	576	}
12ba7eaf	577	if (!strcmp(arg, "--merge-order")) {
a3437b8c JS	578	merge_order = 1;
	579	continue;
	580	}
12ba7eaf	581	if (!strcmp(arg, "--show-breaks")) {
a3437b8c JS	582	show_breaks = 1;
	583	continue;
	584	}
d2d02a49 LT	585	if (!strcmp(arg, "--topo-order")) {
d2d02a49 LT	586	topo_order = 1;
e6c3505b	587	limited = 1;
d2d02a49 LT	588	continue;
d2d02a49 LT	589	}
a6f68d47	590
1215879c JH	591	if (show_breaks && !merge_order)
	592	usage(rev_list_usage);
	593
337cb3fb	594	flags = 0;
1215879c JH	595	dotdot = strstr(arg, "..");
	596	if (dotdot) {
	597	char *next = dotdot + 2;
	598	struct commit *exclude = NULL;
	599	struct commit *include = NULL;
	600	*dotdot = 0;
2a7055ae LT	601	if (!*next)
2a7055ae LT	602	next = "HEAD";
1215879c JH	603	exclude = get_commit_reference(arg, UNINTERESTING);
	604	include = get_commit_reference(next, 0);
	605	if (exclude && include) {
	606	limited = 1;
	607	handle_one_commit(exclude, &list);
	608	handle_one_commit(include, &list);
	609	continue;
	610	}
2a7055ae	611	*dotdot = '.';
1215879c	612	}
337cb3fb LT	613	if (*arg == '^') {
	614	flags = UNINTERESTING;
	615	arg++;
	616	limited = 1;
	617	}
3c90f03d	618	commit = get_commit_reference(arg, flags);
1215879c	619	handle_one_commit(commit, &list);
fcfda02b KS	620	}
fcfda02b KS	621
60ab26de	622	save_commit_buffer = verbose_header;
8805ccac	623	track_object_refs = 0;
60ab26de	624
a3437b8c	625	if (!merge_order) {
a7336ae5	626	sort_by_date(&list);
fe5f51ce LT	627	if (list && !limited && max_count == 1 &&
	628	!tag_objects && !tree_objects && !blob_objects) {
	629	show_commit(list->item);
	630	return 0;
	631	}
17ebe977	632	if (limited)
a3437b8c	633	list = limit_list(list);
d2d02a49 LT	634	if (topo_order)
d2d02a49 LT	635	sort_in_topological_order(&list);
a3437b8c	636	show_commit_list(list);
a3437b8c	637	} else {
dd53c7ab	638	#ifndef NO_OPENSSL
a3437b8c	639	if (sort_list_in_merge_order(list, &process_commit)) {
dd53c7ab	640	die("merge order sort failed\n");
a3437b8c	641	}
dd53c7ab PB	642	#else
	643	die("merge order sort unsupported, OpenSSL not linked");
	644	#endif
a3437b8c	645	}
8906300f	646
64745109 LT	647	return 0;
64745109 LT	648	}