sha1-file: avoid "sha1 file" for generic use in messages
[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 */
9f36c9b7 62static unsigned int hash_obj(const unsigned char *sha1, unsigned int n)
0556a11a 63{
039dc71a 64 return sha1hash(sha1) & (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{
ed1c9977 74 unsigned int j = hash_obj(obj->oid.hash, 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 */
94c09a71 88struct object *lookup_object(struct repository *r, const unsigned char *sha1)
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
94c09a71
SB
96 first = i = hash_obj(sha1, r->parsed_objects->obj_hash_size);
97 while ((obj = r->parsed_objects->obj_hash[i]) != NULL) {
e3ff0683 98 if (hasheq(sha1, obj->oid.hash))
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
341e45e4 144void *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
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)
a962da1e 167 ((struct commit *)obj)->index = alloc_commit_index(r);
8ff226a9
JK
168 obj->type = type;
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
66e481b0
DB
180struct object *lookup_unknown_object(const unsigned char *sha1)
181{
5abddd1e 182 struct object *obj = lookup_object(the_repository, 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
108ed1a3 189struct 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 239struct 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 249struct 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
8e4b0b60 258 obj = lookup_object(r, 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) &&
8e4b0b60 264 oid_object_info(r, oid, NULL) == OBJ_BLOB)) {
b383a13c 265 if (check_object_signature(repl, NULL, 0, NULL) < 0) {
42246589 266 error(_("sha1 mismatch %s"), oid_to_hex(oid));
090ea126
NTND
267 return NULL;
268 }
8e4b0b60
SB
269 parse_blob_buffer(lookup_blob(r, oid), NULL, 0);
270 return lookup_object(r, 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);
42246589 277 error(_("sha1 mismatch %s"), oid_to_hex(repl));
acdeec62
LT
278 return NULL;
279 }
9f613ddd 280
8e4b0b60 281 obj = parse_object_buffer(r, oid, type, size,
1ec5bfd2 282 buffer, &eaten);
9f613ddd
JH
283 if (!eaten)
284 free(buffer);
bd2c39f5 285 return obj;
e9eefa67
DB
286 }
287 return NULL;
288}
66e481b0
DB
289
290struct object_list *object_list_insert(struct object *item,
291 struct object_list **list_p)
292{
293 struct object_list *new_list = xmalloc(sizeof(struct object_list));
55b4e9e4
JH
294 new_list->item = item;
295 new_list->next = *list_p;
296 *list_p = new_list;
297 return new_list;
66e481b0
DB
298}
299
66e481b0
DB
300int object_list_contains(struct object_list *list, struct object *obj)
301{
302 while (list) {
303 if (list->item == obj)
304 return 1;
305 list = list->next;
306 }
307 return 0;
308}
1f1e895f 309
31faeb20
MH
310/*
311 * A zero-length string to which object_array_entry::name can be
312 * initialized without requiring a malloc/free.
313 */
314static char object_array_slopbuf[1];
315
9e0c3c4f
JK
316void add_object_array_with_path(struct object *obj, const char *name,
317 struct object_array *array,
318 unsigned mode, const char *path)
1f1e895f
LT
319{
320 unsigned nr = array->nr;
321 unsigned alloc = array->alloc;
322 struct object_array_entry *objects = array->objects;
31faeb20 323 struct object_array_entry *entry;
1f1e895f
LT
324
325 if (nr >= alloc) {
326 alloc = (alloc + 32) * 2;
2756ca43 327 REALLOC_ARRAY(objects, alloc);
1f1e895f
LT
328 array->alloc = alloc;
329 array->objects = objects;
330 }
31faeb20
MH
331 entry = &objects[nr];
332 entry->item = obj;
333 if (!name)
334 entry->name = NULL;
335 else if (!*name)
336 /* Use our own empty string instead of allocating one: */
337 entry->name = object_array_slopbuf;
338 else
339 entry->name = xstrdup(name);
340 entry->mode = mode;
9e0c3c4f
JK
341 if (path)
342 entry->path = xstrdup(path);
343 else
344 entry->path = NULL;
1f1e895f
LT
345 array->nr = ++nr;
346}
b2a6d1c6 347
afa15f3c
MG
348void add_object_array(struct object *obj, const char *name, struct object_array *array)
349{
189a1222 350 add_object_array_with_path(obj, name, array, S_IFINVALID, NULL);
afa15f3c
MG
351}
352
68f49235
JK
353/*
354 * Free all memory associated with an entry; the result is
355 * in an unspecified state and should not be examined.
356 */
357static void object_array_release_entry(struct object_array_entry *ent)
358{
359 if (ent->name != object_array_slopbuf)
360 free(ent->name);
9e0c3c4f 361 free(ent->path);
68f49235
JK
362}
363
71992039
364struct object *object_array_pop(struct object_array *array)
365{
366 struct object *ret;
367
368 if (!array->nr)
369 return NULL;
370
371 ret = array->objects[array->nr - 1].item;
372 object_array_release_entry(&array->objects[array->nr - 1]);
373 array->nr--;
374 return ret;
375}
376
aeb4a51e
MH
377void object_array_filter(struct object_array *array,
378 object_array_each_func_t want, void *cb_data)
b2a6d1c6 379{
aeb4a51e 380 unsigned nr = array->nr, src, dst;
b2a6d1c6
JH
381 struct object_array_entry *objects = array->objects;
382
aeb4a51e
MH
383 for (src = dst = 0; src < nr; src++) {
384 if (want(&objects[src], cb_data)) {
b2a6d1c6
JH
385 if (src != dst)
386 objects[dst] = objects[src];
387 dst++;
31faeb20 388 } else {
68f49235 389 object_array_release_entry(&objects[src]);
aeb4a51e
MH
390 }
391 }
392 array->nr = dst;
393}
394
46be8231
JK
395void object_array_clear(struct object_array *array)
396{
397 int i;
398 for (i = 0; i < array->nr; i++)
399 object_array_release_entry(&array->objects[i]);
6a83d902 400 FREE_AND_NULL(array->objects);
46be8231
JK
401 array->nr = array->alloc = 0;
402}
403
1506510c
MH
404/*
405 * Return true iff array already contains an entry with name.
406 */
407static int contains_name(struct object_array *array, const char *name)
408{
409 unsigned nr = array->nr, i;
410 struct object_array_entry *object = array->objects;
411
412 for (i = 0; i < nr; i++, object++)
413 if (!strcmp(object->name, name))
414 return 1;
415 return 0;
416}
417
b2a6d1c6
JH
418void object_array_remove_duplicates(struct object_array *array)
419{
1506510c 420 unsigned nr = array->nr, src;
b2a6d1c6
JH
421 struct object_array_entry *objects = array->objects;
422
1506510c
MH
423 array->nr = 0;
424 for (src = 0; src < nr; src++) {
425 if (!contains_name(array, objects[src].name)) {
426 if (src != array->nr)
427 objects[array->nr] = objects[src];
428 array->nr++;
31faeb20 429 } else {
68f49235 430 object_array_release_entry(&objects[src]);
b2a6d1c6 431 }
b2a6d1c6
JH
432 }
433}
bcc0a3ea
HV
434
435void clear_object_flags(unsigned flags)
436{
437 int i;
438
99bf115c
SB
439 for (i=0; i < the_repository->parsed_objects->obj_hash_size; i++) {
440 struct object *obj = the_repository->parsed_objects->obj_hash[i];
bcc0a3ea
HV
441 if (obj)
442 obj->flags &= ~flags;
443 }
444}
4ad315fc
RS
445
446void clear_commit_marks_all(unsigned int flags)
447{
448 int i;
449
99bf115c
SB
450 for (i = 0; i < the_repository->parsed_objects->obj_hash_size; i++) {
451 struct object *obj = the_repository->parsed_objects->obj_hash[i];
4ad315fc
RS
452 if (obj && obj->type == OBJ_COMMIT)
453 obj->flags &= ~flags;
454 }
455}
90c62155 456
99bf115c
SB
457struct parsed_object_pool *parsed_object_pool_new(void)
458{
459 struct parsed_object_pool *o = xmalloc(sizeof(*o));
460 memset(o, 0, sizeof(*o));
14ba97f8
SB
461
462 o->blob_state = allocate_alloc_state();
463 o->tree_state = allocate_alloc_state();
464 o->commit_state = allocate_alloc_state();
465 o->tag_state = allocate_alloc_state();
466 o->object_state = allocate_alloc_state();
467
eee4502b
SB
468 o->is_shallow = -1;
469 o->shallow_stat = xcalloc(1, sizeof(*o->shallow_stat));
470
65ea9d4b
SB
471 o->buffer_slab = allocate_commit_buffer_slab();
472
99bf115c
SB
473 return o;
474}
475
90c62155
SB
476struct raw_object_store *raw_object_store_new(void)
477{
478 struct raw_object_store *o = xmalloc(sizeof(*o));
479
480 memset(o, 0, sizeof(*o));
a80d72db 481 INIT_LIST_HEAD(&o->packed_git_mru);
90c62155
SB
482 return o;
483}
97501e93 484
f0eaf638 485static void free_object_directory(struct object_directory *odb)
97501e93 486{
f0eaf638 487 free(odb->path);
d4e19e51 488 odb_clear_loose_cache(odb);
263db403 489 free(odb);
97501e93
SB
490}
491
f0eaf638 492static void free_object_directories(struct raw_object_store *o)
97501e93 493{
f0eaf638 494 while (o->odb) {
263db403 495 struct object_directory *next;
97501e93 496
f0eaf638
JK
497 next = o->odb->next;
498 free_object_directory(o->odb);
499 o->odb = next;
97501e93
SB
500 }
501}
502
90c62155
SB
503void raw_object_store_clear(struct raw_object_store *o)
504{
90c62155 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 509
85277506
JT
510 free_commit_graph(o->commit_graph);
511 o->commit_graph = NULL;
512 o->commit_graph_attempted = 0;
513
f0eaf638
JK
514 free_object_directories(o);
515 o->odb_tail = NULL;
516 o->loaded_alternates = 0;
a80d72db
SB
517
518 INIT_LIST_HEAD(&o->packed_git_mru);
d0b59866
SB
519 close_all_packs(o);
520 o->packed_git = NULL;
90c62155 521}
99bf115c
SB
522
523void parsed_object_pool_clear(struct parsed_object_pool *o)
524{
525 /*
99bf115c
SB
526 * As objects are allocated in slabs (see alloc.c), we do
527 * not need to free each object, but each slab instead.
14ba97f8
SB
528 *
529 * Before doing so, we need to free any additional memory
530 * the objects may hold.
99bf115c 531 */
14ba97f8
SB
532 unsigned i;
533
534 for (i = 0; i < o->obj_hash_size; i++) {
535 struct object *obj = o->obj_hash[i];
536
537 if (!obj)
538 continue;
539
540 if (obj->type == OBJ_TREE)
541 free_tree_buffer((struct tree*)obj);
542 else if (obj->type == OBJ_COMMIT)
543 release_commit_memory((struct commit*)obj);
544 else if (obj->type == OBJ_TAG)
545 release_tag_memory((struct tag*)obj);
546 }
547
548 FREE_AND_NULL(o->obj_hash);
549 o->obj_hash_size = 0;
550
65ea9d4b
SB
551 free_commit_buffer_slab(o->buffer_slab);
552 o->buffer_slab = NULL;
553
14ba97f8
SB
554 clear_alloc_state(o->blob_state);
555 clear_alloc_state(o->tree_state);
556 clear_alloc_state(o->commit_state);
557 clear_alloc_state(o->tag_state);
558 clear_alloc_state(o->object_state);
559 FREE_AND_NULL(o->blob_state);
560 FREE_AND_NULL(o->tree_state);
561 FREE_AND_NULL(o->commit_state);
562 FREE_AND_NULL(o->tag_state);
563 FREE_AND_NULL(o->object_state);
99bf115c 564}