🌐 AI搜索 & 代理 主页
Google Git
Sign in
chromium / external / github.com / git / git / refs/tags/v2.1.3 / . / object.c
blob: a16b9f9e936d060ba190b6c7e82ff5f25795f490 [file] [log] [blame]
Junio C Hamano8f1d2e62006-01-07 09:33:54[diff] [blame]1#include "cache.h"
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]2#include "object.h"
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]3#include "blob.h"
4#include "tree.h"
5#include "commit.h"
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]6#include "tag.h"
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]7
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]8static struct object **obj_hash;
9static int nr_objs, obj_hash_size;
Linus Torvaldsfc046a72006-06-30 04:38:55[diff] [blame]10
11unsigned int get_max_object_index(void)
12{
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]13 return obj_hash_size;
Linus Torvaldsfc046a72006-06-30 04:38:55[diff] [blame]14}
15
16struct object *get_indexed_object(unsigned int idx)
17{
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]18 return obj_hash[idx];
Linus Torvaldsfc046a72006-06-30 04:38:55[diff] [blame]19}
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]20
Nicolas Pitredf843662007-02-26 19:55:58[diff] [blame]21static 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 */
Linus Torvalds885a86a2006-06-14 23:45:13[diff] [blame]27};
28
Nicolas Pitredf843662007-02-26 19:55:58[diff] [blame]29const char *typename(unsigned int type)
30{
31 if (type >= ARRAY_SIZE(object_type_strings))
32 return NULL;
33 return object_type_strings[type];
34}
35
36int type_from_string(const char *str)
37{
38 int i;
39
40 for (i = 1; i < ARRAY_SIZE(object_type_strings); i++)
41 if (!strcmp(str, object_type_strings[i]))
42 return i;
43 die("invalid object type \"%s\"", str);
44}
45
Michael Haggerty33bef7e2014-02-28 16:29:17[diff] [blame]46/*
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.
50 */
Nicolas Pitre9f36c9b2013-09-10 22:17:12[diff] [blame]51static unsigned int hash_obj(const unsigned char *sha1, unsigned int n)
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]52{
Karsten Blees039dc712014-07-02 22:20:20[diff] [blame]53 return sha1hash(sha1) & (n - 1);
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]54}
55
Michael Haggerty33bef7e2014-02-28 16:29:17[diff] [blame]56/*
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
59 * empty bucket.
60 */
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]61static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size)
62{
Nicolas Pitre9f36c9b2013-09-10 22:17:12[diff] [blame]63 unsigned int j = hash_obj(obj->sha1, size);
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]64
65 while (hash[j]) {
66 j++;
67 if (j >= size)
68 j = 0;
69 }
70 hash[j] = obj;
71}
72
Michael Haggerty33bef7e2014-02-28 16:29:17[diff] [blame]73/*
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.
76 */
Jason McMullan5d6ccf52005-06-03 15:05:39[diff] [blame]77struct object *lookup_object(const unsigned char *sha1)
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]78{
Jeff King9a414482013-05-01 20:34:50[diff] [blame]79 unsigned int i, first;
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]80 struct object *obj;
81
82 if (!obj_hash)
83 return NULL;
84
Nicolas Pitre9f36c9b2013-09-10 22:17:12[diff] [blame]85 first = i = hash_obj(sha1, obj_hash_size);
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]86 while ((obj = obj_hash[i]) != NULL) {
David Rientjesa89fccd2006-08-17 18:54:57[diff] [blame]87 if (!hashcmp(sha1, obj->sha1))
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]88 break;
89 i++;
90 if (i == obj_hash_size)
91 i = 0;
92 }
Jeff King9a414482013-05-01 20:34:50[diff] [blame]93 if (obj && i != first) {
94 /*
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.
98 */
99 struct object *tmp = obj_hash[i];
100 obj_hash[i] = obj_hash[first];
101 obj_hash[first] = tmp;
102 }
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]103 return obj;
104}
105
Michael Haggerty33bef7e2014-02-28 16:29:17[diff] [blame]106/*
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
109 * hash map.
110 */
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]111static void grow_object_hash(void)
112{
113 int i;
Nicolas Pitre9f36c9b2013-09-10 22:17:12[diff] [blame]114 /*
115 * Note that this size must always be power-of-2 to match hash_obj
116 * above.
117 */
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]118 int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size;
119 struct object **new_hash;
120
Jonas Fonsecab3c952f2006-08-28 00:26:07[diff] [blame]121 new_hash = xcalloc(new_hash_size, sizeof(struct object *));
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]122 for (i = 0; i < obj_hash_size; i++) {
123 struct object *obj = obj_hash[i];
124 if (!obj)
125 continue;
126 insert_obj_hash(obj, new_hash, new_hash_size);
127 }
128 free(obj_hash);
129 obj_hash = new_hash;
130 obj_hash_size = new_hash_size;
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]131}
132
Jeff Kingd36f51c2014-07-13 06:41:55[diff] [blame]133void *create_object(const unsigned char *sha1, void *o)
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]134{
Linus Torvalds100c5f32007-04-17 05:11:43[diff] [blame]135 struct object *obj = o;
136
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]137 obj->parsed = 0;
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]138 obj->used = 0;
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]139 obj->flags = 0;
Shawn Pearcee7024962006-08-23 06:49:00[diff] [blame]140 hashcpy(obj->sha1, sha1);
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]141
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]142 if (obj_hash_size - 1 <= nr_objs * 2)
143 grow_object_hash();
Johannes Schindelin070879c2006-02-12 01:57:57[diff] [blame]144
Linus Torvalds0556a112006-06-30 18:20:33[diff] [blame]145 insert_obj_hash(obj, obj_hash, obj_hash_size);
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]146 nr_objs++;
Linus Torvalds100c5f32007-04-17 05:11:43[diff] [blame]147 return obj;
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]148}
149
Jeff King8ff226a2014-07-13 06:42:03[diff] [blame]150void *object_as_type(struct object *obj, enum object_type type, int quiet)
151{
152 if (obj->type == type)
153 return obj;
154 else if (obj->type == OBJ_NONE) {
Jeff Kingd66bebc2014-07-13 06:42:12[diff] [blame]155 if (type == OBJ_COMMIT)
156 ((struct commit *)obj)->index = alloc_commit_index();
Jeff King8ff226a2014-07-13 06:42:03[diff] [blame]157 obj->type = type;
158 return obj;
159 }
160 else {
161 if (!quiet)
162 error("object %s is a %s, not a %s",
163 sha1_to_hex(obj->sha1),
164 typename(obj->type), typename(type));
165 return NULL;
166 }
167}
168
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]169struct object *lookup_unknown_object(const unsigned char *sha1)
170{
171 struct object *obj = lookup_object(sha1);
Linus Torvalds100c5f32007-04-17 05:11:43[diff] [blame]172 if (!obj)
Jeff Kingd36f51c2014-07-13 06:41:55[diff] [blame]173 obj = create_object(sha1, alloc_object_node());
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]174 return obj;
175}
176
Nicolas Pitre21666f12007-02-26 19:55:59[diff] [blame]177struct object *parse_object_buffer(const unsigned char *sha1, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]178{
179 struct object *obj;
Stefan Beller8e92e8f2013-07-17 22:09:42[diff] [blame]180 *eaten_p = 0;
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]181
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]182 obj = NULL;
Nicolas Pitre21666f12007-02-26 19:55:59[diff] [blame]183 if (type == OBJ_BLOB) {
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]184 struct blob *blob = lookup_blob(sha1);
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]185 if (blob) {
Martin Koeglerd0b8c9e2008-02-03 21:22:39[diff] [blame]186 if (parse_blob_buffer(blob, buffer, size))
187 return NULL;
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]188 obj = &blob->object;
189 }
Nicolas Pitre21666f12007-02-26 19:55:59[diff] [blame]190 } else if (type == OBJ_TREE) {
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]191 struct tree *tree = lookup_tree(sha1);
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]192 if (tree) {
193 obj = &tree->object;
Junio C Hamano68be2fe2011-11-17 06:04:13[diff] [blame]194 if (!tree->buffer)
195 tree->object.parsed = 0;
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]196 if (!tree->object.parsed) {
Martin Koeglerd0b8c9e2008-02-03 21:22:39[diff] [blame]197 if (parse_tree_buffer(tree, buffer, size))
198 return NULL;
Stefan Beller8e92e8f2013-07-17 22:09:42[diff] [blame]199 *eaten_p = 1;
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]200 }
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]201 }
Nicolas Pitre21666f12007-02-26 19:55:59[diff] [blame]202 } else if (type == OBJ_COMMIT) {
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]203 struct commit *commit = lookup_commit(sha1);
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]204 if (commit) {
Martin Koeglerd0b8c9e2008-02-03 21:22:39[diff] [blame]205 if (parse_commit_buffer(commit, buffer, size))
206 return NULL;
Jeff King8597ea32014-06-10 21:44:13[diff] [blame]207 if (!get_cached_commit_buffer(commit, NULL)) {
208 set_commit_buffer(commit, buffer, size);
Stefan Beller8e92e8f2013-07-17 22:09:42[diff] [blame]209 *eaten_p = 1;
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]210 }
211 obj = &commit->object;
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]212 }
Nicolas Pitre21666f12007-02-26 19:55:59[diff] [blame]213 } else if (type == OBJ_TAG) {
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]214 struct tag *tag = lookup_tag(sha1);
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]215 if (tag) {
Martin Koeglerd0b8c9e2008-02-03 21:22:39[diff] [blame]216 if (parse_tag_buffer(tag, buffer, size))
217 return NULL;
Jim Meyeringcc216822007-12-21 10:56:32[diff] [blame]218 obj = &tag->object;
219 }
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]220 } else {
Pete Wyckoff82247e92012-04-30 00:28:45[diff] [blame]221 warning("object %s has unknown type id %d", sha1_to_hex(sha1), type);
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]222 obj = NULL;
223 }
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]224 return obj;
225}
226
Jeff King75a95492013-03-17 08:22:36[diff] [blame]227struct object *parse_object_or_die(const unsigned char *sha1,
228 const char *name)
229{
230 struct object *o = parse_object(sha1);
231 if (o)
232 return o;
233
234 die(_("unable to parse object: %s"), name ? name : sha1_to_hex(sha1));
235}
236
Jason McMullan5d6ccf52005-06-03 15:05:39[diff] [blame]237struct object *parse_object(const unsigned char *sha1)
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]238{
Junio C Hamanoc4584ae2005-06-27 10:33:33[diff] [blame]239 unsigned long size;
Nicolas Pitre21666f12007-02-26 19:55:59[diff] [blame]240 enum object_type type;
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]241 int eaten;
Junio C Hamano4bbf5a22011-05-15 19:54:52[diff] [blame]242 const unsigned char *repl = lookup_replace_object(sha1);
Jeff Kingccdc6032012-01-05 21:00:01[diff] [blame]243 void *buffer;
244 struct object *obj;
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]245
Jeff Kingccdc6032012-01-05 21:00:01[diff] [blame]246 obj = lookup_object(sha1);
247 if (obj && obj->parsed)
248 return obj;
249
Nguyễn Thái Ngọc Duy090ea122012-03-07 10:54:18[diff] [blame]250 if ((obj && obj->type == OBJ_BLOB) ||
251 (!obj && has_sha1_file(sha1) &&
252 sha1_object_info(sha1, NULL) == OBJ_BLOB)) {
253 if (check_sha1_signature(repl, NULL, 0, NULL) < 0) {
Pete Wyckoff82247e92012-04-30 00:28:45[diff] [blame]254 error("sha1 mismatch %s", sha1_to_hex(repl));
Nguyễn Thái Ngọc Duy090ea122012-03-07 10:54:18[diff] [blame]255 return NULL;
256 }
257 parse_blob_buffer(lookup_blob(sha1), NULL, 0);
258 return lookup_object(sha1);
259 }
260
Jeff Kingccdc6032012-01-05 21:00:01[diff] [blame]261 buffer = read_sha1_file(sha1, &type, &size);
Junio C Hamanoc4584ae2005-06-27 10:33:33[diff] [blame]262 if (buffer) {
Christian Couder0e87c362009-01-23 09:07:10[diff] [blame]263 if (check_sha1_signature(repl, buffer, size, typename(type)) < 0) {
Carlos Rica0b1f1132007-05-25 01:46:22[diff] [blame]264 free(buffer);
Pete Wyckoff82247e92012-04-30 00:28:45[diff] [blame]265 error("sha1 mismatch %s", sha1_to_hex(repl));
Linus Torvaldsacdeec62007-03-20 17:05:20[diff] [blame]266 return NULL;
267 }
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]268
Nguyễn Thái Ngọc Duy2e3400c2010-09-03 20:51:53[diff] [blame]269 obj = parse_object_buffer(sha1, type, size, buffer, &eaten);
Junio C Hamano9f613dd2006-09-15 20:30:02[diff] [blame]270 if (!eaten)
271 free(buffer);
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]272 return obj;
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]273 }
274 return NULL;
275}
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]276
277struct object_list *object_list_insert(struct object *item,
278 struct object_list **list_p)
279{
280 struct object_list *new_list = xmalloc(sizeof(struct object_list));
Jared Hance55b4e9e2010-09-05 19:36:33[diff] [blame]281 new_list->item = item;
282 new_list->next = *list_p;
283 *list_p = new_list;
284 return new_list;
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]285}
286
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]287int object_list_contains(struct object_list *list, struct object *obj)
288{
289 while (list) {
290 if (list->item == obj)
291 return 1;
292 list = list->next;
293 }
294 return 0;
295}
Linus Torvalds1f1e8952006-06-20 00:42:35[diff] [blame]296
Michael Haggerty31faeb22013-05-25 09:08:14[diff] [blame]297/*
298 * A zero-length string to which object_array_entry::name can be
299 * initialized without requiring a malloc/free.
300 */
301static char object_array_slopbuf[1];
302
Junio C Hamano41973612013-10-23 20:21:30[diff] [blame]303static void add_object_array_with_mode_context(struct object *obj, const char *name,
304 struct object_array *array,
305 unsigned mode,
306 struct object_context *context)
Martin Koeglere5709a42007-04-22 16:43:58[diff] [blame]307{
Linus Torvalds1f1e8952006-06-20 00:42:35[diff] [blame]308 unsigned nr = array->nr;
309 unsigned alloc = array->alloc;
310 struct object_array_entry *objects = array->objects;
Michael Haggerty31faeb22013-05-25 09:08:14[diff] [blame]311 struct object_array_entry *entry;
Linus Torvalds1f1e8952006-06-20 00:42:35[diff] [blame]312
313 if (nr >= alloc) {
314 alloc = (alloc + 32) * 2;
315 objects = xrealloc(objects, alloc * sizeof(*objects));
316 array->alloc = alloc;
317 array->objects = objects;
318 }
Michael Haggerty31faeb22013-05-25 09:08:14[diff] [blame]319 entry = &objects[nr];
320 entry->item = obj;
321 if (!name)
322 entry->name = NULL;
323 else if (!*name)
324 /* Use our own empty string instead of allocating one: */
325 entry->name = object_array_slopbuf;
326 else
327 entry->name = xstrdup(name);
328 entry->mode = mode;
Junio C Hamano41973612013-10-23 20:21:30[diff] [blame]329 entry->context = context;
Linus Torvalds1f1e8952006-06-20 00:42:35[diff] [blame]330 array->nr = ++nr;
331}
Junio C Hamanob2a6d1c2009-01-18 06:27:08[diff] [blame]332
Michael J Gruberafa15f32013-05-10 15:10:16[diff] [blame]333void add_object_array(struct object *obj, const char *name, struct object_array *array)
334{
335 add_object_array_with_mode(obj, name, array, S_IFINVALID);
336}
337
338void add_object_array_with_mode(struct object *obj, const char *name, struct object_array *array, unsigned mode)
339{
340 add_object_array_with_mode_context(obj, name, array, mode, NULL);
341}
342
343void add_object_array_with_context(struct object *obj, const char *name, struct object_array *array, struct object_context *context)
344{
345 if (context)
346 add_object_array_with_mode_context(obj, name, array, context->mode, context);
347 else
348 add_object_array_with_mode_context(obj, name, array, S_IFINVALID, context);
349}
350
Michael Haggertyaeb4a512013-05-25 09:08:08[diff] [blame]351void object_array_filter(struct object_array *array,
352 object_array_each_func_t want, void *cb_data)
353{
354 unsigned nr = array->nr, src, dst;
355 struct object_array_entry *objects = array->objects;
356
357 for (src = dst = 0; src < nr; src++) {
358 if (want(&objects[src], cb_data)) {
359 if (src != dst)
360 objects[dst] = objects[src];
361 dst++;
Michael Haggerty31faeb22013-05-25 09:08:14[diff] [blame]362 } else {
363 if (objects[src].name != object_array_slopbuf)
364 free(objects[src].name);
Michael Haggertyaeb4a512013-05-25 09:08:08[diff] [blame]365 }
366 }
367 array->nr = dst;
368}
369
Michael Haggerty15065102013-05-25 09:08:10[diff] [blame]370/*
371 * Return true iff array already contains an entry with name.
372 */
373static int contains_name(struct object_array *array, const char *name)
374{
375 unsigned nr = array->nr, i;
376 struct object_array_entry *object = array->objects;
377
378 for (i = 0; i < nr; i++, object++)
379 if (!strcmp(object->name, name))
380 return 1;
381 return 0;
382}
383
Junio C Hamanob2a6d1c2009-01-18 06:27:08[diff] [blame]384void object_array_remove_duplicates(struct object_array *array)
385{
Michael Haggerty15065102013-05-25 09:08:10[diff] [blame]386 unsigned nr = array->nr, src;
Junio C Hamanob2a6d1c2009-01-18 06:27:08[diff] [blame]387 struct object_array_entry *objects = array->objects;
388
Michael Haggerty15065102013-05-25 09:08:10[diff] [blame]389 array->nr = 0;
390 for (src = 0; src < nr; src++) {
391 if (!contains_name(array, objects[src].name)) {
392 if (src != array->nr)
393 objects[array->nr] = objects[src];
394 array->nr++;
Michael Haggerty31faeb22013-05-25 09:08:14[diff] [blame]395 } else {
396 if (objects[src].name != object_array_slopbuf)
397 free(objects[src].name);
Junio C Hamanob2a6d1c2009-01-18 06:27:08[diff] [blame]398 }
Junio C Hamanob2a6d1c2009-01-18 06:27:08[diff] [blame]399 }
400}
Heiko Voigtbcc0a3e2012-03-29 07:21:21[diff] [blame]401
402void clear_object_flags(unsigned flags)
403{
404 int i;
405
406 for (i=0; i < obj_hash_size; i++) {
407 struct object *obj = obj_hash[i];
408 if (obj)
409 obj->flags &= ~flags;
410 }
411}