7 * The low 16 bits of the "flags" field shows whether
8 * a commit is part of the path to the root for that
11 * Bit 16 is an internal flag that we've seen the
12 * definition for this rev, and not just seen it as
15 #define MAX_COMMITS (16)
16 #define marked(rev) ((rev)->flags & 0xffff)
19 #define REACHABLE 0x40000
21 static int show_unreachable = 0;
22 static int head_supplied = 0;
23 static unsigned char head_sha1[20];
26 struct revision *parent;
32 unsigned char sha1[20];
34 struct parent *parent;
37 static struct revision **revs;
38 static int nr_revs, rev_allocs;
40 static int find_rev(unsigned char *sha1)
42 int first = 0, last = nr_revs;
44 while (first < last) {
45 int next = (first + last) / 2;
46 struct revision *rev = revs[next];
49 cmp = memcmp(sha1, rev->sha1, 20);
61 static struct revision *lookup_rev(unsigned char *sha1)
63 int pos = find_rev(sha1);
71 if (rev_allocs == nr_revs) {
72 rev_allocs = alloc_nr(rev_allocs);
73 revs = realloc(revs, rev_allocs * sizeof(struct revision *));
75 n = malloc(sizeof(struct revision));
78 memcpy(n->sha1, sha1, 20);
81 /* Insert it into the right place */
82 memmove(revs + pos + 1, revs + pos, (nr_revs - pos) * sizeof(struct revision *));
89 static struct revision *add_relationship(struct revision *rev, unsigned char *needs)
91 struct revision *parent_rev = lookup_rev(needs);
92 struct parent **pp = &rev->parent, *p;
94 while ((p = *pp) != NULL) {
95 if (p->parent == parent_rev)
100 p = malloc(sizeof(*p));
101 p->parent = parent_rev;
107 static void mark_reachable(struct revision *rev)
109 struct parent *p = rev->parent;
111 rev->flags |= REACHABLE | USED;
113 mark_reachable(p->parent);
118 static void check_connectivity(void)
123 mark_reachable(lookup_rev(head_sha1));
125 /* Look up all the requirements, warn about missing objects.. */
126 for (i = 0; i < nr_revs; i++) {
127 struct revision *rev = revs[i];
129 if (show_unreachable && !(rev->flags & REACHABLE)) {
130 printf("unreachable %s\n", sha1_to_hex(rev->sha1));
134 switch (rev->flags & (SEEN | USED)) {
136 printf("bad %s\n", sha1_to_hex(rev->sha1));
139 printf("missing %s\n", sha1_to_hex(rev->sha1));
142 printf("dangling %s\n", sha1_to_hex(rev->sha1));
148 static void mark_needs_sha1(unsigned char *parent, const char * tag, unsigned char *child)
150 struct revision * child_rev = add_relationship(lookup_rev(parent), child);
151 child_rev->flags |= USED;
154 static int mark_sha1_seen(unsigned char *sha1, char *tag)
156 struct revision *rev = lookup_rev(sha1);
162 static int fsck_tree(unsigned char *sha1, void *data, unsigned long size)
164 int warn_old_tree = 1;
167 int len = 1+strlen(data);
168 unsigned char *file_sha1 = data + len;
169 char *path = strchr(data, ' ');
171 if (size < len + 20 || !path || sscanf(data, "%o", &mode) != 1)
174 /* Warn about trees that don't do the recursive thing.. */
175 if (warn_old_tree && strchr(path, '/')) {
176 fprintf(stderr, "warning: fsck-cache: tree %s has full pathnames in it\n", sha1_to_hex(sha1));
182 mark_needs_sha1(sha1, S_ISDIR(mode) ? "tree" : "blob", file_sha1);
187 static int fsck_commit(unsigned char *sha1, void *data, unsigned long size)
190 unsigned char tree_sha1[20];
191 unsigned char parent_sha1[20];
193 if (memcmp(data, "tree ", 5))
195 if (get_sha1_hex(data + 5, tree_sha1) < 0)
197 mark_needs_sha1(sha1, "tree", tree_sha1);
198 data += 5 + 40 + 1; /* "tree " + <hex sha1> + '\n' */
200 while (!memcmp(data, "parent ", 7)) {
201 if (get_sha1_hex(data + 7, parent_sha1) < 0)
203 mark_needs_sha1(sha1, "commit", parent_sha1);
204 data += 7 + 40 + 1; /* "parent " + <hex sha1> + '\n' */
208 printf("root %s\n", sha1_to_hex(sha1));
212 static int fsck_entry(unsigned char *sha1, char *tag, void *data, unsigned long size)
214 if (!strcmp(tag, "blob")) {
215 /* Nothing to check */;
216 } else if (!strcmp(tag, "tree")) {
217 if (fsck_tree(sha1, data, size) < 0)
219 } else if (!strcmp(tag, "commit")) {
220 if (fsck_commit(sha1, data, size) < 0)
224 return mark_sha1_seen(sha1, tag);
227 static int fsck_name(char *hex)
229 unsigned char sha1[20];
230 if (!get_sha1_hex(hex, sha1)) {
231 unsigned long mapsize;
232 void *map = map_sha1_file(sha1, &mapsize);
237 if (!check_sha1_signature(sha1, map, mapsize))
238 buffer = unpack_sha1_file(map, mapsize, type, &size);
239 munmap(map, mapsize);
240 if (buffer && !fsck_entry(sha1, type, buffer, size))
247 static int fsck_dir(int i, char *path)
249 DIR *dir = opendir(path);
253 return error("missing sha1 directory '%s'", path);
256 while ((de = readdir(dir)) != NULL) {
258 int len = strlen(de->d_name);
262 if (de->d_name[1] != '.')
265 if (de->d_name[0] != '.')
269 sprintf(name, "%02x", i);
270 memcpy(name+2, de->d_name, len+1);
271 if (!fsck_name(name))
274 fprintf(stderr, "bad sha1 file: %s/%s\n", path, de->d_name);
280 int main(int argc, char **argv)
285 for (i = 1; i < argc; i++) {
286 if (!strcmp(argv[i], "--unreachable")) {
287 show_unreachable = 1;
290 if (!get_sha1_hex(argv[i], head_sha1)) {
294 usage("fsck-cache [[--unreachable] <head-sha1>]");
296 if (show_unreachable && !head_supplied)
297 usage("unable to do reachability checks without a head");
299 sha1_dir = getenv(DB_ENVIRONMENT) ? : DEFAULT_DB_ENVIRONMENT;
300 for (i = 0; i < 256; i++) {
301 static char dir[4096];
302 sprintf(dir, "%s/%02x", sha1_dir, i);
305 check_connectivity();