alloc: add repository argument to alloc_commit_index
[git/git.git] / object.c
CommitLineData
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"
90c62155 8#include "object-store.h"
d0b59866 9#include "packfile.h"
175785e5 10
fc046a75
LT
11unsigned int get_max_object_index(void)
12{
99bf115c 13 return the_repository->parsed_objects->obj_hash_size;
fc046a75
LT
14}
15
16struct object *get_indexed_object(unsigned int idx)
17{
99bf115c 18 return the_repository->parsed_objects->obj_hash[idx];
fc046a75 19}
175785e5 20
df843662
NP
21static const char *object_type_strings[] = {
22 NULL, /* OBJ_NONE = 0 */
23 "commit", /* OBJ_COMMIT = 1 */
24 "tree", /* OBJ_TREE = 2 */
25 "blob", /* OBJ_BLOB = 3 */
26 "tag", /* OBJ_TAG = 4 */
885a86ab
LT
27};
28
debca9d2 29const char *type_name(unsigned int type)
df843662
NP
30{
31 if (type >= ARRAY_SIZE(object_type_strings))
32 return NULL;
33 return object_type_strings[type];
34}
35
fe8e3b71 36int type_from_string_gently(const char *str, ssize_t len, int gentle)
df843662
NP
37{
38 int i;
39
fe8e3b71
JS
40 if (len < 0)
41 len = strlen(str);
42
df843662 43 for (i = 1; i < ARRAY_SIZE(object_type_strings); i++)
b7994af0
JK
44 if (!strncmp(str, object_type_strings[i], len) &&
45 object_type_strings[i][len] == '\0')
df843662 46 return i;
fe8e3b71
JS
47
48 if (gentle)
49 return -1;
50
df843662
NP
51 die("invalid object type \"%s\"", str);
52}
53
33bef7ea
MH
54/*
55 * Return a numerical hash value between 0 and n-1 for the object with
56 * the specified sha1. n must be a power of 2. Please note that the
57 * return value is *not* consistent across computer architectures.
58 */
9f36c9b7 59static unsigned int hash_obj(const unsigned char *sha1, unsigned int n)
0556a11a 60{
039dc71a 61 return sha1hash(sha1) & (n - 1);
0556a11a
LT
62}
63
33bef7ea
MH
64/*
65 * Insert obj into the hash table hash, which has length size (which
66 * must be a power of 2). On collisions, simply overflow to the next
67 * empty bucket.
68 */
0556a11a
LT
69static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size)
70{
ed1c9977 71 unsigned int j = hash_obj(obj->oid.hash, size);
0556a11a
LT
72
73 while (hash[j]) {
74 j++;
75 if (j >= size)
76 j = 0;
77 }
78 hash[j] = obj;
79}
80
33bef7ea
MH
81/*
82 * Look up the record for the given sha1 in the hash map stored in
83 * obj_hash. Return NULL if it was not found.
84 */
0556a11a 85struct object *lookup_object(const unsigned char *sha1)
175785e5 86{
9a414486 87 unsigned int i, first;
0556a11a 88 struct object *obj;
175785e5 89
99bf115c 90 if (!the_repository->parsed_objects->obj_hash)
0556a11a 91 return NULL;
175785e5 92
99bf115c
SB
93 first = i = hash_obj(sha1,
94 the_repository->parsed_objects->obj_hash_size);
95 while ((obj = the_repository->parsed_objects->obj_hash[i]) != NULL) {
ed1c9977 96 if (!hashcmp(sha1, obj->oid.hash))
0556a11a 97 break;
070879ca 98 i++;
99bf115c 99 if (i == the_repository->parsed_objects->obj_hash_size)
070879ca
JS
100 i = 0;
101 }
9a414486
JK
102 if (obj && i != first) {
103 /*
104 * Move object to where we started to look for it so
105 * that we do not need to walk the hash table the next
106 * time we look for it.
107 */
99bf115c
SB
108 SWAP(the_repository->parsed_objects->obj_hash[i],
109 the_repository->parsed_objects->obj_hash[first]);
9a414486 110 }
0556a11a 111 return obj;
175785e5
DB
112}
113
33bef7ea
MH
114/*
115 * Increase the size of the hash map stored in obj_hash to the next
116 * power of 2 (but at least 32). Copy the existing values to the new
117 * hash map.
118 */
c077a452
JN
119#define grow_object_hash(r) grow_object_hash_##r()
120static void grow_object_hash_the_repository(void)
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 */
99bf115c 127 int new_hash_size = the_repository->parsed_objects->obj_hash_size < 32 ? 32 : 2 * the_repository->parsed_objects->obj_hash_size;
0556a11a
LT
128 struct object **new_hash;
129
b3c952f8 130 new_hash = xcalloc(new_hash_size, sizeof(struct object *));
99bf115c
SB
131 for (i = 0; i < the_repository->parsed_objects->obj_hash_size; i++) {
132 struct object *obj = the_repository->parsed_objects->obj_hash[i];
0556a11a
LT
133 if (!obj)
134 continue;
135 insert_obj_hash(obj, new_hash, new_hash_size);
136 }
99bf115c
SB
137 free(the_repository->parsed_objects->obj_hash);
138 the_repository->parsed_objects->obj_hash = new_hash;
139 the_repository->parsed_objects->obj_hash_size = new_hash_size;
175785e5
DB
140}
141
68f95d38 142void *create_object_the_repository(const unsigned char *sha1, void *o)
175785e5 143{
100c5f3b
LT
144 struct object *obj = o;
145
175785e5 146 obj->parsed = 0;
0556a11a 147 obj->flags = 0;
ed1c9977 148 hashcpy(obj->oid.hash, sha1);
175785e5 149
99bf115c 150 if (the_repository->parsed_objects->obj_hash_size - 1 <= the_repository->parsed_objects->nr_objs * 2)
c077a452 151 grow_object_hash(the_repository);
175785e5 152
99bf115c
SB
153 insert_obj_hash(obj, the_repository->parsed_objects->obj_hash,
154 the_repository->parsed_objects->obj_hash_size);
155 the_repository->parsed_objects->nr_objs++;
100c5f3b 156 return obj;
175785e5
DB
157}
158
8ff226a9
JK
159void *object_as_type(struct object *obj, enum object_type type, int quiet)
160{
161 if (obj->type == type)
162 return obj;
163 else if (obj->type == OBJ_NONE) {
d66bebcb 164 if (type == OBJ_COMMIT)
dd5d9deb 165 ((struct commit *)obj)->index = alloc_commit_index(the_repository);
8ff226a9
JK
166 obj->type = type;
167 return obj;
168 }
169 else {
170 if (!quiet)
171 error("object %s is a %s, not a %s",
f2fd0760 172 oid_to_hex(&obj->oid),
debca9d2 173 type_name(obj->type), type_name(type));
8ff226a9
JK
174 return NULL;
175 }
176}
177
66e481b0
DB
178struct object *lookup_unknown_object(const unsigned char *sha1)
179{
180 struct object *obj = lookup_object(sha1);
100c5f3b 181 if (!obj)
68f95d38 182 obj = create_object(the_repository, sha1,
13e3fdcb 183 alloc_object_node(the_repository));
66e481b0
DB
184 return obj;
185}
186
c251c83d 187struct object *parse_object_buffer(const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
9f613ddd
JH
188{
189 struct object *obj;
8e92e8f2 190 *eaten_p = 0;
9f613ddd 191
cc216827 192 obj = NULL;
21666f1a 193 if (type == OBJ_BLOB) {
c251c83d 194 struct blob *blob = lookup_blob(oid);
cc216827 195 if (blob) {
d0b8c9e5
MK
196 if (parse_blob_buffer(blob, buffer, size))
197 return NULL;
cc216827
JM
198 obj = &blob->object;
199 }
21666f1a 200 } else if (type == OBJ_TREE) {
c251c83d 201 struct tree *tree = lookup_tree(oid);
cc216827
JM
202 if (tree) {
203 obj = &tree->object;
68be2fea
JH
204 if (!tree->buffer)
205 tree->object.parsed = 0;
cc216827 206 if (!tree->object.parsed) {
d0b8c9e5
MK
207 if (parse_tree_buffer(tree, buffer, size))
208 return NULL;
8e92e8f2 209 *eaten_p = 1;
cc216827 210 }
9f613ddd 211 }
21666f1a 212 } else if (type == OBJ_COMMIT) {
c251c83d 213 struct commit *commit = lookup_commit(oid);
cc216827 214 if (commit) {
d0b8c9e5
MK
215 if (parse_commit_buffer(commit, buffer, size))
216 return NULL;
8597ea3a
JK
217 if (!get_cached_commit_buffer(commit, NULL)) {
218 set_commit_buffer(commit, buffer, size);
8e92e8f2 219 *eaten_p = 1;
cc216827
JM
220 }
221 obj = &commit->object;
9f613ddd 222 }
21666f1a 223 } else if (type == OBJ_TAG) {
c251c83d 224 struct tag *tag = lookup_tag(oid);
cc216827 225 if (tag) {
d0b8c9e5
MK
226 if (parse_tag_buffer(tag, buffer, size))
227 return NULL;
cc216827
JM
228 obj = &tag->object;
229 }
9f613ddd 230 } else {
c251c83d 231 warning("object %s has unknown type id %d", oid_to_hex(oid), type);
9f613ddd
JH
232 obj = NULL;
233 }
9f613ddd
JH
234 return obj;
235}
236
c251c83d 237struct object *parse_object_or_die(const struct object_id *oid,
75a95490
JK
238 const char *name)
239{
c251c83d 240 struct object *o = parse_object(oid);
75a95490
JK
241 if (o)
242 return o;
243
c251c83d 244 die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid));
75a95490
JK
245}
246
c251c83d 247struct object *parse_object(const struct object_id *oid)
e9eefa67 248{
c4584ae3 249 unsigned long size;
21666f1a 250 enum object_type type;
9f613ddd 251 int eaten;
1f2e7cea 252 const struct object_id *repl = lookup_replace_object(the_repository, oid);
ccdc6037
JK
253 void *buffer;
254 struct object *obj;
255
c251c83d 256 obj = lookup_object(oid->hash);
ccdc6037
JK
257 if (obj && obj->parsed)
258 return obj;
9f613ddd 259
df11e196 260 if ((obj && obj->type == OBJ_BLOB && has_object_file(oid)) ||
c251c83d 261 (!obj && has_object_file(oid) &&
0df8e965 262 oid_object_info(the_repository, oid, NULL) == OBJ_BLOB)) {
b383a13c 263 if (check_object_signature(repl, NULL, 0, NULL) < 0) {
c251c83d 264 error("sha1 mismatch %s", oid_to_hex(oid));
090ea126
NTND
265 return NULL;
266 }
c251c83d 267 parse_blob_buffer(lookup_blob(oid), NULL, 0);
268 return lookup_object(oid->hash);
090ea126
NTND
269 }
270
b4f5aca4 271 buffer = read_object_file(oid, &type, &size);
c4584ae3 272 if (buffer) {
b383a13c 273 if (check_object_signature(repl, buffer, size, type_name(type)) < 0) {
0b1f1130 274 free(buffer);
b383a13c 275 error("sha1 mismatch %s", oid_to_hex(repl));
acdeec62
LT
276 return NULL;
277 }
9f613ddd 278
c251c83d 279 obj = parse_object_buffer(oid, type, size, buffer, &eaten);
9f613ddd
JH
280 if (!eaten)
281 free(buffer);
bd2c39f5 282 return obj;
e9eefa67
DB
283 }
284 return NULL;
285}
66e481b0
DB
286
287struct object_list *object_list_insert(struct object *item,
288 struct object_list **list_p)
289{
290 struct object_list *new_list = xmalloc(sizeof(struct object_list));
55b4e9e4
JH
291 new_list->item = item;
292 new_list->next = *list_p;
293 *list_p = new_list;
294 return new_list;
66e481b0
DB
295}
296
66e481b0
DB
297int object_list_contains(struct object_list *list, struct object *obj)
298{
299 while (list) {
300 if (list->item == obj)
301 return 1;
302 list = list->next;
303 }
304 return 0;
305}
1f1e895f 306
31faeb20
MH
307/*
308 * A zero-length string to which object_array_entry::name can be
309 * initialized without requiring a malloc/free.
310 */
311static char object_array_slopbuf[1];
312
9e0c3c4f
JK
313void add_object_array_with_path(struct object *obj, const char *name,
314 struct object_array *array,
315 unsigned mode, const char *path)
1f1e895f
LT
316{
317 unsigned nr = array->nr;
318 unsigned alloc = array->alloc;
319 struct object_array_entry *objects = array->objects;
31faeb20 320 struct object_array_entry *entry;
1f1e895f
LT
321
322 if (nr >= alloc) {
323 alloc = (alloc + 32) * 2;
2756ca43 324 REALLOC_ARRAY(objects, alloc);
1f1e895f
LT
325 array->alloc = alloc;
326 array->objects = objects;
327 }
31faeb20
MH
328 entry = &objects[nr];
329 entry->item = obj;
330 if (!name)
331 entry->name = NULL;
332 else if (!*name)
333 /* Use our own empty string instead of allocating one: */
334 entry->name = object_array_slopbuf;
335 else
336 entry->name = xstrdup(name);
337 entry->mode = mode;
9e0c3c4f
JK
338 if (path)
339 entry->path = xstrdup(path);
340 else
341 entry->path = NULL;
1f1e895f
LT
342 array->nr = ++nr;
343}
b2a6d1c6 344
afa15f3c
MG
345void add_object_array(struct object *obj, const char *name, struct object_array *array)
346{
189a1222 347 add_object_array_with_path(obj, name, array, S_IFINVALID, NULL);
afa15f3c
MG
348}
349
68f49235
JK
350/*
351 * Free all memory associated with an entry; the result is
352 * in an unspecified state and should not be examined.
353 */
354static void object_array_release_entry(struct object_array_entry *ent)
355{
356 if (ent->name != object_array_slopbuf)
357 free(ent->name);
9e0c3c4f 358 free(ent->path);
68f49235
JK
359}
360
71992039
361struct object *object_array_pop(struct object_array *array)
362{
363 struct object *ret;
364
365 if (!array->nr)
366 return NULL;
367
368 ret = array->objects[array->nr - 1].item;
369 object_array_release_entry(&array->objects[array->nr - 1]);
370 array->nr--;
371 return ret;
372}
373
aeb4a51e
MH
374void object_array_filter(struct object_array *array,
375 object_array_each_func_t want, void *cb_data)
b2a6d1c6 376{
aeb4a51e 377 unsigned nr = array->nr, src, dst;
b2a6d1c6
JH
378 struct object_array_entry *objects = array->objects;
379
aeb4a51e
MH
380 for (src = dst = 0; src < nr; src++) {
381 if (want(&objects[src], cb_data)) {
b2a6d1c6
JH
382 if (src != dst)
383 objects[dst] = objects[src];
384 dst++;
31faeb20 385 } else {
68f49235 386 object_array_release_entry(&objects[src]);
aeb4a51e
MH
387 }
388 }
389 array->nr = dst;
390}
391
46be8231
JK
392void object_array_clear(struct object_array *array)
393{
394 int i;
395 for (i = 0; i < array->nr; i++)
396 object_array_release_entry(&array->objects[i]);
6a83d902 397 FREE_AND_NULL(array->objects);
46be8231
JK
398 array->nr = array->alloc = 0;
399}
400
1506510c
MH
401/*
402 * Return true iff array already contains an entry with name.
403 */
404static int contains_name(struct object_array *array, const char *name)
405{
406 unsigned nr = array->nr, i;
407 struct object_array_entry *object = array->objects;
408
409 for (i = 0; i < nr; i++, object++)
410 if (!strcmp(object->name, name))
411 return 1;
412 return 0;
413}
414
b2a6d1c6
JH
415void object_array_remove_duplicates(struct object_array *array)
416{
1506510c 417 unsigned nr = array->nr, src;
b2a6d1c6
JH
418 struct object_array_entry *objects = array->objects;
419
1506510c
MH
420 array->nr = 0;
421 for (src = 0; src < nr; src++) {
422 if (!contains_name(array, objects[src].name)) {
423 if (src != array->nr)
424 objects[array->nr] = objects[src];
425 array->nr++;
31faeb20 426 } else {
68f49235 427 object_array_release_entry(&objects[src]);
b2a6d1c6 428 }
b2a6d1c6
JH
429 }
430}
bcc0a3ea
HV
431
432void clear_object_flags(unsigned flags)
433{
434 int i;
435
99bf115c
SB
436 for (i=0; i < the_repository->parsed_objects->obj_hash_size; i++) {
437 struct object *obj = the_repository->parsed_objects->obj_hash[i];
bcc0a3ea
HV
438 if (obj)
439 obj->flags &= ~flags;
440 }
441}
4ad315fc
RS
442
443void clear_commit_marks_all(unsigned int flags)
444{
445 int i;
446
99bf115c
SB
447 for (i = 0; i < the_repository->parsed_objects->obj_hash_size; i++) {
448 struct object *obj = the_repository->parsed_objects->obj_hash[i];
4ad315fc
RS
449 if (obj && obj->type == OBJ_COMMIT)
450 obj->flags &= ~flags;
451 }
452}
90c62155 453
99bf115c
SB
454struct parsed_object_pool *parsed_object_pool_new(void)
455{
456 struct parsed_object_pool *o = xmalloc(sizeof(*o));
457 memset(o, 0, sizeof(*o));
458 return o;
459}
460
90c62155
SB
461struct raw_object_store *raw_object_store_new(void)
462{
463 struct raw_object_store *o = xmalloc(sizeof(*o));
464
465 memset(o, 0, sizeof(*o));
a80d72db 466 INIT_LIST_HEAD(&o->packed_git_mru);
90c62155
SB
467 return o;
468}
97501e93
SB
469
470static void free_alt_odb(struct alternate_object_database *alt)
471{
472 strbuf_release(&alt->scratch);
473 oid_array_clear(&alt->loose_objects_cache);
474 free(alt);
475}
476
477static void free_alt_odbs(struct raw_object_store *o)
478{
479 while (o->alt_odb_list) {
480 struct alternate_object_database *next;
481
482 next = o->alt_odb_list->next;
483 free_alt_odb(o->alt_odb_list);
484 o->alt_odb_list = next;
485 }
486}
487
90c62155
SB
488void raw_object_store_clear(struct raw_object_store *o)
489{
490 FREE_AND_NULL(o->objectdir);
491 FREE_AND_NULL(o->alternate_db);
97501e93
SB
492
493 free_alt_odbs(o);
494 o->alt_odb_tail = NULL;
a80d72db
SB
495
496 INIT_LIST_HEAD(&o->packed_git_mru);
d0b59866
SB
497 close_all_packs(o);
498 o->packed_git = NULL;
90c62155 499}
99bf115c
SB
500
501void parsed_object_pool_clear(struct parsed_object_pool *o)
502{
503 /*
504 * TOOD free objects in o->obj_hash.
505 *
506 * As objects are allocated in slabs (see alloc.c), we do
507 * not need to free each object, but each slab instead.
508 */
509}