move setting of object->type to alloc_* functions
[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
df843662
NP
29const char *typename(unsigned int type)
30{
31 if (type >= ARRAY_SIZE(object_type_strings))
32 return NULL;
33 return object_type_strings[type];
34}
35
36int type_from_string(const char *str)
37{
38 int i;
39
40 for (i = 1; i < ARRAY_SIZE(object_type_strings); i++)
41 if (!strcmp(str, object_type_strings[i]))
42 return i;
43 die("invalid object type \"%s\"", str);
44}
45
33bef7ea
MH
46/*
47 * Return a numerical hash value between 0 and n-1 for the object with
48 * the specified sha1. n must be a power of 2. Please note that the
49 * return value is *not* consistent across computer architectures.
50 */
9f36c9b7 51static unsigned int hash_obj(const unsigned char *sha1, unsigned int n)
0556a11a 52{
b867d324 53 unsigned int hash;
33bef7ea
MH
54
55 /*
56 * Since the sha1 is essentially random, we just take the
57 * required number of bits directly from the first
58 * sizeof(unsigned int) bytes of sha1. First we have to copy
59 * the bytes into a properly aligned integer. If we cared
60 * about getting consistent results across architectures, we
61 * would have to call ntohl() here, too.
62 */
9f36c9b7 63 memcpy(&hash, sha1, sizeof(unsigned int));
9f36c9b7 64 return hash & (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{
9f36c9b7 74 unsigned int j = hash_obj(obj->sha1, 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 */
0556a11a 88struct object *lookup_object(const unsigned char *sha1)
175785e5 89{
9a414486 90 unsigned int i, first;
0556a11a 91 struct object *obj;
175785e5 92
0556a11a
LT
93 if (!obj_hash)
94 return NULL;
175785e5 95
9f36c9b7 96 first = i = hash_obj(sha1, obj_hash_size);
0556a11a 97 while ((obj = obj_hash[i]) != NULL) {
a89fccd2 98 if (!hashcmp(sha1, obj->sha1))
0556a11a 99 break;
070879ca 100 i++;
0556a11a 101 if (i == 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 */
110 struct object *tmp = obj_hash[i];
111 obj_hash[i] = obj_hash[first];
112 obj_hash[first] = tmp;
113 }
0556a11a 114 return obj;
175785e5
DB
115}
116
33bef7ea
MH
117/*
118 * Increase the size of the hash map stored in obj_hash to the next
119 * power of 2 (but at least 32). Copy the existing values to the new
120 * hash map.
121 */
0556a11a 122static void grow_object_hash(void)
175785e5 123{
0556a11a 124 int i;
9f36c9b7
NP
125 /*
126 * Note that this size must always be power-of-2 to match hash_obj
127 * above.
128 */
0556a11a
LT
129 int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size;
130 struct object **new_hash;
131
b3c952f8 132 new_hash = xcalloc(new_hash_size, sizeof(struct object *));
0556a11a
LT
133 for (i = 0; i < obj_hash_size; i++) {
134 struct object *obj = obj_hash[i];
135 if (!obj)
136 continue;
137 insert_obj_hash(obj, new_hash, new_hash_size);
138 }
139 free(obj_hash);
140 obj_hash = new_hash;
141 obj_hash_size = new_hash_size;
175785e5
DB
142}
143
d36f51c1 144void *create_object(const unsigned char *sha1, void *o)
175785e5 145{
100c5f3b
LT
146 struct object *obj = o;
147
175785e5 148 obj->parsed = 0;
175785e5 149 obj->used = 0;
0556a11a 150 obj->flags = 0;
e702496e 151 hashcpy(obj->sha1, sha1);
175785e5 152
0556a11a
LT
153 if (obj_hash_size - 1 <= nr_objs * 2)
154 grow_object_hash();
175785e5 155
0556a11a 156 insert_obj_hash(obj, obj_hash, obj_hash_size);
175785e5 157 nr_objs++;
100c5f3b 158 return obj;
175785e5
DB
159}
160
66e481b0
DB
161struct object *lookup_unknown_object(const unsigned char *sha1)
162{
163 struct object *obj = lookup_object(sha1);
100c5f3b 164 if (!obj)
d36f51c1 165 obj = create_object(sha1, alloc_object_node());
66e481b0
DB
166 return obj;
167}
168
21666f1a 169struct object *parse_object_buffer(const unsigned char *sha1, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
9f613ddd
JH
170{
171 struct object *obj;
8e92e8f2 172 *eaten_p = 0;
9f613ddd 173
cc216827 174 obj = NULL;
21666f1a 175 if (type == OBJ_BLOB) {
9f613ddd 176 struct blob *blob = lookup_blob(sha1);
cc216827 177 if (blob) {
d0b8c9e5
MK
178 if (parse_blob_buffer(blob, buffer, size))
179 return NULL;
cc216827
JM
180 obj = &blob->object;
181 }
21666f1a 182 } else if (type == OBJ_TREE) {
9f613ddd 183 struct tree *tree = lookup_tree(sha1);
cc216827
JM
184 if (tree) {
185 obj = &tree->object;
68be2fea
JH
186 if (!tree->buffer)
187 tree->object.parsed = 0;
cc216827 188 if (!tree->object.parsed) {
d0b8c9e5
MK
189 if (parse_tree_buffer(tree, buffer, size))
190 return NULL;
8e92e8f2 191 *eaten_p = 1;
cc216827 192 }
9f613ddd 193 }
21666f1a 194 } else if (type == OBJ_COMMIT) {
9f613ddd 195 struct commit *commit = lookup_commit(sha1);
cc216827 196 if (commit) {
d0b8c9e5
MK
197 if (parse_commit_buffer(commit, buffer, size))
198 return NULL;
8597ea3a
JK
199 if (!get_cached_commit_buffer(commit, NULL)) {
200 set_commit_buffer(commit, buffer, size);
8e92e8f2 201 *eaten_p = 1;
cc216827
JM
202 }
203 obj = &commit->object;
9f613ddd 204 }
21666f1a 205 } else if (type == OBJ_TAG) {
9f613ddd 206 struct tag *tag = lookup_tag(sha1);
cc216827 207 if (tag) {
d0b8c9e5
MK
208 if (parse_tag_buffer(tag, buffer, size))
209 return NULL;
cc216827
JM
210 obj = &tag->object;
211 }
9f613ddd 212 } else {
82247e9b 213 warning("object %s has unknown type id %d", sha1_to_hex(sha1), type);
9f613ddd
JH
214 obj = NULL;
215 }
e2ac7cb5
SV
216 if (obj && obj->type == OBJ_NONE)
217 obj->type = type;
9f613ddd
JH
218 return obj;
219}
220
75a95490
JK
221struct object *parse_object_or_die(const unsigned char *sha1,
222 const char *name)
223{
224 struct object *o = parse_object(sha1);
225 if (o)
226 return o;
227
228 die(_("unable to parse object: %s"), name ? name : sha1_to_hex(sha1));
229}
230
5d6ccf5c 231struct object *parse_object(const unsigned char *sha1)
e9eefa67 232{
c4584ae3 233 unsigned long size;
21666f1a 234 enum object_type type;
9f613ddd 235 int eaten;
4bbf5a26 236 const unsigned char *repl = lookup_replace_object(sha1);
ccdc6037
JK
237 void *buffer;
238 struct object *obj;
239
240 obj = lookup_object(sha1);
241 if (obj && obj->parsed)
242 return obj;
9f613ddd 243
090ea126
NTND
244 if ((obj && obj->type == OBJ_BLOB) ||
245 (!obj && has_sha1_file(sha1) &&
246 sha1_object_info(sha1, NULL) == OBJ_BLOB)) {
247 if (check_sha1_signature(repl, NULL, 0, NULL) < 0) {
82247e9b 248 error("sha1 mismatch %s", sha1_to_hex(repl));
090ea126
NTND
249 return NULL;
250 }
251 parse_blob_buffer(lookup_blob(sha1), NULL, 0);
252 return lookup_object(sha1);
253 }
254
ccdc6037 255 buffer = read_sha1_file(sha1, &type, &size);
c4584ae3 256 if (buffer) {
0e87c367 257 if (check_sha1_signature(repl, buffer, size, typename(type)) < 0) {
0b1f1130 258 free(buffer);
82247e9b 259 error("sha1 mismatch %s", sha1_to_hex(repl));
acdeec62
LT
260 return NULL;
261 }
9f613ddd 262
2e3400c0 263 obj = parse_object_buffer(sha1, type, size, buffer, &eaten);
9f613ddd
JH
264 if (!eaten)
265 free(buffer);
bd2c39f5 266 return obj;
e9eefa67
DB
267 }
268 return NULL;
269}
66e481b0
DB
270
271struct object_list *object_list_insert(struct object *item,
272 struct object_list **list_p)
273{
274 struct object_list *new_list = xmalloc(sizeof(struct object_list));
55b4e9e4
JH
275 new_list->item = item;
276 new_list->next = *list_p;
277 *list_p = new_list;
278 return new_list;
66e481b0
DB
279}
280
66e481b0
DB
281int object_list_contains(struct object_list *list, struct object *obj)
282{
283 while (list) {
284 if (list->item == obj)
285 return 1;
286 list = list->next;
287 }
288 return 0;
289}
1f1e895f 290
31faeb20
MH
291/*
292 * A zero-length string to which object_array_entry::name can be
293 * initialized without requiring a malloc/free.
294 */
295static char object_array_slopbuf[1];
296
4197361e
JH
297static void add_object_array_with_mode_context(struct object *obj, const char *name,
298 struct object_array *array,
299 unsigned mode,
300 struct object_context *context)
1f1e895f
LT
301{
302 unsigned nr = array->nr;
303 unsigned alloc = array->alloc;
304 struct object_array_entry *objects = array->objects;
31faeb20 305 struct object_array_entry *entry;
1f1e895f
LT
306
307 if (nr >= alloc) {
308 alloc = (alloc + 32) * 2;
309 objects = xrealloc(objects, alloc * sizeof(*objects));
310 array->alloc = alloc;
311 array->objects = objects;
312 }
31faeb20
MH
313 entry = &objects[nr];
314 entry->item = obj;
315 if (!name)
316 entry->name = NULL;
317 else if (!*name)
318 /* Use our own empty string instead of allocating one: */
319 entry->name = object_array_slopbuf;
320 else
321 entry->name = xstrdup(name);
322 entry->mode = mode;
4197361e 323 entry->context = context;
1f1e895f
LT
324 array->nr = ++nr;
325}
b2a6d1c6 326
afa15f3c
MG
327void add_object_array(struct object *obj, const char *name, struct object_array *array)
328{
329 add_object_array_with_mode(obj, name, array, S_IFINVALID);
330}
331
332void add_object_array_with_mode(struct object *obj, const char *name, struct object_array *array, unsigned mode)
333{
334 add_object_array_with_mode_context(obj, name, array, mode, NULL);
335}
336
337void add_object_array_with_context(struct object *obj, const char *name, struct object_array *array, struct object_context *context)
338{
339 if (context)
340 add_object_array_with_mode_context(obj, name, array, context->mode, context);
341 else
342 add_object_array_with_mode_context(obj, name, array, S_IFINVALID, context);
343}
344
aeb4a51e
MH
345void object_array_filter(struct object_array *array,
346 object_array_each_func_t want, void *cb_data)
b2a6d1c6 347{
aeb4a51e 348 unsigned nr = array->nr, src, dst;
b2a6d1c6
JH
349 struct object_array_entry *objects = array->objects;
350
aeb4a51e
MH
351 for (src = dst = 0; src < nr; src++) {
352 if (want(&objects[src], cb_data)) {
b2a6d1c6
JH
353 if (src != dst)
354 objects[dst] = objects[src];
355 dst++;
31faeb20
MH
356 } else {
357 if (objects[src].name != object_array_slopbuf)
358 free(objects[src].name);
aeb4a51e
MH
359 }
360 }
361 array->nr = dst;
362}
363
1506510c
MH
364/*
365 * Return true iff array already contains an entry with name.
366 */
367static int contains_name(struct object_array *array, const char *name)
368{
369 unsigned nr = array->nr, i;
370 struct object_array_entry *object = array->objects;
371
372 for (i = 0; i < nr; i++, object++)
373 if (!strcmp(object->name, name))
374 return 1;
375 return 0;
376}
377
b2a6d1c6
JH
378void object_array_remove_duplicates(struct object_array *array)
379{
1506510c 380 unsigned nr = array->nr, src;
b2a6d1c6
JH
381 struct object_array_entry *objects = array->objects;
382
1506510c
MH
383 array->nr = 0;
384 for (src = 0; src < nr; src++) {
385 if (!contains_name(array, objects[src].name)) {
386 if (src != array->nr)
387 objects[array->nr] = objects[src];
388 array->nr++;
31faeb20
MH
389 } else {
390 if (objects[src].name != object_array_slopbuf)
391 free(objects[src].name);
b2a6d1c6 392 }
b2a6d1c6
JH
393 }
394}
bcc0a3ea
HV
395
396void clear_object_flags(unsigned flags)
397{
398 int i;
399
400 for (i=0; i < obj_hash_size; i++) {
401 struct object *obj = obj_hash[i];
402 if (obj)
403 obj->flags &= ~flags;
404 }
405}