avoid segfaults on parse_object failure
[git/git.git] / reachable.c
CommitLineData
94421474
JH
1#include "cache.h"
2#include "refs.h"
3#include "tag.h"
4#include "commit.h"
5#include "blob.h"
6#include "diff.h"
7#include "revision.h"
8#include "reachable.h"
9#include "cache-tree.h"
dc347195 10#include "progress.h"
94421474 11
0b26abc0
JK
12struct connectivity_progress {
13 struct progress *progress;
14 unsigned long count;
15};
16
17static void update_progress(struct connectivity_progress *cp)
18{
19 cp->count++;
20 if ((cp->count & 1023) == 0)
21 display_progress(cp->progress, cp->count);
22}
23
94421474
JH
24static void process_blob(struct blob *blob,
25 struct object_array *p,
26 struct name_path *path,
0b26abc0
JK
27 const char *name,
28 struct connectivity_progress *cp)
94421474
JH
29{
30 struct object *obj = &blob->object;
31
f7de5a56
MK
32 if (!blob)
33 die("bad blob object");
94421474
JH
34 if (obj->flags & SEEN)
35 return;
36 obj->flags |= SEEN;
0b26abc0 37 update_progress(cp);
94421474
JH
38 /* Nothing to do, really .. The blob lookup was the important part */
39}
40
8d2244ba
AP
41static void process_gitlink(const unsigned char *sha1,
42 struct object_array *p,
43 struct name_path *path,
44 const char *name)
45{
46 /* I don't think we want to recurse into this, really. */
47}
48
94421474
JH
49static void process_tree(struct tree *tree,
50 struct object_array *p,
51 struct name_path *path,
0b26abc0
JK
52 const char *name,
53 struct connectivity_progress *cp)
94421474
JH
54{
55 struct object *obj = &tree->object;
56 struct tree_desc desc;
57 struct name_entry entry;
58 struct name_path me;
59
f7de5a56
MK
60 if (!tree)
61 die("bad tree object");
94421474
JH
62 if (obj->flags & SEEN)
63 return;
64 obj->flags |= SEEN;
0b26abc0 65 update_progress(cp);
94421474
JH
66 if (parse_tree(tree) < 0)
67 die("bad tree object %s", sha1_to_hex(obj->sha1));
94421474
JH
68 add_object(obj, p, path, name);
69 me.up = path;
70 me.elem = name;
71 me.elem_len = strlen(name);
72
6fda5e51 73 init_tree_desc(&desc, tree->buffer, tree->size);
94421474
JH
74
75 while (tree_entry(&desc, &entry)) {
76 if (S_ISDIR(entry.mode))
0b26abc0 77 process_tree(lookup_tree(entry.sha1), p, &me, entry.path, cp);
b941ffac 78 else if (S_ISGITLINK(entry.mode))
8d2244ba 79 process_gitlink(entry.sha1, p, &me, entry.path);
94421474 80 else
0b26abc0 81 process_blob(lookup_blob(entry.sha1), p, &me, entry.path, cp);
94421474
JH
82 }
83 free(tree->buffer);
84 tree->buffer = NULL;
85}
86
0b26abc0
JK
87static void process_tag(struct tag *tag, struct object_array *p,
88 const char *name, struct connectivity_progress *cp)
94421474
JH
89{
90 struct object *obj = &tag->object;
94421474
JH
91
92 if (obj->flags & SEEN)
93 return;
94 obj->flags |= SEEN;
0b26abc0 95 update_progress(cp);
94421474 96
94421474
JH
97 if (parse_tag(tag) < 0)
98 die("bad tag object %s", sha1_to_hex(obj->sha1));
cc369347
MK
99 if (tag->tagged)
100 add_object(tag->tagged, p, NULL, name);
94421474
JH
101}
102
0b26abc0
JK
103static void walk_commit_list(struct rev_info *revs,
104 struct connectivity_progress *cp)
94421474
JH
105{
106 int i;
107 struct commit *commit;
3cd47459 108 struct object_array objects = OBJECT_ARRAY_INIT;
94421474
JH
109
110 /* Walk all commits, process their trees */
dc347195 111 while ((commit = get_revision(revs)) != NULL) {
0b26abc0
JK
112 process_tree(commit->tree, &objects, NULL, "", cp);
113 update_progress(cp);
dc347195 114 }
94421474
JH
115
116 /* Then walk all the pending objects, recursively processing them too */
117 for (i = 0; i < revs->pending.nr; i++) {
118 struct object_array_entry *pending = revs->pending.objects + i;
119 struct object *obj = pending->item;
120 const char *name = pending->name;
121 if (obj->type == OBJ_TAG) {
0b26abc0 122 process_tag((struct tag *) obj, &objects, name, cp);
94421474
JH
123 continue;
124 }
125 if (obj->type == OBJ_TREE) {
0b26abc0 126 process_tree((struct tree *)obj, &objects, NULL, name, cp);
94421474
JH
127 continue;
128 }
129 if (obj->type == OBJ_BLOB) {
0b26abc0 130 process_blob((struct blob *)obj, &objects, NULL, name, cp);
94421474
JH
131 continue;
132 }
133 die("unknown pending object %s (%s)", sha1_to_hex(obj->sha1), name);
134 }
135}
136
883d60fa
JS
137static int add_one_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
138 const char *email, unsigned long timestamp, int tz,
139 const char *message, void *cb_data)
94421474
JH
140{
141 struct object *object;
142 struct rev_info *revs = (struct rev_info *)cb_data;
143
144 object = parse_object(osha1);
145 if (object)
146 add_pending_object(revs, object, "");
147 object = parse_object(nsha1);
148 if (object)
149 add_pending_object(revs, object, "");
150 return 0;
151}
152
153static int add_one_ref(const char *path, const unsigned char *sha1, int flag, void *cb_data)
154{
155 struct object *object = parse_object(sha1);
156 struct rev_info *revs = (struct rev_info *)cb_data;
157
158 if (!object)
159 die("bad object ref: %s:%s", path, sha1_to_hex(sha1));
160 add_pending_object(revs, object, "");
161
162 return 0;
163}
164
165static int add_one_reflog(const char *path, const unsigned char *sha1, int flag, void *cb_data)
166{
167 for_each_reflog_ent(path, add_one_reflog_ent, cb_data);
168 return 0;
169}
170
171static void add_one_tree(const unsigned char *sha1, struct rev_info *revs)
172{
173 struct tree *tree = lookup_tree(sha1);
c3406635
MK
174 if (tree)
175 add_pending_object(revs, &tree->object, "");
94421474
JH
176}
177
178static void add_cache_tree(struct cache_tree *it, struct rev_info *revs)
179{
180 int i;
181
182 if (it->entry_count >= 0)
183 add_one_tree(it->sha1, revs);
184 for (i = 0; i < it->subtree_nr; i++)
185 add_cache_tree(it->down[i]->cache_tree, revs);
186}
187
188static void add_cache_refs(struct rev_info *revs)
189{
190 int i;
191
192 read_cache();
193 for (i = 0; i < active_nr; i++) {
8d2244ba
AP
194 /*
195 * The index can contain blobs and GITLINKs, GITLINKs are hashes
196 * that don't actually point to objects in the repository, it's
197 * almost guaranteed that they are NOT blobs, so we don't call
198 * lookup_blob() on them, to avoid populating the hash table
199 * with invalid information
200 */
7a51ed66 201 if (S_ISGITLINK(active_cache[i]->ce_mode))
8d2244ba
AP
202 continue;
203
94421474
JH
204 lookup_blob(active_cache[i]->sha1);
205 /*
206 * We could add the blobs to the pending list, but quite
207 * frankly, we don't care. Once we've looked them up, and
208 * added them as objects, we've really done everything
209 * there is to do for a blob
210 */
211 }
212 if (active_cache_tree)
213 add_cache_tree(active_cache_tree, revs);
214}
215
dc347195
NTND
216void mark_reachable_objects(struct rev_info *revs, int mark_reflog,
217 struct progress *progress)
94421474 218{
0b26abc0
JK
219 struct connectivity_progress cp;
220
94421474
JH
221 /*
222 * Set up revision parsing, and mark us as being interested
223 * in all object types, not just commits.
224 */
225 revs->tag_objects = 1;
226 revs->blob_objects = 1;
227 revs->tree_objects = 1;
228
229 /* Add all refs from the index file */
230 add_cache_refs(revs);
231
232 /* Add all external refs */
233 for_each_ref(add_one_ref, revs);
234
eb8381c8 235 /* Add all reflog info */
94421474 236 if (mark_reflog)
eb8381c8 237 for_each_reflog(add_one_reflog, revs);
94421474 238
0b26abc0
JK
239 cp.progress = progress;
240 cp.count = 0;
241
94421474
JH
242 /*
243 * Set up the revision walk - this will move all commits
244 * from the pending list to the commit walking list.
245 */
3d51e1b5
MK
246 if (prepare_revision_walk(revs))
247 die("revision walk setup failed");
0b26abc0
JK
248 walk_commit_list(revs, &cp);
249 display_progress(cp.progress, cp.count);
94421474 250}