12 static int obj_allocs
;
14 static int find_object(unsigned char *sha1
)
16 int first
= 0, last
= nr_objs
;
18 while (first
< last
) {
19 int next
= (first
+ last
) / 2;
20 struct object
*obj
= objs
[next
];
23 cmp
= memcmp(sha1
, obj
->sha1
, 20);
35 struct object
*lookup_object(unsigned char *sha1
)
37 int pos
= find_object(sha1
);
43 void created_object(unsigned char *sha1
, struct object
*obj
)
45 int pos
= find_object(sha1
);
48 memcpy(obj
->sha1
, sha1
, 20);
54 die("Inserting %s twice\n", sha1_to_hex(sha1
));
57 if (obj_allocs
== nr_objs
) {
58 obj_allocs
= alloc_nr(obj_allocs
);
59 objs
= xrealloc(objs
, obj_allocs
* sizeof(struct object
*));
62 /* Insert it into the right place */
63 memmove(objs
+ pos
+ 1, objs
+ pos
, (nr_objs
- pos
) *
64 sizeof(struct object
*));
70 void add_ref(struct object
*refer
, struct object
*target
)
72 struct object_list
**pp
= &refer
->refs
;
73 struct object_list
*p
;
75 while ((p
= *pp
) != NULL
) {
76 if (p
->item
== target
)
82 p
= xmalloc(sizeof(*p
));
88 void mark_reachable(struct object
*obj
, unsigned int mask
)
90 struct object_list
*p
= obj
->refs
;
92 /* If we've been here already, don't bother */
93 if (obj
->flags
& mask
)
97 mark_reachable(p
->item
, mask
);
102 struct object
*parse_object(unsigned char *sha1
)
104 unsigned long mapsize
;
105 void *map
= map_sha1_file(sha1
, &mapsize
);
109 void *buffer
= unpack_sha1_file(map
, mapsize
, type
, &size
);
110 munmap(map
, mapsize
);
113 if (check_sha1_signature(sha1
, buffer
, size
, type
) < 0)
114 printf("sha1 mismatch %s\n", sha1_to_hex(sha1
));
116 if (!strcmp(type
, "blob")) {
117 struct blob
*ret
= lookup_blob(sha1
);
120 } else if (!strcmp(type
, "tree")) {
121 struct tree
*ret
= lookup_tree(sha1
);
124 } else if (!strcmp(type
, "commit")) {
125 struct commit
*ret
= lookup_commit(sha1
);
128 } else if (!strcmp(type
, "tag")) {
129 struct tag
*ret
= lookup_tag(sha1
);