list-objects: reduce one argument in mark_edges_uninteresting
[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"
10
11static void process_blob(struct rev_info *revs,
12 struct blob *blob,
8d2dfc49 13 show_object_fn show,
c64ed70d 14 struct name_path *path,
49473672
JH
15 const char *name,
16 void *cb_data)
c64ed70d
JH
17{
18 struct object *obj = &blob->object;
19
20 if (!revs->blob_objects)
21 return;
a301b0c8
MK
22 if (!obj)
23 die("bad blob object");
c64ed70d
JH
24 if (obj->flags & (UNINTERESTING | SEEN))
25 return;
26 obj->flags |= SEEN;
49473672 27 show(obj, path, name, cb_data);
c64ed70d
JH
28}
29
6e2f441b
LT
30/*
31 * Processing a gitlink entry currently does nothing, since
32 * we do not recurse into the subproject.
33 *
34 * We *could* eventually add a flag that actually does that,
35 * which would involve:
36 * - is the subproject actually checked out?
37 * - if so, see if the subproject has already been added
38 * to the alternates list, and add it if not.
39 * - process the commit (or tag) the gitlink points to
40 * recursively.
41 *
42 * However, it's unclear whether there is really ever any
43 * reason to see superprojects and subprojects as such a
44 * "unified" object pool (potentially resulting in a totally
45 * humongous pack - avoiding which was the whole point of
46 * having gitlinks in the first place!).
47 *
48 * So for now, there is just a note that we *could* follow
49 * the link, and how to do it. Whether it necessarily makes
50 * any sense what-so-ever to ever do that is another issue.
51 */
52static void process_gitlink(struct rev_info *revs,
53 const unsigned char *sha1,
8d2dfc49 54 show_object_fn show,
6e2f441b 55 struct name_path *path,
49473672
JH
56 const char *name,
57 void *cb_data)
6e2f441b
LT
58{
59 /* Nothing to do */
60}
61
c64ed70d
JH
62static void process_tree(struct rev_info *revs,
63 struct tree *tree,
8d2dfc49 64 show_object_fn show,
c64ed70d 65 struct name_path *path,
cc5fa2fd 66 struct strbuf *base,
49473672
JH
67 const char *name,
68 void *cb_data)
c64ed70d
JH
69{
70 struct object *obj = &tree->object;
71 struct tree_desc desc;
72 struct name_entry entry;
73 struct name_path me;
d688cf07
NTND
74 enum interesting match = revs->diffopt.pathspec.nr == 0 ?
75 all_entries_interesting: entry_not_interesting;
cc5fa2fd 76 int baselen = base->len;
c64ed70d
JH
77
78 if (!revs->tree_objects)
79 return;
a301b0c8
MK
80 if (!obj)
81 die("bad tree object");
c64ed70d
JH
82 if (obj->flags & (UNINTERESTING | SEEN))
83 return;
84 if (parse_tree(tree) < 0)
85 die("bad tree object %s", sha1_to_hex(obj->sha1));
86 obj->flags |= SEEN;
49473672 87 show(obj, path, name, cb_data);
c64ed70d
JH
88 me.up = path;
89 me.elem = name;
90 me.elem_len = strlen(name);
91
97d0b74a 92 if (!match) {
cc5fa2fd
EN
93 strbuf_addstr(base, name);
94 if (base->len)
95 strbuf_addch(base, '/');
96 }
97
6fda5e51 98 init_tree_desc(&desc, tree->buffer, tree->size);
c64ed70d
JH
99
100 while (tree_entry(&desc, &entry)) {
d688cf07 101 if (match != all_entries_interesting) {
97d0b74a
NTND
102 match = tree_entry_interesting(&entry, base, 0,
103 &revs->diffopt.pathspec);
d688cf07 104 if (match == all_entries_not_interesting)
cc5fa2fd 105 break;
d688cf07 106 if (match == entry_not_interesting)
cc5fa2fd 107 continue;
cc5fa2fd
EN
108 }
109
c64ed70d
JH
110 if (S_ISDIR(entry.mode))
111 process_tree(revs,
112 lookup_tree(entry.sha1),
49473672
JH
113 show, &me, base, entry.path,
114 cb_data);
302b9282 115 else if (S_ISGITLINK(entry.mode))
6e2f441b 116 process_gitlink(revs, entry.sha1,
49473672
JH
117 show, &me, entry.path,
118 cb_data);
c64ed70d
JH
119 else
120 process_blob(revs,
121 lookup_blob(entry.sha1),
49473672
JH
122 show, &me, entry.path,
123 cb_data);
c64ed70d 124 }
cc5fa2fd 125 strbuf_setlen(base, baselen);
c64ed70d
JH
126 free(tree->buffer);
127 tree->buffer = NULL;
128}
129
8d1d8f83
JH
130static void mark_edge_parents_uninteresting(struct commit *commit,
131 struct rev_info *revs,
132 show_edge_fn show_edge)
133{
134 struct commit_list *parents;
135
136 for (parents = commit->parents; parents; parents = parents->next) {
137 struct commit *parent = parents->item;
138 if (!(parent->object.flags & UNINTERESTING))
139 continue;
140 mark_tree_uninteresting(parent->tree);
141 if (revs->edge_hint && !(parent->object.flags & SHOWN)) {
142 parent->object.flags |= SHOWN;
143 show_edge(parent);
144 }
145 }
146}
147
e76a5fb4 148void mark_edges_uninteresting(struct rev_info *revs, show_edge_fn show_edge)
8d1d8f83 149{
e76a5fb4
NTND
150 struct commit_list *list;
151 for (list = revs->commits; list; list = list->next) {
8d1d8f83
JH
152 struct commit *commit = list->item;
153
154 if (commit->object.flags & UNINTERESTING) {
155 mark_tree_uninteresting(commit->tree);
156 continue;
157 }
158 mark_edge_parents_uninteresting(commit, revs, show_edge);
159 }
160}
161
8d2dfc49
LT
162static void add_pending_tree(struct rev_info *revs, struct tree *tree)
163{
164 add_pending_object(revs, &tree->object, "");
165}
166
c64ed70d 167void traverse_commit_list(struct rev_info *revs,
11c211fa
CC
168 show_commit_fn show_commit,
169 show_object_fn show_object,
170 void *data)
c64ed70d
JH
171{
172 int i;
173 struct commit *commit;
cc5fa2fd 174 struct strbuf base;
c64ed70d 175
cc5fa2fd 176 strbuf_init(&base, PATH_MAX);
c64ed70d 177 while ((commit = get_revision(revs)) != NULL) {
6e7d0efa
JH
178 /*
179 * an uninteresting boundary commit may not have its tree
180 * parsed yet, but we are not going to show them anyway
181 */
182 if (commit->tree)
183 add_pending_tree(revs, commit->tree);
11c211fa 184 show_commit(commit, data);
c64ed70d
JH
185 }
186 for (i = 0; i < revs->pending.nr; i++) {
187 struct object_array_entry *pending = revs->pending.objects + i;
188 struct object *obj = pending->item;
189 const char *name = pending->name;
190 if (obj->flags & (UNINTERESTING | SEEN))
191 continue;
192 if (obj->type == OBJ_TAG) {
193 obj->flags |= SEEN;
49473672 194 show_object(obj, NULL, name, data);
c64ed70d
JH
195 continue;
196 }
197 if (obj->type == OBJ_TREE) {
8d2dfc49 198 process_tree(revs, (struct tree *)obj, show_object,
49473672 199 NULL, &base, name, data);
c64ed70d
JH
200 continue;
201 }
202 if (obj->type == OBJ_BLOB) {
8d2dfc49 203 process_blob(revs, (struct blob *)obj, show_object,
49473672 204 NULL, name, data);
c64ed70d
JH
205 continue;
206 }
207 die("unknown pending object %s (%s)",
208 sha1_to_hex(obj->sha1), name);
209 }
295dd2ad
SP
210 if (revs->pending.nr) {
211 free(revs->pending.objects);
212 revs->pending.nr = 0;
213 revs->pending.alloc = 0;
214 revs->pending.objects = NULL;
215 }
cc5fa2fd 216 strbuf_release(&base);
c64ed70d 217}