3 #include "replace-object.h"
8 #include "object-store.h"
11 static struct object **obj_hash;
12 static int nr_objs, obj_hash_size;
14 unsigned int get_max_object_index(void)
19 struct object *get_indexed_object(unsigned int idx)
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 */
32 const char *type_name(unsigned int type)
34 if (type >= ARRAY_SIZE(object_type_strings))
36 return object_type_strings[type];
39 int type_from_string_gently(const char *str, ssize_t len, int gentle)
46 for (i = 1; i < ARRAY_SIZE(object_type_strings); i++)
47 if (!strncmp(str, object_type_strings[i], len) &&
48 object_type_strings[i][len] == '\0')
54 die("invalid object type \"%s\"", str);
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.
62 static unsigned int hash_obj(const unsigned char *sha1, unsigned int n)
64 return sha1hash(sha1) & (n - 1);
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
72 static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size)
74 unsigned int j = hash_obj(obj->oid.hash, size);
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.
88 struct object *lookup_object(const unsigned char *sha1)
90 unsigned int i, first;
96 first = i = hash_obj(sha1, obj_hash_size);
97 while ((obj = obj_hash[i]) != NULL) {
98 if (!hashcmp(sha1, obj->oid.hash))
101 if (i == obj_hash_size)
104 if (obj && i != first) {
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.
110 SWAP(obj_hash[i], obj_hash[first]);
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
120 static void grow_object_hash(void)
124 * Note that this size must always be power-of-2 to match hash_obj
127 int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size;
128 struct object **new_hash;
130 new_hash = xcalloc(new_hash_size, sizeof(struct object *));
131 for (i = 0; i < obj_hash_size; i++) {
132 struct object *obj = obj_hash[i];
135 insert_obj_hash(obj, new_hash, new_hash_size);
139 obj_hash_size = new_hash_size;
142 void *create_object(const unsigned char *sha1, void *o)
144 struct object *obj = o;
148 hashcpy(obj->oid.hash, sha1);
150 if (obj_hash_size - 1 <= nr_objs * 2)
153 insert_obj_hash(obj, obj_hash, obj_hash_size);
158 void *object_as_type(struct object *obj, enum object_type type, int quiet)
160 if (obj->type == type)
162 else if (obj->type == OBJ_NONE) {
163 if (type == OBJ_COMMIT)
164 ((struct commit *)obj)->index = alloc_commit_index();
170 error("object %s is a %s, not a %s",
171 oid_to_hex(&obj->oid),
172 type_name(obj->type), type_name(type));
177 struct object *lookup_unknown_object(const unsigned char *sha1)
179 struct object *obj = lookup_object(sha1);
181 obj = create_object(sha1, alloc_object_node());
185 struct object *parse_object_buffer(const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
191 if (type == OBJ_BLOB) {
192 struct blob *blob = lookup_blob(oid);
194 if (parse_blob_buffer(blob, buffer, size))
198 } else if (type == OBJ_TREE) {
199 struct tree *tree = lookup_tree(oid);
203 tree->object.parsed = 0;
204 if (!tree->object.parsed) {
205 if (parse_tree_buffer(tree, buffer, size))
210 } else if (type == OBJ_COMMIT) {
211 struct commit *commit = lookup_commit(oid);
213 if (parse_commit_buffer(commit, buffer, size))
215 if (!get_cached_commit_buffer(commit, NULL)) {
216 set_commit_buffer(commit, buffer, size);
219 obj = &commit->object;
221 } else if (type == OBJ_TAG) {
222 struct tag *tag = lookup_tag(oid);
224 if (parse_tag_buffer(tag, buffer, size))
229 warning("object %s has unknown type id %d", oid_to_hex(oid), type);
235 struct object *parse_object_or_die(const struct object_id *oid,
238 struct object *o = parse_object(oid);
242 die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid));
245 struct object *parse_object(const struct object_id *oid)
248 enum object_type type;
250 const struct object_id *repl = lookup_replace_object(the_repository, oid);
254 obj = lookup_object(oid->hash);
255 if (obj && obj->parsed)
258 if ((obj && obj->type == OBJ_BLOB && has_object_file(oid)) ||
259 (!obj && has_object_file(oid) &&
260 oid_object_info(oid, NULL) == OBJ_BLOB)) {
261 if (check_object_signature(repl, NULL, 0, NULL) < 0) {
262 error("sha1 mismatch %s", oid_to_hex(oid));
265 parse_blob_buffer(lookup_blob(oid), NULL, 0);
266 return lookup_object(oid->hash);
269 buffer = read_object_file(oid, &type, &size);
271 if (check_object_signature(repl, buffer, size, type_name(type)) < 0) {
273 error("sha1 mismatch %s", oid_to_hex(repl));
277 obj = parse_object_buffer(oid, type, size, buffer, &eaten);
285 struct object_list *object_list_insert(struct object *item,
286 struct object_list **list_p)
288 struct object_list *new_list = xmalloc(sizeof(struct object_list));
289 new_list->item = item;
290 new_list->next = *list_p;
295 int object_list_contains(struct object_list *list, struct object *obj)
298 if (list->item == obj)
306 * A zero-length string to which object_array_entry::name can be
307 * initialized without requiring a malloc/free.
309 static char object_array_slopbuf[1];
311 void add_object_array_with_path(struct object *obj, const char *name,
312 struct object_array *array,
313 unsigned mode, const char *path)
315 unsigned nr = array->nr;
316 unsigned alloc = array->alloc;
317 struct object_array_entry *objects = array->objects;
318 struct object_array_entry *entry;
321 alloc = (alloc + 32) * 2;
322 REALLOC_ARRAY(objects, alloc);
323 array->alloc = alloc;
324 array->objects = objects;
326 entry = &objects[nr];
331 /* Use our own empty string instead of allocating one: */
332 entry->name = object_array_slopbuf;
334 entry->name = xstrdup(name);
337 entry->path = xstrdup(path);
343 void add_object_array(struct object *obj, const char *name, struct object_array *array)
345 add_object_array_with_path(obj, name, array, S_IFINVALID, NULL);
349 * Free all memory associated with an entry; the result is
350 * in an unspecified state and should not be examined.
352 static void object_array_release_entry(struct object_array_entry *ent)
354 if (ent->name != object_array_slopbuf)
359 struct object *object_array_pop(struct object_array *array)
366 ret = array->objects[array->nr - 1].item;
367 object_array_release_entry(&array->objects[array->nr - 1]);
372 void object_array_filter(struct object_array *array,
373 object_array_each_func_t want, void *cb_data)
375 unsigned nr = array->nr, src, dst;
376 struct object_array_entry *objects = array->objects;
378 for (src = dst = 0; src < nr; src++) {
379 if (want(&objects[src], cb_data)) {
381 objects[dst] = objects[src];
384 object_array_release_entry(&objects[src]);
390 void object_array_clear(struct object_array *array)
393 for (i = 0; i < array->nr; i++)
394 object_array_release_entry(&array->objects[i]);
395 FREE_AND_NULL(array->objects);
396 array->nr = array->alloc = 0;
400 * Return true iff array already contains an entry with name.
402 static int contains_name(struct object_array *array, const char *name)
404 unsigned nr = array->nr, i;
405 struct object_array_entry *object = array->objects;
407 for (i = 0; i < nr; i++, object++)
408 if (!strcmp(object->name, name))
413 void object_array_remove_duplicates(struct object_array *array)
415 unsigned nr = array->nr, src;
416 struct object_array_entry *objects = array->objects;
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];
425 object_array_release_entry(&objects[src]);
430 void clear_object_flags(unsigned flags)
434 for (i=0; i < obj_hash_size; i++) {
435 struct object *obj = obj_hash[i];
437 obj->flags &= ~flags;
441 void clear_commit_marks_all(unsigned int flags)
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;
452 struct raw_object_store *raw_object_store_new(void)
454 struct raw_object_store *o = xmalloc(sizeof(*o));
456 memset(o, 0, sizeof(*o));
457 INIT_LIST_HEAD(&o->packed_git_mru);
461 static void free_alt_odb(struct alternate_object_database *alt)
463 strbuf_release(&alt->scratch);
464 oid_array_clear(&alt->loose_objects_cache);
468 static void free_alt_odbs(struct raw_object_store *o)
470 while (o->alt_odb_list) {
471 struct alternate_object_database *next;
473 next = o->alt_odb_list->next;
474 free_alt_odb(o->alt_odb_list);
475 o->alt_odb_list = next;
479 void raw_object_store_clear(struct raw_object_store *o)
481 FREE_AND_NULL(o->objectdir);
482 FREE_AND_NULL(o->alternate_db);
485 o->alt_odb_tail = NULL;
487 INIT_LIST_HEAD(&o->packed_git_mru);
489 o->packed_git = NULL;