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