243192af5352752472908ab9a61e80fb2b138829
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"
14struct 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};
23static void process_blob(struct traversal_context *ctx,
25 struct blob *blob,
26 struct strbuf *path,
27 const char *name)
28{
29 struct object *obj = &blob->object;
30 size_t pathlen;
31 enum list_objects_filter_result r = LOFR_MARK_SEEN | LOFR_DO_SHOW;
32 if (!ctx->revs->blob_objects)
34 return;
35 if (!obj)
36 die("bad blob object");
37 if (obj->flags & (UNINTERESTING | SEEN))
38 return;
39 /*
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 */
49 if (ctx->revs->exclude_promisor_objects &&
50 !has_object_file(&obj->oid) &&
51 is_promisor_object(&obj->oid))
52 return;
53 pathlen = path->len;
55 strbuf_addstr(path, name);
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);
60 if (r & LOFR_MARK_SEEN)
61 obj->flags |= SEEN;
62 if (r & LOFR_DO_SHOW)
63 ctx->show_object(obj, path->buf, ctx->show_data);
64 strbuf_setlen(path, pathlen);
65}
66/*
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 */
89static void process_gitlink(struct traversal_context *ctx,
90 const unsigned char *sha1,
91 struct strbuf *path,
92 const char *name)
93{
94 /* Nothing to do */
95}
96static void process_tree(struct traversal_context *ctx,
98 struct tree *tree,
99 struct strbuf *base,
100 const char *name);
101static 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 init_tree_desc(&desc, tree->buffer, tree->size);
112 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 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}
136static void process_tree(struct traversal_context *ctx,
138 struct tree *tree,
139 struct strbuf *base,
140 const char *name)
141{
142 struct object *obj = &tree->object;
143 struct rev_info *revs = ctx->revs;
144 int baselen = base->len;
145 enum list_objects_filter_result r = LOFR_MARK_SEEN | LOFR_DO_SHOW;
146 int failed_parse;
147 if (!revs->tree_objects)
149 return;
150 if (!obj)
151 die("bad tree object");
152 if (obj->flags & (UNINTERESTING | SEEN))
153 return;
154 failed_parse = parse_tree_gently(tree, 1);
156 if (failed_parse) {
157 if (revs->ignore_missing_links)
158 return;
159 /*
161 * Pre-filter known-missing tree objects when explicitly
162 * requested. This may cause the actual filter to report
163 * an incomplete list of missing objects.
164 */
165 if (revs->exclude_promisor_objects &&
166 is_promisor_object(&obj->oid))
167 return;
168 if (!revs->do_not_die_on_missing_tree)
170 die("bad tree object %s", oid_to_hex(&obj->oid));
171 }
172 strbuf_addstr(base, name);
174 if (!(obj->flags & USER_GIVEN) && ctx->filter_fn)
175 r = ctx->filter_fn(LOFS_BEGIN_TREE, obj,
176 base->buf, &base->buf[baselen],
177 ctx->filter_data);
178 if (r & LOFR_MARK_SEEN)
179 obj->flags |= SEEN;
180 if (r & LOFR_DO_SHOW)
181 ctx->show_object(obj, base->buf, ctx->show_data);
182 if (base->len)
183 strbuf_addch(base, '/');
184 if (!failed_parse)
186 process_tree_contents(ctx, tree, base);
187 if (!(obj->flags & USER_GIVEN) && ctx->filter_fn) {
189 r = ctx->filter_fn(LOFS_END_TREE, obj,
190 base->buf, &base->buf[baselen],
191 ctx->filter_data);
192 if (r & LOFR_MARK_SEEN)
193 obj->flags |= SEEN;
194 if (r & LOFR_DO_SHOW)
195 ctx->show_object(obj, base->buf, ctx->show_data);
196 }
197 strbuf_setlen(base, baselen);
199 free_tree_buffer(tree);
200}
201static void mark_edge_parents_uninteresting(struct commit *commit,
203 struct rev_info *revs,
204 show_edge_fn show_edge)
205{
206 struct commit_list *parents;
207 for (parents = commit->parents; parents; parents = parents->next) {
209 struct commit *parent = parents->item;
210 if (!(parent->object.flags & UNINTERESTING))
211 continue;
212 mark_tree_uninteresting(get_commit_tree(parent));
213 if (revs->edge_hint && !(parent->object.flags & SHOWN)) {
214 parent->object.flags |= SHOWN;
215 show_edge(parent);
216 }
217 }
218}
219void mark_edges_uninteresting(struct rev_info *revs, show_edge_fn show_edge)
221{
222 struct commit_list *list;
223 int i;
224 for (list = revs->commits; list; list = list->next) {
226 struct commit *commit = list->item;
227 if (commit->object.flags & UNINTERESTING) {
229 mark_tree_uninteresting(get_commit_tree(commit));
230 if (revs->edge_hint_aggressive && !(commit->object.flags & SHOWN)) {
231 commit->object.flags |= SHOWN;
232 show_edge(commit);
233 }
234 continue;
235 }
236 mark_edge_parents_uninteresting(commit, revs, show_edge);
237 }
238 if (revs->edge_hint_aggressive) {
239 for (i = 0; i < revs->cmdline.nr; i++) {
240 struct object *obj = revs->cmdline.rev[i].item;
241 struct commit *commit = (struct commit *)obj;
242 if (obj->type != OBJ_COMMIT || !(obj->flags & UNINTERESTING))
243 continue;
244 mark_tree_uninteresting(get_commit_tree(commit));
245 if (!(obj->flags & SHOWN)) {
246 obj->flags |= SHOWN;
247 show_edge(commit);
248 }
249 }
250 }
251}
252static void add_pending_tree(struct rev_info *revs, struct tree *tree)
254{
255 add_pending_object(revs, &tree->object, "");
256}
257static void traverse_trees_and_blobs(struct traversal_context *ctx,
259 struct strbuf *base)
260{
261 int i;
262 assert(base->len == 0);
264 for (i = 0; i < ctx->revs->pending.nr; i++) {
266 struct object_array_entry *pending = ctx->revs->pending.objects + i;
267 struct object *obj = pending->item;
268 const char *name = pending->name;
269 const char *path = pending->path;
270 if (obj->flags & (UNINTERESTING | SEEN))
271 continue;
272 if (obj->type == OBJ_TAG) {
273 obj->flags |= SEEN;
274 ctx->show_object(obj, name, ctx->show_data);
275 continue;
276 }
277 if (!path)
278 path = "";
279 if (obj->type == OBJ_TREE) {
280 process_tree(ctx, (struct tree *)obj, base, path);
281 continue;
282 }
283 if (obj->type == OBJ_BLOB) {
284 process_blob(ctx, (struct blob *)obj, base, path);
285 continue;
286 }
287 die("unknown pending object %s (%s)",
288 oid_to_hex(&obj->oid), name);
289 }
290 object_array_clear(&ctx->revs->pending);
291}
292static void do_traverse(struct traversal_context *ctx)
294{
295 struct commit *commit;
296 struct strbuf csp; /* callee's scratch pad */
297 strbuf_init(&csp, PATH_MAX);
298 while ((commit = get_revision(ctx->revs)) != NULL) {
300 /*
301 * an uninteresting boundary commit may not have its tree
302 * parsed yet, but we are not going to show them anyway
303 */
304 if (get_commit_tree(commit))
305 add_pending_tree(ctx->revs, get_commit_tree(commit));
306 ctx->show_commit(commit, ctx->show_data);
307 if (ctx->revs->tree_blobs_in_commit_order)
309 /*
310 * NEEDSWORK: Adding the tree and then flushing it here
311 * needs a reallocation for each commit. Can we pass the
312 * tree directory without allocation churn?
313 */
314 traverse_trees_and_blobs(ctx, &csp);
315 }
316 traverse_trees_and_blobs(ctx, &csp);
317 strbuf_release(&csp);
318}
319void traverse_commit_list(struct rev_info *revs,
321 show_commit_fn show_commit,
322 show_object_fn show_object,
323 void *show_data)
324{
325 struct traversal_context ctx;
326 ctx.revs = revs;
327 ctx.show_commit = show_commit;
328 ctx.show_object = show_object;
329 ctx.show_data = show_data;
330 ctx.filter_fn = NULL;
331 ctx.filter_data = NULL;
332 do_traverse(&ctx);
333}
334void traverse_commit_list_filtered(
336 struct list_objects_filter_options *filter_options,
337 struct rev_info *revs,
338 show_commit_fn show_commit,
339 show_object_fn show_object,
340 void *show_data,
341 struct oidset *omitted)
342{
343 struct traversal_context ctx;
344 filter_free_fn filter_free_fn = NULL;
345 ctx.revs = revs;
347 ctx.show_object = show_object;
348 ctx.show_commit = show_commit;
349 ctx.show_data = show_data;
350 ctx.filter_fn = NULL;
351 ctx.filter_data = list_objects_filter__init(omitted, filter_options,
353 &ctx.filter_fn, &filter_free_fn);
354 do_traverse(&ctx);
355 if (ctx.filter_data && filter_free_fn)
356 filter_free_fn(ctx.filter_data);
357}