]>
Commit | Line | Data |
---|---|---|
8f1d2e6f | 1 | #include "cache.h" |
175785e5 | 2 | #include "object.h" |
47f351e9 | 3 | #include "replace-object.h" |
cbd53a21 | 4 | #include "object-store.h" |
e9eefa67 DB |
5 | #include "blob.h" |
6 | #include "tree.h" | |
7 | #include "commit.h" | |
e9eefa67 | 8 | #include "tag.h" |
14ba97f8 | 9 | #include "alloc.h" |
90c62155 | 10 | #include "object-store.h" |
d0b59866 | 11 | #include "packfile.h" |
175785e5 | 12 | |
fc046a75 LT |
13 | unsigned int get_max_object_index(void) |
14 | { | |
99bf115c | 15 | return the_repository->parsed_objects->obj_hash_size; |
fc046a75 LT |
16 | } |
17 | ||
18 | struct object *get_indexed_object(unsigned int idx) | |
19 | { | |
99bf115c | 20 | return the_repository->parsed_objects->obj_hash[idx]; |
fc046a75 | 21 | } |
175785e5 | 22 | |
df843662 NP |
23 | static const char *object_type_strings[] = { |
24 | NULL, /* OBJ_NONE = 0 */ | |
25 | "commit", /* OBJ_COMMIT = 1 */ | |
26 | "tree", /* OBJ_TREE = 2 */ | |
27 | "blob", /* OBJ_BLOB = 3 */ | |
28 | "tag", /* OBJ_TAG = 4 */ | |
885a86ab LT |
29 | }; |
30 | ||
debca9d2 | 31 | const char *type_name(unsigned int type) |
df843662 NP |
32 | { |
33 | if (type >= ARRAY_SIZE(object_type_strings)) | |
34 | return NULL; | |
35 | return object_type_strings[type]; | |
36 | } | |
37 | ||
fe8e3b71 | 38 | int type_from_string_gently(const char *str, ssize_t len, int gentle) |
df843662 NP |
39 | { |
40 | int i; | |
41 | ||
fe8e3b71 JS |
42 | if (len < 0) |
43 | len = strlen(str); | |
44 | ||
df843662 | 45 | for (i = 1; i < ARRAY_SIZE(object_type_strings); i++) |
b7994af0 JK |
46 | if (!strncmp(str, object_type_strings[i], len) && |
47 | object_type_strings[i][len] == '\0') | |
df843662 | 48 | return i; |
fe8e3b71 JS |
49 | |
50 | if (gentle) | |
51 | return -1; | |
52 | ||
df843662 NP |
53 | die("invalid object type \"%s\"", str); |
54 | } | |
55 | ||
33bef7ea MH |
56 | /* |
57 | * Return a numerical hash value between 0 and n-1 for the object with | |
58 | * the specified sha1. n must be a power of 2. Please note that the | |
59 | * return value is *not* consistent across computer architectures. | |
60 | */ | |
9f36c9b7 | 61 | static unsigned int hash_obj(const unsigned char *sha1, unsigned int n) |
0556a11a | 62 | { |
039dc71a | 63 | return sha1hash(sha1) & (n - 1); |
0556a11a LT |
64 | } |
65 | ||
33bef7ea MH |
66 | /* |
67 | * Insert obj into the hash table hash, which has length size (which | |
68 | * must be a power of 2). On collisions, simply overflow to the next | |
69 | * empty bucket. | |
70 | */ | |
0556a11a LT |
71 | static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size) |
72 | { | |
ed1c9977 | 73 | unsigned int j = hash_obj(obj->oid.hash, size); |
0556a11a LT |
74 | |
75 | while (hash[j]) { | |
76 | j++; | |
77 | if (j >= size) | |
78 | j = 0; | |
79 | } | |
80 | hash[j] = obj; | |
81 | } | |
82 | ||
33bef7ea MH |
83 | /* |
84 | * Look up the record for the given sha1 in the hash map stored in | |
85 | * obj_hash. Return NULL if it was not found. | |
86 | */ | |
94c09a71 | 87 | struct object *lookup_object(struct repository *r, const unsigned char *sha1) |
175785e5 | 88 | { |
9a414486 | 89 | unsigned int i, first; |
0556a11a | 90 | struct object *obj; |
175785e5 | 91 | |
94c09a71 | 92 | if (!r->parsed_objects->obj_hash) |
0556a11a | 93 | return NULL; |
175785e5 | 94 | |
94c09a71 SB |
95 | first = i = hash_obj(sha1, r->parsed_objects->obj_hash_size); |
96 | while ((obj = r->parsed_objects->obj_hash[i]) != NULL) { | |
ed1c9977 | 97 | if (!hashcmp(sha1, obj->oid.hash)) |
0556a11a | 98 | break; |
070879ca | 99 | i++; |
94c09a71 | 100 | if (i == r->parsed_objects->obj_hash_size) |
070879ca JS |
101 | i = 0; |
102 | } | |
9a414486 JK |
103 | if (obj && i != first) { |
104 | /* | |
105 | * Move object to where we started to look for it so | |
106 | * that we do not need to walk the hash table the next | |
107 | * time we look for it. | |
108 | */ | |
94c09a71 SB |
109 | SWAP(r->parsed_objects->obj_hash[i], |
110 | r->parsed_objects->obj_hash[first]); | |
9a414486 | 111 | } |
0556a11a | 112 | return obj; |
175785e5 DB |
113 | } |
114 | ||
33bef7ea MH |
115 | /* |
116 | * Increase the size of the hash map stored in obj_hash to the next | |
117 | * power of 2 (but at least 32). Copy the existing values to the new | |
118 | * hash map. | |
119 | */ | |
346a817a | 120 | static void grow_object_hash(struct repository *r) |
175785e5 | 121 | { |
0556a11a | 122 | int i; |
9f36c9b7 NP |
123 | /* |
124 | * Note that this size must always be power-of-2 to match hash_obj | |
125 | * above. | |
126 | */ | |
346a817a | 127 | int new_hash_size = r->parsed_objects->obj_hash_size < 32 ? 32 : 2 * r->parsed_objects->obj_hash_size; |
0556a11a LT |
128 | struct object **new_hash; |
129 | ||
b3c952f8 | 130 | new_hash = xcalloc(new_hash_size, sizeof(struct object *)); |
346a817a SB |
131 | for (i = 0; i < r->parsed_objects->obj_hash_size; i++) { |
132 | struct object *obj = r->parsed_objects->obj_hash[i]; | |
133 | ||
0556a11a LT |
134 | if (!obj) |
135 | continue; | |
136 | insert_obj_hash(obj, new_hash, new_hash_size); | |
137 | } | |
346a817a SB |
138 | free(r->parsed_objects->obj_hash); |
139 | r->parsed_objects->obj_hash = new_hash; | |
140 | r->parsed_objects->obj_hash_size = new_hash_size; | |
175785e5 DB |
141 | } |
142 | ||
341e45e4 | 143 | void *create_object(struct repository *r, const unsigned char *sha1, void *o) |
175785e5 | 144 | { |
100c5f3b LT |
145 | struct object *obj = o; |
146 | ||
175785e5 | 147 | obj->parsed = 0; |
0556a11a | 148 | obj->flags = 0; |
ed1c9977 | 149 | hashcpy(obj->oid.hash, sha1); |
175785e5 | 150 | |
341e45e4 SB |
151 | if (r->parsed_objects->obj_hash_size - 1 <= r->parsed_objects->nr_objs * 2) |
152 | grow_object_hash(r); | |
175785e5 | 153 | |
341e45e4 SB |
154 | insert_obj_hash(obj, r->parsed_objects->obj_hash, |
155 | r->parsed_objects->obj_hash_size); | |
156 | r->parsed_objects->nr_objs++; | |
100c5f3b | 157 | return obj; |
175785e5 DB |
158 | } |
159 | ||
a962da1e | 160 | void *object_as_type(struct repository *r, struct object *obj, enum object_type type, int quiet) |
8ff226a9 JK |
161 | { |
162 | if (obj->type == type) | |
163 | return obj; | |
164 | else if (obj->type == OBJ_NONE) { | |
d66bebcb | 165 | if (type == OBJ_COMMIT) |
a962da1e | 166 | ((struct commit *)obj)->index = alloc_commit_index(r); |
8ff226a9 JK |
167 | obj->type = type; |
168 | return obj; | |
169 | } | |
170 | else { | |
171 | if (!quiet) | |
172 | error("object %s is a %s, not a %s", | |
f2fd0760 | 173 | oid_to_hex(&obj->oid), |
debca9d2 | 174 | type_name(obj->type), type_name(type)); |
8ff226a9 JK |
175 | return NULL; |
176 | } | |
177 | } | |
178 | ||
66e481b0 DB |
179 | struct object *lookup_unknown_object(const unsigned char *sha1) |
180 | { | |
5abddd1e | 181 | struct object *obj = lookup_object(the_repository, sha1); |
100c5f3b | 182 | if (!obj) |
68f95d38 | 183 | obj = create_object(the_repository, sha1, |
13e3fdcb | 184 | alloc_object_node(the_repository)); |
66e481b0 DB |
185 | return obj; |
186 | } | |
187 | ||
1ec5bfd2 | 188 | struct object *parse_object_buffer_the_repository(const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p) |
9f613ddd JH |
189 | { |
190 | struct object *obj; | |
8e92e8f2 | 191 | *eaten_p = 0; |
9f613ddd | 192 | |
cc216827 | 193 | obj = NULL; |
21666f1a | 194 | if (type == OBJ_BLOB) { |
da14a7ff | 195 | struct blob *blob = lookup_blob(the_repository, oid); |
cc216827 | 196 | if (blob) { |
d0b8c9e5 MK |
197 | if (parse_blob_buffer(blob, buffer, size)) |
198 | return NULL; | |
cc216827 JM |
199 | obj = &blob->object; |
200 | } | |
21666f1a | 201 | } else if (type == OBJ_TREE) { |
f86bcc7b | 202 | struct tree *tree = lookup_tree(the_repository, oid); |
cc216827 JM |
203 | if (tree) { |
204 | obj = &tree->object; | |
68be2fea JH |
205 | if (!tree->buffer) |
206 | tree->object.parsed = 0; | |
cc216827 | 207 | if (!tree->object.parsed) { |
d0b8c9e5 MK |
208 | if (parse_tree_buffer(tree, buffer, size)) |
209 | return NULL; | |
8e92e8f2 | 210 | *eaten_p = 1; |
cc216827 | 211 | } |
9f613ddd | 212 | } |
21666f1a | 213 | } else if (type == OBJ_COMMIT) { |
c1f5eb49 | 214 | struct commit *commit = lookup_commit(the_repository, oid); |
cc216827 | 215 | if (commit) { |
08f4f445 | 216 | if (parse_commit_buffer(the_repository, commit, buffer, size, 1)) |
d0b8c9e5 | 217 | return NULL; |
3ce85f7e | 218 | if (!get_cached_commit_buffer(the_repository, commit, NULL)) { |
5e0c6360 | 219 | set_commit_buffer(the_repository, commit, buffer, size); |
8e92e8f2 | 220 | *eaten_p = 1; |
cc216827 JM |
221 | } |
222 | obj = &commit->object; | |
9f613ddd | 223 | } |
21666f1a | 224 | } else if (type == OBJ_TAG) { |
ce71efb7 | 225 | struct tag *tag = lookup_tag(the_repository, oid); |
cc216827 | 226 | if (tag) { |
0e740fed | 227 | if (parse_tag_buffer(the_repository, tag, buffer, size)) |
d0b8c9e5 | 228 | return NULL; |
cc216827 JM |
229 | obj = &tag->object; |
230 | } | |
9f613ddd | 231 | } else { |
c251c83d | 232 | warning("object %s has unknown type id %d", oid_to_hex(oid), type); |
9f613ddd JH |
233 | obj = NULL; |
234 | } | |
9f613ddd JH |
235 | return obj; |
236 | } | |
237 | ||
c251c83d | 238 | struct object *parse_object_or_die(const struct object_id *oid, |
75a95490 JK |
239 | const char *name) |
240 | { | |
109cd76d | 241 | struct object *o = parse_object(the_repository, oid); |
75a95490 JK |
242 | if (o) |
243 | return o; | |
244 | ||
c251c83d | 245 | die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid)); |
75a95490 JK |
246 | } |
247 | ||
109cd76d | 248 | struct object *parse_object_the_repository(const struct object_id *oid) |
e9eefa67 | 249 | { |
c4584ae3 | 250 | unsigned long size; |
21666f1a | 251 | enum object_type type; |
9f613ddd | 252 | int eaten; |
1f2e7cea | 253 | const struct object_id *repl = lookup_replace_object(the_repository, oid); |
ccdc6037 JK |
254 | void *buffer; |
255 | struct object *obj; | |
256 | ||
5abddd1e | 257 | obj = lookup_object(the_repository, oid->hash); |
ccdc6037 JK |
258 | if (obj && obj->parsed) |
259 | return obj; | |
9f613ddd | 260 | |
df11e196 | 261 | if ((obj && obj->type == OBJ_BLOB && has_object_file(oid)) || |
c251c83d | 262 | (!obj && has_object_file(oid) && |
0df8e965 | 263 | oid_object_info(the_repository, oid, NULL) == OBJ_BLOB)) { |
b383a13c | 264 | if (check_object_signature(repl, NULL, 0, NULL) < 0) { |
c251c83d | 265 | error("sha1 mismatch %s", oid_to_hex(oid)); |
090ea126 NTND |
266 | return NULL; |
267 | } | |
da14a7ff | 268 | parse_blob_buffer(lookup_blob(the_repository, oid), NULL, 0); |
5abddd1e | 269 | return lookup_object(the_repository, oid->hash); |
090ea126 NTND |
270 | } |
271 | ||
b4f5aca4 | 272 | buffer = read_object_file(oid, &type, &size); |
c4584ae3 | 273 | if (buffer) { |
b383a13c | 274 | if (check_object_signature(repl, buffer, size, type_name(type)) < 0) { |
0b1f1130 | 275 | free(buffer); |
b383a13c | 276 | error("sha1 mismatch %s", oid_to_hex(repl)); |
acdeec62 LT |
277 | return NULL; |
278 | } | |
9f613ddd | 279 | |
1ec5bfd2 SB |
280 | obj = parse_object_buffer(the_repository, oid, type, size, |
281 | buffer, &eaten); | |
9f613ddd JH |
282 | if (!eaten) |
283 | free(buffer); | |
bd2c39f5 | 284 | return obj; |
e9eefa67 DB |
285 | } |
286 | return NULL; | |
287 | } | |
66e481b0 DB |
288 | |
289 | struct object_list *object_list_insert(struct object *item, | |
290 | struct object_list **list_p) | |
291 | { | |
292 | struct object_list *new_list = xmalloc(sizeof(struct object_list)); | |
55b4e9e4 JH |
293 | new_list->item = item; |
294 | new_list->next = *list_p; | |
295 | *list_p = new_list; | |
296 | return new_list; | |
66e481b0 DB |
297 | } |
298 | ||
66e481b0 DB |
299 | int object_list_contains(struct object_list *list, struct object *obj) |
300 | { | |
301 | while (list) { | |
302 | if (list->item == obj) | |
303 | return 1; | |
304 | list = list->next; | |
305 | } | |
306 | return 0; | |
307 | } | |
1f1e895f | 308 | |
31faeb20 MH |
309 | /* |
310 | * A zero-length string to which object_array_entry::name can be | |
311 | * initialized without requiring a malloc/free. | |
312 | */ | |
313 | static char object_array_slopbuf[1]; | |
314 | ||
9e0c3c4f JK |
315 | void add_object_array_with_path(struct object *obj, const char *name, |
316 | struct object_array *array, | |
317 | unsigned mode, const char *path) | |
1f1e895f LT |
318 | { |
319 | unsigned nr = array->nr; | |
320 | unsigned alloc = array->alloc; | |
321 | struct object_array_entry *objects = array->objects; | |
31faeb20 | 322 | struct object_array_entry *entry; |
1f1e895f LT |
323 | |
324 | if (nr >= alloc) { | |
325 | alloc = (alloc + 32) * 2; | |
2756ca43 | 326 | REALLOC_ARRAY(objects, alloc); |
1f1e895f LT |
327 | array->alloc = alloc; |
328 | array->objects = objects; | |
329 | } | |
31faeb20 MH |
330 | entry = &objects[nr]; |
331 | entry->item = obj; | |
332 | if (!name) | |
333 | entry->name = NULL; | |
334 | else if (!*name) | |
335 | /* Use our own empty string instead of allocating one: */ | |
336 | entry->name = object_array_slopbuf; | |
337 | else | |
338 | entry->name = xstrdup(name); | |
339 | entry->mode = mode; | |
9e0c3c4f JK |
340 | if (path) |
341 | entry->path = xstrdup(path); | |
342 | else | |
343 | entry->path = NULL; | |
1f1e895f LT |
344 | array->nr = ++nr; |
345 | } | |
b2a6d1c6 | 346 | |
afa15f3c MG |
347 | void add_object_array(struct object *obj, const char *name, struct object_array *array) |
348 | { | |
189a1222 | 349 | add_object_array_with_path(obj, name, array, S_IFINVALID, NULL); |
afa15f3c MG |
350 | } |
351 | ||
68f49235 JK |
352 | /* |
353 | * Free all memory associated with an entry; the result is | |
354 | * in an unspecified state and should not be examined. | |
355 | */ | |
356 | static void object_array_release_entry(struct object_array_entry *ent) | |
357 | { | |
358 | if (ent->name != object_array_slopbuf) | |
359 | free(ent->name); | |
9e0c3c4f | 360 | free(ent->path); |
68f49235 JK |
361 | } |
362 | ||
71992039 MÅ |
363 | struct object *object_array_pop(struct object_array *array) |
364 | { | |
365 | struct object *ret; | |
366 | ||
367 | if (!array->nr) | |
368 | return NULL; | |
369 | ||
370 | ret = array->objects[array->nr - 1].item; | |
371 | object_array_release_entry(&array->objects[array->nr - 1]); | |
372 | array->nr--; | |
373 | return ret; | |
374 | } | |
375 | ||
aeb4a51e MH |
376 | void object_array_filter(struct object_array *array, |
377 | object_array_each_func_t want, void *cb_data) | |
b2a6d1c6 | 378 | { |
aeb4a51e | 379 | unsigned nr = array->nr, src, dst; |
b2a6d1c6 JH |
380 | struct object_array_entry *objects = array->objects; |
381 | ||
aeb4a51e MH |
382 | for (src = dst = 0; src < nr; src++) { |
383 | if (want(&objects[src], cb_data)) { | |
b2a6d1c6 JH |
384 | if (src != dst) |
385 | objects[dst] = objects[src]; | |
386 | dst++; | |
31faeb20 | 387 | } else { |
68f49235 | 388 | object_array_release_entry(&objects[src]); |
aeb4a51e MH |
389 | } |
390 | } | |
391 | array->nr = dst; | |
392 | } | |
393 | ||
46be8231 JK |
394 | void object_array_clear(struct object_array *array) |
395 | { | |
396 | int i; | |
397 | for (i = 0; i < array->nr; i++) | |
398 | object_array_release_entry(&array->objects[i]); | |
6a83d902 | 399 | FREE_AND_NULL(array->objects); |
46be8231 JK |
400 | array->nr = array->alloc = 0; |
401 | } | |
402 | ||
1506510c MH |
403 | /* |
404 | * Return true iff array already contains an entry with name. | |
405 | */ | |
406 | static int contains_name(struct object_array *array, const char *name) | |
407 | { | |
408 | unsigned nr = array->nr, i; | |
409 | struct object_array_entry *object = array->objects; | |
410 | ||
411 | for (i = 0; i < nr; i++, object++) | |
412 | if (!strcmp(object->name, name)) | |
413 | return 1; | |
414 | return 0; | |
415 | } | |
416 | ||
b2a6d1c6 JH |
417 | void object_array_remove_duplicates(struct object_array *array) |
418 | { | |
1506510c | 419 | unsigned nr = array->nr, src; |
b2a6d1c6 JH |
420 | struct object_array_entry *objects = array->objects; |
421 | ||
1506510c MH |
422 | array->nr = 0; |
423 | for (src = 0; src < nr; src++) { | |
424 | if (!contains_name(array, objects[src].name)) { | |
425 | if (src != array->nr) | |
426 | objects[array->nr] = objects[src]; | |
427 | array->nr++; | |
31faeb20 | 428 | } else { |
68f49235 | 429 | object_array_release_entry(&objects[src]); |
b2a6d1c6 | 430 | } |
b2a6d1c6 JH |
431 | } |
432 | } | |
bcc0a3ea HV |
433 | |
434 | void clear_object_flags(unsigned flags) | |
435 | { | |
436 | int i; | |
437 | ||
99bf115c SB |
438 | for (i=0; i < the_repository->parsed_objects->obj_hash_size; i++) { |
439 | struct object *obj = the_repository->parsed_objects->obj_hash[i]; | |
bcc0a3ea HV |
440 | if (obj) |
441 | obj->flags &= ~flags; | |
442 | } | |
443 | } | |
4ad315fc RS |
444 | |
445 | void clear_commit_marks_all(unsigned int flags) | |
446 | { | |
447 | int i; | |
448 | ||
99bf115c SB |
449 | for (i = 0; i < the_repository->parsed_objects->obj_hash_size; i++) { |
450 | struct object *obj = the_repository->parsed_objects->obj_hash[i]; | |
4ad315fc RS |
451 | if (obj && obj->type == OBJ_COMMIT) |
452 | obj->flags &= ~flags; | |
453 | } | |
454 | } | |
90c62155 | 455 | |
99bf115c SB |
456 | struct parsed_object_pool *parsed_object_pool_new(void) |
457 | { | |
458 | struct parsed_object_pool *o = xmalloc(sizeof(*o)); | |
459 | memset(o, 0, sizeof(*o)); | |
14ba97f8 SB |
460 | |
461 | o->blob_state = allocate_alloc_state(); | |
462 | o->tree_state = allocate_alloc_state(); | |
463 | o->commit_state = allocate_alloc_state(); | |
464 | o->tag_state = allocate_alloc_state(); | |
465 | o->object_state = allocate_alloc_state(); | |
466 | ||
eee4502b SB |
467 | o->is_shallow = -1; |
468 | o->shallow_stat = xcalloc(1, sizeof(*o->shallow_stat)); | |
469 | ||
65ea9d4b SB |
470 | o->buffer_slab = allocate_commit_buffer_slab(); |
471 | ||
99bf115c SB |
472 | return o; |
473 | } | |
474 | ||
90c62155 SB |
475 | struct raw_object_store *raw_object_store_new(void) |
476 | { | |
477 | struct raw_object_store *o = xmalloc(sizeof(*o)); | |
478 | ||
479 | memset(o, 0, sizeof(*o)); | |
a80d72db | 480 | INIT_LIST_HEAD(&o->packed_git_mru); |
90c62155 SB |
481 | return o; |
482 | } | |
97501e93 SB |
483 | |
484 | static void free_alt_odb(struct alternate_object_database *alt) | |
485 | { | |
486 | strbuf_release(&alt->scratch); | |
487 | oid_array_clear(&alt->loose_objects_cache); | |
488 | free(alt); | |
489 | } | |
490 | ||
491 | static void free_alt_odbs(struct raw_object_store *o) | |
492 | { | |
493 | while (o->alt_odb_list) { | |
494 | struct alternate_object_database *next; | |
495 | ||
496 | next = o->alt_odb_list->next; | |
497 | free_alt_odb(o->alt_odb_list); | |
498 | o->alt_odb_list = next; | |
499 | } | |
500 | } | |
501 | ||
90c62155 SB |
502 | void raw_object_store_clear(struct raw_object_store *o) |
503 | { | |
504 | FREE_AND_NULL(o->objectdir); | |
505 | FREE_AND_NULL(o->alternate_db); | |
7a1dc605 SB |
506 | |
507 | oidmap_free(o->replace_map, 1); | |
d5873072 | 508 | FREE_AND_NULL(o->replace_map); |
97501e93 SB |
509 | |
510 | free_alt_odbs(o); | |
511 | o->alt_odb_tail = NULL; | |
a80d72db SB |
512 | |
513 | INIT_LIST_HEAD(&o->packed_git_mru); | |
d0b59866 SB |
514 | close_all_packs(o); |
515 | o->packed_git = NULL; | |
90c62155 | 516 | } |
99bf115c SB |
517 | |
518 | void parsed_object_pool_clear(struct parsed_object_pool *o) | |
519 | { | |
520 | /* | |
99bf115c SB |
521 | * As objects are allocated in slabs (see alloc.c), we do |
522 | * not need to free each object, but each slab instead. | |
14ba97f8 SB |
523 | * |
524 | * Before doing so, we need to free any additional memory | |
525 | * the objects may hold. | |
99bf115c | 526 | */ |
14ba97f8 SB |
527 | unsigned i; |
528 | ||
529 | for (i = 0; i < o->obj_hash_size; i++) { | |
530 | struct object *obj = o->obj_hash[i]; | |
531 | ||
532 | if (!obj) | |
533 | continue; | |
534 | ||
535 | if (obj->type == OBJ_TREE) | |
536 | free_tree_buffer((struct tree*)obj); | |
537 | else if (obj->type == OBJ_COMMIT) | |
538 | release_commit_memory((struct commit*)obj); | |
539 | else if (obj->type == OBJ_TAG) | |
540 | release_tag_memory((struct tag*)obj); | |
541 | } | |
542 | ||
543 | FREE_AND_NULL(o->obj_hash); | |
544 | o->obj_hash_size = 0; | |
545 | ||
65ea9d4b SB |
546 | free_commit_buffer_slab(o->buffer_slab); |
547 | o->buffer_slab = NULL; | |
548 | ||
14ba97f8 SB |
549 | clear_alloc_state(o->blob_state); |
550 | clear_alloc_state(o->tree_state); | |
551 | clear_alloc_state(o->commit_state); | |
552 | clear_alloc_state(o->tag_state); | |
553 | clear_alloc_state(o->object_state); | |
554 | FREE_AND_NULL(o->blob_state); | |
555 | FREE_AND_NULL(o->tree_state); | |
556 | FREE_AND_NULL(o->commit_state); | |
557 | FREE_AND_NULL(o->tag_state); | |
558 | FREE_AND_NULL(o->object_state); | |
99bf115c | 559 | } |