]>
Commit | Line | Data |
---|---|---|
8f1d2e6f | 1 | #include "cache.h" |
175785e5 | 2 | #include "object.h" |
47f351e9 | 3 | #include "replace-object.h" |
e9eefa67 DB |
4 | #include "blob.h" |
5 | #include "tree.h" | |
6 | #include "commit.h" | |
e9eefa67 | 7 | #include "tag.h" |
14ba97f8 | 8 | #include "alloc.h" |
90c62155 | 9 | #include "object-store.h" |
d0b59866 | 10 | #include "packfile.h" |
175785e5 | 11 | |
fc046a75 LT |
12 | unsigned int get_max_object_index(void) |
13 | { | |
99bf115c | 14 | return the_repository->parsed_objects->obj_hash_size; |
fc046a75 LT |
15 | } |
16 | ||
17 | struct object *get_indexed_object(unsigned int idx) | |
18 | { | |
99bf115c | 19 | return the_repository->parsed_objects->obj_hash[idx]; |
fc046a75 | 20 | } |
175785e5 | 21 | |
df843662 NP |
22 | static const char *object_type_strings[] = { |
23 | NULL, /* OBJ_NONE = 0 */ | |
24 | "commit", /* OBJ_COMMIT = 1 */ | |
25 | "tree", /* OBJ_TREE = 2 */ | |
26 | "blob", /* OBJ_BLOB = 3 */ | |
27 | "tag", /* OBJ_TAG = 4 */ | |
885a86ab LT |
28 | }; |
29 | ||
debca9d2 | 30 | const char *type_name(unsigned int type) |
df843662 NP |
31 | { |
32 | if (type >= ARRAY_SIZE(object_type_strings)) | |
33 | return NULL; | |
34 | return object_type_strings[type]; | |
35 | } | |
36 | ||
fe8e3b71 | 37 | int type_from_string_gently(const char *str, ssize_t len, int gentle) |
df843662 NP |
38 | { |
39 | int i; | |
40 | ||
fe8e3b71 JS |
41 | if (len < 0) |
42 | len = strlen(str); | |
43 | ||
df843662 | 44 | for (i = 1; i < ARRAY_SIZE(object_type_strings); i++) |
b7994af0 JK |
45 | if (!strncmp(str, object_type_strings[i], len) && |
46 | object_type_strings[i][len] == '\0') | |
df843662 | 47 | return i; |
fe8e3b71 JS |
48 | |
49 | if (gentle) | |
50 | return -1; | |
51 | ||
df843662 NP |
52 | die("invalid object type \"%s\"", str); |
53 | } | |
54 | ||
33bef7ea MH |
55 | /* |
56 | * Return a numerical hash value between 0 and n-1 for the object with | |
57 | * the specified sha1. n must be a power of 2. Please note that the | |
58 | * return value is *not* consistent across computer architectures. | |
59 | */ | |
9f36c9b7 | 60 | static unsigned int hash_obj(const unsigned char *sha1, unsigned int n) |
0556a11a | 61 | { |
039dc71a | 62 | return sha1hash(sha1) & (n - 1); |
0556a11a LT |
63 | } |
64 | ||
33bef7ea MH |
65 | /* |
66 | * Insert obj into the hash table hash, which has length size (which | |
67 | * must be a power of 2). On collisions, simply overflow to the next | |
68 | * empty bucket. | |
69 | */ | |
0556a11a LT |
70 | static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size) |
71 | { | |
ed1c9977 | 72 | unsigned int j = hash_obj(obj->oid.hash, size); |
0556a11a LT |
73 | |
74 | while (hash[j]) { | |
75 | j++; | |
76 | if (j >= size) | |
77 | j = 0; | |
78 | } | |
79 | hash[j] = obj; | |
80 | } | |
81 | ||
33bef7ea MH |
82 | /* |
83 | * Look up the record for the given sha1 in the hash map stored in | |
84 | * obj_hash. Return NULL if it was not found. | |
85 | */ | |
0556a11a | 86 | struct object *lookup_object(const unsigned char *sha1) |
175785e5 | 87 | { |
9a414486 | 88 | unsigned int i, first; |
0556a11a | 89 | struct object *obj; |
175785e5 | 90 | |
99bf115c | 91 | if (!the_repository->parsed_objects->obj_hash) |
0556a11a | 92 | return NULL; |
175785e5 | 93 | |
99bf115c SB |
94 | first = i = hash_obj(sha1, |
95 | the_repository->parsed_objects->obj_hash_size); | |
96 | while ((obj = the_repository->parsed_objects->obj_hash[i]) != NULL) { | |
ed1c9977 | 97 | if (!hashcmp(sha1, obj->oid.hash)) |
0556a11a | 98 | break; |
070879ca | 99 | i++; |
99bf115c | 100 | if (i == the_repository->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 | */ | |
99bf115c SB |
109 | SWAP(the_repository->parsed_objects->obj_hash[i], |
110 | the_repository->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 | ||
8ff226a9 JK |
160 | void *object_as_type(struct object *obj, enum object_type type, int quiet) |
161 | { | |
162 | if (obj->type == type) | |
163 | return obj; | |
164 | else if (obj->type == OBJ_NONE) { | |
d66bebcb | 165 | if (type == OBJ_COMMIT) |
dd5d9deb | 166 | ((struct commit *)obj)->index = alloc_commit_index(the_repository); |
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 | { | |
181 | struct object *obj = lookup_object(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 | ||
c251c83d | 188 | struct object *parse_object_buffer(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) { |
c251c83d | 195 | struct blob *blob = lookup_blob(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) { |
c251c83d | 202 | struct tree *tree = lookup_tree(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) { |
c251c83d | 214 | struct commit *commit = lookup_commit(oid); |
cc216827 | 215 | if (commit) { |
d0b8c9e5 MK |
216 | if (parse_commit_buffer(commit, buffer, size)) |
217 | return NULL; | |
8597ea3a JK |
218 | if (!get_cached_commit_buffer(commit, NULL)) { |
219 | set_commit_buffer(commit, buffer, size); | |
8e92e8f2 | 220 | *eaten_p = 1; |
cc216827 JM |
221 | } |
222 | obj = &commit->object; | |
9f613ddd | 223 | } |
21666f1a | 224 | } else if (type == OBJ_TAG) { |
c251c83d | 225 | struct tag *tag = lookup_tag(oid); |
cc216827 | 226 | if (tag) { |
d0b8c9e5 MK |
227 | if (parse_tag_buffer(tag, buffer, size)) |
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 | { | |
c251c83d | 241 | struct object *o = parse_object(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 | ||
c251c83d | 248 | struct object *parse_object(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 | ||
c251c83d | 257 | obj = lookup_object(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 | } | |
c251c83d | 268 | parse_blob_buffer(lookup_blob(oid), NULL, 0); |
269 | return lookup_object(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 | |
c251c83d | 280 | obj = parse_object_buffer(oid, type, size, buffer, &eaten); |
9f613ddd JH |
281 | if (!eaten) |
282 | free(buffer); | |
bd2c39f5 | 283 | return obj; |
e9eefa67 DB |
284 | } |
285 | return NULL; | |
286 | } | |
66e481b0 DB |
287 | |
288 | struct object_list *object_list_insert(struct object *item, | |
289 | struct object_list **list_p) | |
290 | { | |
291 | struct object_list *new_list = xmalloc(sizeof(struct object_list)); | |
55b4e9e4 JH |
292 | new_list->item = item; |
293 | new_list->next = *list_p; | |
294 | *list_p = new_list; | |
295 | return new_list; | |
66e481b0 DB |
296 | } |
297 | ||
66e481b0 DB |
298 | int object_list_contains(struct object_list *list, struct object *obj) |
299 | { | |
300 | while (list) { | |
301 | if (list->item == obj) | |
302 | return 1; | |
303 | list = list->next; | |
304 | } | |
305 | return 0; | |
306 | } | |
1f1e895f | 307 | |
31faeb20 MH |
308 | /* |
309 | * A zero-length string to which object_array_entry::name can be | |
310 | * initialized without requiring a malloc/free. | |
311 | */ | |
312 | static char object_array_slopbuf[1]; | |
313 | ||
9e0c3c4f JK |
314 | void add_object_array_with_path(struct object *obj, const char *name, |
315 | struct object_array *array, | |
316 | unsigned mode, const char *path) | |
1f1e895f LT |
317 | { |
318 | unsigned nr = array->nr; | |
319 | unsigned alloc = array->alloc; | |
320 | struct object_array_entry *objects = array->objects; | |
31faeb20 | 321 | struct object_array_entry *entry; |
1f1e895f LT |
322 | |
323 | if (nr >= alloc) { | |
324 | alloc = (alloc + 32) * 2; | |
2756ca43 | 325 | REALLOC_ARRAY(objects, alloc); |
1f1e895f LT |
326 | array->alloc = alloc; |
327 | array->objects = objects; | |
328 | } | |
31faeb20 MH |
329 | entry = &objects[nr]; |
330 | entry->item = obj; | |
331 | if (!name) | |
332 | entry->name = NULL; | |
333 | else if (!*name) | |
334 | /* Use our own empty string instead of allocating one: */ | |
335 | entry->name = object_array_slopbuf; | |
336 | else | |
337 | entry->name = xstrdup(name); | |
338 | entry->mode = mode; | |
9e0c3c4f JK |
339 | if (path) |
340 | entry->path = xstrdup(path); | |
341 | else | |
342 | entry->path = NULL; | |
1f1e895f LT |
343 | array->nr = ++nr; |
344 | } | |
b2a6d1c6 | 345 | |
afa15f3c MG |
346 | void add_object_array(struct object *obj, const char *name, struct object_array *array) |
347 | { | |
189a1222 | 348 | add_object_array_with_path(obj, name, array, S_IFINVALID, NULL); |
afa15f3c MG |
349 | } |
350 | ||
68f49235 JK |
351 | /* |
352 | * Free all memory associated with an entry; the result is | |
353 | * in an unspecified state and should not be examined. | |
354 | */ | |
355 | static void object_array_release_entry(struct object_array_entry *ent) | |
356 | { | |
357 | if (ent->name != object_array_slopbuf) | |
358 | free(ent->name); | |
9e0c3c4f | 359 | free(ent->path); |
68f49235 JK |
360 | } |
361 | ||
71992039 MÅ |
362 | struct object *object_array_pop(struct object_array *array) |
363 | { | |
364 | struct object *ret; | |
365 | ||
366 | if (!array->nr) | |
367 | return NULL; | |
368 | ||
369 | ret = array->objects[array->nr - 1].item; | |
370 | object_array_release_entry(&array->objects[array->nr - 1]); | |
371 | array->nr--; | |
372 | return ret; | |
373 | } | |
374 | ||
aeb4a51e MH |
375 | void object_array_filter(struct object_array *array, |
376 | object_array_each_func_t want, void *cb_data) | |
b2a6d1c6 | 377 | { |
aeb4a51e | 378 | unsigned nr = array->nr, src, dst; |
b2a6d1c6 JH |
379 | struct object_array_entry *objects = array->objects; |
380 | ||
aeb4a51e MH |
381 | for (src = dst = 0; src < nr; src++) { |
382 | if (want(&objects[src], cb_data)) { | |
b2a6d1c6 JH |
383 | if (src != dst) |
384 | objects[dst] = objects[src]; | |
385 | dst++; | |
31faeb20 | 386 | } else { |
68f49235 | 387 | object_array_release_entry(&objects[src]); |
aeb4a51e MH |
388 | } |
389 | } | |
390 | array->nr = dst; | |
391 | } | |
392 | ||
46be8231 JK |
393 | void object_array_clear(struct object_array *array) |
394 | { | |
395 | int i; | |
396 | for (i = 0; i < array->nr; i++) | |
397 | object_array_release_entry(&array->objects[i]); | |
6a83d902 | 398 | FREE_AND_NULL(array->objects); |
46be8231 JK |
399 | array->nr = array->alloc = 0; |
400 | } | |
401 | ||
1506510c MH |
402 | /* |
403 | * Return true iff array already contains an entry with name. | |
404 | */ | |
405 | static int contains_name(struct object_array *array, const char *name) | |
406 | { | |
407 | unsigned nr = array->nr, i; | |
408 | struct object_array_entry *object = array->objects; | |
409 | ||
410 | for (i = 0; i < nr; i++, object++) | |
411 | if (!strcmp(object->name, name)) | |
412 | return 1; | |
413 | return 0; | |
414 | } | |
415 | ||
b2a6d1c6 JH |
416 | void object_array_remove_duplicates(struct object_array *array) |
417 | { | |
1506510c | 418 | unsigned nr = array->nr, src; |
b2a6d1c6 JH |
419 | struct object_array_entry *objects = array->objects; |
420 | ||
1506510c MH |
421 | array->nr = 0; |
422 | for (src = 0; src < nr; src++) { | |
423 | if (!contains_name(array, objects[src].name)) { | |
424 | if (src != array->nr) | |
425 | objects[array->nr] = objects[src]; | |
426 | array->nr++; | |
31faeb20 | 427 | } else { |
68f49235 | 428 | object_array_release_entry(&objects[src]); |
b2a6d1c6 | 429 | } |
b2a6d1c6 JH |
430 | } |
431 | } | |
bcc0a3ea HV |
432 | |
433 | void clear_object_flags(unsigned flags) | |
434 | { | |
435 | int i; | |
436 | ||
99bf115c SB |
437 | for (i=0; i < the_repository->parsed_objects->obj_hash_size; i++) { |
438 | struct object *obj = the_repository->parsed_objects->obj_hash[i]; | |
bcc0a3ea HV |
439 | if (obj) |
440 | obj->flags &= ~flags; | |
441 | } | |
442 | } | |
4ad315fc RS |
443 | |
444 | void clear_commit_marks_all(unsigned int flags) | |
445 | { | |
446 | int i; | |
447 | ||
99bf115c SB |
448 | for (i = 0; i < the_repository->parsed_objects->obj_hash_size; i++) { |
449 | struct object *obj = the_repository->parsed_objects->obj_hash[i]; | |
4ad315fc RS |
450 | if (obj && obj->type == OBJ_COMMIT) |
451 | obj->flags &= ~flags; | |
452 | } | |
453 | } | |
90c62155 | 454 | |
99bf115c SB |
455 | struct parsed_object_pool *parsed_object_pool_new(void) |
456 | { | |
457 | struct parsed_object_pool *o = xmalloc(sizeof(*o)); | |
458 | memset(o, 0, sizeof(*o)); | |
14ba97f8 SB |
459 | |
460 | o->blob_state = allocate_alloc_state(); | |
461 | o->tree_state = allocate_alloc_state(); | |
462 | o->commit_state = allocate_alloc_state(); | |
463 | o->tag_state = allocate_alloc_state(); | |
464 | o->object_state = allocate_alloc_state(); | |
465 | ||
99bf115c SB |
466 | return o; |
467 | } | |
468 | ||
90c62155 SB |
469 | struct raw_object_store *raw_object_store_new(void) |
470 | { | |
471 | struct raw_object_store *o = xmalloc(sizeof(*o)); | |
472 | ||
473 | memset(o, 0, sizeof(*o)); | |
a80d72db | 474 | INIT_LIST_HEAD(&o->packed_git_mru); |
90c62155 SB |
475 | return o; |
476 | } | |
97501e93 SB |
477 | |
478 | static void free_alt_odb(struct alternate_object_database *alt) | |
479 | { | |
480 | strbuf_release(&alt->scratch); | |
481 | oid_array_clear(&alt->loose_objects_cache); | |
482 | free(alt); | |
483 | } | |
484 | ||
485 | static void free_alt_odbs(struct raw_object_store *o) | |
486 | { | |
487 | while (o->alt_odb_list) { | |
488 | struct alternate_object_database *next; | |
489 | ||
490 | next = o->alt_odb_list->next; | |
491 | free_alt_odb(o->alt_odb_list); | |
492 | o->alt_odb_list = next; | |
493 | } | |
494 | } | |
495 | ||
90c62155 SB |
496 | void raw_object_store_clear(struct raw_object_store *o) |
497 | { | |
498 | FREE_AND_NULL(o->objectdir); | |
499 | FREE_AND_NULL(o->alternate_db); | |
97501e93 SB |
500 | |
501 | free_alt_odbs(o); | |
502 | o->alt_odb_tail = NULL; | |
a80d72db SB |
503 | |
504 | INIT_LIST_HEAD(&o->packed_git_mru); | |
d0b59866 SB |
505 | close_all_packs(o); |
506 | o->packed_git = NULL; | |
90c62155 | 507 | } |
99bf115c SB |
508 | |
509 | void parsed_object_pool_clear(struct parsed_object_pool *o) | |
510 | { | |
511 | /* | |
99bf115c SB |
512 | * As objects are allocated in slabs (see alloc.c), we do |
513 | * not need to free each object, but each slab instead. | |
14ba97f8 SB |
514 | * |
515 | * Before doing so, we need to free any additional memory | |
516 | * the objects may hold. | |
99bf115c | 517 | */ |
14ba97f8 SB |
518 | unsigned i; |
519 | ||
520 | for (i = 0; i < o->obj_hash_size; i++) { | |
521 | struct object *obj = o->obj_hash[i]; | |
522 | ||
523 | if (!obj) | |
524 | continue; | |
525 | ||
526 | if (obj->type == OBJ_TREE) | |
527 | free_tree_buffer((struct tree*)obj); | |
528 | else if (obj->type == OBJ_COMMIT) | |
529 | release_commit_memory((struct commit*)obj); | |
530 | else if (obj->type == OBJ_TAG) | |
531 | release_tag_memory((struct tag*)obj); | |
532 | } | |
533 | ||
534 | FREE_AND_NULL(o->obj_hash); | |
535 | o->obj_hash_size = 0; | |
536 | ||
537 | clear_alloc_state(o->blob_state); | |
538 | clear_alloc_state(o->tree_state); | |
539 | clear_alloc_state(o->commit_state); | |
540 | clear_alloc_state(o->tag_state); | |
541 | clear_alloc_state(o->object_state); | |
542 | FREE_AND_NULL(o->blob_state); | |
543 | FREE_AND_NULL(o->tree_state); | |
544 | FREE_AND_NULL(o->commit_state); | |
545 | FREE_AND_NULL(o->tag_state); | |
546 | FREE_AND_NULL(o->object_state); | |
99bf115c | 547 | } |