Merge branch 'rs/commit-graph-use-list-count'
[git/git.git] / object.c
CommitLineData
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"
85277506 12#include "commit-graph.h"
175785e5 13
fc046a75
LT
14unsigned int get_max_object_index(void)
15{
99bf115c 16 return the_repository->parsed_objects->obj_hash_size;
fc046a75
LT
17}
18
19struct object *get_indexed_object(unsigned int idx)
20{
99bf115c 21 return the_repository->parsed_objects->obj_hash[idx];
fc046a75 22}
175785e5 23
df843662
NP
24static const char *object_type_strings[] = {
25 NULL, /* OBJ_NONE = 0 */
26 "commit", /* OBJ_COMMIT = 1 */
27 "tree", /* OBJ_TREE = 2 */
28 "blob", /* OBJ_BLOB = 3 */
29 "tag", /* OBJ_TAG = 4 */
885a86ab
LT
30};
31
debca9d2 32const char *type_name(unsigned int type)
df843662
NP
33{
34 if (type >= ARRAY_SIZE(object_type_strings))
35 return NULL;
36 return object_type_strings[type];
37}
38
fe8e3b71 39int type_from_string_gently(const char *str, ssize_t len, int gentle)
df843662
NP
40{
41 int i;
42
fe8e3b71
JS
43 if (len < 0)
44 len = strlen(str);
45
df843662 46 for (i = 1; i < ARRAY_SIZE(object_type_strings); i++)
b7994af0
JK
47 if (!strncmp(str, object_type_strings[i], len) &&
48 object_type_strings[i][len] == '\0')
df843662 49 return i;
fe8e3b71
JS
50
51 if (gentle)
52 return -1;
53
42246589 54 die(_("invalid object type \"%s\""), str);
df843662
NP
55}
56
33bef7ea
MH
57/*
58 * Return a numerical hash value between 0 and n-1 for the object with
59 * the specified sha1. n must be a power of 2. Please note that the
60 * return value is *not* consistent across computer architectures.
61 */
46931d39 62static unsigned int hash_obj(const struct object_id *oid, unsigned int n)
0556a11a 63{
d40abc8e 64 return oidhash(oid) & (n - 1);
0556a11a
LT
65}
66
33bef7ea
MH
67/*
68 * Insert obj into the hash table hash, which has length size (which
69 * must be a power of 2). On collisions, simply overflow to the next
70 * empty bucket.
71 */
0556a11a
LT
72static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size)
73{
46931d39 74 unsigned int j = hash_obj(&obj->oid, size);
0556a11a
LT
75
76 while (hash[j]) {
77 j++;
78 if (j >= size)
79 j = 0;
80 }
81 hash[j] = obj;
82}
83
33bef7ea
MH
84/*
85 * Look up the record for the given sha1 in the hash map stored in
86 * obj_hash. Return NULL if it was not found.
87 */
d0229abd 88struct object *lookup_object(struct repository *r, const struct object_id *oid)
175785e5 89{
9a414486 90 unsigned int i, first;
0556a11a 91 struct object *obj;
175785e5 92
94c09a71 93 if (!r->parsed_objects->obj_hash)
0556a11a 94 return NULL;
175785e5 95
46931d39 96 first = i = hash_obj(oid, r->parsed_objects->obj_hash_size);
94c09a71 97 while ((obj = r->parsed_objects->obj_hash[i]) != NULL) {
d0229abd 98 if (oideq(oid, &obj->oid))
0556a11a 99 break;
070879ca 100 i++;
94c09a71 101 if (i == r->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 */
94c09a71
SB
110 SWAP(r->parsed_objects->obj_hash[i],
111 r->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 121static 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
a378509e 144void *create_object(struct repository *r, const struct object_id *oid, void *o)
175785e5 145{
100c5f3b
LT
146 struct object *obj = o;
147
175785e5 148 obj->parsed = 0;
0556a11a 149 obj->flags = 0;
a378509e 150 oidcpy(&obj->oid, oid);
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
a962da1e 161void *object_as_type(struct repository *r, struct object *obj, enum object_type type, int quiet)
8ff226a9
JK
162{
163 if (obj->type == type)
164 return obj;
165 else if (obj->type == OBJ_NONE) {
d66bebcb 166 if (type == OBJ_COMMIT)
4468d443
SG
167 init_commit_node(r, (struct commit *) obj);
168 else
169 obj->type = type;
8ff226a9
JK
170 return obj;
171 }
172 else {
173 if (!quiet)
42246589 174 error(_("object %s is a %s, not a %s"),
f2fd0760 175 oid_to_hex(&obj->oid),
debca9d2 176 type_name(obj->type), type_name(type));
8ff226a9
JK
177 return NULL;
178 }
179}
180
0ebbcf70 181struct object *lookup_unknown_object(const struct object_id *oid)
66e481b0 182{
d0229abd 183 struct object *obj = lookup_object(the_repository, oid);
100c5f3b 184 if (!obj)
a378509e 185 obj = create_object(the_repository, oid,
13e3fdcb 186 alloc_object_node(the_repository));
66e481b0
DB
187 return obj;
188}
189
108ed1a3 190struct 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
191{
192 struct object *obj;
8e92e8f2 193 *eaten_p = 0;
9f613ddd 194
cc216827 195 obj = NULL;
21666f1a 196 if (type == OBJ_BLOB) {
108ed1a3 197 struct blob *blob = lookup_blob(r, oid);
cc216827 198 if (blob) {
d0b8c9e5
MK
199 if (parse_blob_buffer(blob, buffer, size))
200 return NULL;
cc216827
JM
201 obj = &blob->object;
202 }
21666f1a 203 } else if (type == OBJ_TREE) {
108ed1a3 204 struct tree *tree = lookup_tree(r, oid);
cc216827
JM
205 if (tree) {
206 obj = &tree->object;
68be2fea
JH
207 if (!tree->buffer)
208 tree->object.parsed = 0;
cc216827 209 if (!tree->object.parsed) {
d0b8c9e5
MK
210 if (parse_tree_buffer(tree, buffer, size))
211 return NULL;
8e92e8f2 212 *eaten_p = 1;
cc216827 213 }
9f613ddd 214 }
21666f1a 215 } else if (type == OBJ_COMMIT) {
108ed1a3 216 struct commit *commit = lookup_commit(r, oid);
cc216827 217 if (commit) {
108ed1a3 218 if (parse_commit_buffer(r, commit, buffer, size, 1))
d0b8c9e5 219 return NULL;
108ed1a3
SB
220 if (!get_cached_commit_buffer(r, commit, NULL)) {
221 set_commit_buffer(r, commit, buffer, size);
8e92e8f2 222 *eaten_p = 1;
cc216827
JM
223 }
224 obj = &commit->object;
9f613ddd 225 }
21666f1a 226 } else if (type == OBJ_TAG) {
108ed1a3 227 struct tag *tag = lookup_tag(r, oid);
cc216827 228 if (tag) {
108ed1a3 229 if (parse_tag_buffer(r, tag, buffer, size))
d0b8c9e5 230 return NULL;
cc216827
JM
231 obj = &tag->object;
232 }
9f613ddd 233 } else {
42246589 234 warning(_("object %s has unknown type id %d"), oid_to_hex(oid), type);
9f613ddd
JH
235 obj = NULL;
236 }
9f613ddd
JH
237 return obj;
238}
239
c251c83d 240struct object *parse_object_or_die(const struct object_id *oid,
75a95490
JK
241 const char *name)
242{
109cd76d 243 struct object *o = parse_object(the_repository, oid);
75a95490
JK
244 if (o)
245 return o;
246
c251c83d 247 die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid));
75a95490
JK
248}
249
8e4b0b60 250struct object *parse_object(struct repository *r, const struct object_id *oid)
e9eefa67 251{
c4584ae3 252 unsigned long size;
21666f1a 253 enum object_type type;
9f613ddd 254 int eaten;
8e4b0b60 255 const struct object_id *repl = lookup_replace_object(r, oid);
ccdc6037
JK
256 void *buffer;
257 struct object *obj;
258
d0229abd 259 obj = lookup_object(r, oid);
ccdc6037
JK
260 if (obj && obj->parsed)
261 return obj;
9f613ddd 262
d1a69022
SB
263 if ((obj && obj->type == OBJ_BLOB && repo_has_object_file(r, oid)) ||
264 (!obj && repo_has_object_file(r, oid) &&
8e4b0b60 265 oid_object_info(r, oid, NULL) == OBJ_BLOB)) {
b383a13c 266 if (check_object_signature(repl, NULL, 0, NULL) < 0) {
01f8d594 267 error(_("hash mismatch %s"), oid_to_hex(oid));
090ea126
NTND
268 return NULL;
269 }
8e4b0b60 270 parse_blob_buffer(lookup_blob(r, oid), NULL, 0);
d0229abd 271 return lookup_object(r, oid);
090ea126
NTND
272 }
273
d1a69022 274 buffer = repo_read_object_file(r, oid, &type, &size);
c4584ae3 275 if (buffer) {
b383a13c 276 if (check_object_signature(repl, buffer, size, 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
291struct 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
301int 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
31faeb20
MH
311/*
312 * A zero-length string to which object_array_entry::name can be
313 * initialized without requiring a malloc/free.
314 */
315static char object_array_slopbuf[1];
316
9e0c3c4f
JK
317void add_object_array_with_path(struct object *obj, const char *name,
318 struct object_array *array,
319 unsigned mode, const char *path)
1f1e895f
LT
320{
321 unsigned nr = array->nr;
322 unsigned alloc = array->alloc;
323 struct object_array_entry *objects = array->objects;
31faeb20 324 struct object_array_entry *entry;
1f1e895f
LT
325
326 if (nr >= alloc) {
327 alloc = (alloc + 32) * 2;
2756ca43 328 REALLOC_ARRAY(objects, alloc);
1f1e895f
LT
329 array->alloc = alloc;
330 array->objects = objects;
331 }
31faeb20
MH
332 entry = &objects[nr];
333 entry->item = obj;
334 if (!name)
335 entry->name = NULL;
336 else if (!*name)
337 /* Use our own empty string instead of allocating one: */
338 entry->name = object_array_slopbuf;
339 else
340 entry->name = xstrdup(name);
341 entry->mode = mode;
9e0c3c4f
JK
342 if (path)
343 entry->path = xstrdup(path);
344 else
345 entry->path = NULL;
1f1e895f
LT
346 array->nr = ++nr;
347}
b2a6d1c6 348
afa15f3c
MG
349void add_object_array(struct object *obj, const char *name, struct object_array *array)
350{
189a1222 351 add_object_array_with_path(obj, name, array, S_IFINVALID, NULL);
afa15f3c
MG
352}
353
68f49235
JK
354/*
355 * Free all memory associated with an entry; the result is
356 * in an unspecified state and should not be examined.
357 */
358static void object_array_release_entry(struct object_array_entry *ent)
359{
360 if (ent->name != object_array_slopbuf)
361 free(ent->name);
9e0c3c4f 362 free(ent->path);
68f49235
JK
363}
364
71992039
365struct object *object_array_pop(struct object_array *array)
366{
367 struct object *ret;
368
369 if (!array->nr)
370 return NULL;
371
372 ret = array->objects[array->nr - 1].item;
373 object_array_release_entry(&array->objects[array->nr - 1]);
374 array->nr--;
375 return ret;
376}
377
aeb4a51e
MH
378void object_array_filter(struct object_array *array,
379 object_array_each_func_t want, void *cb_data)
b2a6d1c6 380{
aeb4a51e 381 unsigned nr = array->nr, src, dst;
b2a6d1c6
JH
382 struct object_array_entry *objects = array->objects;
383
aeb4a51e
MH
384 for (src = dst = 0; src < nr; src++) {
385 if (want(&objects[src], cb_data)) {
b2a6d1c6
JH
386 if (src != dst)
387 objects[dst] = objects[src];
388 dst++;
31faeb20 389 } else {
68f49235 390 object_array_release_entry(&objects[src]);
aeb4a51e
MH
391 }
392 }
393 array->nr = dst;
394}
395
46be8231
JK
396void object_array_clear(struct object_array *array)
397{
398 int i;
399 for (i = 0; i < array->nr; i++)
400 object_array_release_entry(&array->objects[i]);
6a83d902 401 FREE_AND_NULL(array->objects);
46be8231
JK
402 array->nr = array->alloc = 0;
403}
404
1506510c
MH
405/*
406 * Return true iff array already contains an entry with name.
407 */
408static int contains_name(struct object_array *array, const char *name)
409{
410 unsigned nr = array->nr, i;
411 struct object_array_entry *object = array->objects;
412
413 for (i = 0; i < nr; i++, object++)
414 if (!strcmp(object->name, name))
415 return 1;
416 return 0;
417}
418
b2a6d1c6
JH
419void object_array_remove_duplicates(struct object_array *array)
420{
1506510c 421 unsigned nr = array->nr, src;
b2a6d1c6
JH
422 struct object_array_entry *objects = array->objects;
423
1506510c
MH
424 array->nr = 0;
425 for (src = 0; src < nr; src++) {
426 if (!contains_name(array, objects[src].name)) {
427 if (src != array->nr)
428 objects[array->nr] = objects[src];
429 array->nr++;
31faeb20 430 } else {
68f49235 431 object_array_release_entry(&objects[src]);
b2a6d1c6 432 }
b2a6d1c6
JH
433 }
434}
bcc0a3ea
HV
435
436void clear_object_flags(unsigned flags)
437{
438 int i;
439
99bf115c
SB
440 for (i=0; i < the_repository->parsed_objects->obj_hash_size; i++) {
441 struct object *obj = the_repository->parsed_objects->obj_hash[i];
bcc0a3ea
HV
442 if (obj)
443 obj->flags &= ~flags;
444 }
445}
4ad315fc
RS
446
447void clear_commit_marks_all(unsigned int flags)
448{
449 int i;
450
99bf115c
SB
451 for (i = 0; i < the_repository->parsed_objects->obj_hash_size; i++) {
452 struct object *obj = the_repository->parsed_objects->obj_hash[i];
4ad315fc
RS
453 if (obj && obj->type == OBJ_COMMIT)
454 obj->flags &= ~flags;
455 }
456}
90c62155 457
99bf115c
SB
458struct parsed_object_pool *parsed_object_pool_new(void)
459{
460 struct parsed_object_pool *o = xmalloc(sizeof(*o));
461 memset(o, 0, sizeof(*o));
14ba97f8
SB
462
463 o->blob_state = allocate_alloc_state();
464 o->tree_state = allocate_alloc_state();
465 o->commit_state = allocate_alloc_state();
466 o->tag_state = allocate_alloc_state();
467 o->object_state = allocate_alloc_state();
468
eee4502b
SB
469 o->is_shallow = -1;
470 o->shallow_stat = xcalloc(1, sizeof(*o->shallow_stat));
471
65ea9d4b
SB
472 o->buffer_slab = allocate_commit_buffer_slab();
473
99bf115c
SB
474 return o;
475}
476
90c62155
SB
477struct raw_object_store *raw_object_store_new(void)
478{
479 struct raw_object_store *o = xmalloc(sizeof(*o));
480
481 memset(o, 0, sizeof(*o));
a80d72db 482 INIT_LIST_HEAD(&o->packed_git_mru);
90c62155
SB
483 return o;
484}
97501e93 485
f0eaf638 486static void free_object_directory(struct object_directory *odb)
97501e93 487{
f0eaf638 488 free(odb->path);
d4e19e51 489 odb_clear_loose_cache(odb);
263db403 490 free(odb);
97501e93
SB
491}
492
f0eaf638 493static void free_object_directories(struct raw_object_store *o)
97501e93 494{
f0eaf638 495 while (o->odb) {
263db403 496 struct object_directory *next;
97501e93 497
f0eaf638
JK
498 next = o->odb->next;
499 free_object_directory(o->odb);
500 o->odb = next;
97501e93
SB
501 }
502}
503
90c62155
SB
504void raw_object_store_clear(struct raw_object_store *o)
505{
90c62155 506 FREE_AND_NULL(o->alternate_db);
7a1dc605
SB
507
508 oidmap_free(o->replace_map, 1);
d5873072 509 FREE_AND_NULL(o->replace_map);
97501e93 510
85277506
JT
511 free_commit_graph(o->commit_graph);
512 o->commit_graph = NULL;
513 o->commit_graph_attempted = 0;
514
f0eaf638
JK
515 free_object_directories(o);
516 o->odb_tail = NULL;
517 o->loaded_alternates = 0;
a80d72db
SB
518
519 INIT_LIST_HEAD(&o->packed_git_mru);
2d511cfc 520 close_object_store(o);
d0b59866 521 o->packed_git = NULL;
90c62155 522}
99bf115c
SB
523
524void parsed_object_pool_clear(struct parsed_object_pool *o)
525{
526 /*
99bf115c
SB
527 * As objects are allocated in slabs (see alloc.c), we do
528 * not need to free each object, but each slab instead.
14ba97f8
SB
529 *
530 * Before doing so, we need to free any additional memory
531 * the objects may hold.
99bf115c 532 */
14ba97f8
SB
533 unsigned i;
534
535 for (i = 0; i < o->obj_hash_size; i++) {
536 struct object *obj = o->obj_hash[i];
537
538 if (!obj)
539 continue;
540
541 if (obj->type == OBJ_TREE)
542 free_tree_buffer((struct tree*)obj);
543 else if (obj->type == OBJ_COMMIT)
6a7895fd 544 release_commit_memory(o, (struct commit*)obj);
14ba97f8
SB
545 else if (obj->type == OBJ_TAG)
546 release_tag_memory((struct tag*)obj);
547 }
548
549 FREE_AND_NULL(o->obj_hash);
550 o->obj_hash_size = 0;
551
65ea9d4b
SB
552 free_commit_buffer_slab(o->buffer_slab);
553 o->buffer_slab = NULL;
554
14ba97f8
SB
555 clear_alloc_state(o->blob_state);
556 clear_alloc_state(o->tree_state);
557 clear_alloc_state(o->commit_state);
558 clear_alloc_state(o->tag_state);
559 clear_alloc_state(o->object_state);
96b0710e 560 stat_validity_clear(o->shallow_stat);
14ba97f8
SB
561 FREE_AND_NULL(o->blob_state);
562 FREE_AND_NULL(o->tree_state);
563 FREE_AND_NULL(o->commit_state);
564 FREE_AND_NULL(o->tag_state);
565 FREE_AND_NULL(o->object_state);
96b0710e 566 FREE_AND_NULL(o->shallow_stat);
99bf115c 567}