]>
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 | */ | |
0556a11a | 87 | struct object *lookup_object(const unsigned char *sha1) |
175785e5 | 88 | { |
9a414486 | 89 | unsigned int i, first; |
0556a11a | 90 | struct object *obj; |
175785e5 | 91 | |
99bf115c | 92 | if (!the_repository->parsed_objects->obj_hash) |
0556a11a | 93 | return NULL; |
175785e5 | 94 | |
99bf115c SB |
95 | first = i = hash_obj(sha1, |
96 | the_repository->parsed_objects->obj_hash_size); | |
97 | while ((obj = the_repository->parsed_objects->obj_hash[i]) != NULL) { | |
ed1c9977 | 98 | if (!hashcmp(sha1, obj->oid.hash)) |
0556a11a | 99 | break; |
070879ca | 100 | i++; |
99bf115c | 101 | if (i == the_repository->parsed_objects->obj_hash_size) |
070879ca JS |
102 | i = 0; |
103 | } | |
9a414486 JK |
104 | if (obj && i != first) { |
105 | /* | |
106 | * Move object to where we started to look for it so | |
107 | * that we do not need to walk the hash table the next | |
108 | * time we look for it. | |
109 | */ | |
99bf115c SB |
110 | SWAP(the_repository->parsed_objects->obj_hash[i], |
111 | the_repository->parsed_objects->obj_hash[first]); | |
9a414486 | 112 | } |
0556a11a | 113 | return obj; |
175785e5 DB |
114 | } |
115 | ||
33bef7ea MH |
116 | /* |
117 | * Increase the size of the hash map stored in obj_hash to the next | |
118 | * power of 2 (but at least 32). Copy the existing values to the new | |
119 | * hash map. | |
120 | */ | |
346a817a | 121 | static void grow_object_hash(struct repository *r) |
175785e5 | 122 | { |
0556a11a | 123 | int i; |
9f36c9b7 NP |
124 | /* |
125 | * Note that this size must always be power-of-2 to match hash_obj | |
126 | * above. | |
127 | */ | |
346a817a | 128 | int new_hash_size = r->parsed_objects->obj_hash_size < 32 ? 32 : 2 * r->parsed_objects->obj_hash_size; |
0556a11a LT |
129 | struct object **new_hash; |
130 | ||
b3c952f8 | 131 | new_hash = xcalloc(new_hash_size, sizeof(struct object *)); |
346a817a SB |
132 | for (i = 0; i < r->parsed_objects->obj_hash_size; i++) { |
133 | struct object *obj = r->parsed_objects->obj_hash[i]; | |
134 | ||
0556a11a LT |
135 | if (!obj) |
136 | continue; | |
137 | insert_obj_hash(obj, new_hash, new_hash_size); | |
138 | } | |
346a817a SB |
139 | free(r->parsed_objects->obj_hash); |
140 | r->parsed_objects->obj_hash = new_hash; | |
141 | r->parsed_objects->obj_hash_size = new_hash_size; | |
175785e5 DB |
142 | } |
143 | ||
341e45e4 | 144 | void *create_object(struct repository *r, const unsigned char *sha1, void *o) |
175785e5 | 145 | { |
100c5f3b LT |
146 | struct object *obj = o; |
147 | ||
175785e5 | 148 | obj->parsed = 0; |
0556a11a | 149 | obj->flags = 0; |
ed1c9977 | 150 | hashcpy(obj->oid.hash, sha1); |
175785e5 | 151 | |
341e45e4 SB |
152 | if (r->parsed_objects->obj_hash_size - 1 <= r->parsed_objects->nr_objs * 2) |
153 | grow_object_hash(r); | |
175785e5 | 154 | |
341e45e4 SB |
155 | insert_obj_hash(obj, r->parsed_objects->obj_hash, |
156 | r->parsed_objects->obj_hash_size); | |
157 | r->parsed_objects->nr_objs++; | |
100c5f3b | 158 | return obj; |
175785e5 DB |
159 | } |
160 | ||
8ff226a9 JK |
161 | void *object_as_type(struct object *obj, enum object_type type, int quiet) |
162 | { | |
163 | if (obj->type == type) | |
164 | return obj; | |
165 | else if (obj->type == OBJ_NONE) { | |
d66bebcb | 166 | if (type == OBJ_COMMIT) |
dd5d9deb | 167 | ((struct commit *)obj)->index = alloc_commit_index(the_repository); |
8ff226a9 JK |
168 | obj->type = type; |
169 | return obj; | |
170 | } | |
171 | else { | |
172 | if (!quiet) | |
173 | error("object %s is a %s, not a %s", | |
f2fd0760 | 174 | oid_to_hex(&obj->oid), |
debca9d2 | 175 | type_name(obj->type), type_name(type)); |
8ff226a9 JK |
176 | return NULL; |
177 | } | |
178 | } | |
179 | ||
66e481b0 DB |
180 | struct object *lookup_unknown_object(const unsigned char *sha1) |
181 | { | |
182 | struct object *obj = lookup_object(sha1); | |
100c5f3b | 183 | if (!obj) |
68f95d38 | 184 | obj = create_object(the_repository, sha1, |
13e3fdcb | 185 | alloc_object_node(the_repository)); |
66e481b0 DB |
186 | return obj; |
187 | } | |
188 | ||
c251c83d | 189 | struct object *parse_object_buffer(const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p) |
9f613ddd JH |
190 | { |
191 | struct object *obj; | |
8e92e8f2 | 192 | *eaten_p = 0; |
9f613ddd | 193 | |
cc216827 | 194 | obj = NULL; |
21666f1a | 195 | if (type == OBJ_BLOB) { |
c251c83d | 196 | struct blob *blob = lookup_blob(oid); |
cc216827 | 197 | if (blob) { |
d0b8c9e5 MK |
198 | if (parse_blob_buffer(blob, buffer, size)) |
199 | return NULL; | |
cc216827 JM |
200 | obj = &blob->object; |
201 | } | |
21666f1a | 202 | } else if (type == OBJ_TREE) { |
c251c83d | 203 | struct tree *tree = lookup_tree(oid); |
cc216827 JM |
204 | if (tree) { |
205 | obj = &tree->object; | |
68be2fea JH |
206 | if (!tree->buffer) |
207 | tree->object.parsed = 0; | |
cc216827 | 208 | if (!tree->object.parsed) { |
d0b8c9e5 MK |
209 | if (parse_tree_buffer(tree, buffer, size)) |
210 | return NULL; | |
8e92e8f2 | 211 | *eaten_p = 1; |
cc216827 | 212 | } |
9f613ddd | 213 | } |
21666f1a | 214 | } else if (type == OBJ_COMMIT) { |
c251c83d | 215 | struct commit *commit = lookup_commit(oid); |
cc216827 | 216 | if (commit) { |
e2838d85 | 217 | if (parse_commit_buffer(commit, buffer, size, 1)) |
d0b8c9e5 | 218 | return NULL; |
8597ea3a JK |
219 | if (!get_cached_commit_buffer(commit, NULL)) { |
220 | set_commit_buffer(commit, buffer, size); | |
8e92e8f2 | 221 | *eaten_p = 1; |
cc216827 JM |
222 | } |
223 | obj = &commit->object; | |
9f613ddd | 224 | } |
21666f1a | 225 | } else if (type == OBJ_TAG) { |
c251c83d | 226 | struct tag *tag = lookup_tag(oid); |
cc216827 | 227 | if (tag) { |
d0b8c9e5 MK |
228 | if (parse_tag_buffer(tag, buffer, size)) |
229 | return NULL; | |
cc216827 JM |
230 | obj = &tag->object; |
231 | } | |
9f613ddd | 232 | } else { |
c251c83d | 233 | warning("object %s has unknown type id %d", oid_to_hex(oid), type); |
9f613ddd JH |
234 | obj = NULL; |
235 | } | |
9f613ddd JH |
236 | return obj; |
237 | } | |
238 | ||
c251c83d | 239 | struct object *parse_object_or_die(const struct object_id *oid, |
75a95490 JK |
240 | const char *name) |
241 | { | |
c251c83d | 242 | struct object *o = parse_object(oid); |
75a95490 JK |
243 | if (o) |
244 | return o; | |
245 | ||
c251c83d | 246 | die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid)); |
75a95490 JK |
247 | } |
248 | ||
c251c83d | 249 | struct object *parse_object(const struct object_id *oid) |
e9eefa67 | 250 | { |
c4584ae3 | 251 | unsigned long size; |
21666f1a | 252 | enum object_type type; |
9f613ddd | 253 | int eaten; |
1f2e7cea | 254 | const struct object_id *repl = lookup_replace_object(the_repository, oid); |
ccdc6037 JK |
255 | void *buffer; |
256 | struct object *obj; | |
257 | ||
c251c83d | 258 | obj = lookup_object(oid->hash); |
ccdc6037 JK |
259 | if (obj && obj->parsed) |
260 | return obj; | |
9f613ddd | 261 | |
df11e196 | 262 | if ((obj && obj->type == OBJ_BLOB && has_object_file(oid)) || |
c251c83d | 263 | (!obj && has_object_file(oid) && |
0df8e965 | 264 | oid_object_info(the_repository, oid, NULL) == OBJ_BLOB)) { |
b383a13c | 265 | if (check_object_signature(repl, NULL, 0, NULL) < 0) { |
c251c83d | 266 | error("sha1 mismatch %s", oid_to_hex(oid)); |
090ea126 NTND |
267 | return NULL; |
268 | } | |
c251c83d | 269 | parse_blob_buffer(lookup_blob(oid), NULL, 0); |
270 | return lookup_object(oid->hash); | |
090ea126 NTND |
271 | } |
272 | ||
b4f5aca4 | 273 | buffer = read_object_file(oid, &type, &size); |
c4584ae3 | 274 | if (buffer) { |
b383a13c | 275 | if (check_object_signature(repl, buffer, size, type_name(type)) < 0) { |
0b1f1130 | 276 | free(buffer); |
b383a13c | 277 | error("sha1 mismatch %s", oid_to_hex(repl)); |
acdeec62 LT |
278 | return NULL; |
279 | } | |
9f613ddd | 280 | |
c251c83d | 281 | obj = parse_object_buffer(oid, type, size, 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 | ||
99bf115c SB |
470 | return o; |
471 | } | |
472 | ||
90c62155 SB |
473 | struct raw_object_store *raw_object_store_new(void) |
474 | { | |
475 | struct raw_object_store *o = xmalloc(sizeof(*o)); | |
476 | ||
477 | memset(o, 0, sizeof(*o)); | |
a80d72db | 478 | INIT_LIST_HEAD(&o->packed_git_mru); |
90c62155 SB |
479 | return o; |
480 | } | |
97501e93 SB |
481 | |
482 | static void free_alt_odb(struct alternate_object_database *alt) | |
483 | { | |
484 | strbuf_release(&alt->scratch); | |
485 | oid_array_clear(&alt->loose_objects_cache); | |
486 | free(alt); | |
487 | } | |
488 | ||
489 | static void free_alt_odbs(struct raw_object_store *o) | |
490 | { | |
491 | while (o->alt_odb_list) { | |
492 | struct alternate_object_database *next; | |
493 | ||
494 | next = o->alt_odb_list->next; | |
495 | free_alt_odb(o->alt_odb_list); | |
496 | o->alt_odb_list = next; | |
497 | } | |
498 | } | |
499 | ||
90c62155 SB |
500 | void raw_object_store_clear(struct raw_object_store *o) |
501 | { | |
502 | FREE_AND_NULL(o->objectdir); | |
503 | FREE_AND_NULL(o->alternate_db); | |
7a1dc605 SB |
504 | |
505 | oidmap_free(o->replace_map, 1); | |
d5873072 | 506 | FREE_AND_NULL(o->replace_map); |
97501e93 SB |
507 | |
508 | free_alt_odbs(o); | |
509 | o->alt_odb_tail = NULL; | |
a80d72db SB |
510 | |
511 | INIT_LIST_HEAD(&o->packed_git_mru); | |
d0b59866 SB |
512 | close_all_packs(o); |
513 | o->packed_git = NULL; | |
90c62155 | 514 | } |
99bf115c SB |
515 | |
516 | void parsed_object_pool_clear(struct parsed_object_pool *o) | |
517 | { | |
518 | /* | |
99bf115c SB |
519 | * As objects are allocated in slabs (see alloc.c), we do |
520 | * not need to free each object, but each slab instead. | |
14ba97f8 SB |
521 | * |
522 | * Before doing so, we need to free any additional memory | |
523 | * the objects may hold. | |
99bf115c | 524 | */ |
14ba97f8 SB |
525 | unsigned i; |
526 | ||
527 | for (i = 0; i < o->obj_hash_size; i++) { | |
528 | struct object *obj = o->obj_hash[i]; | |
529 | ||
530 | if (!obj) | |
531 | continue; | |
532 | ||
533 | if (obj->type == OBJ_TREE) | |
534 | free_tree_buffer((struct tree*)obj); | |
535 | else if (obj->type == OBJ_COMMIT) | |
536 | release_commit_memory((struct commit*)obj); | |
537 | else if (obj->type == OBJ_TAG) | |
538 | release_tag_memory((struct tag*)obj); | |
539 | } | |
540 | ||
541 | FREE_AND_NULL(o->obj_hash); | |
542 | o->obj_hash_size = 0; | |
543 | ||
544 | clear_alloc_state(o->blob_state); | |
545 | clear_alloc_state(o->tree_state); | |
546 | clear_alloc_state(o->commit_state); | |
547 | clear_alloc_state(o->tag_state); | |
548 | clear_alloc_state(o->object_state); | |
549 | FREE_AND_NULL(o->blob_state); | |
550 | FREE_AND_NULL(o->tree_state); | |
551 | FREE_AND_NULL(o->commit_state); | |
552 | FREE_AND_NULL(o->tag_state); | |
553 | FREE_AND_NULL(o->object_state); | |
99bf115c | 554 | } |