lookup_object: prioritize recently found objects
[alt-git.git] / object.c
blob3fb1caa29fe4f76b1cf49a08d30a47a143081298
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;
49 memcpy(&hash, obj->sha1, sizeof(unsigned int));
50 return hash % n;
53 static void insert_obj_hash(struct object *obj, struct object **hash, unsigned int size)
55 unsigned int j = hash_obj(obj, size);
57 while (hash[j]) {
58 j++;
59 if (j >= size)
60 j = 0;
62 hash[j] = obj;
65 static unsigned int hashtable_index(const unsigned char *sha1)
67 unsigned int i;
68 memcpy(&i, sha1, sizeof(unsigned int));
69 return i % obj_hash_size;
72 struct object *lookup_object(const unsigned char *sha1)
74 unsigned int i, first;
75 struct object *obj;
77 if (!obj_hash)
78 return NULL;
80 first = i = hashtable_index(sha1);
81 while ((obj = obj_hash[i]) != NULL) {
82 if (!hashcmp(sha1, obj->sha1))
83 break;
84 i++;
85 if (i == obj_hash_size)
86 i = 0;
88 if (obj && i != first) {
90 * Move object to where we started to look for it so
91 * that we do not need to walk the hash table the next
92 * time we look for it.
94 struct object *tmp = obj_hash[i];
95 obj_hash[i] = obj_hash[first];
96 obj_hash[first] = tmp;
98 return obj;
101 static void grow_object_hash(void)
103 int i;
104 int new_hash_size = obj_hash_size < 32 ? 32 : 2 * obj_hash_size;
105 struct object **new_hash;
107 new_hash = xcalloc(new_hash_size, sizeof(struct object *));
108 for (i = 0; i < obj_hash_size; i++) {
109 struct object *obj = obj_hash[i];
110 if (!obj)
111 continue;
112 insert_obj_hash(obj, new_hash, new_hash_size);
114 free(obj_hash);
115 obj_hash = new_hash;
116 obj_hash_size = new_hash_size;
119 void *create_object(const unsigned char *sha1, int type, void *o)
121 struct object *obj = o;
123 obj->parsed = 0;
124 obj->used = 0;
125 obj->type = type;
126 obj->flags = 0;
127 hashcpy(obj->sha1, sha1);
129 if (obj_hash_size - 1 <= nr_objs * 2)
130 grow_object_hash();
132 insert_obj_hash(obj, obj_hash, obj_hash_size);
133 nr_objs++;
134 return obj;
137 struct object *lookup_unknown_object(const unsigned char *sha1)
139 struct object *obj = lookup_object(sha1);
140 if (!obj)
141 obj = create_object(sha1, OBJ_NONE, alloc_object_node());
142 return obj;
145 struct object *parse_object_buffer(const unsigned char *sha1, enum object_type type, unsigned long size, void *buffer, int *eaten_p)
147 struct object *obj;
148 int eaten = 0;
150 obj = NULL;
151 if (type == OBJ_BLOB) {
152 struct blob *blob = lookup_blob(sha1);
153 if (blob) {
154 if (parse_blob_buffer(blob, buffer, size))
155 return NULL;
156 obj = &blob->object;
158 } else if (type == OBJ_TREE) {
159 struct tree *tree = lookup_tree(sha1);
160 if (tree) {
161 obj = &tree->object;
162 if (!tree->buffer)
163 tree->object.parsed = 0;
164 if (!tree->object.parsed) {
165 if (parse_tree_buffer(tree, buffer, size))
166 return NULL;
167 eaten = 1;
170 } else if (type == OBJ_COMMIT) {
171 struct commit *commit = lookup_commit(sha1);
172 if (commit) {
173 if (parse_commit_buffer(commit, buffer, size))
174 return NULL;
175 if (!commit->buffer) {
176 commit->buffer = buffer;
177 eaten = 1;
179 obj = &commit->object;
181 } else if (type == OBJ_TAG) {
182 struct tag *tag = lookup_tag(sha1);
183 if (tag) {
184 if (parse_tag_buffer(tag, buffer, size))
185 return NULL;
186 obj = &tag->object;
188 } else {
189 warning("object %s has unknown type id %d", sha1_to_hex(sha1), type);
190 obj = NULL;
192 if (obj && obj->type == OBJ_NONE)
193 obj->type = type;
194 *eaten_p = eaten;
195 return obj;
198 struct object *parse_object(const unsigned char *sha1)
200 unsigned long size;
201 enum object_type type;
202 int eaten;
203 const unsigned char *repl = lookup_replace_object(sha1);
204 void *buffer;
205 struct object *obj;
207 obj = lookup_object(sha1);
208 if (obj && obj->parsed)
209 return obj;
211 if ((obj && obj->type == OBJ_BLOB) ||
212 (!obj && has_sha1_file(sha1) &&
213 sha1_object_info(sha1, NULL) == OBJ_BLOB)) {
214 if (check_sha1_signature(repl, NULL, 0, NULL) < 0) {
215 error("sha1 mismatch %s", sha1_to_hex(repl));
216 return NULL;
218 parse_blob_buffer(lookup_blob(sha1), NULL, 0);
219 return lookup_object(sha1);
222 buffer = read_sha1_file(sha1, &type, &size);
223 if (buffer) {
224 if (check_sha1_signature(repl, buffer, size, typename(type)) < 0) {
225 free(buffer);
226 error("sha1 mismatch %s", sha1_to_hex(repl));
227 return NULL;
230 obj = parse_object_buffer(sha1, type, size, buffer, &eaten);
231 if (!eaten)
232 free(buffer);
233 return obj;
235 return NULL;
238 struct object_list *object_list_insert(struct object *item,
239 struct object_list **list_p)
241 struct object_list *new_list = xmalloc(sizeof(struct object_list));
242 new_list->item = item;
243 new_list->next = *list_p;
244 *list_p = new_list;
245 return new_list;
248 int object_list_contains(struct object_list *list, struct object *obj)
250 while (list) {
251 if (list->item == obj)
252 return 1;
253 list = list->next;
255 return 0;
258 void add_object_array(struct object *obj, const char *name, struct object_array *array)
260 add_object_array_with_mode(obj, name, array, S_IFINVALID);
263 void add_object_array_with_mode(struct object *obj, const char *name, struct object_array *array, unsigned mode)
265 unsigned nr = array->nr;
266 unsigned alloc = array->alloc;
267 struct object_array_entry *objects = array->objects;
269 if (nr >= alloc) {
270 alloc = (alloc + 32) * 2;
271 objects = xrealloc(objects, alloc * sizeof(*objects));
272 array->alloc = alloc;
273 array->objects = objects;
275 objects[nr].item = obj;
276 objects[nr].name = name;
277 objects[nr].mode = mode;
278 array->nr = ++nr;
281 void object_array_remove_duplicates(struct object_array *array)
283 unsigned int ref, src, dst;
284 struct object_array_entry *objects = array->objects;
286 for (ref = 0; ref + 1 < array->nr; ref++) {
287 for (src = ref + 1, dst = src;
288 src < array->nr;
289 src++) {
290 if (!strcmp(objects[ref].name, objects[src].name))
291 continue;
292 if (src != dst)
293 objects[dst] = objects[src];
294 dst++;
296 array->nr = dst;
300 void clear_object_flags(unsigned flags)
302 int i;
304 for (i=0; i < obj_hash_size; i++) {
305 struct object *obj = obj_hash[i];
306 if (obj)
307 obj->flags &= ~flags;