]>
Commit | Line | Data |
---|---|---|
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 | |
0556a11a LT |
11 | static struct object **obj_hash; |
12 | static int nr_objs, obj_hash_size; | |
fc046a75 LT |
13 | |
14 | unsigned int get_max_object_index(void) | |
15 | { | |
0556a11a | 16 | return obj_hash_size; |
fc046a75 LT |
17 | } |
18 | ||
19 | struct object *get_indexed_object(unsigned int idx) | |
20 | { | |
0556a11a | 21 | return obj_hash[idx]; |
fc046a75 | 22 | } |
175785e5 | 23 | |
df843662 NP |
24 | static 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 | 32 | const 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 | 39 | int 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 | ||
df843662 NP |
54 | die("invalid object type \"%s\"", str); |
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 | 62 | static 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 |
72 | static 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 | */ | |
0556a11a | 88 | struct 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) { |
ed1c9977 | 98 | if (!hashcmp(sha1, obj->oid.hash)) |
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 | */ | |
35d803bc | 110 | SWAP(obj_hash[i], obj_hash[first]); |
9a414486 | 111 | } |
0556a11a | 112 | return obj; |
175785e5 DB |
113 | } |
114 | ||
33bef7ea MH |
115 | /* |
116 | * Increase the size of the hash map stored in obj_hash to the next | |
117 | * power of 2 (but at least 32). Copy the existing values to the new | |
118 | * hash map. | |
119 | */ | |
0556a11a | 120 | static void grow_object_hash(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 | */ | |
0556a11a LT |
127 | int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size; |
128 | struct object **new_hash; | |
129 | ||
b3c952f8 | 130 | new_hash = xcalloc(new_hash_size, sizeof(struct object *)); |
0556a11a LT |
131 | for (i = 0; i < obj_hash_size; i++) { |
132 | struct object *obj = obj_hash[i]; | |
133 | if (!obj) | |
134 | continue; | |
135 | insert_obj_hash(obj, new_hash, new_hash_size); | |
136 | } | |
137 | free(obj_hash); | |
138 | obj_hash = new_hash; | |
139 | obj_hash_size = new_hash_size; | |
175785e5 DB |
140 | } |
141 | ||
d36f51c1 | 142 | void *create_object(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 | |
0556a11a LT |
150 | if (obj_hash_size - 1 <= nr_objs * 2) |
151 | grow_object_hash(); | |
175785e5 | 152 | |
0556a11a | 153 | insert_obj_hash(obj, obj_hash, obj_hash_size); |
175785e5 | 154 | nr_objs++; |
100c5f3b | 155 | return obj; |
175785e5 DB |
156 | } |
157 | ||
8ff226a9 JK |
158 | void *object_as_type(struct object *obj, enum object_type type, int quiet) |
159 | { | |
160 | if (obj->type == type) | |
161 | return obj; | |
162 | else if (obj->type == OBJ_NONE) { | |
d66bebcb JK |
163 | if (type == OBJ_COMMIT) |
164 | ((struct commit *)obj)->index = alloc_commit_index(); | |
8ff226a9 JK |
165 | obj->type = type; |
166 | return obj; | |
167 | } | |
168 | else { | |
169 | if (!quiet) | |
170 | error("object %s is a %s, not a %s", | |
f2fd0760 | 171 | oid_to_hex(&obj->oid), |
debca9d2 | 172 | type_name(obj->type), type_name(type)); |
8ff226a9 JK |
173 | return NULL; |
174 | } | |
175 | } | |
176 | ||
66e481b0 DB |
177 | struct object *lookup_unknown_object(const unsigned char *sha1) |
178 | { | |
179 | struct object *obj = lookup_object(sha1); | |
100c5f3b | 180 | if (!obj) |
d36f51c1 | 181 | obj = create_object(sha1, alloc_object_node()); |
66e481b0 DB |
182 | return obj; |
183 | } | |
184 | ||
c251c83d | 185 | struct object *parse_object_buffer(const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p) |
9f613ddd JH |
186 | { |
187 | struct object *obj; | |
8e92e8f2 | 188 | *eaten_p = 0; |
9f613ddd | 189 | |
cc216827 | 190 | obj = NULL; |
21666f1a | 191 | if (type == OBJ_BLOB) { |
c251c83d | 192 | struct blob *blob = lookup_blob(oid); |
cc216827 | 193 | if (blob) { |
d0b8c9e5 MK |
194 | if (parse_blob_buffer(blob, buffer, size)) |
195 | return NULL; | |
cc216827 JM |
196 | obj = &blob->object; |
197 | } | |
21666f1a | 198 | } else if (type == OBJ_TREE) { |
c251c83d | 199 | struct tree *tree = lookup_tree(oid); |
cc216827 JM |
200 | if (tree) { |
201 | obj = &tree->object; | |
68be2fea JH |
202 | if (!tree->buffer) |
203 | tree->object.parsed = 0; | |
cc216827 | 204 | if (!tree->object.parsed) { |
d0b8c9e5 MK |
205 | if (parse_tree_buffer(tree, buffer, size)) |
206 | return NULL; | |
8e92e8f2 | 207 | *eaten_p = 1; |
cc216827 | 208 | } |
9f613ddd | 209 | } |
21666f1a | 210 | } else if (type == OBJ_COMMIT) { |
c251c83d | 211 | struct commit *commit = lookup_commit(oid); |
cc216827 | 212 | if (commit) { |
d0b8c9e5 MK |
213 | if (parse_commit_buffer(commit, buffer, size)) |
214 | return NULL; | |
8597ea3a JK |
215 | if (!get_cached_commit_buffer(commit, NULL)) { |
216 | set_commit_buffer(commit, buffer, size); | |
8e92e8f2 | 217 | *eaten_p = 1; |
cc216827 JM |
218 | } |
219 | obj = &commit->object; | |
9f613ddd | 220 | } |
21666f1a | 221 | } else if (type == OBJ_TAG) { |
c251c83d | 222 | struct tag *tag = lookup_tag(oid); |
cc216827 | 223 | if (tag) { |
d0b8c9e5 MK |
224 | if (parse_tag_buffer(tag, buffer, size)) |
225 | return NULL; | |
cc216827 JM |
226 | obj = &tag->object; |
227 | } | |
9f613ddd | 228 | } else { |
c251c83d | 229 | warning("object %s has unknown type id %d", oid_to_hex(oid), type); |
9f613ddd JH |
230 | obj = NULL; |
231 | } | |
9f613ddd JH |
232 | return obj; |
233 | } | |
234 | ||
c251c83d | 235 | struct object *parse_object_or_die(const struct object_id *oid, |
75a95490 JK |
236 | const char *name) |
237 | { | |
c251c83d | 238 | struct object *o = parse_object(oid); |
75a95490 JK |
239 | if (o) |
240 | return o; | |
241 | ||
c251c83d | 242 | die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid)); |
75a95490 JK |
243 | } |
244 | ||
c251c83d | 245 | struct object *parse_object(const struct object_id *oid) |
e9eefa67 | 246 | { |
c4584ae3 | 247 | unsigned long size; |
21666f1a | 248 | enum object_type type; |
9f613ddd | 249 | int eaten; |
1f2e7cea | 250 | const struct object_id *repl = lookup_replace_object(the_repository, oid); |
ccdc6037 JK |
251 | void *buffer; |
252 | struct object *obj; | |
253 | ||
c251c83d | 254 | obj = lookup_object(oid->hash); |
ccdc6037 JK |
255 | if (obj && obj->parsed) |
256 | return obj; | |
9f613ddd | 257 | |
df11e196 | 258 | if ((obj && obj->type == OBJ_BLOB && has_object_file(oid)) || |
c251c83d | 259 | (!obj && has_object_file(oid) && |
abef9020 | 260 | oid_object_info(oid, NULL) == OBJ_BLOB)) { |
b383a13c | 261 | if (check_object_signature(repl, 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) { |
b383a13c | 271 | if (check_object_signature(repl, buffer, size, type_name(type)) < 0) { |
0b1f1130 | 272 | free(buffer); |
b383a13c | 273 | error("sha1 mismatch %s", oid_to_hex(repl)); |
acdeec62 LT |
274 | return NULL; |
275 | } | |
9f613ddd | 276 | |
c251c83d | 277 | obj = parse_object_buffer(oid, type, size, buffer, &eaten); |
9f613ddd JH |
278 | if (!eaten) |
279 | free(buffer); | |
bd2c39f5 | 280 | return obj; |
e9eefa67 DB |
281 | } |
282 | return NULL; | |
283 | } | |
66e481b0 DB |
284 | |
285 | struct object_list *object_list_insert(struct object *item, | |
286 | struct object_list **list_p) | |
287 | { | |
288 | struct object_list *new_list = xmalloc(sizeof(struct object_list)); | |
55b4e9e4 JH |
289 | new_list->item = item; |
290 | new_list->next = *list_p; | |
291 | *list_p = new_list; | |
292 | return new_list; | |
66e481b0 DB |
293 | } |
294 | ||
66e481b0 DB |
295 | int object_list_contains(struct object_list *list, struct object *obj) |
296 | { | |
297 | while (list) { | |
298 | if (list->item == obj) | |
299 | return 1; | |
300 | list = list->next; | |
301 | } | |
302 | return 0; | |
303 | } | |
1f1e895f | 304 | |
31faeb20 MH |
305 | /* |
306 | * A zero-length string to which object_array_entry::name can be | |
307 | * initialized without requiring a malloc/free. | |
308 | */ | |
309 | static char object_array_slopbuf[1]; | |
310 | ||
9e0c3c4f JK |
311 | void add_object_array_with_path(struct object *obj, const char *name, |
312 | struct object_array *array, | |
313 | unsigned mode, const char *path) | |
1f1e895f LT |
314 | { |
315 | unsigned nr = array->nr; | |
316 | unsigned alloc = array->alloc; | |
317 | struct object_array_entry *objects = array->objects; | |
31faeb20 | 318 | struct object_array_entry *entry; |
1f1e895f LT |
319 | |
320 | if (nr >= alloc) { | |
321 | alloc = (alloc + 32) * 2; | |
2756ca43 | 322 | REALLOC_ARRAY(objects, alloc); |
1f1e895f LT |
323 | array->alloc = alloc; |
324 | array->objects = objects; | |
325 | } | |
31faeb20 MH |
326 | entry = &objects[nr]; |
327 | entry->item = obj; | |
328 | if (!name) | |
329 | entry->name = NULL; | |
330 | else if (!*name) | |
331 | /* Use our own empty string instead of allocating one: */ | |
332 | entry->name = object_array_slopbuf; | |
333 | else | |
334 | entry->name = xstrdup(name); | |
335 | entry->mode = mode; | |
9e0c3c4f JK |
336 | if (path) |
337 | entry->path = xstrdup(path); | |
338 | else | |
339 | entry->path = NULL; | |
1f1e895f LT |
340 | array->nr = ++nr; |
341 | } | |
b2a6d1c6 | 342 | |
afa15f3c MG |
343 | void add_object_array(struct object *obj, const char *name, struct object_array *array) |
344 | { | |
189a1222 | 345 | add_object_array_with_path(obj, name, array, S_IFINVALID, NULL); |
afa15f3c MG |
346 | } |
347 | ||
68f49235 JK |
348 | /* |
349 | * Free all memory associated with an entry; the result is | |
350 | * in an unspecified state and should not be examined. | |
351 | */ | |
352 | static void object_array_release_entry(struct object_array_entry *ent) | |
353 | { | |
354 | if (ent->name != object_array_slopbuf) | |
355 | free(ent->name); | |
9e0c3c4f | 356 | free(ent->path); |
68f49235 JK |
357 | } |
358 | ||
71992039 MÅ |
359 | struct object *object_array_pop(struct object_array *array) |
360 | { | |
361 | struct object *ret; | |
362 | ||
363 | if (!array->nr) | |
364 | return NULL; | |
365 | ||
366 | ret = array->objects[array->nr - 1].item; | |
367 | object_array_release_entry(&array->objects[array->nr - 1]); | |
368 | array->nr--; | |
369 | return ret; | |
370 | } | |
371 | ||
aeb4a51e MH |
372 | void object_array_filter(struct object_array *array, |
373 | object_array_each_func_t want, void *cb_data) | |
b2a6d1c6 | 374 | { |
aeb4a51e | 375 | unsigned nr = array->nr, src, dst; |
b2a6d1c6 JH |
376 | struct object_array_entry *objects = array->objects; |
377 | ||
aeb4a51e MH |
378 | for (src = dst = 0; src < nr; src++) { |
379 | if (want(&objects[src], cb_data)) { | |
b2a6d1c6 JH |
380 | if (src != dst) |
381 | objects[dst] = objects[src]; | |
382 | dst++; | |
31faeb20 | 383 | } else { |
68f49235 | 384 | object_array_release_entry(&objects[src]); |
aeb4a51e MH |
385 | } |
386 | } | |
387 | array->nr = dst; | |
388 | } | |
389 | ||
46be8231 JK |
390 | void object_array_clear(struct object_array *array) |
391 | { | |
392 | int i; | |
393 | for (i = 0; i < array->nr; i++) | |
394 | object_array_release_entry(&array->objects[i]); | |
6a83d902 | 395 | FREE_AND_NULL(array->objects); |
46be8231 JK |
396 | array->nr = array->alloc = 0; |
397 | } | |
398 | ||
1506510c MH |
399 | /* |
400 | * Return true iff array already contains an entry with name. | |
401 | */ | |
402 | static int contains_name(struct object_array *array, const char *name) | |
403 | { | |
404 | unsigned nr = array->nr, i; | |
405 | struct object_array_entry *object = array->objects; | |
406 | ||
407 | for (i = 0; i < nr; i++, object++) | |
408 | if (!strcmp(object->name, name)) | |
409 | return 1; | |
410 | return 0; | |
411 | } | |
412 | ||
b2a6d1c6 JH |
413 | void object_array_remove_duplicates(struct object_array *array) |
414 | { | |
1506510c | 415 | unsigned nr = array->nr, src; |
b2a6d1c6 JH |
416 | struct object_array_entry *objects = array->objects; |
417 | ||
1506510c MH |
418 | array->nr = 0; |
419 | for (src = 0; src < nr; src++) { | |
420 | if (!contains_name(array, objects[src].name)) { | |
421 | if (src != array->nr) | |
422 | objects[array->nr] = objects[src]; | |
423 | array->nr++; | |
31faeb20 | 424 | } else { |
68f49235 | 425 | object_array_release_entry(&objects[src]); |
b2a6d1c6 | 426 | } |
b2a6d1c6 JH |
427 | } |
428 | } | |
bcc0a3ea HV |
429 | |
430 | void clear_object_flags(unsigned flags) | |
431 | { | |
432 | int i; | |
433 | ||
434 | for (i=0; i < obj_hash_size; i++) { | |
435 | struct object *obj = obj_hash[i]; | |
436 | if (obj) | |
437 | obj->flags &= ~flags; | |
438 | } | |
439 | } | |
4ad315fc RS |
440 | |
441 | void clear_commit_marks_all(unsigned int flags) | |
442 | { | |
443 | int i; | |
444 | ||
445 | for (i = 0; i < obj_hash_size; i++) { | |
446 | struct object *obj = obj_hash[i]; | |
447 | if (obj && obj->type == OBJ_COMMIT) | |
448 | obj->flags &= ~flags; | |
449 | } | |
450 | } | |
90c62155 SB |
451 | |
452 | struct raw_object_store *raw_object_store_new(void) | |
453 | { | |
454 | struct raw_object_store *o = xmalloc(sizeof(*o)); | |
455 | ||
456 | memset(o, 0, sizeof(*o)); | |
a80d72db | 457 | INIT_LIST_HEAD(&o->packed_git_mru); |
90c62155 SB |
458 | return o; |
459 | } | |
97501e93 SB |
460 | |
461 | static void free_alt_odb(struct alternate_object_database *alt) | |
462 | { | |
463 | strbuf_release(&alt->scratch); | |
464 | oid_array_clear(&alt->loose_objects_cache); | |
465 | free(alt); | |
466 | } | |
467 | ||
468 | static void free_alt_odbs(struct raw_object_store *o) | |
469 | { | |
470 | while (o->alt_odb_list) { | |
471 | struct alternate_object_database *next; | |
472 | ||
473 | next = o->alt_odb_list->next; | |
474 | free_alt_odb(o->alt_odb_list); | |
475 | o->alt_odb_list = next; | |
476 | } | |
477 | } | |
478 | ||
90c62155 SB |
479 | void raw_object_store_clear(struct raw_object_store *o) |
480 | { | |
481 | FREE_AND_NULL(o->objectdir); | |
482 | FREE_AND_NULL(o->alternate_db); | |
97501e93 SB |
483 | |
484 | free_alt_odbs(o); | |
485 | o->alt_odb_tail = NULL; | |
a80d72db SB |
486 | |
487 | INIT_LIST_HEAD(&o->packed_git_mru); | |
d0b59866 SB |
488 | close_all_packs(o); |
489 | o->packed_git = NULL; | |
90c62155 | 490 | } |