]>
Commit | Line | Data |
---|---|---|
1 | #include "git-compat-util.h" | |
2 | #include "tag.h" | |
3 | #include "commit.h" | |
4 | #include "gettext.h" | |
5 | #include "hex.h" | |
6 | #include "tree.h" | |
7 | #include "blob.h" | |
8 | #include "diff.h" | |
9 | #include "tree-walk.h" | |
10 | #include "revision.h" | |
11 | #include "list-objects.h" | |
12 | #include "list-objects-filter.h" | |
13 | #include "list-objects-filter-options.h" | |
14 | #include "packfile.h" | |
15 | #include "object-store-ll.h" | |
16 | #include "trace.h" | |
17 | ||
18 | struct traversal_context { | |
19 | struct rev_info *revs; | |
20 | show_object_fn show_object; | |
21 | show_commit_fn show_commit; | |
22 | void *show_data; | |
23 | struct filter *filter; | |
24 | }; | |
25 | ||
26 | static void show_commit(struct traversal_context *ctx, | |
27 | struct commit *commit) | |
28 | { | |
29 | if (!ctx->show_commit) | |
30 | return; | |
31 | ctx->show_commit(commit, ctx->show_data); | |
32 | } | |
33 | ||
34 | static void show_object(struct traversal_context *ctx, | |
35 | struct object *object, | |
36 | const char *name) | |
37 | { | |
38 | if (!ctx->show_object) | |
39 | return; | |
40 | ctx->show_object(object, name, ctx->show_data); | |
41 | } | |
42 | ||
43 | static void process_blob(struct traversal_context *ctx, | |
44 | struct blob *blob, | |
45 | struct strbuf *path, | |
46 | const char *name) | |
47 | { | |
48 | struct object *obj = &blob->object; | |
49 | size_t pathlen; | |
50 | enum list_objects_filter_result r; | |
51 | ||
52 | if (!ctx->revs->blob_objects) | |
53 | return; | |
54 | if (!obj) | |
55 | die("bad blob object"); | |
56 | if (obj->flags & (UNINTERESTING | SEEN)) | |
57 | return; | |
58 | ||
59 | /* | |
60 | * Pre-filter known-missing objects when explicitly requested. | |
61 | * Otherwise, a missing object error message may be reported | |
62 | * later (depending on other filtering criteria). | |
63 | * | |
64 | * Note that this "--exclude-promisor-objects" pre-filtering | |
65 | * may cause the actual filter to report an incomplete list | |
66 | * of missing objects. | |
67 | */ | |
68 | if (ctx->revs->exclude_promisor_objects && | |
69 | !repo_has_object_file(the_repository, &obj->oid) && | |
70 | is_promisor_object(&obj->oid)) | |
71 | return; | |
72 | ||
73 | pathlen = path->len; | |
74 | strbuf_addstr(path, name); | |
75 | r = list_objects_filter__filter_object(ctx->revs->repo, | |
76 | LOFS_BLOB, obj, | |
77 | path->buf, &path->buf[pathlen], | |
78 | ctx->filter); | |
79 | if (r & LOFR_MARK_SEEN) | |
80 | obj->flags |= SEEN; | |
81 | if (r & LOFR_DO_SHOW) | |
82 | show_object(ctx, obj, path->buf); | |
83 | strbuf_setlen(path, pathlen); | |
84 | } | |
85 | ||
86 | static void process_tree(struct traversal_context *ctx, | |
87 | struct tree *tree, | |
88 | struct strbuf *base, | |
89 | const char *name); | |
90 | ||
91 | static void process_tree_contents(struct traversal_context *ctx, | |
92 | struct tree *tree, | |
93 | struct strbuf *base) | |
94 | { | |
95 | struct tree_desc desc; | |
96 | struct name_entry entry; | |
97 | enum interesting match = ctx->revs->diffopt.pathspec.nr == 0 ? | |
98 | all_entries_interesting : entry_not_interesting; | |
99 | ||
100 | init_tree_desc(&desc, tree->buffer, tree->size); | |
101 | ||
102 | while (tree_entry(&desc, &entry)) { | |
103 | if (match != all_entries_interesting) { | |
104 | match = tree_entry_interesting(ctx->revs->repo->index, | |
105 | &entry, base, | |
106 | &ctx->revs->diffopt.pathspec); | |
107 | if (match == all_entries_not_interesting) | |
108 | break; | |
109 | if (match == entry_not_interesting) | |
110 | continue; | |
111 | } | |
112 | ||
113 | if (S_ISDIR(entry.mode)) { | |
114 | struct tree *t = lookup_tree(ctx->revs->repo, &entry.oid); | |
115 | if (!t) { | |
116 | die(_("entry '%s' in tree %s has tree mode, " | |
117 | "but is not a tree"), | |
118 | entry.path, oid_to_hex(&tree->object.oid)); | |
119 | } | |
120 | t->object.flags |= NOT_USER_GIVEN; | |
121 | process_tree(ctx, t, base, entry.path); | |
122 | } | |
123 | else if (S_ISGITLINK(entry.mode)) | |
124 | ; /* ignore gitlink */ | |
125 | else { | |
126 | struct blob *b = lookup_blob(ctx->revs->repo, &entry.oid); | |
127 | if (!b) { | |
128 | die(_("entry '%s' in tree %s has blob mode, " | |
129 | "but is not a blob"), | |
130 | entry.path, oid_to_hex(&tree->object.oid)); | |
131 | } | |
132 | b->object.flags |= NOT_USER_GIVEN; | |
133 | process_blob(ctx, b, base, entry.path); | |
134 | } | |
135 | } | |
136 | } | |
137 | ||
138 | static void process_tree(struct traversal_context *ctx, | |
139 | struct tree *tree, | |
140 | struct strbuf *base, | |
141 | const char *name) | |
142 | { | |
143 | struct object *obj = &tree->object; | |
144 | struct rev_info *revs = ctx->revs; | |
145 | int baselen = base->len; | |
146 | enum list_objects_filter_result r; | |
147 | int failed_parse; | |
148 | ||
149 | if (!revs->tree_objects) | |
150 | return; | |
151 | if (!obj) | |
152 | die("bad tree object"); | |
153 | if (obj->flags & (UNINTERESTING | SEEN)) | |
154 | return; | |
155 | if (revs->include_check_obj && | |
156 | !revs->include_check_obj(&tree->object, revs->include_check_data)) | |
157 | return; | |
158 | ||
159 | failed_parse = parse_tree_gently(tree, 1); | |
160 | if (failed_parse) { | |
161 | if (revs->ignore_missing_links) | |
162 | return; | |
163 | ||
164 | /* | |
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 | ||
173 | if (!revs->do_not_die_on_missing_tree) | |
174 | die("bad tree object %s", oid_to_hex(&obj->oid)); | |
175 | } | |
176 | ||
177 | strbuf_addstr(base, name); | |
178 | r = list_objects_filter__filter_object(ctx->revs->repo, | |
179 | LOFS_BEGIN_TREE, obj, | |
180 | base->buf, &base->buf[baselen], | |
181 | ctx->filter); | |
182 | if (r & LOFR_MARK_SEEN) | |
183 | obj->flags |= SEEN; | |
184 | if (r & LOFR_DO_SHOW) | |
185 | show_object(ctx, obj, base->buf); | |
186 | if (base->len) | |
187 | strbuf_addch(base, '/'); | |
188 | ||
189 | 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 | ||
194 | r = list_objects_filter__filter_object(ctx->revs->repo, | |
195 | LOFS_END_TREE, obj, | |
196 | base->buf, &base->buf[baselen], | |
197 | ctx->filter); | |
198 | if (r & LOFR_MARK_SEEN) | |
199 | obj->flags |= SEEN; | |
200 | if (r & LOFR_DO_SHOW) | |
201 | show_object(ctx, obj, base->buf); | |
202 | ||
203 | strbuf_setlen(base, baselen); | |
204 | free_tree_buffer(tree); | |
205 | } | |
206 | ||
207 | static void process_tag(struct traversal_context *ctx, | |
208 | struct tag *tag, | |
209 | const char *name) | |
210 | { | |
211 | enum list_objects_filter_result r; | |
212 | ||
213 | r = list_objects_filter__filter_object(ctx->revs->repo, LOFS_TAG, | |
214 | &tag->object, NULL, NULL, | |
215 | ctx->filter); | |
216 | if (r & LOFR_MARK_SEEN) | |
217 | tag->object.flags |= SEEN; | |
218 | if (r & LOFR_DO_SHOW) | |
219 | show_object(ctx, &tag->object, name); | |
220 | } | |
221 | ||
222 | static void mark_edge_parents_uninteresting(struct commit *commit, | |
223 | struct rev_info *revs, | |
224 | show_edge_fn show_edge) | |
225 | { | |
226 | struct commit_list *parents; | |
227 | ||
228 | for (parents = commit->parents; parents; parents = parents->next) { | |
229 | struct commit *parent = parents->item; | |
230 | if (!(parent->object.flags & UNINTERESTING)) | |
231 | continue; | |
232 | mark_tree_uninteresting(revs->repo, | |
233 | repo_get_commit_tree(the_repository, parent)); | |
234 | if (revs->edge_hint && !(parent->object.flags & SHOWN)) { | |
235 | parent->object.flags |= SHOWN; | |
236 | show_edge(parent); | |
237 | } | |
238 | } | |
239 | } | |
240 | ||
241 | static void add_edge_parents(struct commit *commit, | |
242 | struct rev_info *revs, | |
243 | show_edge_fn show_edge, | |
244 | struct oidset *set) | |
245 | { | |
246 | struct commit_list *parents; | |
247 | ||
248 | for (parents = commit->parents; parents; parents = parents->next) { | |
249 | struct commit *parent = parents->item; | |
250 | struct tree *tree = repo_get_commit_tree(the_repository, | |
251 | parent); | |
252 | ||
253 | if (!tree) | |
254 | continue; | |
255 | ||
256 | oidset_insert(set, &tree->object.oid); | |
257 | ||
258 | if (!(parent->object.flags & UNINTERESTING)) | |
259 | continue; | |
260 | tree->object.flags |= UNINTERESTING; | |
261 | ||
262 | if (revs->edge_hint && !(parent->object.flags & SHOWN)) { | |
263 | parent->object.flags |= SHOWN; | |
264 | show_edge(parent); | |
265 | } | |
266 | } | |
267 | } | |
268 | ||
269 | void mark_edges_uninteresting(struct rev_info *revs, | |
270 | show_edge_fn show_edge, | |
271 | int sparse) | |
272 | { | |
273 | struct commit_list *list; | |
274 | int i; | |
275 | ||
276 | if (sparse) { | |
277 | struct oidset set; | |
278 | oidset_init(&set, 16); | |
279 | ||
280 | for (list = revs->commits; list; list = list->next) { | |
281 | struct commit *commit = list->item; | |
282 | struct tree *tree = repo_get_commit_tree(the_repository, | |
283 | commit); | |
284 | ||
285 | if (commit->object.flags & UNINTERESTING) | |
286 | tree->object.flags |= UNINTERESTING; | |
287 | ||
288 | oidset_insert(&set, &tree->object.oid); | |
289 | add_edge_parents(commit, revs, show_edge, &set); | |
290 | } | |
291 | ||
292 | mark_trees_uninteresting_sparse(revs->repo, &set); | |
293 | oidset_clear(&set); | |
294 | } else { | |
295 | for (list = revs->commits; list; list = list->next) { | |
296 | struct commit *commit = list->item; | |
297 | if (commit->object.flags & UNINTERESTING) { | |
298 | mark_tree_uninteresting(revs->repo, | |
299 | repo_get_commit_tree(the_repository, commit)); | |
300 | if (revs->edge_hint_aggressive && !(commit->object.flags & SHOWN)) { | |
301 | commit->object.flags |= SHOWN; | |
302 | show_edge(commit); | |
303 | } | |
304 | continue; | |
305 | } | |
306 | mark_edge_parents_uninteresting(commit, revs, show_edge); | |
307 | } | |
308 | } | |
309 | ||
310 | if (revs->edge_hint_aggressive) { | |
311 | for (i = 0; i < revs->cmdline.nr; i++) { | |
312 | struct object *obj = revs->cmdline.rev[i].item; | |
313 | struct commit *commit = (struct commit *)obj; | |
314 | if (obj->type != OBJ_COMMIT || !(obj->flags & UNINTERESTING)) | |
315 | continue; | |
316 | mark_tree_uninteresting(revs->repo, | |
317 | repo_get_commit_tree(the_repository, commit)); | |
318 | if (!(obj->flags & SHOWN)) { | |
319 | obj->flags |= SHOWN; | |
320 | show_edge(commit); | |
321 | } | |
322 | } | |
323 | } | |
324 | } | |
325 | ||
326 | static void add_pending_tree(struct rev_info *revs, struct tree *tree) | |
327 | { | |
328 | add_pending_object(revs, &tree->object, ""); | |
329 | } | |
330 | ||
331 | static void traverse_non_commits(struct traversal_context *ctx, | |
332 | struct strbuf *base) | |
333 | { | |
334 | int i; | |
335 | ||
336 | assert(base->len == 0); | |
337 | ||
338 | for (i = 0; i < ctx->revs->pending.nr; i++) { | |
339 | struct object_array_entry *pending = ctx->revs->pending.objects + i; | |
340 | struct object *obj = pending->item; | |
341 | const char *name = pending->name; | |
342 | const char *path = pending->path; | |
343 | if (obj->flags & (UNINTERESTING | SEEN)) | |
344 | continue; | |
345 | if (obj->type == OBJ_TAG) { | |
346 | process_tag(ctx, (struct tag *)obj, name); | |
347 | continue; | |
348 | } | |
349 | if (!path) | |
350 | path = ""; | |
351 | if (obj->type == OBJ_TREE) { | |
352 | process_tree(ctx, (struct tree *)obj, base, path); | |
353 | continue; | |
354 | } | |
355 | if (obj->type == OBJ_BLOB) { | |
356 | process_blob(ctx, (struct blob *)obj, base, path); | |
357 | continue; | |
358 | } | |
359 | die("unknown pending object %s (%s)", | |
360 | oid_to_hex(&obj->oid), name); | |
361 | } | |
362 | object_array_clear(&ctx->revs->pending); | |
363 | } | |
364 | ||
365 | static void do_traverse(struct traversal_context *ctx) | |
366 | { | |
367 | struct commit *commit; | |
368 | struct strbuf csp; /* callee's scratch pad */ | |
369 | strbuf_init(&csp, PATH_MAX); | |
370 | ||
371 | while ((commit = get_revision(ctx->revs)) != NULL) { | |
372 | enum list_objects_filter_result r; | |
373 | ||
374 | r = list_objects_filter__filter_object(ctx->revs->repo, | |
375 | LOFS_COMMIT, &commit->object, | |
376 | NULL, NULL, ctx->filter); | |
377 | ||
378 | /* | |
379 | * an uninteresting boundary commit may not have its tree | |
380 | * parsed yet, but we are not going to show them anyway | |
381 | */ | |
382 | if (!ctx->revs->tree_objects) | |
383 | ; /* do not bother loading tree */ | |
384 | else if (repo_get_commit_tree(the_repository, commit)) { | |
385 | struct tree *tree = repo_get_commit_tree(the_repository, | |
386 | commit); | |
387 | tree->object.flags |= NOT_USER_GIVEN; | |
388 | add_pending_tree(ctx->revs, tree); | |
389 | } else if (commit->object.parsed) { | |
390 | die(_("unable to load root tree for commit %s"), | |
391 | oid_to_hex(&commit->object.oid)); | |
392 | } | |
393 | ||
394 | if (r & LOFR_MARK_SEEN) | |
395 | commit->object.flags |= SEEN; | |
396 | if (r & LOFR_DO_SHOW) | |
397 | show_commit(ctx, commit); | |
398 | ||
399 | if (ctx->revs->tree_blobs_in_commit_order) | |
400 | /* | |
401 | * NEEDSWORK: Adding the tree and then flushing it here | |
402 | * needs a reallocation for each commit. Can we pass the | |
403 | * tree directory without allocation churn? | |
404 | */ | |
405 | traverse_non_commits(ctx, &csp); | |
406 | } | |
407 | traverse_non_commits(ctx, &csp); | |
408 | strbuf_release(&csp); | |
409 | } | |
410 | ||
411 | void traverse_commit_list_filtered( | |
412 | struct rev_info *revs, | |
413 | show_commit_fn show_commit, | |
414 | show_object_fn show_object, | |
415 | void *show_data, | |
416 | struct oidset *omitted) | |
417 | { | |
418 | struct traversal_context ctx = { | |
419 | .revs = revs, | |
420 | .show_object = show_object, | |
421 | .show_commit = show_commit, | |
422 | .show_data = show_data, | |
423 | }; | |
424 | ||
425 | if (revs->filter.choice) | |
426 | ctx.filter = list_objects_filter__init(omitted, &revs->filter); | |
427 | ||
428 | do_traverse(&ctx); | |
429 | ||
430 | if (ctx.filter) | |
431 | list_objects_filter__free(ctx.filter); | |
432 | } |