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(const char *str
)
40 for (i
= 1; i
< ARRAY_SIZE(object_type_strings
); i
++)
41 if (!strcmp(str
, object_type_strings
[i
]))
43 die("invalid object type \"%s\"", str
);
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.
51 static unsigned int hash_obj(const unsigned char *sha1
, unsigned int n
)
53 return sha1hash(sha1
) & (n
- 1);
57 * Insert obj into the hash table hash, which has length size (which
58 * must be a power of 2). On collisions, simply overflow to the next
61 static void insert_obj_hash(struct object
*obj
, struct object
**hash
, unsigned int size
)
63 unsigned int j
= hash_obj(obj
->sha1
, size
);
74 * Look up the record for the given sha1 in the hash map stored in
75 * obj_hash. Return NULL if it was not found.
77 struct object
*lookup_object(const unsigned char *sha1
)
79 unsigned int i
, first
;
85 first
= i
= hash_obj(sha1
, obj_hash_size
);
86 while ((obj
= obj_hash
[i
]) != NULL
) {
87 if (!hashcmp(sha1
, obj
->sha1
))
90 if (i
== obj_hash_size
)
93 if (obj
&& i
!= first
) {
95 * Move object to where we started to look for it so
96 * that we do not need to walk the hash table the next
97 * time we look for it.
99 struct object
*tmp
= obj_hash
[i
];
100 obj_hash
[i
] = obj_hash
[first
];
101 obj_hash
[first
] = tmp
;
107 * Increase the size of the hash map stored in obj_hash to the next
108 * power of 2 (but at least 32). Copy the existing values to the new
111 static void grow_object_hash(void)
115 * Note that this size must always be power-of-2 to match hash_obj
118 int new_hash_size
= obj_hash_size
< 32 ? 32 : 2 * obj_hash_size
;
119 struct object
**new_hash
;
121 new_hash
= xcalloc(new_hash_size
, sizeof(struct object
*));
122 for (i
= 0; i
< obj_hash_size
; i
++) {
123 struct object
*obj
= obj_hash
[i
];
126 insert_obj_hash(obj
, new_hash
, new_hash_size
);
130 obj_hash_size
= new_hash_size
;
133 void *create_object(const unsigned char *sha1
, int type
, void *o
)
135 struct object
*obj
= o
;
141 hashcpy(obj
->sha1
, sha1
);
143 if (obj_hash_size
- 1 <= nr_objs
* 2)
146 insert_obj_hash(obj
, obj_hash
, obj_hash_size
);
151 struct object
*lookup_unknown_object(const unsigned char *sha1
)
153 struct object
*obj
= lookup_object(sha1
);
155 obj
= create_object(sha1
, OBJ_NONE
, alloc_object_node());
159 struct object
*parse_object_buffer(const unsigned char *sha1
, enum object_type type
, unsigned long size
, void *buffer
, int *eaten_p
)
165 if (type
== OBJ_BLOB
) {
166 struct blob
*blob
= lookup_blob(sha1
);
168 if (parse_blob_buffer(blob
, buffer
, size
))
172 } else if (type
== OBJ_TREE
) {
173 struct tree
*tree
= lookup_tree(sha1
);
177 tree
->object
.parsed
= 0;
178 if (!tree
->object
.parsed
) {
179 if (parse_tree_buffer(tree
, buffer
, size
))
184 } else if (type
== OBJ_COMMIT
) {
185 struct commit
*commit
= lookup_commit(sha1
);
187 if (parse_commit_buffer(commit
, buffer
, size
))
189 if (!get_cached_commit_buffer(commit
, NULL
)) {
190 set_commit_buffer(commit
, buffer
, size
);
193 obj
= &commit
->object
;
195 } else if (type
== OBJ_TAG
) {
196 struct tag
*tag
= lookup_tag(sha1
);
198 if (parse_tag_buffer(tag
, buffer
, size
))
203 warning("object %s has unknown type id %d", sha1_to_hex(sha1
), type
);
206 if (obj
&& obj
->type
== OBJ_NONE
)
211 struct object
*parse_object_or_die(const unsigned char *sha1
,
214 struct object
*o
= parse_object(sha1
);
218 die(_("unable to parse object: %s"), name
? name
: sha1_to_hex(sha1
));
221 struct object
*parse_object(const unsigned char *sha1
)
224 enum object_type type
;
226 const unsigned char *repl
= lookup_replace_object(sha1
);
230 obj
= lookup_object(sha1
);
231 if (obj
&& obj
->parsed
)
234 if ((obj
&& obj
->type
== OBJ_BLOB
) ||
235 (!obj
&& has_sha1_file(sha1
) &&
236 sha1_object_info(sha1
, NULL
) == OBJ_BLOB
)) {
237 if (check_sha1_signature(repl
, NULL
, 0, NULL
) < 0) {
238 error("sha1 mismatch %s", sha1_to_hex(repl
));
241 parse_blob_buffer(lookup_blob(sha1
), NULL
, 0);
242 return lookup_object(sha1
);
245 buffer
= read_sha1_file(sha1
, &type
, &size
);
247 if (check_sha1_signature(repl
, buffer
, size
, typename(type
)) < 0) {
249 error("sha1 mismatch %s", sha1_to_hex(repl
));
253 obj
= parse_object_buffer(sha1
, type
, size
, buffer
, &eaten
);
261 struct object_list
*object_list_insert(struct object
*item
,
262 struct object_list
**list_p
)
264 struct object_list
*new_list
= xmalloc(sizeof(struct object_list
));
265 new_list
->item
= item
;
266 new_list
->next
= *list_p
;
271 int object_list_contains(struct object_list
*list
, struct object
*obj
)
274 if (list
->item
== obj
)
282 * A zero-length string to which object_array_entry::name can be
283 * initialized without requiring a malloc/free.
285 static char object_array_slopbuf
[1];
287 static void add_object_array_with_mode_context(struct object
*obj
, const char *name
,
288 struct object_array
*array
,
290 struct object_context
*context
)
292 unsigned nr
= array
->nr
;
293 unsigned alloc
= array
->alloc
;
294 struct object_array_entry
*objects
= array
->objects
;
295 struct object_array_entry
*entry
;
298 alloc
= (alloc
+ 32) * 2;
299 objects
= xrealloc(objects
, alloc
* sizeof(*objects
));
300 array
->alloc
= alloc
;
301 array
->objects
= objects
;
303 entry
= &objects
[nr
];
308 /* Use our own empty string instead of allocating one: */
309 entry
->name
= object_array_slopbuf
;
311 entry
->name
= xstrdup(name
);
313 entry
->context
= context
;
317 void add_object_array(struct object
*obj
, const char *name
, struct object_array
*array
)
319 add_object_array_with_mode(obj
, name
, array
, S_IFINVALID
);
322 void add_object_array_with_mode(struct object
*obj
, const char *name
, struct object_array
*array
, unsigned mode
)
324 add_object_array_with_mode_context(obj
, name
, array
, mode
, NULL
);
327 void add_object_array_with_context(struct object
*obj
, const char *name
, struct object_array
*array
, struct object_context
*context
)
330 add_object_array_with_mode_context(obj
, name
, array
, context
->mode
, context
);
332 add_object_array_with_mode_context(obj
, name
, array
, S_IFINVALID
, context
);
335 void object_array_filter(struct object_array
*array
,
336 object_array_each_func_t want
, void *cb_data
)
338 unsigned nr
= array
->nr
, src
, dst
;
339 struct object_array_entry
*objects
= array
->objects
;
341 for (src
= dst
= 0; src
< nr
; src
++) {
342 if (want(&objects
[src
], cb_data
)) {
344 objects
[dst
] = objects
[src
];
347 if (objects
[src
].name
!= object_array_slopbuf
)
348 free(objects
[src
].name
);
355 * Return true iff array already contains an entry with name.
357 static int contains_name(struct object_array
*array
, const char *name
)
359 unsigned nr
= array
->nr
, i
;
360 struct object_array_entry
*object
= array
->objects
;
362 for (i
= 0; i
< nr
; i
++, object
++)
363 if (!strcmp(object
->name
, name
))
368 void object_array_remove_duplicates(struct object_array
*array
)
370 unsigned nr
= array
->nr
, src
;
371 struct object_array_entry
*objects
= array
->objects
;
374 for (src
= 0; src
< nr
; src
++) {
375 if (!contains_name(array
, objects
[src
].name
)) {
376 if (src
!= array
->nr
)
377 objects
[array
->nr
] = objects
[src
];
380 if (objects
[src
].name
!= object_array_slopbuf
)
381 free(objects
[src
].name
);
386 void clear_object_flags(unsigned flags
)
390 for (i
=0; i
< obj_hash_size
; i
++) {
391 struct object
*obj
= obj_hash
[i
];
393 obj
->flags
&= ~flags
;