wt-status.c: remove implicit dependency the_repository
[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)
f447a499
MD
58 r = ctx->filter_fn(LOFS_BLOB, obj,
59 path->buf, &path->buf[pathlen],
60 ctx->filter_data);
25ec7bca
JH
61 if (r & LOFR_MARK_SEEN)
62 obj->flags |= SEEN;
63 if (r & LOFR_DO_SHOW)
f447a499 64 ctx->show_object(obj, path->buf, ctx->show_data);
de1e67d0 65 strbuf_setlen(path, pathlen);
c64ed70d
JH
66}
67
6e2f441b
LT
68/*
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 */
f447a499 90static void process_gitlink(struct traversal_context *ctx,
6e2f441b 91 const unsigned char *sha1,
bd64516a 92 struct strbuf *path,
f447a499 93 const char *name)
6e2f441b
LT
94{
95 /* Nothing to do */
96}
97
92024891 98static void process_tree(struct traversal_context *ctx,
c64ed70d 99 struct tree *tree,
cc5fa2fd 100 struct strbuf *base,
92024891
MD
101 const char *name);
102
103static void process_tree_contents(struct traversal_context *ctx,
104 struct tree *tree,
105 struct strbuf *base)
c64ed70d 106{
c64ed70d
JH
107 struct tree_desc desc;
108 struct name_entry entry;
92024891
MD
109 enum interesting match = ctx->revs->diffopt.pathspec.nr == 0 ?
110 all_entries_interesting : entry_not_interesting;
111
112 init_tree_desc(&desc, tree->buffer, tree->size);
113
114 while (tree_entry(&desc, &entry)) {
115 if (match != all_entries_interesting) {
116 match = tree_entry_interesting(&entry, base, 0,
117 &ctx->revs->diffopt.pathspec);
118 if (match == all_entries_not_interesting)
119 break;
120 if (match == entry_not_interesting)
121 continue;
122 }
123
99c9aa95
MD
124 if (S_ISDIR(entry.mode)) {
125 struct tree *t = lookup_tree(the_repository, entry.oid);
126 t->object.flags |= NOT_USER_GIVEN;
127 process_tree(ctx, t, base, entry.path);
128 }
92024891
MD
129 else if (S_ISGITLINK(entry.mode))
130 process_gitlink(ctx, entry.oid->hash,
131 base, entry.path);
99c9aa95
MD
132 else {
133 struct blob *b = lookup_blob(the_repository, entry.oid);
134 b->object.flags |= NOT_USER_GIVEN;
135 process_blob(ctx, b, base, entry.path);
136 }
92024891
MD
137 }
138}
139
f447a499 140static void process_tree(struct traversal_context *ctx,
c64ed70d 141 struct tree *tree,
cc5fa2fd 142 struct strbuf *base,
f447a499 143 const char *name)
c64ed70d
JH
144{
145 struct object *obj = &tree->object;
f447a499 146 struct rev_info *revs = ctx->revs;
cc5fa2fd 147 int baselen = base->len;
25ec7bca 148 enum list_objects_filter_result r = LOFR_MARK_SEEN | LOFR_DO_SHOW;
7c0fe330 149 int failed_parse;
c64ed70d
JH
150
151 if (!revs->tree_objects)
152 return;
a301b0c8
MK
153 if (!obj)
154 die("bad tree object");
c64ed70d
JH
155 if (obj->flags & (UNINTERESTING | SEEN))
156 return;
7c0fe330
MD
157
158 failed_parse = parse_tree_gently(tree, 1);
159 if (failed_parse) {
2db1a43f
VM
160 if (revs->ignore_missing_links)
161 return;
df11e196
JT
162
163 /*
164 * Pre-filter known-missing tree objects when explicitly
165 * requested. This may cause the actual filter to report
166 * an incomplete list of missing objects.
167 */
168 if (revs->exclude_promisor_objects &&
169 is_promisor_object(&obj->oid))
170 return;
171
7c0fe330
MD
172 if (!revs->do_not_die_on_missing_tree)
173 die("bad tree object %s", oid_to_hex(&obj->oid));
2db1a43f 174 }
13528ab3 175
13528ab3 176 strbuf_addstr(base, name);
99c9aa95 177 if ((obj->flags & NOT_USER_GIVEN) && ctx->filter_fn)
f447a499
MD
178 r = ctx->filter_fn(LOFS_BEGIN_TREE, obj,
179 base->buf, &base->buf[baselen],
180 ctx->filter_data);
25ec7bca
JH
181 if (r & LOFR_MARK_SEEN)
182 obj->flags |= SEEN;
183 if (r & LOFR_DO_SHOW)
f447a499 184 ctx->show_object(obj, base->buf, ctx->show_data);
13528ab3
JK
185 if (base->len)
186 strbuf_addch(base, '/');
cc5fa2fd 187
8b10a206
MD
188 if (r & LOFR_SKIP_TREE)
189 trace_printf("Skipping contents of tree %s...\n", base->buf);
190 else if (!failed_parse)
7c0fe330 191 process_tree_contents(ctx, tree, base);
c64ed70d 192
99c9aa95 193 if ((obj->flags & NOT_USER_GIVEN) && ctx->filter_fn) {
f447a499
MD
194 r = ctx->filter_fn(LOFS_END_TREE, obj,
195 base->buf, &base->buf[baselen],
196 ctx->filter_data);
25ec7bca
JH
197 if (r & LOFR_MARK_SEEN)
198 obj->flags |= SEEN;
199 if (r & LOFR_DO_SHOW)
f447a499 200 ctx->show_object(obj, base->buf, ctx->show_data);
25ec7bca
JH
201 }
202
cc5fa2fd 203 strbuf_setlen(base, baselen);
6e454b9a 204 free_tree_buffer(tree);
c64ed70d
JH
205}
206
8d1d8f83
JH
207static void mark_edge_parents_uninteresting(struct commit *commit,
208 struct rev_info *revs,
209 show_edge_fn show_edge)
210{
211 struct commit_list *parents;
212
213 for (parents = commit->parents; parents; parents = parents->next) {
214 struct commit *parent = parents->item;
215 if (!(parent->object.flags & UNINTERESTING))
216 continue;
b3c7eef9 217 mark_tree_uninteresting(revs->repo, get_commit_tree(parent));
8d1d8f83
JH
218 if (revs->edge_hint && !(parent->object.flags & SHOWN)) {
219 parent->object.flags |= SHOWN;
220 show_edge(parent);
221 }
222 }
223}
224
e76a5fb4 225void mark_edges_uninteresting(struct rev_info *revs, show_edge_fn show_edge)
8d1d8f83 226{
e76a5fb4 227 struct commit_list *list;
fbd4a703
NTND
228 int i;
229
e76a5fb4 230 for (list = revs->commits; list; list = list->next) {
8d1d8f83
JH
231 struct commit *commit = list->item;
232
233 if (commit->object.flags & UNINTERESTING) {
b3c7eef9
NTND
234 mark_tree_uninteresting(revs->repo,
235 get_commit_tree(commit));
1684c1b2 236 if (revs->edge_hint_aggressive && !(commit->object.flags & SHOWN)) {
fbd4a703
NTND
237 commit->object.flags |= SHOWN;
238 show_edge(commit);
239 }
8d1d8f83
JH
240 continue;
241 }
242 mark_edge_parents_uninteresting(commit, revs, show_edge);
243 }
1684c1b2 244 if (revs->edge_hint_aggressive) {
200abe74
JK
245 for (i = 0; i < revs->cmdline.nr; i++) {
246 struct object *obj = revs->cmdline.rev[i].item;
247 struct commit *commit = (struct commit *)obj;
248 if (obj->type != OBJ_COMMIT || !(obj->flags & UNINTERESTING))
249 continue;
b3c7eef9
NTND
250 mark_tree_uninteresting(revs->repo,
251 get_commit_tree(commit));
200abe74
JK
252 if (!(obj->flags & SHOWN)) {
253 obj->flags |= SHOWN;
254 show_edge(commit);
255 }
fbd4a703
NTND
256 }
257 }
8d1d8f83
JH
258}
259
8d2dfc49
LT
260static void add_pending_tree(struct rev_info *revs, struct tree *tree)
261{
262 add_pending_object(revs, &tree->object, "");
263}
264
f447a499
MD
265static void traverse_trees_and_blobs(struct traversal_context *ctx,
266 struct strbuf *base)
c64ed70d
JH
267{
268 int i;
c64ed70d 269
91904f56
SB
270 assert(base->len == 0);
271
f447a499
MD
272 for (i = 0; i < ctx->revs->pending.nr; i++) {
273 struct object_array_entry *pending = ctx->revs->pending.objects + i;
c64ed70d
JH
274 struct object *obj = pending->item;
275 const char *name = pending->name;
20739490 276 const char *path = pending->path;
c64ed70d
JH
277 if (obj->flags & (UNINTERESTING | SEEN))
278 continue;
279 if (obj->type == OBJ_TAG) {
280 obj->flags |= SEEN;
f447a499 281 ctx->show_object(obj, name, ctx->show_data);
c64ed70d
JH
282 continue;
283 }
20739490
JK
284 if (!path)
285 path = "";
c64ed70d 286 if (obj->type == OBJ_TREE) {
f447a499 287 process_tree(ctx, (struct tree *)obj, base, path);
c64ed70d
JH
288 continue;
289 }
290 if (obj->type == OBJ_BLOB) {
f447a499 291 process_blob(ctx, (struct blob *)obj, base, path);
c64ed70d
JH
292 continue;
293 }
294 die("unknown pending object %s (%s)",
f2fd0760 295 oid_to_hex(&obj->oid), name);
c64ed70d 296 }
f447a499 297 object_array_clear(&ctx->revs->pending);
91904f56
SB
298}
299
f447a499 300static void do_traverse(struct traversal_context *ctx)
91904f56
SB
301{
302 struct commit *commit;
303 struct strbuf csp; /* callee's scratch pad */
304 strbuf_init(&csp, PATH_MAX);
305
f447a499 306 while ((commit = get_revision(ctx->revs)) != NULL) {
91904f56
SB
307 /*
308 * an uninteresting boundary commit may not have its tree
309 * parsed yet, but we are not going to show them anyway
310 */
99c9aa95
MD
311 if (get_commit_tree(commit)) {
312 struct tree *tree = get_commit_tree(commit);
313 tree->object.flags |= NOT_USER_GIVEN;
314 add_pending_tree(ctx->revs, tree);
315 }
f447a499 316 ctx->show_commit(commit, ctx->show_data);
ce5b6f9b 317
f447a499 318 if (ctx->revs->tree_blobs_in_commit_order)
ce5b6f9b
SB
319 /*
320 * NEEDSWORK: Adding the tree and then flushing it here
321 * needs a reallocation for each commit. Can we pass the
322 * tree directory without allocation churn?
323 */
f447a499 324 traverse_trees_and_blobs(ctx, &csp);
91904f56 325 }
f447a499 326 traverse_trees_and_blobs(ctx, &csp);
91904f56 327 strbuf_release(&csp);
c64ed70d 328}
25ec7bca
JH
329
330void traverse_commit_list(struct rev_info *revs,
331 show_commit_fn show_commit,
332 show_object_fn show_object,
333 void *show_data)
334{
f447a499
MD
335 struct traversal_context ctx;
336 ctx.revs = revs;
337 ctx.show_commit = show_commit;
338 ctx.show_object = show_object;
339 ctx.show_data = show_data;
340 ctx.filter_fn = NULL;
341 ctx.filter_data = NULL;
342 do_traverse(&ctx);
25ec7bca
JH
343}
344
345void traverse_commit_list_filtered(
346 struct list_objects_filter_options *filter_options,
347 struct rev_info *revs,
348 show_commit_fn show_commit,
349 show_object_fn show_object,
350 void *show_data,
351 struct oidset *omitted)
352{
f447a499 353 struct traversal_context ctx;
25ec7bca 354 filter_free_fn filter_free_fn = NULL;
f447a499
MD
355
356 ctx.revs = revs;
357 ctx.show_object = show_object;
358 ctx.show_commit = show_commit;
359 ctx.show_data = show_data;
360 ctx.filter_fn = NULL;
361
362 ctx.filter_data = list_objects_filter__init(omitted, filter_options,
363 &ctx.filter_fn, &filter_free_fn);
364 do_traverse(&ctx);
365 if (ctx.filter_data && filter_free_fn)
366 filter_free_fn(ctx.filter_data);
25ec7bca 367}