12 #define REACHABLE 0x0001
14 static int show_root
= 0;
15 static int show_tags
= 0;
16 static int show_unreachable
= 0;
17 static int check_full
= 0;
18 static int check_strict
= 0;
19 static int keep_cache_objects
= 0;
20 static unsigned char head_sha1
[20];
22 #ifdef NO_D_INO_IN_DIRENT
24 #define DIRENT_SORT_HINT(de) 0
27 #define DIRENT_SORT_HINT(de) ((de)->d_ino)
30 static void objreport(struct object
*obj
, const char *severity
,
31 const char *err
, va_list params
)
33 fprintf(stderr
, "%s in %s %s: ",
34 severity
, obj
->type
, sha1_to_hex(obj
->sha1
));
35 vfprintf(stderr
, err
, params
);
39 static int objerror(struct object
*obj
, const char *err
, ...)
42 va_start(params
, err
);
43 objreport(obj
, "error", err
, params
);
48 static int objwarning(struct object
*obj
, const char *err
, ...)
51 va_start(params
, err
);
52 objreport(obj
, "warning", err
, params
);
58 static void check_connectivity(void)
62 /* Look up all the requirements, warn about missing objects.. */
63 for (i
= 0; i
< obj_allocs
; i
++) {
64 struct object
*obj
= objs
[i
];
70 if (has_sha1_file(obj
->sha1
))
73 printf("missing %s %s\n",
74 obj
->type
, sha1_to_hex(obj
->sha1
));
79 const struct object_refs
*refs
= obj
->refs
;
81 for (j
= 0; j
< refs
->count
; j
++) {
82 struct object
*ref
= refs
->ref
[j
];
84 (has_sha1_file(ref
->sha1
)))
86 printf("broken link from %7s %s\n",
87 obj
->type
, sha1_to_hex(obj
->sha1
));
88 printf(" to %7s %s\n",
89 ref
->type
, sha1_to_hex(ref
->sha1
));
93 if (show_unreachable
&& !(obj
->flags
& REACHABLE
)) {
94 printf("unreachable %s %s\n",
95 obj
->type
, sha1_to_hex(obj
->sha1
));
100 printf("dangling %s %s\n", obj
->type
,
101 sha1_to_hex(obj
->sha1
));
107 * The entries in a tree are ordered in the _path_ order,
108 * which means that a directory entry is ordered by adding
109 * a slash to the end of it.
111 * So a directory called "a" is ordered _after_ a file
112 * called "a.c", because "a/" sorts after "a.c".
114 #define TREE_UNORDERED (-1)
115 #define TREE_HAS_DUPS (-2)
117 static int verify_ordered(struct tree_entry_list
*a
, struct tree_entry_list
*b
)
119 int len1
= strlen(a
->name
);
120 int len2
= strlen(b
->name
);
121 int len
= len1
< len2
? len1
: len2
;
122 unsigned char c1
, c2
;
125 cmp
= memcmp(a
->name
, b
->name
, len
);
129 return TREE_UNORDERED
;
132 * Ok, the first <len> characters are the same.
133 * Now we need to order the next one, but turn
134 * a '\0' into a '/' for a directory entry.
140 * git-write-tree used to write out a nonsense tree that has
141 * entries with the same name, one blob and one tree. Make
142 * sure we do not have duplicate entries.
144 return TREE_HAS_DUPS
;
145 if (!c1
&& a
->directory
)
147 if (!c2
&& b
->directory
)
149 return c1
< c2
? 0 : TREE_UNORDERED
;
152 static int fsck_tree(struct tree
*item
)
155 int has_full_path
= 0;
156 int has_zero_pad
= 0;
157 int has_bad_modes
= 0;
158 int has_dup_entries
= 0;
159 int not_properly_sorted
= 0;
160 struct tree_entry_list
*entry
, *last
;
163 for (entry
= item
->entries
; entry
; entry
= entry
->next
) {
164 if (strchr(entry
->name
, '/'))
166 has_zero_pad
|= entry
->zeropad
;
168 switch (entry
->mode
) {
178 * This is nonstandard, but we had a few of these
179 * early on when we honored the full set of mode
190 switch (verify_ordered(last
, entry
)) {
192 not_properly_sorted
= 1;
207 item
->entries
= NULL
;
213 objwarning(&item
->object
, "contains full pathnames");
216 objwarning(&item
->object
, "contains zero-padded file modes");
219 objwarning(&item
->object
, "contains bad file modes");
221 if (has_dup_entries
) {
222 retval
= objerror(&item
->object
, "contains duplicate file entries");
224 if (not_properly_sorted
) {
225 retval
= objerror(&item
->object
, "not properly sorted");
230 static int fsck_commit(struct commit
*commit
)
232 char *buffer
= commit
->buffer
;
233 unsigned char tree_sha1
[20], sha1
[20];
235 if (memcmp(buffer
, "tree ", 5))
236 return objerror(&commit
->object
, "invalid format - expected 'tree' line");
237 if (get_sha1_hex(buffer
+5, tree_sha1
) || buffer
[45] != '\n')
238 return objerror(&commit
->object
, "invalid 'tree' line format - bad sha1");
240 while (!memcmp(buffer
, "parent ", 7)) {
241 if (get_sha1_hex(buffer
+7, sha1
) || buffer
[47] != '\n')
242 return objerror(&commit
->object
, "invalid 'parent' line format - bad sha1");
245 if (memcmp(buffer
, "author ", 7))
246 return objerror(&commit
->object
, "invalid format - expected 'author' line");
247 free(commit
->buffer
);
248 commit
->buffer
= NULL
;
250 return objerror(&commit
->object
, "could not load commit's tree %s", tree_sha1
);
251 if (!commit
->parents
&& show_root
)
252 printf("root %s\n", sha1_to_hex(commit
->object
.sha1
));
254 printf("bad commit date in %s\n",
255 sha1_to_hex(commit
->object
.sha1
));
259 static int fsck_tag(struct tag
*tag
)
261 struct object
*tagged
= tag
->tagged
;
264 return objerror(&tag
->object
, "could not load tagged object");
269 printf("tagged %s %s", tagged
->type
, sha1_to_hex(tagged
->sha1
));
270 printf(" (%s) in %s\n", tag
->tag
, sha1_to_hex(tag
->object
.sha1
));
274 static int fsck_sha1(unsigned char *sha1
)
276 struct object
*obj
= parse_object(sha1
);
278 return error("%s: object not found", sha1_to_hex(sha1
));
279 if (obj
->type
== blob_type
)
281 if (obj
->type
== tree_type
)
282 return fsck_tree((struct tree
*) obj
);
283 if (obj
->type
== commit_type
)
284 return fsck_commit((struct commit
*) obj
);
285 if (obj
->type
== tag_type
)
286 return fsck_tag((struct tag
*) obj
);
287 /* By now, parse_object() would've returned NULL instead. */
288 return objerror(obj
, "unknown type '%s' (internal fsck error)", obj
->type
);
292 * This is the sorting chunk size: make it reasonably
293 * big so that we can sort well..
295 #define MAX_SHA1_ENTRIES (1024)
299 unsigned char sha1
[20];
304 struct sha1_entry
*entry
[MAX_SHA1_ENTRIES
];
307 static int ino_compare(const void *_a
, const void *_b
)
309 const struct sha1_entry
*a
= _a
, *b
= _b
;
310 unsigned long ino1
= a
->ino
, ino2
= b
->ino
;
311 return ino1
< ino2
? -1 : ino1
> ino2
? 1 : 0;
314 static void fsck_sha1_list(void)
316 int i
, nr
= sha1_list
.nr
;
319 qsort(sha1_list
.entry
, nr
,
320 sizeof(struct sha1_entry
*), ino_compare
);
321 for (i
= 0; i
< nr
; i
++) {
322 struct sha1_entry
*entry
= sha1_list
.entry
[i
];
323 unsigned char *sha1
= entry
->sha1
;
325 sha1_list
.entry
[i
] = NULL
;
332 static void add_sha1_list(unsigned char *sha1
, unsigned long ino
)
334 struct sha1_entry
*entry
= xmalloc(sizeof(*entry
));
338 memcpy(entry
->sha1
, sha1
, 20);
340 if (nr
== MAX_SHA1_ENTRIES
) {
344 sha1_list
.entry
[nr
] = entry
;
348 static int fsck_dir(int i
, char *path
)
350 DIR *dir
= opendir(path
);
356 while ((de
= readdir(dir
)) != NULL
) {
358 unsigned char sha1
[20];
359 int len
= strlen(de
->d_name
);
363 if (de
->d_name
[1] != '.')
366 if (de
->d_name
[0] != '.')
370 sprintf(name
, "%02x", i
);
371 memcpy(name
+2, de
->d_name
, len
+1);
372 if (get_sha1_hex(name
, sha1
) < 0)
374 add_sha1_list(sha1
, DIRENT_SORT_HINT(de
));
377 fprintf(stderr
, "bad sha1 file: %s/%s\n", path
, de
->d_name
);
383 static int default_refs
= 0;
385 static int fsck_handle_ref(const char *refname
, const unsigned char *sha1
)
389 obj
= lookup_object(sha1
);
391 if (has_sha1_file(sha1
)) {
393 return 0; /* it is in a pack */
395 error("%s: invalid sha1 pointer %s", refname
, sha1_to_hex(sha1
));
396 /* We'll continue with the rest despite the error.. */
401 mark_reachable(obj
, REACHABLE
);
405 static void get_default_heads(void)
407 for_each_ref(fsck_handle_ref
);
409 die("No default references");
412 static void fsck_object_dir(const char *path
)
415 for (i
= 0; i
< 256; i
++) {
416 static char dir
[4096];
417 sprintf(dir
, "%s/%02x", path
, i
);
423 static int fsck_head_link(void)
425 unsigned char sha1
[20];
426 const char *git_HEAD
= strdup(git_path("HEAD"));
427 const char *git_refs_heads_master
= resolve_ref(git_HEAD
, sha1
, 1);
428 int pfxlen
= strlen(git_HEAD
) - 4; /* strip .../.git/ part */
430 if (!git_refs_heads_master
)
431 return error("HEAD is not a symbolic ref");
432 if (strncmp(git_refs_heads_master
+ pfxlen
, "refs/heads/", 11))
433 return error("HEAD points to something strange (%s)",
434 git_refs_heads_master
+ pfxlen
);
435 if (!memcmp(null_sha1
, sha1
, 20))
436 return error("HEAD: not a valid git pointer");
440 int main(int argc
, char **argv
)
444 setup_git_directory();
446 for (i
= 1; i
< argc
; i
++) {
447 const char *arg
= argv
[i
];
449 if (!strcmp(arg
, "--unreachable")) {
450 show_unreachable
= 1;
453 if (!strcmp(arg
, "--tags")) {
457 if (!strcmp(arg
, "--root")) {
461 if (!strcmp(arg
, "--cache")) {
462 keep_cache_objects
= 1;
465 if (!strcmp(arg
, "--full")) {
469 if (!strcmp(arg
, "--strict")) {
474 usage("git-fsck-objects [--tags] [--root] [[--unreachable] [--cache] [--full] [--strict] <head-sha1>*]");
478 fsck_object_dir(get_object_directory());
480 struct alternate_object_database
*alt
;
481 struct packed_git
*p
;
483 for (alt
= alt_odb_list
; alt
; alt
= alt
->next
) {
484 char namebuf
[PATH_MAX
];
485 int namelen
= alt
->name
- alt
->base
;
486 memcpy(namebuf
, alt
->base
, namelen
);
487 namebuf
[namelen
- 1] = 0;
488 fsck_object_dir(namebuf
);
490 prepare_packed_git();
491 for (p
= packed_git
; p
; p
= p
->next
)
492 /* verify gives error messages itself */
495 for (p
= packed_git
; p
; p
= p
->next
) {
496 int num
= num_packed_objects(p
);
497 for (i
= 0; i
< num
; i
++) {
498 unsigned char sha1
[20];
499 nth_packed_object_sha1(p
, i
, sha1
);
506 for (i
= 1; i
< argc
; i
++) {
507 const char *arg
= argv
[i
];
512 if (!get_sha1(arg
, head_sha1
)) {
513 struct object
*obj
= lookup_object(head_sha1
);
515 /* Error is printed by lookup_object(). */
520 mark_reachable(obj
, REACHABLE
);
524 error("invalid parameter: expected sha1, got '%s'", arg
);
528 * If we've not been given any explicit head information, do the
529 * default ones from .git/refs. We also consider the index file
530 * in this case (ie this implies --cache).
534 keep_cache_objects
= 1;
537 if (keep_cache_objects
) {
540 for (i
= 0; i
< active_nr
; i
++) {
541 struct blob
*blob
= lookup_blob(active_cache
[i
]->sha1
);
547 mark_reachable(obj
, REACHABLE
);
551 check_connectivity();