]>
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" |
d0b59866 | 10 | #include "packfile.h" |
85277506 | 11 | #include "commit-graph.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 | ||
42246589 | 53 | die(_("invalid object type \"%s\""), str); |
df843662 NP |
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 | */ | |
46931d39 | 61 | static unsigned int hash_obj(const struct object_id *oid, unsigned int n) |
0556a11a | 62 | { |
d40abc8e | 63 | return oidhash(oid) & (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 | { | |
46931d39 | 73 | unsigned int j = hash_obj(&obj->oid, 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 | */ | |
d0229abd | 87 | struct object *lookup_object(struct repository *r, const struct object_id *oid) |
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 | |
46931d39 | 95 | first = i = hash_obj(oid, r->parsed_objects->obj_hash_size); |
94c09a71 | 96 | while ((obj = r->parsed_objects->obj_hash[i]) != NULL) { |
d0229abd | 97 | if (oideq(oid, &obj->oid)) |
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 | ||
a378509e | 143 | void *create_object(struct repository *r, const struct object_id *oid, void *o) |
175785e5 | 144 | { |
100c5f3b LT |
145 | struct object *obj = o; |
146 | ||
175785e5 | 147 | obj->parsed = 0; |
0556a11a | 148 | obj->flags = 0; |
a378509e | 149 | oidcpy(&obj->oid, oid); |
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 | ||
6da43d93 | 160 | void *object_as_type(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) |
6da43d93 | 166 | init_commit_node((struct commit *) obj); |
4468d443 SG |
167 | else |
168 | obj->type = type; | |
8ff226a9 JK |
169 | return obj; |
170 | } | |
171 | else { | |
172 | if (!quiet) | |
42246589 | 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 | ||
0ebbcf70 | 180 | struct object *lookup_unknown_object(const struct object_id *oid) |
66e481b0 | 181 | { |
d0229abd | 182 | struct object *obj = lookup_object(the_repository, oid); |
100c5f3b | 183 | if (!obj) |
a378509e | 184 | obj = create_object(the_repository, oid, |
13e3fdcb | 185 | alloc_object_node(the_repository)); |
66e481b0 DB |
186 | return obj; |
187 | } | |
188 | ||
108ed1a3 | 189 | struct object *parse_object_buffer(struct repository *r, 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) { |
108ed1a3 | 196 | struct blob *blob = lookup_blob(r, 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) { |
108ed1a3 | 203 | struct tree *tree = lookup_tree(r, 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) { |
108ed1a3 | 215 | struct commit *commit = lookup_commit(r, oid); |
cc216827 | 216 | if (commit) { |
108ed1a3 | 217 | if (parse_commit_buffer(r, commit, buffer, size, 1)) |
d0b8c9e5 | 218 | return NULL; |
108ed1a3 SB |
219 | if (!get_cached_commit_buffer(r, commit, NULL)) { |
220 | set_commit_buffer(r, commit, buffer, size); | |
8e92e8f2 | 221 | *eaten_p = 1; |
cc216827 JM |
222 | } |
223 | obj = &commit->object; | |
9f613ddd | 224 | } |
21666f1a | 225 | } else if (type == OBJ_TAG) { |
108ed1a3 | 226 | struct tag *tag = lookup_tag(r, oid); |
cc216827 | 227 | if (tag) { |
108ed1a3 | 228 | if (parse_tag_buffer(r, tag, buffer, size)) |
d0b8c9e5 | 229 | return NULL; |
cc216827 JM |
230 | obj = &tag->object; |
231 | } | |
9f613ddd | 232 | } else { |
42246589 | 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 | { | |
109cd76d | 242 | struct object *o = parse_object(the_repository, 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 | ||
8e4b0b60 | 249 | struct object *parse_object(struct repository *r, const struct object_id *oid) |
e9eefa67 | 250 | { |
c4584ae3 | 251 | unsigned long size; |
21666f1a | 252 | enum object_type type; |
9f613ddd | 253 | int eaten; |
8e4b0b60 | 254 | const struct object_id *repl = lookup_replace_object(r, oid); |
ccdc6037 JK |
255 | void *buffer; |
256 | struct object *obj; | |
257 | ||
d0229abd | 258 | obj = lookup_object(r, oid); |
ccdc6037 JK |
259 | if (obj && obj->parsed) |
260 | return obj; | |
9f613ddd | 261 | |
d1a69022 SB |
262 | if ((obj && obj->type == OBJ_BLOB && repo_has_object_file(r, oid)) || |
263 | (!obj && repo_has_object_file(r, oid) && | |
8e4b0b60 | 264 | oid_object_info(r, oid, NULL) == OBJ_BLOB)) { |
b98d1885 | 265 | if (check_object_signature(r, repl, NULL, 0, NULL) < 0) { |
01f8d594 | 266 | error(_("hash mismatch %s"), oid_to_hex(oid)); |
090ea126 NTND |
267 | return NULL; |
268 | } | |
8e4b0b60 | 269 | parse_blob_buffer(lookup_blob(r, oid), NULL, 0); |
d0229abd | 270 | return lookup_object(r, oid); |
090ea126 NTND |
271 | } |
272 | ||
d1a69022 | 273 | buffer = repo_read_object_file(r, oid, &type, &size); |
c4584ae3 | 274 | if (buffer) { |
b98d1885 MT |
275 | if (check_object_signature(r, repl, buffer, size, |
276 | type_name(type)) < 0) { | |
0b1f1130 | 277 | free(buffer); |
01f8d594 | 278 | error(_("hash mismatch %s"), oid_to_hex(repl)); |
acdeec62 LT |
279 | return NULL; |
280 | } | |
9f613ddd | 281 | |
8e4b0b60 | 282 | obj = parse_object_buffer(r, oid, type, size, |
1ec5bfd2 | 283 | buffer, &eaten); |
9f613ddd JH |
284 | if (!eaten) |
285 | free(buffer); | |
bd2c39f5 | 286 | return obj; |
e9eefa67 DB |
287 | } |
288 | return NULL; | |
289 | } | |
66e481b0 DB |
290 | |
291 | struct object_list *object_list_insert(struct object *item, | |
292 | struct object_list **list_p) | |
293 | { | |
294 | struct object_list *new_list = xmalloc(sizeof(struct object_list)); | |
55b4e9e4 JH |
295 | new_list->item = item; |
296 | new_list->next = *list_p; | |
297 | *list_p = new_list; | |
298 | return new_list; | |
66e481b0 DB |
299 | } |
300 | ||
66e481b0 DB |
301 | int object_list_contains(struct object_list *list, struct object *obj) |
302 | { | |
303 | while (list) { | |
304 | if (list->item == obj) | |
305 | return 1; | |
306 | list = list->next; | |
307 | } | |
308 | return 0; | |
309 | } | |
1f1e895f | 310 | |
acac50dd JK |
311 | void object_list_free(struct object_list **list) |
312 | { | |
313 | while (*list) { | |
314 | struct object_list *p = *list; | |
315 | *list = p->next; | |
316 | free(p); | |
317 | } | |
318 | } | |
319 | ||
31faeb20 MH |
320 | /* |
321 | * A zero-length string to which object_array_entry::name can be | |
322 | * initialized without requiring a malloc/free. | |
323 | */ | |
324 | static char object_array_slopbuf[1]; | |
325 | ||
9e0c3c4f JK |
326 | void add_object_array_with_path(struct object *obj, const char *name, |
327 | struct object_array *array, | |
328 | unsigned mode, const char *path) | |
1f1e895f LT |
329 | { |
330 | unsigned nr = array->nr; | |
331 | unsigned alloc = array->alloc; | |
332 | struct object_array_entry *objects = array->objects; | |
31faeb20 | 333 | struct object_array_entry *entry; |
1f1e895f LT |
334 | |
335 | if (nr >= alloc) { | |
336 | alloc = (alloc + 32) * 2; | |
2756ca43 | 337 | REALLOC_ARRAY(objects, alloc); |
1f1e895f LT |
338 | array->alloc = alloc; |
339 | array->objects = objects; | |
340 | } | |
31faeb20 MH |
341 | entry = &objects[nr]; |
342 | entry->item = obj; | |
343 | if (!name) | |
344 | entry->name = NULL; | |
345 | else if (!*name) | |
346 | /* Use our own empty string instead of allocating one: */ | |
347 | entry->name = object_array_slopbuf; | |
348 | else | |
349 | entry->name = xstrdup(name); | |
350 | entry->mode = mode; | |
9e0c3c4f JK |
351 | if (path) |
352 | entry->path = xstrdup(path); | |
353 | else | |
354 | entry->path = NULL; | |
1f1e895f LT |
355 | array->nr = ++nr; |
356 | } | |
b2a6d1c6 | 357 | |
afa15f3c MG |
358 | void add_object_array(struct object *obj, const char *name, struct object_array *array) |
359 | { | |
189a1222 | 360 | add_object_array_with_path(obj, name, array, S_IFINVALID, NULL); |
afa15f3c MG |
361 | } |
362 | ||
68f49235 JK |
363 | /* |
364 | * Free all memory associated with an entry; the result is | |
365 | * in an unspecified state and should not be examined. | |
366 | */ | |
367 | static void object_array_release_entry(struct object_array_entry *ent) | |
368 | { | |
369 | if (ent->name != object_array_slopbuf) | |
370 | free(ent->name); | |
9e0c3c4f | 371 | free(ent->path); |
68f49235 JK |
372 | } |
373 | ||
71992039 MÅ |
374 | struct object *object_array_pop(struct object_array *array) |
375 | { | |
376 | struct object *ret; | |
377 | ||
378 | if (!array->nr) | |
379 | return NULL; | |
380 | ||
381 | ret = array->objects[array->nr - 1].item; | |
382 | object_array_release_entry(&array->objects[array->nr - 1]); | |
383 | array->nr--; | |
384 | return ret; | |
385 | } | |
386 | ||
aeb4a51e MH |
387 | void object_array_filter(struct object_array *array, |
388 | object_array_each_func_t want, void *cb_data) | |
b2a6d1c6 | 389 | { |
aeb4a51e | 390 | unsigned nr = array->nr, src, dst; |
b2a6d1c6 JH |
391 | struct object_array_entry *objects = array->objects; |
392 | ||
aeb4a51e MH |
393 | for (src = dst = 0; src < nr; src++) { |
394 | if (want(&objects[src], cb_data)) { | |
b2a6d1c6 JH |
395 | if (src != dst) |
396 | objects[dst] = objects[src]; | |
397 | dst++; | |
31faeb20 | 398 | } else { |
68f49235 | 399 | object_array_release_entry(&objects[src]); |
aeb4a51e MH |
400 | } |
401 | } | |
402 | array->nr = dst; | |
403 | } | |
404 | ||
46be8231 JK |
405 | void object_array_clear(struct object_array *array) |
406 | { | |
407 | int i; | |
408 | for (i = 0; i < array->nr; i++) | |
409 | object_array_release_entry(&array->objects[i]); | |
6a83d902 | 410 | FREE_AND_NULL(array->objects); |
46be8231 JK |
411 | array->nr = array->alloc = 0; |
412 | } | |
413 | ||
1506510c MH |
414 | /* |
415 | * Return true iff array already contains an entry with name. | |
416 | */ | |
417 | static int contains_name(struct object_array *array, const char *name) | |
418 | { | |
419 | unsigned nr = array->nr, i; | |
420 | struct object_array_entry *object = array->objects; | |
421 | ||
422 | for (i = 0; i < nr; i++, object++) | |
423 | if (!strcmp(object->name, name)) | |
424 | return 1; | |
425 | return 0; | |
426 | } | |
427 | ||
b2a6d1c6 JH |
428 | void object_array_remove_duplicates(struct object_array *array) |
429 | { | |
1506510c | 430 | unsigned nr = array->nr, src; |
b2a6d1c6 JH |
431 | struct object_array_entry *objects = array->objects; |
432 | ||
1506510c MH |
433 | array->nr = 0; |
434 | for (src = 0; src < nr; src++) { | |
435 | if (!contains_name(array, objects[src].name)) { | |
436 | if (src != array->nr) | |
437 | objects[array->nr] = objects[src]; | |
438 | array->nr++; | |
31faeb20 | 439 | } else { |
68f49235 | 440 | object_array_release_entry(&objects[src]); |
b2a6d1c6 | 441 | } |
b2a6d1c6 JH |
442 | } |
443 | } | |
bcc0a3ea HV |
444 | |
445 | void clear_object_flags(unsigned 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]; | |
bcc0a3ea HV |
451 | if (obj) |
452 | obj->flags &= ~flags; | |
453 | } | |
454 | } | |
4ad315fc | 455 | |
cd888845 | 456 | void repo_clear_commit_marks(struct repository *r, unsigned int flags) |
4ad315fc RS |
457 | { |
458 | int i; | |
459 | ||
cd888845 RS |
460 | for (i = 0; i < r->parsed_objects->obj_hash_size; i++) { |
461 | struct object *obj = r->parsed_objects->obj_hash[i]; | |
4ad315fc RS |
462 | if (obj && obj->type == OBJ_COMMIT) |
463 | obj->flags &= ~flags; | |
464 | } | |
465 | } | |
90c62155 | 466 | |
99bf115c SB |
467 | struct parsed_object_pool *parsed_object_pool_new(void) |
468 | { | |
469 | struct parsed_object_pool *o = xmalloc(sizeof(*o)); | |
470 | memset(o, 0, sizeof(*o)); | |
14ba97f8 SB |
471 | |
472 | o->blob_state = allocate_alloc_state(); | |
473 | o->tree_state = allocate_alloc_state(); | |
474 | o->commit_state = allocate_alloc_state(); | |
475 | o->tag_state = allocate_alloc_state(); | |
476 | o->object_state = allocate_alloc_state(); | |
477 | ||
eee4502b SB |
478 | o->is_shallow = -1; |
479 | o->shallow_stat = xcalloc(1, sizeof(*o->shallow_stat)); | |
480 | ||
65ea9d4b SB |
481 | o->buffer_slab = allocate_commit_buffer_slab(); |
482 | ||
99bf115c SB |
483 | return o; |
484 | } | |
485 | ||
90c62155 SB |
486 | struct raw_object_store *raw_object_store_new(void) |
487 | { | |
488 | struct raw_object_store *o = xmalloc(sizeof(*o)); | |
489 | ||
490 | memset(o, 0, sizeof(*o)); | |
a80d72db | 491 | INIT_LIST_HEAD(&o->packed_git_mru); |
ec48540f | 492 | hashmap_init(&o->pack_map, pack_map_entry_cmp, NULL, 0); |
b1fc9da1 | 493 | pthread_mutex_init(&o->replace_mutex, NULL); |
90c62155 SB |
494 | return o; |
495 | } | |
97501e93 | 496 | |
f0eaf638 | 497 | static void free_object_directory(struct object_directory *odb) |
97501e93 | 498 | { |
f0eaf638 | 499 | free(odb->path); |
d4e19e51 | 500 | odb_clear_loose_cache(odb); |
263db403 | 501 | free(odb); |
97501e93 SB |
502 | } |
503 | ||
f0eaf638 | 504 | static void free_object_directories(struct raw_object_store *o) |
97501e93 | 505 | { |
f0eaf638 | 506 | while (o->odb) { |
263db403 | 507 | struct object_directory *next; |
97501e93 | 508 | |
f0eaf638 JK |
509 | next = o->odb->next; |
510 | free_object_directory(o->odb); | |
511 | o->odb = next; | |
97501e93 SB |
512 | } |
513 | } | |
514 | ||
90c62155 SB |
515 | void raw_object_store_clear(struct raw_object_store *o) |
516 | { | |
90c62155 | 517 | FREE_AND_NULL(o->alternate_db); |
7a1dc605 SB |
518 | |
519 | oidmap_free(o->replace_map, 1); | |
d5873072 | 520 | FREE_AND_NULL(o->replace_map); |
b1fc9da1 | 521 | pthread_mutex_destroy(&o->replace_mutex); |
97501e93 | 522 | |
85277506 JT |
523 | free_commit_graph(o->commit_graph); |
524 | o->commit_graph = NULL; | |
525 | o->commit_graph_attempted = 0; | |
526 | ||
f0eaf638 JK |
527 | free_object_directories(o); |
528 | o->odb_tail = NULL; | |
529 | o->loaded_alternates = 0; | |
a80d72db SB |
530 | |
531 | INIT_LIST_HEAD(&o->packed_git_mru); | |
2d511cfc | 532 | close_object_store(o); |
d0b59866 | 533 | o->packed_git = NULL; |
ec48540f | 534 | |
6da1a258 | 535 | hashmap_clear(&o->pack_map); |
90c62155 | 536 | } |
99bf115c SB |
537 | |
538 | void parsed_object_pool_clear(struct parsed_object_pool *o) | |
539 | { | |
540 | /* | |
99bf115c SB |
541 | * As objects are allocated in slabs (see alloc.c), we do |
542 | * not need to free each object, but each slab instead. | |
14ba97f8 SB |
543 | * |
544 | * Before doing so, we need to free any additional memory | |
545 | * the objects may hold. | |
99bf115c | 546 | */ |
14ba97f8 SB |
547 | unsigned i; |
548 | ||
549 | for (i = 0; i < o->obj_hash_size; i++) { | |
550 | struct object *obj = o->obj_hash[i]; | |
551 | ||
552 | if (!obj) | |
553 | continue; | |
554 | ||
555 | if (obj->type == OBJ_TREE) | |
556 | free_tree_buffer((struct tree*)obj); | |
557 | else if (obj->type == OBJ_COMMIT) | |
6a7895fd | 558 | release_commit_memory(o, (struct commit*)obj); |
14ba97f8 SB |
559 | else if (obj->type == OBJ_TAG) |
560 | release_tag_memory((struct tag*)obj); | |
561 | } | |
562 | ||
563 | FREE_AND_NULL(o->obj_hash); | |
564 | o->obj_hash_size = 0; | |
565 | ||
65ea9d4b SB |
566 | free_commit_buffer_slab(o->buffer_slab); |
567 | o->buffer_slab = NULL; | |
568 | ||
14ba97f8 SB |
569 | clear_alloc_state(o->blob_state); |
570 | clear_alloc_state(o->tree_state); | |
571 | clear_alloc_state(o->commit_state); | |
572 | clear_alloc_state(o->tag_state); | |
573 | clear_alloc_state(o->object_state); | |
96b0710e | 574 | stat_validity_clear(o->shallow_stat); |
14ba97f8 SB |
575 | FREE_AND_NULL(o->blob_state); |
576 | FREE_AND_NULL(o->tree_state); | |
577 | FREE_AND_NULL(o->commit_state); | |
578 | FREE_AND_NULL(o->tag_state); | |
579 | FREE_AND_NULL(o->object_state); | |
96b0710e | 580 | FREE_AND_NULL(o->shallow_stat); |
99bf115c | 581 | } |