8 static struct object
**obj_hash
;
9 static int nr_objs
, obj_hash_size
;
11 unsigned int get_max_object_index(void)
16 struct object
*get_indexed_object(unsigned int idx
)
21 static 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 */
29 const char *typename(unsigned int type
)
31 if (type
>= ARRAY_SIZE(object_type_strings
))
33 return object_type_strings
[type
];
36 int type_from_string_gently(const char *str
, ssize_t len
, int gentle
)
43 for (i
= 1; i
< ARRAY_SIZE(object_type_strings
); i
++)
44 if (!strncmp(str
, object_type_strings
[i
], len
) &&
45 object_type_strings
[i
][len
] == '\0')
51 die("invalid object type \"%s\"", str
);
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.
59 static unsigned int hash_obj(const unsigned char *sha1
, unsigned int n
)
61 return sha1hash(sha1
) & (n
- 1);
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
69 static void insert_obj_hash(struct object
*obj
, struct object
**hash
, unsigned int size
)
71 unsigned int j
= hash_obj(obj
->oid
.hash
, size
);
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.
85 struct object
*lookup_object(const unsigned char *sha1
)
87 unsigned int i
, first
;
93 first
= i
= hash_obj(sha1
, obj_hash_size
);
94 while ((obj
= obj_hash
[i
]) != NULL
) {
95 if (!hashcmp(sha1
, obj
->oid
.hash
))
98 if (i
== obj_hash_size
)
101 if (obj
&& i
!= first
) {
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.
107 SWAP(obj_hash
[i
], obj_hash
[first
]);
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
117 static void grow_object_hash(void)
121 * Note that this size must always be power-of-2 to match hash_obj
124 int new_hash_size
= obj_hash_size
< 32 ? 32 : 2 * obj_hash_size
;
125 struct object
**new_hash
;
127 new_hash
= xcalloc(new_hash_size
, sizeof(struct object
*));
128 for (i
= 0; i
< obj_hash_size
; i
++) {
129 struct object
*obj
= obj_hash
[i
];
132 insert_obj_hash(obj
, new_hash
, new_hash_size
);
136 obj_hash_size
= new_hash_size
;
139 void *create_object(const unsigned char *sha1
, void *o
)
141 struct object
*obj
= o
;
146 hashcpy(obj
->oid
.hash
, sha1
);
148 if (obj_hash_size
- 1 <= nr_objs
* 2)
151 insert_obj_hash(obj
, obj_hash
, obj_hash_size
);
156 void *object_as_type(struct object
*obj
, enum object_type type
, int quiet
)
158 if (obj
->type
== type
)
160 else if (obj
->type
== OBJ_NONE
) {
161 if (type
== OBJ_COMMIT
)
162 ((struct commit
*)obj
)->index
= alloc_commit_index();
168 error("object %s is a %s, not a %s",
169 oid_to_hex(&obj
->oid
),
170 typename(obj
->type
), typename(type
));
175 struct object
*lookup_unknown_object(const unsigned char *sha1
)
177 struct object
*obj
= lookup_object(sha1
);
179 obj
= create_object(sha1
, alloc_object_node());
183 struct object
*parse_object_buffer(const unsigned char *sha1
, enum object_type type
, unsigned long size
, void *buffer
, int *eaten_p
)
185 struct object_id oid
;
189 hashcpy(oid
.hash
, sha1
);
192 if (type
== OBJ_BLOB
) {
193 struct blob
*blob
= lookup_blob(&oid
);
195 if (parse_blob_buffer(blob
, buffer
, size
))
199 } else if (type
== OBJ_TREE
) {
200 struct tree
*tree
= lookup_tree(sha1
);
204 tree
->object
.parsed
= 0;
205 if (!tree
->object
.parsed
) {
206 if (parse_tree_buffer(tree
, buffer
, size
))
211 } else if (type
== OBJ_COMMIT
) {
212 struct commit
*commit
= lookup_commit(&oid
);
214 if (parse_commit_buffer(commit
, buffer
, size
))
216 if (!get_cached_commit_buffer(commit
, NULL
)) {
217 set_commit_buffer(commit
, buffer
, size
);
220 obj
= &commit
->object
;
222 } else if (type
== OBJ_TAG
) {
223 struct tag
*tag
= lookup_tag(sha1
);
225 if (parse_tag_buffer(tag
, buffer
, size
))
230 warning("object %s has unknown type id %d", sha1_to_hex(sha1
), type
);
236 struct object
*parse_object_or_die(const unsigned char *sha1
,
239 struct object
*o
= parse_object(sha1
);
243 die(_("unable to parse object: %s"), name
? name
: sha1_to_hex(sha1
));
246 struct object
*parse_object(const unsigned char *sha1
)
249 enum object_type type
;
251 const unsigned char *repl
= lookup_replace_object(sha1
);
254 struct object_id oid
;
256 hashcpy(oid
.hash
, sha1
);
258 obj
= lookup_object(oid
.hash
);
259 if (obj
&& obj
->parsed
)
262 if ((obj
&& obj
->type
== OBJ_BLOB
) ||
263 (!obj
&& has_sha1_file(sha1
) &&
264 sha1_object_info(sha1
, NULL
) == OBJ_BLOB
)) {
265 if (check_sha1_signature(repl
, NULL
, 0, NULL
) < 0) {
266 error("sha1 mismatch %s", sha1_to_hex(repl
));
269 parse_blob_buffer(lookup_blob(&oid
), NULL
, 0);
270 return lookup_object(sha1
);
273 buffer
= read_sha1_file(sha1
, &type
, &size
);
275 if (check_sha1_signature(repl
, buffer
, size
, typename(type
)) < 0) {
277 error("sha1 mismatch %s", sha1_to_hex(repl
));
281 obj
= parse_object_buffer(sha1
, type
, size
, buffer
, &eaten
);
289 struct object_list
*object_list_insert(struct object
*item
,
290 struct object_list
**list_p
)
292 struct object_list
*new_list
= xmalloc(sizeof(struct object_list
));
293 new_list
->item
= item
;
294 new_list
->next
= *list_p
;
299 int object_list_contains(struct object_list
*list
, struct object
*obj
)
302 if (list
->item
== obj
)
310 * A zero-length string to which object_array_entry::name can be
311 * initialized without requiring a malloc/free.
313 static char object_array_slopbuf
[1];
315 void add_object_array_with_path(struct object
*obj
, const char *name
,
316 struct object_array
*array
,
317 unsigned mode
, const char *path
)
319 unsigned nr
= array
->nr
;
320 unsigned alloc
= array
->alloc
;
321 struct object_array_entry
*objects
= array
->objects
;
322 struct object_array_entry
*entry
;
325 alloc
= (alloc
+ 32) * 2;
326 REALLOC_ARRAY(objects
, alloc
);
327 array
->alloc
= alloc
;
328 array
->objects
= objects
;
330 entry
= &objects
[nr
];
335 /* Use our own empty string instead of allocating one: */
336 entry
->name
= object_array_slopbuf
;
338 entry
->name
= xstrdup(name
);
341 entry
->path
= xstrdup(path
);
347 void add_object_array(struct object
*obj
, const char *name
, struct object_array
*array
)
349 add_object_array_with_path(obj
, name
, array
, S_IFINVALID
, NULL
);
353 * Free all memory associated with an entry; the result is
354 * in an unspecified state and should not be examined.
356 static void object_array_release_entry(struct object_array_entry
*ent
)
358 if (ent
->name
!= object_array_slopbuf
)
363 void object_array_filter(struct object_array
*array
,
364 object_array_each_func_t want
, void *cb_data
)
366 unsigned nr
= array
->nr
, src
, dst
;
367 struct object_array_entry
*objects
= array
->objects
;
369 for (src
= dst
= 0; src
< nr
; src
++) {
370 if (want(&objects
[src
], cb_data
)) {
372 objects
[dst
] = objects
[src
];
375 object_array_release_entry(&objects
[src
]);
381 void object_array_clear(struct object_array
*array
)
384 for (i
= 0; i
< array
->nr
; i
++)
385 object_array_release_entry(&array
->objects
[i
]);
386 free(array
->objects
);
387 array
->objects
= NULL
;
388 array
->nr
= array
->alloc
= 0;
392 * Return true iff array already contains an entry with name.
394 static int contains_name(struct object_array
*array
, const char *name
)
396 unsigned nr
= array
->nr
, i
;
397 struct object_array_entry
*object
= array
->objects
;
399 for (i
= 0; i
< nr
; i
++, object
++)
400 if (!strcmp(object
->name
, name
))
405 void object_array_remove_duplicates(struct object_array
*array
)
407 unsigned nr
= array
->nr
, src
;
408 struct object_array_entry
*objects
= array
->objects
;
411 for (src
= 0; src
< nr
; src
++) {
412 if (!contains_name(array
, objects
[src
].name
)) {
413 if (src
!= array
->nr
)
414 objects
[array
->nr
] = objects
[src
];
417 object_array_release_entry(&objects
[src
]);
422 void clear_object_flags(unsigned flags
)
426 for (i
=0; i
< obj_hash_size
; i
++) {
427 struct object
*obj
= obj_hash
[i
];
429 obj
->flags
&= ~flags
;