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

#include "cache.h"
#include "tag.h"
#include "commit.h"
#include "tree.h"
#include "blob.h"
#include "diff.h"
#include "tree-walk.h"
#include "revision.h"
#include "list-objects.h"
#include "list-objects-filter.h"
#include "list-objects-filter-options.h"
#include "packfile.h"
#include "object-store.h"

struct traversal_context {
	struct rev_info *revs;
	show_object_fn show_object;
	show_commit_fn show_commit;
	void *show_data;
	filter_object_fn filter_fn;
	void *filter_data;
};

static void process_blob(struct traversal_context *ctx,
			 struct blob *blob,
			 struct strbuf *path,
			 const char *name)
{
	struct object *obj = &blob->object;
	size_t pathlen;
	enum list_objects_filter_result r = LOFR_MARK_SEEN | LOFR_DO_SHOW;

	if (!ctx->revs->blob_objects)
		return;
	if (!obj)
		die("bad blob object");
	if (obj->flags & (UNINTERESTING | SEEN))
		return;

	/*
	 * Pre-filter known-missing objects when explicitly requested.
	 * Otherwise, a missing object error message may be reported
	 * later (depending on other filtering criteria).
	 *
	 * Note that this "--exclude-promisor-objects" pre-filtering
	 * may cause the actual filter to report an incomplete list
	 * of missing objects.
	 */
	if (ctx->revs->exclude_promisor_objects &&
	    !has_object_file(&obj->oid) &&
	    is_promisor_object(&obj->oid))
		return;

	pathlen = path->len;
	strbuf_addstr(path, name);
	if (!(obj->flags & USER_GIVEN) && ctx->filter_fn)
		r = ctx->filter_fn(LOFS_BLOB, obj,
				   path->buf, &path->buf[pathlen],
				   ctx->filter_data);
	if (r & LOFR_MARK_SEEN)
		obj->flags |= SEEN;
	if (r & LOFR_DO_SHOW)
		ctx->show_object(obj, path->buf, ctx->show_data);
	strbuf_setlen(path, pathlen);
}

/*
 * Processing a gitlink entry currently does nothing, since
 * we do not recurse into the subproject.
 *
 * We *could* eventually add a flag that actually does that,
 * which would involve:
 *  - is the subproject actually checked out?
 *  - if so, see if the subproject has already been added
 *    to the alternates list, and add it if not.
 *  - process the commit (or tag) the gitlink points to
 *    recursively.
 *
 * However, it's unclear whether there is really ever any
 * reason to see superprojects and subprojects as such a
 * "unified" object pool (potentially resulting in a totally
 * humongous pack - avoiding which was the whole point of
 * having gitlinks in the first place!).
 *
 * So for now, there is just a note that we *could* follow
 * the link, and how to do it. Whether it necessarily makes
 * any sense what-so-ever to ever do that is another issue.
 */
static void process_gitlink(struct traversal_context *ctx,
			    const unsigned char *sha1,
			    struct strbuf *path,
			    const char *name)
{
	/* Nothing to do */
}

static void process_tree(struct traversal_context *ctx,
			 struct tree *tree,
			 struct strbuf *base,
			 const char *name);

static void process_tree_contents(struct traversal_context *ctx,
				  struct tree *tree,
				  struct strbuf *base)
{
	struct tree_desc desc;
	struct name_entry entry;
	enum interesting match = ctx->revs->diffopt.pathspec.nr == 0 ?
		all_entries_interesting : entry_not_interesting;

	init_tree_desc(&desc, tree->buffer, tree->size);

	while (tree_entry(&desc, &entry)) {
		if (match != all_entries_interesting) {
			match = tree_entry_interesting(&entry, base, 0,
						       &ctx->revs->diffopt.pathspec);
			if (match == all_entries_not_interesting)
				break;
			if (match == entry_not_interesting)
				continue;
		}

		if (S_ISDIR(entry.mode))
			process_tree(ctx,
				     lookup_tree(the_repository, entry.oid),
				     base, entry.path);
		else if (S_ISGITLINK(entry.mode))
			process_gitlink(ctx, entry.oid->hash,
					base, entry.path);
		else
			process_blob(ctx,
				     lookup_blob(the_repository, entry.oid),
				     base, entry.path);
	}
}

static void process_tree(struct traversal_context *ctx,
			 struct tree *tree,
			 struct strbuf *base,
			 const char *name)
{
	struct object *obj = &tree->object;
	struct rev_info *revs = ctx->revs;
	int baselen = base->len;
	enum list_objects_filter_result r = LOFR_MARK_SEEN | LOFR_DO_SHOW;

	if (!revs->tree_objects)
		return;
	if (!obj)
		die("bad tree object");
	if (obj->flags & (UNINTERESTING | SEEN))
		return;
	if (parse_tree_gently(tree, 1) < 0) {
		if (revs->ignore_missing_links)
			return;

		/*
		 * Pre-filter known-missing tree objects when explicitly
		 * requested.  This may cause the actual filter to report
		 * an incomplete list of missing objects.
		 */
		if (revs->exclude_promisor_objects &&
		    is_promisor_object(&obj->oid))
			return;

		die("bad tree object %s", oid_to_hex(&obj->oid));
	}

	strbuf_addstr(base, name);
	if (!(obj->flags & USER_GIVEN) && ctx->filter_fn)
		r = ctx->filter_fn(LOFS_BEGIN_TREE, obj,
				   base->buf, &base->buf[baselen],
				   ctx->filter_data);
	if (r & LOFR_MARK_SEEN)
		obj->flags |= SEEN;
	if (r & LOFR_DO_SHOW)
		ctx->show_object(obj, base->buf, ctx->show_data);
	if (base->len)
		strbuf_addch(base, '/');

	process_tree_contents(ctx, tree, base);

	if (!(obj->flags & USER_GIVEN) && ctx->filter_fn) {
		r = ctx->filter_fn(LOFS_END_TREE, obj,
				   base->buf, &base->buf[baselen],
				   ctx->filter_data);
		if (r & LOFR_MARK_SEEN)
			obj->flags |= SEEN;
		if (r & LOFR_DO_SHOW)
			ctx->show_object(obj, base->buf, ctx->show_data);
	}

	strbuf_setlen(base, baselen);
	free_tree_buffer(tree);
}

static void mark_edge_parents_uninteresting(struct commit *commit,
					    struct rev_info *revs,
					    show_edge_fn show_edge)
{
	struct commit_list *parents;

	for (parents = commit->parents; parents; parents = parents->next) {
		struct commit *parent = parents->item;
		if (!(parent->object.flags & UNINTERESTING))
			continue;
		mark_tree_uninteresting(get_commit_tree(parent));
		if (revs->edge_hint && !(parent->object.flags & SHOWN)) {
			parent->object.flags |= SHOWN;
			show_edge(parent);
		}
	}
}

void mark_edges_uninteresting(struct rev_info *revs, show_edge_fn show_edge)
{
	struct commit_list *list;
	int i;

	for (list = revs->commits; list; list = list->next) {
		struct commit *commit = list->item;

		if (commit->object.flags & UNINTERESTING) {
			mark_tree_uninteresting(get_commit_tree(commit));
			if (revs->edge_hint_aggressive && !(commit->object.flags & SHOWN)) {
				commit->object.flags |= SHOWN;
				show_edge(commit);
			}
			continue;
		}
		mark_edge_parents_uninteresting(commit, revs, show_edge);
	}
	if (revs->edge_hint_aggressive) {
		for (i = 0; i < revs->cmdline.nr; i++) {
			struct object *obj = revs->cmdline.rev[i].item;
			struct commit *commit = (struct commit *)obj;
			if (obj->type != OBJ_COMMIT || !(obj->flags & UNINTERESTING))
				continue;
			mark_tree_uninteresting(get_commit_tree(commit));
			if (!(obj->flags & SHOWN)) {
				obj->flags |= SHOWN;
				show_edge(commit);
			}
		}
	}
}

static void add_pending_tree(struct rev_info *revs, struct tree *tree)
{
	add_pending_object(revs, &tree->object, "");
}

static void traverse_trees_and_blobs(struct traversal_context *ctx,
				     struct strbuf *base)
{
	int i;

	assert(base->len == 0);

	for (i = 0; i < ctx->revs->pending.nr; i++) {
		struct object_array_entry *pending = ctx->revs->pending.objects + i;
		struct object *obj = pending->item;
		const char *name = pending->name;
		const char *path = pending->path;
		if (obj->flags & (UNINTERESTING | SEEN))
			continue;
		if (obj->type == OBJ_TAG) {
			obj->flags |= SEEN;
			ctx->show_object(obj, name, ctx->show_data);
			continue;
		}
		if (!path)
			path = "";
		if (obj->type == OBJ_TREE) {
			process_tree(ctx, (struct tree *)obj, base, path);
			continue;
		}
		if (obj->type == OBJ_BLOB) {
			process_blob(ctx, (struct blob *)obj, base, path);
			continue;
		}
		die("unknown pending object %s (%s)",
		    oid_to_hex(&obj->oid), name);
	}
	object_array_clear(&ctx->revs->pending);
}

static void do_traverse(struct traversal_context *ctx)
{
	struct commit *commit;
	struct strbuf csp; /* callee's scratch pad */
	strbuf_init(&csp, PATH_MAX);

	while ((commit = get_revision(ctx->revs)) != NULL) {
		/*
		 * an uninteresting boundary commit may not have its tree
		 * parsed yet, but we are not going to show them anyway
		 */
		if (get_commit_tree(commit))
			add_pending_tree(ctx->revs, get_commit_tree(commit));
		ctx->show_commit(commit, ctx->show_data);

		if (ctx->revs->tree_blobs_in_commit_order)
			/*
			 * NEEDSWORK: Adding the tree and then flushing it here
			 * needs a reallocation for each commit. Can we pass the
			 * tree directory without allocation churn?
			 */
			traverse_trees_and_blobs(ctx, &csp);
	}
	traverse_trees_and_blobs(ctx, &csp);
	strbuf_release(&csp);
}

void traverse_commit_list(struct rev_info *revs,
			  show_commit_fn show_commit,
			  show_object_fn show_object,
			  void *show_data)
{
	struct traversal_context ctx;
	ctx.revs = revs;
	ctx.show_commit = show_commit;
	ctx.show_object = show_object;
	ctx.show_data = show_data;
	ctx.filter_fn = NULL;
	ctx.filter_data = NULL;
	do_traverse(&ctx);
}

void traverse_commit_list_filtered(
	struct list_objects_filter_options *filter_options,
	struct rev_info *revs,
	show_commit_fn show_commit,
	show_object_fn show_object,
	void *show_data,
	struct oidset *omitted)
{
	struct traversal_context ctx;
	filter_free_fn filter_free_fn = NULL;

	ctx.revs = revs;
	ctx.show_object = show_object;
	ctx.show_commit = show_commit;
	ctx.show_data = show_data;
	ctx.filter_fn = NULL;

	ctx.filter_data = list_objects_filter__init(omitted, filter_options,
						    &ctx.filter_fn, &filter_free_fn);
	do_traverse(&ctx);
	if (ctx.filter_data && filter_free_fn)
		filter_free_fn(ctx.filter_data);
}
Commit	Line	Data
c64ed70d JH	1	#include "cache.h"
	2	#include "tag.h"
	3	#include "commit.h"
	4	#include "tree.h"
	5	#include "blob.h"
	6	#include "diff.h"
	7	#include "tree-walk.h"
	8	#include "revision.h"
	9	#include "list-objects.h"
25ec7bca JH	10	#include "list-objects-filter.h"
25ec7bca JH	11	#include "list-objects-filter-options.h"
df11e196	12	#include "packfile.h"
cbd53a21	13	#include "object-store.h"
c64ed70d	14
f447a499 MD	15	struct traversal_context {
	16	struct rev_info *revs;
	17	show_object_fn show_object;
	18	show_commit_fn show_commit;
	19	void *show_data;
	20	filter_object_fn filter_fn;
	21	void *filter_data;
	22	};
	23
	24	static void process_blob(struct traversal_context *ctx,
c64ed70d	25	struct blob *blob,
bd64516a	26	struct strbuf *path,
f447a499	27	const char *name)
c64ed70d JH	28	{
c64ed70d JH	29	struct object *obj = &blob->object;
de1e67d0	30	size_t pathlen;
25ec7bca	31	enum list_objects_filter_result r = LOFR_MARK_SEEN \| LOFR_DO_SHOW;
c64ed70d	32
f447a499	33	if (!ctx->revs->blob_objects)
c64ed70d	34	return;
a301b0c8 MK	35	if (!obj)
a301b0c8 MK	36	die("bad blob object");
c64ed70d JH	37	if (obj->flags & (UNINTERESTING \| SEEN))
c64ed70d JH	38	return;
de1e67d0	39
df11e196 JT	40	/*
	41	* Pre-filter known-missing objects when explicitly requested.
	42	* Otherwise, a missing object error message may be reported
	43	* later (depending on other filtering criteria).
	44	*
	45	* Note that this "--exclude-promisor-objects" pre-filtering
	46	* may cause the actual filter to report an incomplete list
	47	* of missing objects.
	48	*/
f447a499	49	if (ctx->revs->exclude_promisor_objects &&
df11e196 JT	50	!has_object_file(&obj->oid) &&
	51	is_promisor_object(&obj->oid))
	52	return;
	53
de1e67d0 JK	54	pathlen = path->len;
de1e67d0 JK	55	strbuf_addstr(path, name);
f447a499 MD	56	if (!(obj->flags & USER_GIVEN) && ctx->filter_fn)
	57	r = ctx->filter_fn(LOFS_BLOB, obj,
	58	path->buf, &path->buf[pathlen],
	59	ctx->filter_data);
25ec7bca JH	60	if (r & LOFR_MARK_SEEN)
	61	obj->flags \|= SEEN;
	62	if (r & LOFR_DO_SHOW)
f447a499	63	ctx->show_object(obj, path->buf, ctx->show_data);
de1e67d0	64	strbuf_setlen(path, pathlen);
c64ed70d JH	65	}
c64ed70d JH	66
6e2f441b LT	67	/*
	68	* Processing a gitlink entry currently does nothing, since
	69	* we do not recurse into the subproject.
	70	*
	71	* We could eventually add a flag that actually does that,
	72	* which would involve:
	73	* - is the subproject actually checked out?
	74	* - if so, see if the subproject has already been added
	75	* to the alternates list, and add it if not.
	76	* - process the commit (or tag) the gitlink points to
	77	* recursively.
	78	*
	79	* However, it's unclear whether there is really ever any
	80	* reason to see superprojects and subprojects as such a
	81	* "unified" object pool (potentially resulting in a totally
	82	* humongous pack - avoiding which was the whole point of
	83	* having gitlinks in the first place!).
	84	*
	85	* So for now, there is just a note that we could follow
	86	* the link, and how to do it. Whether it necessarily makes
	87	* any sense what-so-ever to ever do that is another issue.
	88	*/
f447a499	89	static void process_gitlink(struct traversal_context *ctx,
6e2f441b	90	const unsigned char *sha1,
bd64516a	91	struct strbuf *path,
f447a499	92	const char *name)
6e2f441b LT	93	{
	94	/* Nothing to do */
	95	}
	96
92024891 MD	97	static void process_tree(struct traversal_context *ctx,
	98	struct tree *tree,
	99	struct strbuf *base,
	100	const char *name);
	101
	102	static void process_tree_contents(struct traversal_context *ctx,
	103	struct tree *tree,
	104	struct strbuf *base)
	105	{
	106	struct tree_desc desc;
	107	struct name_entry entry;
	108	enum interesting match = ctx->revs->diffopt.pathspec.nr == 0 ?
	109	all_entries_interesting : entry_not_interesting;
	110
	111	init_tree_desc(&desc, tree->buffer, tree->size);
	112
	113	while (tree_entry(&desc, &entry)) {
	114	if (match != all_entries_interesting) {
	115	match = tree_entry_interesting(&entry, base, 0,
	116	&ctx->revs->diffopt.pathspec);
	117	if (match == all_entries_not_interesting)
	118	break;
	119	if (match == entry_not_interesting)
	120	continue;
	121	}
	122
	123	if (S_ISDIR(entry.mode))
	124	process_tree(ctx,
	125	lookup_tree(the_repository, entry.oid),
	126	base, entry.path);
	127	else if (S_ISGITLINK(entry.mode))
	128	process_gitlink(ctx, entry.oid->hash,
	129	base, entry.path);
	130	else
	131	process_blob(ctx,
	132	lookup_blob(the_repository, entry.oid),
	133	base, entry.path);
	134	}
	135	}
	136
f447a499	137	static void process_tree(struct traversal_context *ctx,
c64ed70d	138	struct tree *tree,
cc5fa2fd	139	struct strbuf *base,
f447a499	140	const char *name)
c64ed70d JH	141	{
c64ed70d JH	142	struct object *obj = &tree->object;
f447a499	143	struct rev_info *revs = ctx->revs;
cc5fa2fd	144	int baselen = base->len;
25ec7bca	145	enum list_objects_filter_result r = LOFR_MARK_SEEN \| LOFR_DO_SHOW;
c64ed70d JH	146
	147	if (!revs->tree_objects)
	148	return;
a301b0c8 MK	149	if (!obj)
a301b0c8 MK	150	die("bad tree object");
c64ed70d JH	151	if (obj->flags & (UNINTERESTING \| SEEN))
c64ed70d JH	152	return;
f1d02daa	153	if (parse_tree_gently(tree, 1) < 0) {
2db1a43f VM	154	if (revs->ignore_missing_links)
2db1a43f VM	155	return;
df11e196 JT	156
	157	/*
	158	* Pre-filter known-missing tree objects when explicitly
	159	* requested. This may cause the actual filter to report
	160	* an incomplete list of missing objects.
	161	*/
	162	if (revs->exclude_promisor_objects &&
	163	is_promisor_object(&obj->oid))
	164	return;
	165
f2fd0760	166	die("bad tree object %s", oid_to_hex(&obj->oid));
2db1a43f	167	}
13528ab3	168
13528ab3	169	strbuf_addstr(base, name);
f447a499 MD	170	if (!(obj->flags & USER_GIVEN) && ctx->filter_fn)
	171	r = ctx->filter_fn(LOFS_BEGIN_TREE, obj,
	172	base->buf, &base->buf[baselen],
	173	ctx->filter_data);
25ec7bca JH	174	if (r & LOFR_MARK_SEEN)
	175	obj->flags \|= SEEN;
	176	if (r & LOFR_DO_SHOW)
f447a499	177	ctx->show_object(obj, base->buf, ctx->show_data);
13528ab3 JK	178	if (base->len)
13528ab3 JK	179	strbuf_addch(base, '/');
cc5fa2fd	180
92024891	181	process_tree_contents(ctx, tree, base);
25ec7bca	182
f447a499 MD	183	if (!(obj->flags & USER_GIVEN) && ctx->filter_fn) {
	184	r = ctx->filter_fn(LOFS_END_TREE, obj,
	185	base->buf, &base->buf[baselen],
	186	ctx->filter_data);
25ec7bca JH	187	if (r & LOFR_MARK_SEEN)
	188	obj->flags \|= SEEN;
	189	if (r & LOFR_DO_SHOW)
f447a499	190	ctx->show_object(obj, base->buf, ctx->show_data);
25ec7bca JH	191	}
25ec7bca JH	192
cc5fa2fd	193	strbuf_setlen(base, baselen);
6e454b9a	194	free_tree_buffer(tree);
c64ed70d JH	195	}
c64ed70d JH	196
8d1d8f83 JH	197	static void mark_edge_parents_uninteresting(struct commit *commit,
	198	struct rev_info *revs,
	199	show_edge_fn show_edge)
	200	{
	201	struct commit_list *parents;
	202
	203	for (parents = commit->parents; parents; parents = parents->next) {
	204	struct commit *parent = parents->item;
	205	if (!(parent->object.flags & UNINTERESTING))
	206	continue;
2e27bd77	207	mark_tree_uninteresting(get_commit_tree(parent));
8d1d8f83 JH	208	if (revs->edge_hint && !(parent->object.flags & SHOWN)) {
	209	parent->object.flags \|= SHOWN;
	210	show_edge(parent);
	211	}
	212	}
	213	}
	214
e76a5fb4	215	void mark_edges_uninteresting(struct rev_info *revs, show_edge_fn show_edge)
8d1d8f83	216	{
e76a5fb4	217	struct commit_list *list;
fbd4a703 NTND	218	int i;
fbd4a703 NTND	219
e76a5fb4	220	for (list = revs->commits; list; list = list->next) {
8d1d8f83 JH	221	struct commit *commit = list->item;
	222
	223	if (commit->object.flags & UNINTERESTING) {
2e27bd77	224	mark_tree_uninteresting(get_commit_tree(commit));
1684c1b2	225	if (revs->edge_hint_aggressive && !(commit->object.flags & SHOWN)) {
fbd4a703 NTND	226	commit->object.flags \|= SHOWN;
	227	show_edge(commit);
	228	}
8d1d8f83 JH	229	continue;
	230	}
	231	mark_edge_parents_uninteresting(commit, revs, show_edge);
	232	}
1684c1b2	233	if (revs->edge_hint_aggressive) {
200abe74 JK	234	for (i = 0; i < revs->cmdline.nr; i++) {
	235	struct object *obj = revs->cmdline.rev[i].item;
	236	struct commit commit = (struct commit )obj;
	237	if (obj->type != OBJ_COMMIT \|\| !(obj->flags & UNINTERESTING))
	238	continue;
2e27bd77	239	mark_tree_uninteresting(get_commit_tree(commit));
200abe74 JK	240	if (!(obj->flags & SHOWN)) {
	241	obj->flags \|= SHOWN;
	242	show_edge(commit);
	243	}
fbd4a703 NTND	244	}
fbd4a703 NTND	245	}
8d1d8f83 JH	246	}
8d1d8f83 JH	247
8d2dfc49 LT	248	static void add_pending_tree(struct rev_info revs, struct tree tree)
	249	{
	250	add_pending_object(revs, &tree->object, "");
	251	}
	252
f447a499 MD	253	static void traverse_trees_and_blobs(struct traversal_context *ctx,
f447a499 MD	254	struct strbuf *base)
c64ed70d JH	255	{
c64ed70d JH	256	int i;
c64ed70d	257
91904f56 SB	258	assert(base->len == 0);
91904f56 SB	259
f447a499 MD	260	for (i = 0; i < ctx->revs->pending.nr; i++) {
f447a499 MD	261	struct object_array_entry *pending = ctx->revs->pending.objects + i;
c64ed70d JH	262	struct object *obj = pending->item;
c64ed70d JH	263	const char *name = pending->name;
20739490	264	const char *path = pending->path;
c64ed70d JH	265	if (obj->flags & (UNINTERESTING \| SEEN))
	266	continue;
	267	if (obj->type == OBJ_TAG) {
	268	obj->flags \|= SEEN;
f447a499	269	ctx->show_object(obj, name, ctx->show_data);
c64ed70d JH	270	continue;
c64ed70d JH	271	}
20739490 JK	272	if (!path)
20739490 JK	273	path = "";
c64ed70d	274	if (obj->type == OBJ_TREE) {
f447a499	275	process_tree(ctx, (struct tree *)obj, base, path);
c64ed70d JH	276	continue;
	277	}
	278	if (obj->type == OBJ_BLOB) {
f447a499	279	process_blob(ctx, (struct blob *)obj, base, path);
c64ed70d JH	280	continue;
	281	}
	282	die("unknown pending object %s (%s)",
f2fd0760	283	oid_to_hex(&obj->oid), name);
c64ed70d	284	}
f447a499	285	object_array_clear(&ctx->revs->pending);
91904f56 SB	286	}
91904f56 SB	287
f447a499	288	static void do_traverse(struct traversal_context *ctx)
91904f56 SB	289	{
	290	struct commit *commit;
	291	struct strbuf csp; /* callee's scratch pad */
	292	strbuf_init(&csp, PATH_MAX);
	293
f447a499	294	while ((commit = get_revision(ctx->revs)) != NULL) {
91904f56 SB	295	/*
	296	* an uninteresting boundary commit may not have its tree
	297	* parsed yet, but we are not going to show them anyway
	298	*/
2e27bd77	299	if (get_commit_tree(commit))
f447a499 MD	300	add_pending_tree(ctx->revs, get_commit_tree(commit));
f447a499 MD	301	ctx->show_commit(commit, ctx->show_data);
ce5b6f9b	302
f447a499	303	if (ctx->revs->tree_blobs_in_commit_order)
ce5b6f9b SB	304	/*
	305	* NEEDSWORK: Adding the tree and then flushing it here
	306	* needs a reallocation for each commit. Can we pass the
	307	* tree directory without allocation churn?
	308	*/
f447a499	309	traverse_trees_and_blobs(ctx, &csp);
91904f56	310	}
f447a499	311	traverse_trees_and_blobs(ctx, &csp);
91904f56	312	strbuf_release(&csp);
c64ed70d	313	}
25ec7bca JH	314
	315	void traverse_commit_list(struct rev_info *revs,
	316	show_commit_fn show_commit,
	317	show_object_fn show_object,
	318	void *show_data)
	319	{
f447a499 MD	320	struct traversal_context ctx;
	321	ctx.revs = revs;
	322	ctx.show_commit = show_commit;
	323	ctx.show_object = show_object;
	324	ctx.show_data = show_data;
	325	ctx.filter_fn = NULL;
	326	ctx.filter_data = NULL;
	327	do_traverse(&ctx);
25ec7bca JH	328	}
	329
	330	void traverse_commit_list_filtered(
	331	struct list_objects_filter_options *filter_options,
	332	struct rev_info *revs,
	333	show_commit_fn show_commit,
	334	show_object_fn show_object,
	335	void *show_data,
	336	struct oidset *omitted)
	337	{
f447a499	338	struct traversal_context ctx;
25ec7bca	339	filter_free_fn filter_free_fn = NULL;
f447a499 MD	340
	341	ctx.revs = revs;
	342	ctx.show_object = show_object;
	343	ctx.show_commit = show_commit;
	344	ctx.show_data = show_data;
	345	ctx.filter_fn = NULL;
	346
	347	ctx.filter_data = list_objects_filter__init(omitted, filter_options,
	348	&ctx.filter_fn, &filter_free_fn);
	349	do_traverse(&ctx);
	350	if (ctx.filter_data && filter_free_fn)
	351	filter_free_fn(ctx.filter_data);
25ec7bca	352	}