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