don't ever allow SHA1 collisions to exist by fetching a pack
[git/haiku.git] / object.c
blob5b468893421794c50741ce9085c12bc41fb1985f
1 #include "cache.h"
2 #include "object.h"
3 #include "blob.h"
4 #include "tree.h"
5 #include "commit.h"
6 #include "tag.h"
8 static struct object **obj_hash;
9 static int nr_objs, obj_hash_size;
11 unsigned int get_max_object_index(void)
13 return obj_hash_size;
16 struct object *get_indexed_object(unsigned int idx)
18 return obj_hash[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))
32 return NULL;
33 return object_type_strings[type];
36 int type_from_string(const char *str)
38 int i;
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);
46 static unsigned int hash_obj(struct object *obj, unsigned int n)
48 unsigned int hash = *(unsigned int *)obj->sha1;
49 return hash % n;
52 static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size)
54 int j = hash_obj(obj, size);
56 while (hash[j]) {
57 j++;
58 if (j >= size)
59 j = 0;
61 hash[j] = obj;
64 static int hashtable_index(const unsigned char *sha1)
66 unsigned int i;
67 memcpy(&i, sha1, sizeof(unsigned int));
68 return (int)(i % obj_hash_size);
71 struct object *lookup_object(const unsigned char *sha1)
73 int i;
74 struct object *obj;
76 if (!obj_hash)
77 return NULL;
79 i = hashtable_index(sha1);
80 while ((obj = obj_hash[i]) != NULL) {
81 if (!hashcmp(sha1, obj->sha1))
82 break;
83 i++;
84 if (i == obj_hash_size)
85 i = 0;
87 return obj;
90 static void grow_object_hash(void)
92 int i;
93 int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size;
94 struct object **new_hash;
96 new_hash = xcalloc(new_hash_size, sizeof(struct object *));
97 for (i = 0; i < obj_hash_size; i++) {
98 struct object *obj = obj_hash[i];
99 if (!obj)
100 continue;
101 insert_obj_hash(obj, new_hash, new_hash_size);
103 free(obj_hash);
104 obj_hash = new_hash;
105 obj_hash_size = new_hash_size;
108 void created_object(const unsigned char *sha1, struct object *obj)
110 obj->parsed = 0;
111 obj->used = 0;
112 obj->type = OBJ_NONE;
113 obj->flags = 0;
114 hashcpy(obj->sha1, sha1);
116 if (obj_hash_size - 1 <= nr_objs * 2)
117 grow_object_hash();
119 insert_obj_hash(obj, obj_hash, obj_hash_size);
120 nr_objs++;
123 union any_object {
124 struct object object;
125 struct commit commit;
126 struct tree tree;
127 struct blob blob;
128 struct tag tag;
131 struct object *lookup_unknown_object(const unsigned char *sha1)
133 struct object *obj = lookup_object(sha1);
134 if (!obj) {
135 union any_object *ret = xcalloc(1, sizeof(*ret));
136 created_object(sha1, &ret->object);
137 ret->object.type = OBJ_NONE;
138 return &ret->object;
140 return obj;
143 struct object *parse_object_buffer(const unsigned char *sha1, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
145 struct object *obj;
146 int eaten = 0;
148 if (type == OBJ_BLOB) {
149 struct blob *blob = lookup_blob(sha1);
150 parse_blob_buffer(blob, buffer, size);
151 obj = &blob->object;
152 } else if (type == OBJ_TREE) {
153 struct tree *tree = lookup_tree(sha1);
154 obj = &tree->object;
155 if (!tree->object.parsed) {
156 parse_tree_buffer(tree, buffer, size);
157 eaten = 1;
159 } else if (type == OBJ_COMMIT) {
160 struct commit *commit = lookup_commit(sha1);
161 parse_commit_buffer(commit, buffer, size);
162 if (!commit->buffer) {
163 commit->buffer = buffer;
164 eaten = 1;
166 obj = &commit->object;
167 } else if (type == OBJ_TAG) {
168 struct tag *tag = lookup_tag(sha1);
169 parse_tag_buffer(tag, buffer, size);
170 obj = &tag->object;
171 } else {
172 obj = NULL;
174 *eaten_p = eaten;
175 return obj;
178 struct object *parse_object(const unsigned char *sha1)
180 unsigned long size;
181 enum object_type type;
182 int eaten;
183 void *buffer = read_sha1_file(sha1, &type, &size);
185 if (buffer) {
186 struct object *obj;
187 if (check_sha1_signature(sha1, buffer, size, typename(type)) < 0)
188 printf("sha1 mismatch %s\n", sha1_to_hex(sha1));
190 obj = parse_object_buffer(sha1, type, size, buffer, &eaten);
191 if (!eaten)
192 free(buffer);
193 return obj;
195 return NULL;
198 struct object_list *object_list_insert(struct object *item,
199 struct object_list **list_p)
201 struct object_list *new_list = xmalloc(sizeof(struct object_list));
202 new_list->item = item;
203 new_list->next = *list_p;
204 *list_p = new_list;
205 return new_list;
208 void object_list_append(struct object *item,
209 struct object_list **list_p)
211 while (*list_p) {
212 list_p = &((*list_p)->next);
214 *list_p = xmalloc(sizeof(struct object_list));
215 (*list_p)->next = NULL;
216 (*list_p)->item = item;
219 unsigned object_list_length(struct object_list *list)
221 unsigned ret = 0;
222 while (list) {
223 list = list->next;
224 ret++;
226 return ret;
229 int object_list_contains(struct object_list *list, struct object *obj)
231 while (list) {
232 if (list->item == obj)
233 return 1;
234 list = list->next;
236 return 0;
239 void add_object_array(struct object *obj, const char *name, struct object_array *array)
241 unsigned nr = array->nr;
242 unsigned alloc = array->alloc;
243 struct object_array_entry *objects = array->objects;
245 if (nr >= alloc) {
246 alloc = (alloc + 32) * 2;
247 objects = xrealloc(objects, alloc * sizeof(*objects));
248 array->alloc = alloc;
249 array->objects = objects;
251 objects[nr].item = obj;
252 objects[nr].name = name;
253 array->nr = ++nr;