🌐 AI搜索 & 代理 主页
Google Git
Sign in
chromium / external / github.com / git / git / refs/tags/v1.0.3 / . / object.c
blob: cf5931a9423cb2ecdd9f34e6c33ed0b714ce61bf [file] [log] [blame]
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]1#include "object.h"
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]2#include "blob.h"
3#include "tree.h"
4#include "commit.h"
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]5#include "cache.h"
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]6#include "tag.h"
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]7
8struct object **objs;
9int nr_objs;
10static int obj_allocs;
11
Linus Torvalds8805cca2005-09-16 21:55:33[diff] [blame]12int track_object_refs = 1;
13
Jason McMullan5d6ccf52005-06-03 15:05:39[diff] [blame]14static int find_object(const unsigned char *sha1)
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]15{
16 int first = 0, last = nr_objs;
17
18 while (first < last) {
19 int next = (first + last) / 2;
20 struct object *obj = objs[next];
21 int cmp;
22
23 cmp = memcmp(sha1, obj->sha1, 20);
24 if (!cmp)
25 return next;
26 if (cmp < 0) {
27 last = next;
28 continue;
29 }
30 first = next+1;
31 }
32 return -first-1;
33}
34
Jason McMullan5d6ccf52005-06-03 15:05:39[diff] [blame]35struct object *lookup_object(const unsigned char *sha1)
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]36{
37 int pos = find_object(sha1);
38 if (pos >= 0)
39 return objs[pos];
40 return NULL;
41}
42
Jason McMullan5d6ccf52005-06-03 15:05:39[diff] [blame]43void created_object(const unsigned char *sha1, struct object *obj)
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]44{
45 int pos = find_object(sha1);
46
47 obj->parsed = 0;
48 memcpy(obj->sha1, sha1, 20);
49 obj->type = NULL;
50 obj->refs = NULL;
51 obj->used = 0;
52
53 if (pos >= 0)
54 die("Inserting %s twice\n", sha1_to_hex(sha1));
55 pos = -pos-1;
56
57 if (obj_allocs == nr_objs) {
58 obj_allocs = alloc_nr(obj_allocs);
Christopher Li812666c2005-04-26 19:00:58[diff] [blame]59 objs = xrealloc(objs, obj_allocs * sizeof(struct object *));
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]60 }
61
62 /* Insert it into the right place */
63 memmove(objs + pos + 1, objs + pos, (nr_objs - pos) *
64 sizeof(struct object *));
65
66 objs[pos] = obj;
67 nr_objs++;
68}
69
Sergey Vlasov4a4e6fd2005-11-15 16:08:08[diff] [blame]70struct object_refs *alloc_object_refs(unsigned count)
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]71{
Sergey Vlasov4a4e6fd2005-11-15 16:08:08[diff] [blame]72 struct object_refs *refs;
73 size_t size = sizeof(*refs) + count*sizeof(struct object *);
Linus Torvalds8805cca2005-09-16 21:55:33[diff] [blame]74
Sergey Vlasov4a4e6fd2005-11-15 16:08:08[diff] [blame]75 refs = xmalloc(size);
76 memset(refs, 0, size);
77 refs->count = count;
78 return refs;
79}
80
81static int compare_object_pointers(const void *a, const void *b)
82{
83 const struct object * const *pa = a;
84 const struct object * const *pb = b;
Junio C Hamanoe23eff82005-12-06 21:41:48[diff] [blame]85 if (*pa == *pb)
86 return 0;
87 else if (*pa < *pb)
88 return -1;
89 else
90 return 1;
Sergey Vlasov4a4e6fd2005-11-15 16:08:08[diff] [blame]91}
92
93void set_object_refs(struct object *obj, struct object_refs *refs)
94{
95 unsigned int i, j;
96
97 /* Do not install empty list of references */
98 if (refs->count < 1) {
99 free(refs);
Linus Torvalds8805cca2005-09-16 21:55:33[diff] [blame]100 return;
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]101 }
102
Sergey Vlasov4a4e6fd2005-11-15 16:08:08[diff] [blame]103 /* Sort the list and filter out duplicates */
104 qsort(refs->ref, refs->count, sizeof(refs->ref[0]),
105 compare_object_pointers);
106 for (i = j = 1; i < refs->count; i++) {
107 if (refs->ref[i] != refs->ref[i - 1])
108 refs->ref[j++] = refs->ref[i];
109 }
110 if (j < refs->count) {
111 /* Duplicates were found - reallocate list */
112 size_t size = sizeof(*refs) + j*sizeof(struct object *);
113 refs->count = j;
114 refs = xrealloc(refs, size);
115 }
116
117 for (i = 0; i < refs->count; i++)
118 refs->ref[i]->used = 1;
119 obj->refs = refs;
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]120}
121
122void mark_reachable(struct object *obj, unsigned int mask)
123{
Linus Torvalds8805cca2005-09-16 21:55:33[diff] [blame]124 if (!track_object_refs)
125 die("cannot do reachability with object refs turned off");
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]126 /* If we've been here already, don't bother */
127 if (obj->flags & mask)
128 return;
129 obj->flags |= mask;
Sergey Vlasov4a4e6fd2005-11-15 16:08:08[diff] [blame]130 if (obj->refs) {
131 const struct object_refs *refs = obj->refs;
132 unsigned i;
133 for (i = 0; i < refs->count; i++)
134 mark_reachable(refs->ref[i], mask);
Daniel Barkalow175785e2005-04-18 18:39:48[diff] [blame]135 }
136}
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]137
Daniel Barkalow89e42022005-06-22 00:35:10[diff] [blame]138struct object *lookup_object_type(const unsigned char *sha1, const char *type)
139{
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]140 if (!type) {
141 return lookup_unknown_object(sha1);
142 } else if (!strcmp(type, blob_type)) {
Daniel Barkalow89e42022005-06-22 00:35:10[diff] [blame]143 return &lookup_blob(sha1)->object;
144 } else if (!strcmp(type, tree_type)) {
145 return &lookup_tree(sha1)->object;
146 } else if (!strcmp(type, commit_type)) {
147 return &lookup_commit(sha1)->object;
148 } else if (!strcmp(type, tag_type)) {
149 return &lookup_tag(sha1)->object;
150 } else {
151 error("Unknown type %s", type);
152 return NULL;
153 }
154}
155
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]156union any_object {
157 struct object object;
158 struct commit commit;
159 struct tree tree;
160 struct blob blob;
161 struct tag tag;
162};
163
164struct object *lookup_unknown_object(const unsigned char *sha1)
165{
166 struct object *obj = lookup_object(sha1);
167 if (!obj) {
168 union any_object *ret = xmalloc(sizeof(*ret));
169 memset(ret, 0, sizeof(*ret));
170 created_object(sha1, &ret->object);
171 ret->object.type = NULL;
172 return &ret->object;
173 }
174 return obj;
175}
176
Jason McMullan5d6ccf52005-06-03 15:05:39[diff] [blame]177struct object *parse_object(const unsigned char *sha1)
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]178{
Junio C Hamanoc4584ae2005-06-27 10:33:33[diff] [blame]179 unsigned long size;
180 char type[20];
181 void *buffer = read_sha1_file(sha1, type, &size);
182 if (buffer) {
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]183 struct object *obj;
Junio C Hamanoc4584ae2005-06-27 10:33:33[diff] [blame]184 if (check_sha1_signature(sha1, buffer, size, type) < 0)
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]185 printf("sha1 mismatch %s\n", sha1_to_hex(sha1));
Junio C Hamanoc4584ae2005-06-27 10:33:33[diff] [blame]186 if (!strcmp(type, "blob")) {
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]187 struct blob *blob = lookup_blob(sha1);
188 parse_blob_buffer(blob, buffer, size);
189 obj = &blob->object;
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]190 } else if (!strcmp(type, "tree")) {
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]191 struct tree *tree = lookup_tree(sha1);
192 parse_tree_buffer(tree, buffer, size);
193 obj = &tree->object;
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]194 } else if (!strcmp(type, "commit")) {
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]195 struct commit *commit = lookup_commit(sha1);
196 parse_commit_buffer(commit, buffer, size);
Linus Torvaldsbd1e17e2005-05-26 02:26:28[diff] [blame]197 if (!commit->buffer) {
198 commit->buffer = buffer;
199 buffer = NULL;
200 }
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]201 obj = &commit->object;
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]202 } else if (!strcmp(type, "tag")) {
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]203 struct tag *tag = lookup_tag(sha1);
204 parse_tag_buffer(tag, buffer, size);
205 obj = &tag->object;
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]206 } else {
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]207 obj = NULL;
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]208 }
Nicolas Pitrebd2c39f2005-05-06 17:48:34[diff] [blame]209 free(buffer);
210 return obj;
Daniel Barkalowe9eefa62005-04-28 14:46:33[diff] [blame]211 }
212 return NULL;
213}
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]214
215struct object_list *object_list_insert(struct object *item,
216 struct object_list **list_p)
217{
218 struct object_list *new_list = xmalloc(sizeof(struct object_list));
219 new_list->item = item;
220 new_list->next = *list_p;
221 *list_p = new_list;
222 return new_list;
223}
224
Daniel Barkalow680bab32005-09-05 06:04:18[diff] [blame]225void object_list_append(struct object *item,
226 struct object_list **list_p)
227{
228 while (*list_p) {
229 list_p = &((*list_p)->next);
230 }
231 *list_p = xmalloc(sizeof(struct object_list));
232 (*list_p)->next = NULL;
233 (*list_p)->item = item;
234}
235
barkalow@iabervon.org66e481b2005-08-02 23:45:48[diff] [blame]236unsigned object_list_length(struct object_list *list)
237{
238 unsigned ret = 0;
239 while (list) {
240 list = list->next;
241 ret++;
242 }
243 return ret;
244}
245
246int object_list_contains(struct object_list *list, struct object *obj)
247{
248 while (list) {
249 if (list->item == obj)
250 return 1;
251 list = list->next;
252 }
253 return 0;
254}