]>
Commit | Line | Data |
---|---|---|
8f1d2e6f | 1 | #include "cache.h" |
175785e5 | 2 | #include "object.h" |
e9eefa67 DB |
3 | #include "blob.h" |
4 | #include "tree.h" | |
5 | #include "commit.h" | |
e9eefa67 | 6 | #include "tag.h" |
175785e5 | 7 | |
0556a11a LT |
8 | static struct object **obj_hash; |
9 | static int nr_objs, obj_hash_size; | |
fc046a75 LT |
10 | |
11 | unsigned int get_max_object_index(void) | |
12 | { | |
0556a11a | 13 | return obj_hash_size; |
fc046a75 LT |
14 | } |
15 | ||
16 | struct object *get_indexed_object(unsigned int idx) | |
17 | { | |
0556a11a | 18 | return obj_hash[idx]; |
fc046a75 | 19 | } |
175785e5 | 20 | |
df843662 NP |
21 | static const char *object_type_strings[] = { |
22 | NULL, /* OBJ_NONE = 0 */ | |
23 | "commit", /* OBJ_COMMIT = 1 */ | |
24 | "tree", /* OBJ_TREE = 2 */ | |
25 | "blob", /* OBJ_BLOB = 3 */ | |
26 | "tag", /* OBJ_TAG = 4 */ | |
885a86ab LT |
27 | }; |
28 | ||
df843662 NP |
29 | const char *typename(unsigned int type) |
30 | { | |
31 | if (type >= ARRAY_SIZE(object_type_strings)) | |
32 | return NULL; | |
33 | return object_type_strings[type]; | |
34 | } | |
35 | ||
36 | int type_from_string(const char *str) | |
37 | { | |
38 | int i; | |
39 | ||
40 | for (i = 1; i < ARRAY_SIZE(object_type_strings); i++) | |
41 | if (!strcmp(str, object_type_strings[i])) | |
42 | return i; | |
43 | die("invalid object type \"%s\"", str); | |
44 | } | |
45 | ||
33bef7ea MH |
46 | /* |
47 | * Return a numerical hash value between 0 and n-1 for the object with | |
48 | * the specified sha1. n must be a power of 2. Please note that the | |
49 | * return value is *not* consistent across computer architectures. | |
50 | */ | |
9f36c9b7 | 51 | static unsigned int hash_obj(const unsigned char *sha1, unsigned int n) |
0556a11a | 52 | { |
039dc71a | 53 | return sha1hash(sha1) & (n - 1); |
0556a11a LT |
54 | } |
55 | ||
33bef7ea MH |
56 | /* |
57 | * Insert obj into the hash table hash, which has length size (which | |
58 | * must be a power of 2). On collisions, simply overflow to the next | |
59 | * empty bucket. | |
60 | */ | |
0556a11a LT |
61 | static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size) |
62 | { | |
9f36c9b7 | 63 | unsigned int j = hash_obj(obj->sha1, size); |
0556a11a LT |
64 | |
65 | while (hash[j]) { | |
66 | j++; | |
67 | if (j >= size) | |
68 | j = 0; | |
69 | } | |
70 | hash[j] = obj; | |
71 | } | |
72 | ||
33bef7ea MH |
73 | /* |
74 | * Look up the record for the given sha1 in the hash map stored in | |
75 | * obj_hash. Return NULL if it was not found. | |
76 | */ | |
0556a11a | 77 | struct object *lookup_object(const unsigned char *sha1) |
175785e5 | 78 | { |
9a414486 | 79 | unsigned int i, first; |
0556a11a | 80 | struct object *obj; |
175785e5 | 81 | |
0556a11a LT |
82 | if (!obj_hash) |
83 | return NULL; | |
175785e5 | 84 | |
9f36c9b7 | 85 | first = i = hash_obj(sha1, obj_hash_size); |
0556a11a | 86 | while ((obj = obj_hash[i]) != NULL) { |
a89fccd2 | 87 | if (!hashcmp(sha1, obj->sha1)) |
0556a11a | 88 | break; |
070879ca | 89 | i++; |
0556a11a | 90 | if (i == obj_hash_size) |
070879ca JS |
91 | i = 0; |
92 | } | |
9a414486 JK |
93 | if (obj && i != first) { |
94 | /* | |
95 | * Move object to where we started to look for it so | |
96 | * that we do not need to walk the hash table the next | |
97 | * time we look for it. | |
98 | */ | |
99 | struct object *tmp = obj_hash[i]; | |
100 | obj_hash[i] = obj_hash[first]; | |
101 | obj_hash[first] = tmp; | |
102 | } | |
0556a11a | 103 | return obj; |
175785e5 DB |
104 | } |
105 | ||
33bef7ea MH |
106 | /* |
107 | * Increase the size of the hash map stored in obj_hash to the next | |
108 | * power of 2 (but at least 32). Copy the existing values to the new | |
109 | * hash map. | |
110 | */ | |
0556a11a | 111 | static void grow_object_hash(void) |
175785e5 | 112 | { |
0556a11a | 113 | int i; |
9f36c9b7 NP |
114 | /* |
115 | * Note that this size must always be power-of-2 to match hash_obj | |
116 | * above. | |
117 | */ | |
0556a11a LT |
118 | int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size; |
119 | struct object **new_hash; | |
120 | ||
b3c952f8 | 121 | new_hash = xcalloc(new_hash_size, sizeof(struct object *)); |
0556a11a LT |
122 | for (i = 0; i < obj_hash_size; i++) { |
123 | struct object *obj = obj_hash[i]; | |
124 | if (!obj) | |
125 | continue; | |
126 | insert_obj_hash(obj, new_hash, new_hash_size); | |
127 | } | |
128 | free(obj_hash); | |
129 | obj_hash = new_hash; | |
130 | obj_hash_size = new_hash_size; | |
175785e5 DB |
131 | } |
132 | ||
100c5f3b | 133 | void *create_object(const unsigned char *sha1, int type, void *o) |
175785e5 | 134 | { |
100c5f3b LT |
135 | struct object *obj = o; |
136 | ||
175785e5 | 137 | obj->parsed = 0; |
175785e5 | 138 | obj->used = 0; |
100c5f3b | 139 | obj->type = type; |
0556a11a | 140 | obj->flags = 0; |
e702496e | 141 | hashcpy(obj->sha1, sha1); |
175785e5 | 142 | |
0556a11a LT |
143 | if (obj_hash_size - 1 <= nr_objs * 2) |
144 | grow_object_hash(); | |
175785e5 | 145 | |
0556a11a | 146 | insert_obj_hash(obj, obj_hash, obj_hash_size); |
175785e5 | 147 | nr_objs++; |
100c5f3b | 148 | return obj; |
175785e5 DB |
149 | } |
150 | ||
66e481b0 DB |
151 | struct object *lookup_unknown_object(const unsigned char *sha1) |
152 | { | |
153 | struct object *obj = lookup_object(sha1); | |
100c5f3b LT |
154 | if (!obj) |
155 | obj = create_object(sha1, OBJ_NONE, alloc_object_node()); | |
66e481b0 DB |
156 | return obj; |
157 | } | |
158 | ||
21666f1a | 159 | struct object *parse_object_buffer(const unsigned char *sha1, enum object_type type, unsigned long size, void *buffer, int *eaten_p) |
9f613ddd JH |
160 | { |
161 | struct object *obj; | |
8e92e8f2 | 162 | *eaten_p = 0; |
9f613ddd | 163 | |
cc216827 | 164 | obj = NULL; |
21666f1a | 165 | if (type == OBJ_BLOB) { |
9f613ddd | 166 | struct blob *blob = lookup_blob(sha1); |
cc216827 | 167 | if (blob) { |
d0b8c9e5 MK |
168 | if (parse_blob_buffer(blob, buffer, size)) |
169 | return NULL; | |
cc216827 JM |
170 | obj = &blob->object; |
171 | } | |
21666f1a | 172 | } else if (type == OBJ_TREE) { |
9f613ddd | 173 | struct tree *tree = lookup_tree(sha1); |
cc216827 JM |
174 | if (tree) { |
175 | obj = &tree->object; | |
68be2fea JH |
176 | if (!tree->buffer) |
177 | tree->object.parsed = 0; | |
cc216827 | 178 | if (!tree->object.parsed) { |
d0b8c9e5 MK |
179 | if (parse_tree_buffer(tree, buffer, size)) |
180 | return NULL; | |
8e92e8f2 | 181 | *eaten_p = 1; |
cc216827 | 182 | } |
9f613ddd | 183 | } |
21666f1a | 184 | } else if (type == OBJ_COMMIT) { |
9f613ddd | 185 | struct commit *commit = lookup_commit(sha1); |
cc216827 | 186 | if (commit) { |
d0b8c9e5 MK |
187 | if (parse_commit_buffer(commit, buffer, size)) |
188 | return NULL; | |
8597ea3a JK |
189 | if (!get_cached_commit_buffer(commit, NULL)) { |
190 | set_commit_buffer(commit, buffer, size); | |
8e92e8f2 | 191 | *eaten_p = 1; |
cc216827 JM |
192 | } |
193 | obj = &commit->object; | |
9f613ddd | 194 | } |
21666f1a | 195 | } else if (type == OBJ_TAG) { |
9f613ddd | 196 | struct tag *tag = lookup_tag(sha1); |
cc216827 | 197 | if (tag) { |
d0b8c9e5 MK |
198 | if (parse_tag_buffer(tag, buffer, size)) |
199 | return NULL; | |
cc216827 JM |
200 | obj = &tag->object; |
201 | } | |
9f613ddd | 202 | } else { |
82247e9b | 203 | warning("object %s has unknown type id %d", sha1_to_hex(sha1), type); |
9f613ddd JH |
204 | obj = NULL; |
205 | } | |
e2ac7cb5 SV |
206 | if (obj && obj->type == OBJ_NONE) |
207 | obj->type = type; | |
9f613ddd JH |
208 | return obj; |
209 | } | |
210 | ||
75a95490 JK |
211 | struct object *parse_object_or_die(const unsigned char *sha1, |
212 | const char *name) | |
213 | { | |
214 | struct object *o = parse_object(sha1); | |
215 | if (o) | |
216 | return o; | |
217 | ||
218 | die(_("unable to parse object: %s"), name ? name : sha1_to_hex(sha1)); | |
219 | } | |
220 | ||
5d6ccf5c | 221 | struct object *parse_object(const unsigned char *sha1) |
e9eefa67 | 222 | { |
c4584ae3 | 223 | unsigned long size; |
21666f1a | 224 | enum object_type type; |
9f613ddd | 225 | int eaten; |
4bbf5a26 | 226 | const unsigned char *repl = lookup_replace_object(sha1); |
ccdc6037 JK |
227 | void *buffer; |
228 | struct object *obj; | |
229 | ||
230 | obj = lookup_object(sha1); | |
231 | if (obj && obj->parsed) | |
232 | return obj; | |
9f613ddd | 233 | |
090ea126 NTND |
234 | if ((obj && obj->type == OBJ_BLOB) || |
235 | (!obj && has_sha1_file(sha1) && | |
236 | sha1_object_info(sha1, NULL) == OBJ_BLOB)) { | |
237 | if (check_sha1_signature(repl, NULL, 0, NULL) < 0) { | |
82247e9b | 238 | error("sha1 mismatch %s", sha1_to_hex(repl)); |
090ea126 NTND |
239 | return NULL; |
240 | } | |
241 | parse_blob_buffer(lookup_blob(sha1), NULL, 0); | |
242 | return lookup_object(sha1); | |
243 | } | |
244 | ||
ccdc6037 | 245 | buffer = read_sha1_file(sha1, &type, &size); |
c4584ae3 | 246 | if (buffer) { |
0e87c367 | 247 | if (check_sha1_signature(repl, buffer, size, typename(type)) < 0) { |
0b1f1130 | 248 | free(buffer); |
82247e9b | 249 | error("sha1 mismatch %s", sha1_to_hex(repl)); |
acdeec62 LT |
250 | return NULL; |
251 | } | |
9f613ddd | 252 | |
2e3400c0 | 253 | obj = parse_object_buffer(sha1, type, size, buffer, &eaten); |
9f613ddd JH |
254 | if (!eaten) |
255 | free(buffer); | |
bd2c39f5 | 256 | return obj; |
e9eefa67 DB |
257 | } |
258 | return NULL; | |
259 | } | |
66e481b0 DB |
260 | |
261 | struct object_list *object_list_insert(struct object *item, | |
262 | struct object_list **list_p) | |
263 | { | |
264 | struct object_list *new_list = xmalloc(sizeof(struct object_list)); | |
55b4e9e4 JH |
265 | new_list->item = item; |
266 | new_list->next = *list_p; | |
267 | *list_p = new_list; | |
268 | return new_list; | |
66e481b0 DB |
269 | } |
270 | ||
66e481b0 DB |
271 | int object_list_contains(struct object_list *list, struct object *obj) |
272 | { | |
273 | while (list) { | |
274 | if (list->item == obj) | |
275 | return 1; | |
276 | list = list->next; | |
277 | } | |
278 | return 0; | |
279 | } | |
1f1e895f | 280 | |
31faeb20 MH |
281 | /* |
282 | * A zero-length string to which object_array_entry::name can be | |
283 | * initialized without requiring a malloc/free. | |
284 | */ | |
285 | static char object_array_slopbuf[1]; | |
286 | ||
4197361e JH |
287 | static void add_object_array_with_mode_context(struct object *obj, const char *name, |
288 | struct object_array *array, | |
289 | unsigned mode, | |
290 | struct object_context *context) | |
1f1e895f LT |
291 | { |
292 | unsigned nr = array->nr; | |
293 | unsigned alloc = array->alloc; | |
294 | struct object_array_entry *objects = array->objects; | |
31faeb20 | 295 | struct object_array_entry *entry; |
1f1e895f LT |
296 | |
297 | if (nr >= alloc) { | |
298 | alloc = (alloc + 32) * 2; | |
299 | objects = xrealloc(objects, alloc * sizeof(*objects)); | |
300 | array->alloc = alloc; | |
301 | array->objects = objects; | |
302 | } | |
31faeb20 MH |
303 | entry = &objects[nr]; |
304 | entry->item = obj; | |
305 | if (!name) | |
306 | entry->name = NULL; | |
307 | else if (!*name) | |
308 | /* Use our own empty string instead of allocating one: */ | |
309 | entry->name = object_array_slopbuf; | |
310 | else | |
311 | entry->name = xstrdup(name); | |
312 | entry->mode = mode; | |
4197361e | 313 | entry->context = context; |
1f1e895f LT |
314 | array->nr = ++nr; |
315 | } | |
b2a6d1c6 | 316 | |
afa15f3c MG |
317 | void add_object_array(struct object *obj, const char *name, struct object_array *array) |
318 | { | |
319 | add_object_array_with_mode(obj, name, array, S_IFINVALID); | |
320 | } | |
321 | ||
322 | void add_object_array_with_mode(struct object *obj, const char *name, struct object_array *array, unsigned mode) | |
323 | { | |
324 | add_object_array_with_mode_context(obj, name, array, mode, NULL); | |
325 | } | |
326 | ||
327 | void add_object_array_with_context(struct object *obj, const char *name, struct object_array *array, struct object_context *context) | |
328 | { | |
329 | if (context) | |
330 | add_object_array_with_mode_context(obj, name, array, context->mode, context); | |
331 | else | |
332 | add_object_array_with_mode_context(obj, name, array, S_IFINVALID, context); | |
333 | } | |
334 | ||
aeb4a51e MH |
335 | void object_array_filter(struct object_array *array, |
336 | object_array_each_func_t want, void *cb_data) | |
b2a6d1c6 | 337 | { |
aeb4a51e | 338 | unsigned nr = array->nr, src, dst; |
b2a6d1c6 JH |
339 | struct object_array_entry *objects = array->objects; |
340 | ||
aeb4a51e MH |
341 | for (src = dst = 0; src < nr; src++) { |
342 | if (want(&objects[src], cb_data)) { | |
b2a6d1c6 JH |
343 | if (src != dst) |
344 | objects[dst] = objects[src]; | |
345 | dst++; | |
31faeb20 MH |
346 | } else { |
347 | if (objects[src].name != object_array_slopbuf) | |
348 | free(objects[src].name); | |
aeb4a51e MH |
349 | } |
350 | } | |
351 | array->nr = dst; | |
352 | } | |
353 | ||
1506510c MH |
354 | /* |
355 | * Return true iff array already contains an entry with name. | |
356 | */ | |
357 | static int contains_name(struct object_array *array, const char *name) | |
358 | { | |
359 | unsigned nr = array->nr, i; | |
360 | struct object_array_entry *object = array->objects; | |
361 | ||
362 | for (i = 0; i < nr; i++, object++) | |
363 | if (!strcmp(object->name, name)) | |
364 | return 1; | |
365 | return 0; | |
366 | } | |
367 | ||
b2a6d1c6 JH |
368 | void object_array_remove_duplicates(struct object_array *array) |
369 | { | |
1506510c | 370 | unsigned nr = array->nr, src; |
b2a6d1c6 JH |
371 | struct object_array_entry *objects = array->objects; |
372 | ||
1506510c MH |
373 | array->nr = 0; |
374 | for (src = 0; src < nr; src++) { | |
375 | if (!contains_name(array, objects[src].name)) { | |
376 | if (src != array->nr) | |
377 | objects[array->nr] = objects[src]; | |
378 | array->nr++; | |
31faeb20 MH |
379 | } else { |
380 | if (objects[src].name != object_array_slopbuf) | |
381 | free(objects[src].name); | |
b2a6d1c6 | 382 | } |
b2a6d1c6 JH |
383 | } |
384 | } | |
bcc0a3ea HV |
385 | |
386 | void clear_object_flags(unsigned flags) | |
387 | { | |
388 | int i; | |
389 | ||
390 | for (i=0; i < obj_hash_size; i++) { | |
391 | struct object *obj = obj_hash[i]; | |
392 | if (obj) | |
393 | obj->flags &= ~flags; | |
394 | } | |
395 | } |