9 #include "cache-tree.h"
10 #include "tree-walk.h"
12 #include "parse-options.h"
14 #define REACHABLE 0x0001
19 static int show_unreachable
;
20 static int include_reflogs
= 1;
21 static int check_full
;
22 static int check_strict
;
23 static int keep_cache_objects
;
24 static unsigned char head_sha1
[20];
25 static int errors_found
;
26 static int write_lost_and_found
;
28 #define ERROR_OBJECT 01
29 #define ERROR_REACHABLE 02
31 #ifdef NO_D_INO_IN_DIRENT
33 #define DIRENT_SORT_HINT(de) 0
36 #define DIRENT_SORT_HINT(de) ((de)->d_ino)
39 static void objreport(struct object
*obj
, const char *severity
,
40 const char *err
, va_list params
)
42 fprintf(stderr
, "%s in %s %s: ",
43 severity
, typename(obj
->type
), sha1_to_hex(obj
->sha1
));
44 vfprintf(stderr
, err
, params
);
48 static int objerror(struct object
*obj
, const char *err
, ...)
51 va_start(params
, err
);
52 errors_found
|= ERROR_OBJECT
;
53 objreport(obj
, "error", err
, params
);
58 static int fsck_error_func(struct object
*obj
, int type
, const char *err
, ...)
61 va_start(params
, err
);
62 objreport(obj
, (type
== FSCK_WARN
) ? "warning" : "error", err
, params
);
64 return (type
== FSCK_WARN
) ? 0 : 1;
67 static struct object_array pending
;
69 static int mark_object(struct object
*obj
, int type
, void *data
)
71 struct object
*parent
= data
;
74 printf("broken link from %7s %s\n",
75 typename(parent
->type
), sha1_to_hex(parent
->sha1
));
76 printf("broken link from %7s %s\n",
77 (type
== OBJ_ANY
? "unknown" : typename(type
)), "unknown");
78 errors_found
|= ERROR_REACHABLE
;
82 if (type
!= OBJ_ANY
&& obj
->type
!= type
)
83 objerror(parent
, "wrong object type in link");
85 if (obj
->flags
& REACHABLE
)
87 obj
->flags
|= REACHABLE
;
89 if (parent
&& !has_sha1_file(obj
->sha1
)) {
90 printf("broken link from %7s %s\n",
91 typename(parent
->type
), sha1_to_hex(parent
->sha1
));
92 printf(" to %7s %s\n",
93 typename(obj
->type
), sha1_to_hex(obj
->sha1
));
94 errors_found
|= ERROR_REACHABLE
;
99 add_object_array(obj
, (void *) parent
, &pending
);
103 static void mark_object_reachable(struct object
*obj
)
105 mark_object(obj
, OBJ_ANY
, 0);
108 static int traverse_one_object(struct object
*obj
, struct object
*parent
)
111 struct tree
*tree
= NULL
;
113 if (obj
->type
== OBJ_TREE
) {
115 tree
= (struct tree
*)obj
;
116 if (parse_tree(tree
) < 0)
117 return 1; /* error already displayed */
119 result
= fsck_walk(obj
, mark_object
, obj
);
127 static int traverse_reachable(void)
131 struct object_array_entry
*entry
;
132 struct object
*obj
, *parent
;
134 entry
= pending
.objects
+ --pending
.nr
;
136 parent
= (struct object
*) entry
->name
;
137 result
|= traverse_one_object(obj
, parent
);
142 static int mark_used(struct object
*obj
, int type
, void *data
)
151 * Check a single reachable object
153 static void check_reachable_object(struct object
*obj
)
156 * We obviously want the object to be parsed,
157 * except if it was in a pack-file and we didn't
161 if (has_sha1_pack(obj
->sha1
))
162 return; /* it is in pack - forget about it */
163 printf("missing %s %s\n", typename(obj
->type
), sha1_to_hex(obj
->sha1
));
164 errors_found
|= ERROR_REACHABLE
;
170 * Check a single unreachable object
172 static void check_unreachable_object(struct object
*obj
)
175 * Missing unreachable object? Ignore it. It's not like
176 * we miss it (since it can't be reached), nor do we want
177 * to complain about it being unreachable (since it does
184 * Unreachable object that exists? Show it if asked to,
185 * since this is something that is prunable.
187 if (show_unreachable
) {
188 printf("unreachable %s %s\n", typename(obj
->type
), sha1_to_hex(obj
->sha1
));
193 * "!used" means that nothing at all points to it, including
194 * other unreachable objects. In other words, it's the "tip"
195 * of some set of unreachable objects, usually a commit that
198 * Such starting points are more interesting than some random
199 * set of unreachable objects, so we show them even if the user
200 * hasn't asked for _all_ unreachable objects. If you have
201 * deleted a branch by mistake, this is a prime candidate to
202 * start looking at, for example.
205 printf("dangling %s %s\n", typename(obj
->type
),
206 sha1_to_hex(obj
->sha1
));
207 if (write_lost_and_found
) {
208 char *filename
= git_path("lost-found/%s/%s",
209 obj
->type
== OBJ_COMMIT
? "commit" : "other",
210 sha1_to_hex(obj
->sha1
));
213 if (safe_create_leading_directories(filename
)) {
214 error("Could not create lost-found");
217 if (!(f
= fopen(filename
, "w")))
218 die("Could not open %s", filename
);
219 if (obj
->type
== OBJ_BLOB
) {
220 enum object_type type
;
222 char *buf
= read_sha1_file(obj
->sha1
,
225 if (fwrite(buf
, size
, 1, f
) != 1)
226 die("Could not write %s: %s",
227 filename
, strerror(errno
));
231 fprintf(f
, "%s\n", sha1_to_hex(obj
->sha1
));
233 die("Could not finish %s: %s",
234 filename
, strerror(errno
));
240 * Otherwise? It's there, it's unreachable, and some other unreachable
241 * object points to it. Ignore it - it's not interesting, and we showed
242 * all the interesting cases above.
246 static void check_object(struct object
*obj
)
249 fprintf(stderr
, "Checking %s\n", sha1_to_hex(obj
->sha1
));
251 if (obj
->flags
& REACHABLE
)
252 check_reachable_object(obj
);
254 check_unreachable_object(obj
);
257 static void check_connectivity(void)
261 /* Traverse the pending reachable objects */
262 traverse_reachable();
264 /* Look up all the requirements, warn about missing objects.. */
265 max
= get_max_object_index();
267 fprintf(stderr
, "Checking connectivity (%d objects)\n", max
);
269 for (i
= 0; i
< max
; i
++) {
270 struct object
*obj
= get_indexed_object(i
);
277 static int fsck_sha1(const unsigned char *sha1
)
279 struct object
*obj
= parse_object(sha1
);
281 errors_found
|= ERROR_OBJECT
;
282 return error("%s: object corrupt or missing",
285 if (obj
->flags
& SEEN
)
290 fprintf(stderr
, "Checking %s %s\n",
291 typename(obj
->type
), sha1_to_hex(obj
->sha1
));
293 if (fsck_walk(obj
, mark_used
, 0))
294 objerror(obj
, "broken links");
295 if (fsck_object(obj
, check_strict
, fsck_error_func
))
298 if (obj
->type
== OBJ_TREE
) {
299 struct tree
*item
= (struct tree
*) obj
;
305 if (obj
->type
== OBJ_COMMIT
) {
306 struct commit
*commit
= (struct commit
*) obj
;
308 free(commit
->buffer
);
309 commit
->buffer
= NULL
;
311 if (!commit
->parents
&& show_root
)
312 printf("root %s\n", sha1_to_hex(commit
->object
.sha1
));
315 if (obj
->type
== OBJ_TAG
) {
316 struct tag
*tag
= (struct tag
*) obj
;
318 if (show_tags
&& tag
->tagged
) {
319 printf("tagged %s %s", typename(tag
->tagged
->type
), sha1_to_hex(tag
->tagged
->sha1
));
320 printf(" (%s) in %s\n", tag
->tag
, sha1_to_hex(tag
->object
.sha1
));
328 * This is the sorting chunk size: make it reasonably
329 * big so that we can sort well..
331 #define MAX_SHA1_ENTRIES (1024)
335 unsigned char sha1
[20];
340 struct sha1_entry
*entry
[MAX_SHA1_ENTRIES
];
343 static int ino_compare(const void *_a
, const void *_b
)
345 const struct sha1_entry
*a
= _a
, *b
= _b
;
346 unsigned long ino1
= a
->ino
, ino2
= b
->ino
;
347 return ino1
< ino2
? -1 : ino1
> ino2
? 1 : 0;
350 static void fsck_sha1_list(void)
352 int i
, nr
= sha1_list
.nr
;
355 qsort(sha1_list
.entry
, nr
,
356 sizeof(struct sha1_entry
*), ino_compare
);
357 for (i
= 0; i
< nr
; i
++) {
358 struct sha1_entry
*entry
= sha1_list
.entry
[i
];
359 unsigned char *sha1
= entry
->sha1
;
361 sha1_list
.entry
[i
] = NULL
;
368 static void add_sha1_list(unsigned char *sha1
, unsigned long ino
)
370 struct sha1_entry
*entry
= xmalloc(sizeof(*entry
));
374 hashcpy(entry
->sha1
, sha1
);
376 if (nr
== MAX_SHA1_ENTRIES
) {
380 sha1_list
.entry
[nr
] = entry
;
384 static void fsck_dir(int i
, char *path
)
386 DIR *dir
= opendir(path
);
393 fprintf(stderr
, "Checking directory %s\n", path
);
395 while ((de
= readdir(dir
)) != NULL
) {
397 unsigned char sha1
[20];
398 int len
= strlen(de
->d_name
);
402 if (de
->d_name
[1] != '.')
405 if (de
->d_name
[0] != '.')
409 sprintf(name
, "%02x", i
);
410 memcpy(name
+2, de
->d_name
, len
+1);
411 if (get_sha1_hex(name
, sha1
) < 0)
413 add_sha1_list(sha1
, DIRENT_SORT_HINT(de
));
416 if (!prefixcmp(de
->d_name
, "tmp_obj_"))
418 fprintf(stderr
, "bad sha1 file: %s/%s\n", path
, de
->d_name
);
423 static int default_refs
;
425 static int fsck_handle_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
,
426 const char *email
, unsigned long timestamp
, int tz
,
427 const char *message
, void *cb_data
)
432 fprintf(stderr
, "Checking reflog %s->%s\n",
433 sha1_to_hex(osha1
), sha1_to_hex(nsha1
));
435 if (!is_null_sha1(osha1
)) {
436 obj
= lookup_object(osha1
);
439 mark_object_reachable(obj
);
442 obj
= lookup_object(nsha1
);
445 mark_object_reachable(obj
);
450 static int fsck_handle_reflog(const char *logname
, const unsigned char *sha1
, int flag
, void *cb_data
)
452 for_each_reflog_ent(logname
, fsck_handle_reflog_ent
, NULL
);
456 static int is_branch(const char *refname
)
458 return !strcmp(refname
, "HEAD") || !prefixcmp(refname
, "refs/heads/");
461 static int fsck_handle_ref(const char *refname
, const unsigned char *sha1
, int flag
, void *cb_data
)
465 obj
= parse_object(sha1
);
467 error("%s: invalid sha1 pointer %s", refname
, sha1_to_hex(sha1
));
468 /* We'll continue with the rest despite the error.. */
471 if (obj
->type
!= OBJ_COMMIT
&& is_branch(refname
))
472 error("%s: not a commit", refname
);
475 mark_object_reachable(obj
);
480 static void get_default_heads(void)
482 for_each_ref(fsck_handle_ref
, NULL
);
484 for_each_reflog(fsck_handle_reflog
, NULL
);
487 * Not having any default heads isn't really fatal, but
488 * it does mean that "--unreachable" no longer makes any
489 * sense (since in this case everything will obviously
490 * be unreachable by definition.
492 * Showing dangling objects is valid, though (as those
493 * dangling objects are likely lost heads).
495 * So we just print a warning about it, and clear the
496 * "show_unreachable" flag.
499 fprintf(stderr
, "notice: No default references\n");
500 show_unreachable
= 0;
504 static void fsck_object_dir(const char *path
)
509 fprintf(stderr
, "Checking object directory\n");
511 for (i
= 0; i
< 256; i
++) {
512 static char dir
[4096];
513 sprintf(dir
, "%s/%02x", path
, i
);
519 static int fsck_head_link(void)
521 unsigned char sha1
[20];
523 int null_is_error
= 0;
524 const char *head_points_at
= resolve_ref("HEAD", sha1
, 0, &flag
);
527 fprintf(stderr
, "Checking HEAD link\n");
530 return error("Invalid HEAD");
531 if (!strcmp(head_points_at
, "HEAD"))
534 else if (prefixcmp(head_points_at
, "refs/heads/"))
535 return error("HEAD points to something strange (%s)",
537 if (is_null_sha1(sha1
)) {
539 return error("HEAD: detached HEAD points at nothing");
540 fprintf(stderr
, "notice: HEAD points to an unborn branch (%s)\n",
541 head_points_at
+ 11);
546 static int fsck_cache_tree(struct cache_tree
*it
)
552 fprintf(stderr
, "Checking cache tree\n");
554 if (0 <= it
->entry_count
) {
555 struct object
*obj
= parse_object(it
->sha1
);
557 error("%s: invalid sha1 pointer in cache-tree",
558 sha1_to_hex(it
->sha1
));
561 mark_object_reachable(obj
);
563 if (obj
->type
!= OBJ_TREE
)
564 err
|= objerror(obj
, "non-tree in cache-tree");
566 for (i
= 0; i
< it
->subtree_nr
; i
++)
567 err
|= fsck_cache_tree(it
->down
[i
]->cache_tree
);
571 static char const * const fsck_usage
[] = {
572 "git fsck [options] [<object>...]",
576 static struct option fsck_opts
[] = {
577 OPT__VERBOSE(&verbose
),
578 OPT_BOOLEAN(0, "unreachable", &show_unreachable
, "show unreachable objects"),
579 OPT_BOOLEAN(0, "tags", &show_tags
, "report tags"),
580 OPT_BOOLEAN(0, "root", &show_root
, "report root nodes"),
581 OPT_BOOLEAN(0, "cache", &keep_cache_objects
, "make index objects head nodes"),
582 OPT_BOOLEAN(0, "reflogs", &include_reflogs
, "make reflogs head nodes (default)"),
583 OPT_BOOLEAN(0, "full", &check_full
, "also consider alternate objects"),
584 OPT_BOOLEAN(0, "strict", &check_strict
, "enable more strict checking"),
585 OPT_BOOLEAN(0, "lost-found", &write_lost_and_found
,
586 "write dangling objects in .git/lost-found"),
590 int cmd_fsck(int argc
, const char **argv
, const char *prefix
)
596 argc
= parse_options(argc
, argv
, fsck_opts
, fsck_usage
, 0);
597 if (write_lost_and_found
) {
603 fsck_object_dir(get_object_directory());
605 struct alternate_object_database
*alt
;
606 struct packed_git
*p
;
608 for (alt
= alt_odb_list
; alt
; alt
= alt
->next
) {
609 char namebuf
[PATH_MAX
];
610 int namelen
= alt
->name
- alt
->base
;
611 memcpy(namebuf
, alt
->base
, namelen
);
612 namebuf
[namelen
- 1] = 0;
613 fsck_object_dir(namebuf
);
615 prepare_packed_git();
616 for (p
= packed_git
; p
; p
= p
->next
)
617 /* verify gives error messages itself */
620 for (p
= packed_git
; p
; p
= p
->next
) {
622 if (open_pack_index(p
))
624 num
= p
->num_objects
;
625 for (j
= 0; j
< num
; j
++)
626 fsck_sha1(nth_packed_object_sha1(p
, j
));
631 for (i
= 0; i
< argc
; i
++) {
632 const char *arg
= argv
[i
];
633 if (!get_sha1(arg
, head_sha1
)) {
634 struct object
*obj
= lookup_object(head_sha1
);
636 /* Error is printed by lookup_object(). */
641 mark_object_reachable(obj
);
645 error("invalid parameter: expected sha1, got '%s'", arg
);
649 * If we've not been given any explicit head information, do the
650 * default ones from .git/refs. We also consider the index file
651 * in this case (ie this implies --cache).
655 keep_cache_objects
= 1;
658 if (keep_cache_objects
) {
660 for (i
= 0; i
< active_nr
; i
++) {
665 mode
= active_cache
[i
]->ce_mode
;
666 if (S_ISGITLINK(mode
))
668 blob
= lookup_blob(active_cache
[i
]->sha1
);
673 mark_object_reachable(obj
);
675 if (active_cache_tree
)
676 fsck_cache_tree(active_cache_tree
);
679 check_connectivity();