object.c

   1 #include "cache.h"
   2 #include "object.h"
   3 #include "replace-object.h"
   4 #include "object-store.h"
   5 #include "blob.h"
   6 #include "tree.h"
   7 #include "commit.h"
   8 #include "tag.h"
   9 #include "alloc.h"
  10 #include "packfile.h"
  11 #include "commit-graph.h"
  12
  13 unsigned int get_max_object_index(void)
  14 {
  15         return the_repository->parsed_objects->obj_hash_size;
  16 }
  17
  18 struct object *get_indexed_object(unsigned int idx)
  19 {
  20         return the_repository->parsed_objects->obj_hash[idx];
  21 }
  22
  23 static const char *object_type_strings[] = {
  24         NULL,           /* OBJ_NONE = 0 */
  25         "commit",       /* OBJ_COMMIT = 1 */
  26         "tree",         /* OBJ_TREE = 2 */
  27         "blob",         /* OBJ_BLOB = 3 */
  28         "tag",          /* OBJ_TAG = 4 */
  29 };
  30
  31 const char *type_name(unsigned int type)
  32 {
  33         if (type >= ARRAY_SIZE(object_type_strings))
  34                 return NULL;
  35         return object_type_strings[type];
  36 }
  37
  38 int type_from_string_gently(const char *str, ssize_t len, int gentle)
  39 {
  40         int i;
  41
  42         if (len < 0)
  43                 len = strlen(str);
  44
  45         for (i = 1; i < ARRAY_SIZE(object_type_strings); i++)
  46                 if (!strncmp(str, object_type_strings[i], len) &&
  47                     object_type_strings[i][len] == '\0')
  48                         return i;
  49
  50         if (gentle)
  51                 return -1;
  52
  53         die(_("invalid object type \"%s\""), str);
  54 }
  55
  56 /*
  57  * Return a numerical hash value between 0 and n-1 for the object with
  58  * the specified sha1.  n must be a power of 2.  Please note that the
  59  * return value is *not* consistent across computer architectures.
  60  */
  61 static unsigned int hash_obj(const struct object_id *oid, unsigned int n)
  62 {
  63         return oidhash(oid) & (n - 1);
  64 }
  65
  66 /*
  67  * Insert obj into the hash table hash, which has length size (which
  68  * must be a power of 2).  On collisions, simply overflow to the next
  69  * empty bucket.
  70  */
  71 static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size)
  72 {
  73         unsigned int j = hash_obj(&obj->oid, size);
  74
  75         while (hash[j]) {
  76                 j++;
  77                 if (j >= size)
  78                         j = 0;
  79         }
  80         hash[j] = obj;
  81 }
  82
  83 /*
  84  * Look up the record for the given sha1 in the hash map stored in
  85  * obj_hash.  Return NULL if it was not found.
  86  */
  87 struct object *lookup_object(struct repository *r, const struct object_id *oid)
  88 {
  89         unsigned int i, first;
  90         struct object *obj;
  91
  92         if (!r->parsed_objects->obj_hash)
  93                 return NULL;
  94
  95         first = i = hash_obj(oid, r->parsed_objects->obj_hash_size);
  96         while ((obj = r->parsed_objects->obj_hash[i]) != NULL) {
  97                 if (oideq(oid, &obj->oid))
  98                         break;
  99                 i++;
 100                 if (i == r->parsed_objects->obj_hash_size)
 101                         i = 0;
 102         }
 103         if (obj && i != first) {
 104                 /*
 105                  * Move object to where we started to look for it so
 106                  * that we do not need to walk the hash table the next
 107                  * time we look for it.
 108                  */
 109                 SWAP(r->parsed_objects->obj_hash[i],
 110                      r->parsed_objects->obj_hash[first]);
 111         }
 112         return obj;
 113 }
 114
 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  */
 120 static void grow_object_hash(struct repository *r)
 121 {
 122         int i;
 123         /*
 124          * Note that this size must always be power-of-2 to match hash_obj
 125          * above.
 126          */
 127         int new_hash_size = r->parsed_objects->obj_hash_size < 32 ? 32 : 2 * r->parsed_objects->obj_hash_size;
 128         struct object **new_hash;
 129
 130         CALLOC_ARRAY(new_hash, new_hash_size);
 131         for (i = 0; i < r->parsed_objects->obj_hash_size; i++) {
 132                 struct object *obj = r->parsed_objects->obj_hash[i];
 133
 134                 if (!obj)
 135                         continue;
 136                 insert_obj_hash(obj, new_hash, new_hash_size);
 137         }
 138         free(r->parsed_objects->obj_hash);
 139         r->parsed_objects->obj_hash = new_hash;
 140         r->parsed_objects->obj_hash_size = new_hash_size;
 141 }
 142
 143 void *create_object(struct repository *r, const struct object_id *oid, void *o)
 144 {
 145         struct object *obj = o;
 146
 147         obj->parsed = 0;
 148         obj->flags = 0;
 149         oidcpy(&obj->oid, oid);
 150
 151         if (r->parsed_objects->obj_hash_size - 1 <= r->parsed_objects->nr_objs * 2)
 152                 grow_object_hash(r);
 153
 154         insert_obj_hash(obj, r->parsed_objects->obj_hash,
 155                         r->parsed_objects->obj_hash_size);
 156         r->parsed_objects->nr_objs++;
 157         return obj;
 158 }
 159
 160 void *object_as_type(struct object *obj, enum object_type type, int quiet)
 161 {
 162         if (obj->type == type)
 163                 return obj;
 164         else if (obj->type == OBJ_NONE) {
 165                 if (type == OBJ_COMMIT)
 166                         init_commit_node((struct commit *) obj);
 167                 else
 168                         obj->type = type;
 169                 return obj;
 170         }
 171         else {
 172                 if (!quiet)
 173                         error(_("object %s is a %s, not a %s"),
 174                               oid_to_hex(&obj->oid),
 175                               type_name(obj->type), type_name(type));
 176                 return NULL;
 177         }
 178 }
 179
 180 struct object *lookup_unknown_object(struct repository *r, const struct object_id *oid)
 181 {
 182         struct object *obj = lookup_object(r, oid);
 183         if (!obj)
 184                 obj = create_object(r, oid, alloc_object_node(r));
 185         return obj;
 186 }
 187
 188 struct object *lookup_object_by_type(struct repository *r,
 189                             const struct object_id *oid,
 190                             enum object_type type)
 191 {
 192         switch (type) {
 193         case OBJ_COMMIT:
 194                 return (struct object *)lookup_commit(r, oid);
 195         case OBJ_TREE:
 196                 return (struct object *)lookup_tree(r, oid);
 197         case OBJ_TAG:
 198                 return (struct object *)lookup_tag(r, oid);
 199         case OBJ_BLOB:
 200                 return (struct object *)lookup_blob(r, oid);
 201         default:
 202                 BUG("unknown object type %d", type);
 203         }
 204 }
 205
 206 struct object *parse_object_buffer(struct repository *r, const struct object_id *oid, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
 207 {
 208         struct object *obj;
 209         *eaten_p = 0;
 210
 211         obj = NULL;
 212         if (type == OBJ_BLOB) {
 213                 struct blob *blob = lookup_blob(r, oid);
 214                 if (blob) {
 215                         if (parse_blob_buffer(blob, buffer, size))
 216                                 return NULL;
 217                         obj = &blob->object;
 218                 }
 219         } else if (type == OBJ_TREE) {
 220                 struct tree *tree = lookup_tree(r, oid);
 221                 if (tree) {
 222                         obj = &tree->object;
 223                         if (!tree->buffer)
 224                                 tree->object.parsed = 0;
 225                         if (!tree->object.parsed) {
 226                                 if (parse_tree_buffer(tree, buffer, size))
 227                                         return NULL;
 228                                 *eaten_p = 1;
 229                         }
 230                 }
 231         } else if (type == OBJ_COMMIT) {
 232                 struct commit *commit = lookup_commit(r, oid);
 233                 if (commit) {
 234                         if (parse_commit_buffer(r, commit, buffer, size, 1))
 235                                 return NULL;
 236                         if (!get_cached_commit_buffer(r, commit, NULL)) {
 237                                 set_commit_buffer(r, commit, buffer, size);
 238                                 *eaten_p = 1;
 239                         }
 240                         obj = &commit->object;
 241                 }
 242         } else if (type == OBJ_TAG) {
 243                 struct tag *tag = lookup_tag(r, oid);
 244                 if (tag) {
 245                         if (parse_tag_buffer(r, tag, buffer, size))
 246                                return NULL;
 247                         obj = &tag->object;
 248                 }
 249         } else {
 250                 warning(_("object %s has unknown type id %d"), oid_to_hex(oid), type);
 251                 obj = NULL;
 252         }
 253         return obj;
 254 }
 255
 256 struct object *parse_object_or_die(const struct object_id *oid,
 257                                    const char *name)
 258 {
 259         struct object *o = parse_object(the_repository, oid);
 260         if (o)
 261                 return o;
 262
 263         die(_("unable to parse object: %s"), name ? name : oid_to_hex(oid));
 264 }
 265
 266 struct object *parse_object(struct repository *r, const struct object_id *oid)
 267 {
 268         unsigned long size;
 269         enum object_type type;
 270         int eaten;
 271         const struct object_id *repl = lookup_replace_object(r, oid);
 272         void *buffer;
 273         struct object *obj;
 274
 275         obj = lookup_object(r, oid);
 276         if (obj && obj->parsed)
 277                 return obj;
 278
 279         if ((obj && obj->type == OBJ_BLOB && repo_has_object_file(r, oid)) ||
 280             (!obj && repo_has_object_file(r, oid) &&
 281              oid_object_info(r, oid, NULL) == OBJ_BLOB)) {
 282                 if (stream_object_signature(r, repl) < 0) {
 283                         error(_("hash mismatch %s"), oid_to_hex(oid));
 284                         return NULL;
 285                 }
 286                 parse_blob_buffer(lookup_blob(r, oid), NULL, 0);
 287                 return lookup_object(r, oid);
 288         }
 289
 290         buffer = repo_read_object_file(r, oid, &type, &size);
 291         if (buffer) {
 292                 if (check_object_signature(r, repl, buffer, size, type) < 0) {
 293                         free(buffer);
 294                         error(_("hash mismatch %s"), oid_to_hex(repl));
 295                         return NULL;
 296                 }
 297
 298                 obj = parse_object_buffer(r, oid, type, size,
 299                                           buffer, &eaten);
 300                 if (!eaten)
 301                         free(buffer);
 302                 return obj;
 303         }
 304         return NULL;
 305 }
 306
 307 struct object_list *object_list_insert(struct object *item,
 308                                        struct object_list **list_p)
 309 {
 310         struct object_list *new_list = xmalloc(sizeof(struct object_list));
 311         new_list->item = item;
 312         new_list->next = *list_p;
 313         *list_p = new_list;
 314         return new_list;
 315 }
 316
 317 int object_list_contains(struct object_list *list, struct object *obj)
 318 {
 319         while (list) {
 320                 if (list->item == obj)
 321                         return 1;
 322                 list = list->next;
 323         }
 324         return 0;
 325 }
 326
 327 void object_list_free(struct object_list **list)
 328 {
 329         while (*list) {
 330                 struct object_list *p = *list;
 331                 *list = p->next;
 332                 free(p);
 333         }
 334 }
 335
 336 /*
 337  * A zero-length string to which object_array_entry::name can be
 338  * initialized without requiring a malloc/free.
 339  */
 340 static char object_array_slopbuf[1];
 341
 342 void add_object_array_with_path(struct object *obj, const char *name,
 343                                 struct object_array *array,
 344                                 unsigned mode, const char *path)
 345 {
 346         unsigned nr = array->nr;
 347         unsigned alloc = array->alloc;
 348         struct object_array_entry *objects = array->objects;
 349         struct object_array_entry *entry;
 350
 351         if (nr >= alloc) {
 352                 alloc = (alloc + 32) * 2;
 353                 REALLOC_ARRAY(objects, alloc);
 354                 array->alloc = alloc;
 355                 array->objects = objects;
 356         }
 357         entry = &objects[nr];
 358         entry->item = obj;
 359         if (!name)
 360                 entry->name = NULL;
 361         else if (!*name)
 362                 /* Use our own empty string instead of allocating one: */
 363                 entry->name = object_array_slopbuf;
 364         else
 365                 entry->name = xstrdup(name);
 366         entry->mode = mode;
 367         if (path)
 368                 entry->path = xstrdup(path);
 369         else
 370                 entry->path = NULL;
 371         array->nr = ++nr;
 372 }
 373
 374 void add_object_array(struct object *obj, const char *name, struct object_array *array)
 375 {
 376         add_object_array_with_path(obj, name, array, S_IFINVALID, NULL);
 377 }
 378
 379 /*
 380  * Free all memory associated with an entry; the result is
 381  * in an unspecified state and should not be examined.
 382  */
 383 static void object_array_release_entry(struct object_array_entry *ent)
 384 {
 385         if (ent->name != object_array_slopbuf)
 386                 free(ent->name);
 387         free(ent->path);
 388 }
 389
 390 struct object *object_array_pop(struct object_array *array)
 391 {
 392         struct object *ret;
 393
 394         if (!array->nr)
 395                 return NULL;
 396
 397         ret = array->objects[array->nr - 1].item;
 398         object_array_release_entry(&array->objects[array->nr - 1]);
 399         array->nr--;
 400         return ret;
 401 }
 402
 403 void object_array_filter(struct object_array *array,
 404                          object_array_each_func_t want, void *cb_data)
 405 {
 406         unsigned nr = array->nr, src, dst;
 407         struct object_array_entry *objects = array->objects;
 408
 409         for (src = dst = 0; src < nr; src++) {
 410                 if (want(&objects[src], cb_data)) {
 411                         if (src != dst)
 412                                 objects[dst] = objects[src];
 413                         dst++;
 414                 } else {
 415                         object_array_release_entry(&objects[src]);
 416                 }
 417         }
 418         array->nr = dst;
 419 }
 420
 421 void object_array_clear(struct object_array *array)
 422 {
 423         int i;
 424         for (i = 0; i < array->nr; i++)
 425                 object_array_release_entry(&array->objects[i]);
 426         FREE_AND_NULL(array->objects);
 427         array->nr = array->alloc = 0;
 428 }
 429
 430 /*
 431  * Return true if array already contains an entry.
 432  */
 433 static int contains_object(struct object_array *array,
 434                            const struct object *item, const char *name)
 435 {
 436         unsigned nr = array->nr, i;
 437         struct object_array_entry *object = array->objects;
 438
 439         for (i = 0; i < nr; i++, object++)
 440                 if (item == object->item && !strcmp(object->name, name))
 441                         return 1;
 442         return 0;
 443 }
 444
 445 void object_array_remove_duplicates(struct object_array *array)
 446 {
 447         unsigned nr = array->nr, src;
 448         struct object_array_entry *objects = array->objects;
 449
 450         array->nr = 0;
 451         for (src = 0; src < nr; src++) {
 452                 if (!contains_object(array, objects[src].item,
 453                                      objects[src].name)) {
 454                         if (src != array->nr)
 455                                 objects[array->nr] = objects[src];
 456                         array->nr++;
 457                 } else {
 458                         object_array_release_entry(&objects[src]);
 459                 }
 460         }
 461 }
 462
 463 void clear_object_flags(unsigned flags)
 464 {
 465         int i;
 466
 467         for (i=0; i < the_repository->parsed_objects->obj_hash_size; i++) {
 468                 struct object *obj = the_repository->parsed_objects->obj_hash[i];
 469                 if (obj)
 470                         obj->flags &= ~flags;
 471         }
 472 }
 473
 474 void repo_clear_commit_marks(struct repository *r, unsigned int flags)
 475 {
 476         int i;
 477
 478         for (i = 0; i < r->parsed_objects->obj_hash_size; i++) {
 479                 struct object *obj = r->parsed_objects->obj_hash[i];
 480                 if (obj && obj->type == OBJ_COMMIT)
 481                         obj->flags &= ~flags;
 482         }
 483 }
 484
 485 struct parsed_object_pool *parsed_object_pool_new(void)
 486 {
 487         struct parsed_object_pool *o = xmalloc(sizeof(*o));
 488         memset(o, 0, sizeof(*o));
 489
 490         o->blob_state = allocate_alloc_state();
 491         o->tree_state = allocate_alloc_state();
 492         o->commit_state = allocate_alloc_state();
 493         o->tag_state = allocate_alloc_state();
 494         o->object_state = allocate_alloc_state();
 495
 496         o->is_shallow = -1;
 497         CALLOC_ARRAY(o->shallow_stat, 1);
 498
 499         o->buffer_slab = allocate_commit_buffer_slab();
 500
 501         return o;
 502 }
 503
 504 struct raw_object_store *raw_object_store_new(void)
 505 {
 506         struct raw_object_store *o = xmalloc(sizeof(*o));
 507
 508         memset(o, 0, sizeof(*o));
 509         INIT_LIST_HEAD(&o->packed_git_mru);
 510         hashmap_init(&o->pack_map, pack_map_entry_cmp, NULL, 0);
 511         pthread_mutex_init(&o->replace_mutex, NULL);
 512         return o;
 513 }
 514
 515 void free_object_directory(struct object_directory *odb)
 516 {
 517         free(odb->path);
 518         odb_clear_loose_cache(odb);
 519         free(odb);
 520 }
 521
 522 static void free_object_directories(struct raw_object_store *o)
 523 {
 524         while (o->odb) {
 525                 struct object_directory *next;
 526
 527                 next = o->odb->next;
 528                 free_object_directory(o->odb);
 529                 o->odb = next;
 530         }
 531         kh_destroy_odb_path_map(o->odb_by_path);
 532         o->odb_by_path = NULL;
 533 }
 534
 535 void raw_object_store_clear(struct raw_object_store *o)
 536 {
 537         FREE_AND_NULL(o->alternate_db);
 538
 539         oidmap_free(o->replace_map, 1);
 540         FREE_AND_NULL(o->replace_map);
 541         pthread_mutex_destroy(&o->replace_mutex);
 542
 543         free_commit_graph(o->commit_graph);
 544         o->commit_graph = NULL;
 545         o->commit_graph_attempted = 0;
 546
 547         free_object_directories(o);
 548         o->odb_tail = NULL;
 549         o->loaded_alternates = 0;
 550
 551         INIT_LIST_HEAD(&o->packed_git_mru);
 552         close_object_store(o);
 553         o->packed_git = NULL;
 554
 555         hashmap_clear(&o->pack_map);
 556 }
 557
 558 void parsed_object_pool_clear(struct parsed_object_pool *o)
 559 {
 560         /*
 561          * As objects are allocated in slabs (see alloc.c), we do
 562          * not need to free each object, but each slab instead.
 563          *
 564          * Before doing so, we need to free any additional memory
 565          * the objects may hold.
 566          */
 567         unsigned i;
 568
 569         for (i = 0; i < o->obj_hash_size; i++) {
 570                 struct object *obj = o->obj_hash[i];
 571
 572                 if (!obj)
 573                         continue;
 574
 575                 if (obj->type == OBJ_TREE)
 576                         free_tree_buffer((struct tree*)obj);
 577                 else if (obj->type == OBJ_COMMIT)
 578                         release_commit_memory(o, (struct commit*)obj);
 579                 else if (obj->type == OBJ_TAG)
 580                         release_tag_memory((struct tag*)obj);
 581         }
 582
 583         FREE_AND_NULL(o->obj_hash);
 584         o->obj_hash_size = 0;
 585
 586         free_commit_buffer_slab(o->buffer_slab);
 587         o->buffer_slab = NULL;
 588
 589         clear_alloc_state(o->blob_state);
 590         clear_alloc_state(o->tree_state);
 591         clear_alloc_state(o->commit_state);
 592         clear_alloc_state(o->tag_state);
 593         clear_alloc_state(o->object_state);
 594         stat_validity_clear(o->shallow_stat);
 595         FREE_AND_NULL(o->blob_state);
 596         FREE_AND_NULL(o->tree_state);
 597         FREE_AND_NULL(o->commit_state);
 598         FREE_AND_NULL(o->tag_state);
 599         FREE_AND_NULL(o->object_state);
 600         FREE_AND_NULL(o->shallow_stat);
 601 }