sha1_file: convert read_sha1_file to struct object_id
[git/git.git] / object.c
CommitLineData
8f1d2e6f 1#include "cache.h"
175785e5 2#include "object.h"
e9eefa67
DB
3#include "blob.h"
4#include "tree.h"
5#include "commit.h"
e9eefa67 6#include "tag.h"
175785e5 7
0556a11a
LT
8static struct object **obj_hash;
9static int nr_objs, obj_hash_size;
fc046a75
LT
10
11unsigned int get_max_object_index(void)
12{
0556a11a 13 return obj_hash_size;
fc046a75
LT
14}
15
16struct object *get_indexed_object(unsigned int idx)
17{
0556a11a 18 return 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
0556a11a
LT
90 if (!obj_hash)
91 return NULL;
175785e5 92
9f36c9b7 93 first = i = hash_obj(sha1, obj_hash_size);
0556a11a 94 while ((obj = obj_hash[i]) != NULL) {
ed1c9977 95 if (!hashcmp(sha1, obj->oid.hash))
0556a11a 96 break;
070879ca 97 i++;
0556a11a 98 if (i == obj_hash_size)
070879ca
JS
99 i = 0;
100 }
9a414486
JK
101 if (obj && i != first) {
102 /*
103 * Move object to where we started to look for it so
104 * that we do not need to walk the hash table the next
105 * time we look for it.
106 */
35d803bc 107 SWAP(obj_hash[i], obj_hash[first]);
9a414486 108 }
0556a11a 109 return obj;
175785e5
DB
110}
111
33bef7ea
MH
112/*
113 * Increase the size of the hash map stored in obj_hash to the next
114 * power of 2 (but at least 32). Copy the existing values to the new
115 * hash map.
116 */
0556a11a 117static void grow_object_hash(void)
175785e5 118{
0556a11a 119 int i;
9f36c9b7
NP
120 /*
121 * Note that this size must always be power-of-2 to match hash_obj
122 * above.
123 */
0556a11a
LT
124 int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size;
125 struct object **new_hash;
126
b3c952f8 127 new_hash = xcalloc(new_hash_size, sizeof(struct object *));
0556a11a
LT
128 for (i = 0; i < obj_hash_size; i++) {
129 struct object *obj = obj_hash[i];
130 if (!obj)
131 continue;
132 insert_obj_hash(obj, new_hash, new_hash_size);
133 }
134 free(obj_hash);
135 obj_hash = new_hash;
136 obj_hash_size = new_hash_size;
175785e5
DB
137}
138
d36f51c1 139void *create_object(const unsigned char *sha1, void *o)
175785e5 140{
100c5f3b
LT
141 struct object *obj = o;
142
175785e5 143 obj->parsed = 0;
0556a11a 144 obj->flags = 0;
ed1c9977 145 hashcpy(obj->oid.hash, sha1);
175785e5 146
0556a11a
LT
147 if (obj_hash_size - 1 <= nr_objs * 2)
148 grow_object_hash();
175785e5 149
0556a11a 150 insert_obj_hash(obj, obj_hash, obj_hash_size);
175785e5 151 nr_objs++;
100c5f3b 152 return obj;
175785e5
DB
153}
154
8ff226a9
JK
155void *object_as_type(struct object *obj, enum object_type type, int quiet)
156{
157 if (obj->type == type)
158 return obj;
159 else if (obj->type == OBJ_NONE) {
d66bebcb
JK
160 if (type == OBJ_COMMIT)
161 ((struct commit *)obj)->index = alloc_commit_index();
8ff226a9
JK
162 obj->type = type;
163 return obj;
164 }
165 else {
166 if (!quiet)
167 error("object %s is a %s, not a %s",
f2fd0760 168 oid_to_hex(&obj->oid),
debca9d2 169 type_name(obj->type), type_name(type));
8ff226a9
JK
170 return NULL;
171 }
172}
173
66e481b0
DB
174struct object *lookup_unknown_object(const unsigned char *sha1)
175{
176 struct object *obj = lookup_object(sha1);
100c5f3b 177 if (!obj)
d36f51c1 178 obj = create_object(sha1, alloc_object_node());
66e481b0
DB
179 return obj;
180}
181
c251c83d 182struct object *parse_object_buffer(const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
9f613ddd
JH
183{
184 struct object *obj;
8e92e8f2 185 *eaten_p = 0;
9f613ddd 186
cc216827 187 obj = NULL;
21666f1a 188 if (type == OBJ_BLOB) {
c251c83d 189 struct blob *blob = lookup_blob(oid);
cc216827 190 if (blob) {
d0b8c9e5
MK
191 if (parse_blob_buffer(blob, buffer, size))
192 return NULL;
cc216827
JM
193 obj = &blob->object;
194 }
21666f1a 195 } else if (type == OBJ_TREE) {
c251c83d 196 struct tree *tree = lookup_tree(oid);
cc216827
JM
197 if (tree) {
198 obj = &tree->object;
68be2fea
JH
199 if (!tree->buffer)
200 tree->object.parsed = 0;
cc216827 201 if (!tree->object.parsed) {
d0b8c9e5
MK
202 if (parse_tree_buffer(tree, buffer, size))
203 return NULL;
8e92e8f2 204 *eaten_p = 1;
cc216827 205 }
9f613ddd 206 }
21666f1a 207 } else if (type == OBJ_COMMIT) {
c251c83d 208 struct commit *commit = lookup_commit(oid);
cc216827 209 if (commit) {
d0b8c9e5
MK
210 if (parse_commit_buffer(commit, buffer, size))
211 return NULL;
8597ea3a
JK
212 if (!get_cached_commit_buffer(commit, NULL)) {
213 set_commit_buffer(commit, buffer, size);
8e92e8f2 214 *eaten_p = 1;
cc216827
JM
215 }
216 obj = &commit->object;
9f613ddd 217 }
21666f1a 218 } else if (type == OBJ_TAG) {
c251c83d 219 struct tag *tag = lookup_tag(oid);
cc216827 220 if (tag) {
d0b8c9e5
MK
221 if (parse_tag_buffer(tag, buffer, size))
222 return NULL;
cc216827
JM
223 obj = &tag->object;
224 }
9f613ddd 225 } else {
c251c83d 226 warning("object %s has unknown type id %d", oid_to_hex(oid), type);
9f613ddd
JH
227 obj = NULL;
228 }
9f613ddd
JH
229 return obj;
230}
231
c251c83d 232struct object *parse_object_or_die(const struct object_id *oid,
75a95490
JK
233 const char *name)
234{
c251c83d 235 struct object *o = parse_object(oid);
75a95490
JK
236 if (o)
237 return o;
238
c251c83d 239 die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid));
75a95490
JK
240}
241
c251c83d 242struct object *parse_object(const struct object_id *oid)
e9eefa67 243{
c4584ae3 244 unsigned long size;
21666f1a 245 enum object_type type;
9f613ddd 246 int eaten;
c251c83d 247 const unsigned char *repl = lookup_replace_object(oid->hash);
ccdc6037
JK
248 void *buffer;
249 struct object *obj;
250
c251c83d 251 obj = lookup_object(oid->hash);
ccdc6037
JK
252 if (obj && obj->parsed)
253 return obj;
9f613ddd 254
df11e196 255 if ((obj && obj->type == OBJ_BLOB && has_object_file(oid)) ||
c251c83d 256 (!obj && has_object_file(oid) &&
abef9020 257 oid_object_info(oid, NULL) == OBJ_BLOB)) {
17e65451 258 struct object_id reploid;
259 hashcpy(reploid.hash, repl);
260
261 if (check_object_signature(&reploid, NULL, 0, NULL) < 0) {
c251c83d 262 error("sha1 mismatch %s", oid_to_hex(oid));
090ea126
NTND
263 return NULL;
264 }
c251c83d 265 parse_blob_buffer(lookup_blob(oid), NULL, 0);
266 return lookup_object(oid->hash);
090ea126
NTND
267 }
268
b4f5aca4 269 buffer = read_object_file(oid, &type, &size);
c4584ae3 270 if (buffer) {
17e65451 271 struct object_id reploid;
272 hashcpy(reploid.hash, repl);
273
274 if (check_object_signature(&reploid, buffer, size, type_name(type)) < 0) {
0b1f1130 275 free(buffer);
82247e9b 276 error("sha1 mismatch %s", sha1_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
288struct 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
298int 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 */
312static char object_array_slopbuf[1];
313
9e0c3c4f
JK
314void 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
346void 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 */
355static 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
362struct 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
375void 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
393void 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 */
405static 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
416void 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
433void clear_object_flags(unsigned flags)
434{
435 int i;
436
437 for (i=0; i < obj_hash_size; i++) {
438 struct object *obj = obj_hash[i];
439 if (obj)
440 obj->flags &= ~flags;
441 }
442}
4ad315fc
RS
443
444void clear_commit_marks_all(unsigned int flags)
445{
446 int i;
447
448 for (i = 0; i < obj_hash_size; i++) {
449 struct object *obj = obj_hash[i];
450 if (obj && obj->type == OBJ_COMMIT)
451 obj->flags &= ~flags;
452 }
453}