]> git.ipfire.org Git - thirdparty/git.git/blame - builtin-fsck.c
git-svn: remove leading slashes from fetch lines in the generate config
[thirdparty/git.git] / builtin-fsck.c
CommitLineData
4b182421 1#include "cache.h"
ff5ebe39
DB
2#include "commit.h"
3#include "tree.h"
4#include "blob.h"
c418eda4 5#include "tag.h"
944d8589 6#include "refs.h"
f9253394 7#include "pack.h"
53dc3f3e 8#include "cache-tree.h"
e9a95bef 9#include "tree-walk.h"
ff5ebe39
DB
10
11#define REACHABLE 0x0001
2d9c58c6 12#define SEEN 0x0002
d9839e03 13
96f1e58f
DR
14static int show_root;
15static int show_tags;
16static int show_unreachable;
566842f6 17static int include_reflogs = 1;
96f1e58f
DR
18static int check_full;
19static int check_strict;
20static int keep_cache_objects;
d9839e03 21static unsigned char head_sha1[20];
e2b4f635 22static int errors_found;
68f6c019 23static int write_lost_and_found;
20f1eb6b 24static int verbose;
e2b4f635
JH
25#define ERROR_OBJECT 01
26#define ERROR_REACHABLE 02
d9839e03 27
962554c6 28#ifdef NO_D_INO_IN_DIRENT
35a730f0
JH
29#define SORT_DIRENT 0
30#define DIRENT_SORT_HINT(de) 0
31#else
32#define SORT_DIRENT 1
33#define DIRENT_SORT_HINT(de) ((de)->d_ino)
34#endif
f1f0d088
PB
35
36static void objreport(struct object *obj, const char *severity,
37 const char *err, va_list params)
38{
39 fprintf(stderr, "%s in %s %s: ",
885a86ab 40 severity, typename(obj->type), sha1_to_hex(obj->sha1));
f1f0d088
PB
41 vfprintf(stderr, err, params);
42 fputs("\n", stderr);
43}
44
a7928f8e 45static int objerror(struct object *obj, const char *err, ...)
f1f0d088
PB
46{
47 va_list params;
48 va_start(params, err);
e2b4f635 49 errors_found |= ERROR_OBJECT;
f1f0d088
PB
50 objreport(obj, "error", err, params);
51 va_end(params);
52 return -1;
53}
54
a7928f8e 55static int objwarning(struct object *obj, const char *err, ...)
f1f0d088
PB
56{
57 va_list params;
58 va_start(params, err);
59 objreport(obj, "warning", err, params);
60 va_end(params);
61 return -1;
62}
63
18af29f2
LT
64/*
65 * Check a single reachable object
66 */
67static void check_reachable_object(struct object *obj)
68{
69 const struct object_refs *refs;
70
71 /*
72 * We obviously want the object to be parsed,
73 * except if it was in a pack-file and we didn't
74 * do a full fsck
75 */
76 if (!obj->parsed) {
efec43c0 77 if (has_sha1_pack(obj->sha1, NULL))
18af29f2
LT
78 return; /* it is in pack - forget about it */
79 printf("missing %s %s\n", typename(obj->type), sha1_to_hex(obj->sha1));
e2b4f635 80 errors_found |= ERROR_REACHABLE;
18af29f2
LT
81 return;
82 }
83
84 /*
85 * Check that everything that we try to reference is also good.
86 */
87 refs = lookup_object_refs(obj);
88 if (refs) {
89 unsigned j;
90 for (j = 0; j < refs->count; j++) {
91 struct object *ref = refs->ref[j];
92 if (ref->parsed ||
93 (has_sha1_file(ref->sha1)))
94 continue;
95 printf("broken link from %7s %s\n",
96 typename(obj->type), sha1_to_hex(obj->sha1));
97 printf(" to %7s %s\n",
98 typename(ref->type), sha1_to_hex(ref->sha1));
e2b4f635 99 errors_found |= ERROR_REACHABLE;
18af29f2
LT
100 }
101 }
102}
103
104/*
105 * Check a single unreachable object
106 */
107static void check_unreachable_object(struct object *obj)
108{
109 /*
110 * Missing unreachable object? Ignore it. It's not like
111 * we miss it (since it can't be reached), nor do we want
112 * to complain about it being unreachable (since it does
113 * not exist).
114 */
115 if (!obj->parsed)
116 return;
117
118 /*
119 * Unreachable object that exists? Show it if asked to,
120 * since this is something that is prunable.
121 */
122 if (show_unreachable) {
123 printf("unreachable %s %s\n", typename(obj->type), sha1_to_hex(obj->sha1));
124 return;
125 }
126
127 /*
128 * "!used" means that nothing at all points to it, including
3dff5379 129 * other unreachable objects. In other words, it's the "tip"
18af29f2
LT
130 * of some set of unreachable objects, usually a commit that
131 * got dropped.
132 *
133 * Such starting points are more interesting than some random
134 * set of unreachable objects, so we show them even if the user
135 * hasn't asked for _all_ unreachable objects. If you have
136 * deleted a branch by mistake, this is a prime candidate to
137 * start looking at, for example.
138 */
139 if (!obj->used) {
140 printf("dangling %s %s\n", typename(obj->type),
141 sha1_to_hex(obj->sha1));
68f6c019
JS
142 if (write_lost_and_found) {
143 char *filename = git_path("lost-found/%s/%s",
144 obj->type == OBJ_COMMIT ? "commit" : "other",
145 sha1_to_hex(obj->sha1));
146 FILE *f;
147
148 if (safe_create_leading_directories(filename)) {
149 error("Could not create lost-found");
150 return;
151 }
152 if (!(f = fopen(filename, "w")))
153 die("Could not open %s", filename);
154 fprintf(f, "%s\n", sha1_to_hex(obj->sha1));
155 fclose(f);
156 }
18af29f2
LT
157 return;
158 }
159
160 /*
161 * Otherwise? It's there, it's unreachable, and some other unreachable
162 * object points to it. Ignore it - it's not interesting, and we showed
163 * all the interesting cases above.
164 */
165}
166
167static void check_object(struct object *obj)
168{
20f1eb6b
JS
169 if (verbose)
170 fprintf(stderr, "Checking %s\n", sha1_to_hex(obj->sha1));
171
18af29f2
LT
172 if (obj->flags & REACHABLE)
173 check_reachable_object(obj);
174 else
175 check_unreachable_object(obj);
176}
f1f0d088 177
8ba0bbb2
LT
178static void check_connectivity(void)
179{
fc046a75 180 int i, max;
8ba0bbb2 181
8ba0bbb2 182 /* Look up all the requirements, warn about missing objects.. */
fc046a75 183 max = get_max_object_index();
20f1eb6b
JS
184 if (verbose)
185 fprintf(stderr, "Checking connectivity (%d objects)\n", max);
186
fc046a75 187 for (i = 0; i < max; i++) {
fc046a75 188 struct object *obj = get_indexed_object(i);
8ba0bbb2 189
18af29f2
LT
190 if (obj)
191 check_object(obj);
8ba0bbb2
LT
192 }
193}
194
85003492
LT
195/*
196 * The entries in a tree are ordered in the _path_ order,
197 * which means that a directory entry is ordered by adding
198 * a slash to the end of it.
199 *
200 * So a directory called "a" is ordered _after_ a file
201 * called "a.c", because "a/" sorts after "a.c".
202 */
a4f35a2d
JH
203#define TREE_UNORDERED (-1)
204#define TREE_HAS_DUPS (-2)
205
e9a95bef 206static int verify_ordered(unsigned mode1, const char *name1, unsigned mode2, const char *name2)
85003492 207{
e9a95bef
LT
208 int len1 = strlen(name1);
209 int len2 = strlen(name2);
85003492
LT
210 int len = len1 < len2 ? len1 : len2;
211 unsigned char c1, c2;
212 int cmp;
213
e9a95bef 214 cmp = memcmp(name1, name2, len);
85003492
LT
215 if (cmp < 0)
216 return 0;
217 if (cmp > 0)
a4f35a2d 218 return TREE_UNORDERED;
85003492
LT
219
220 /*
221 * Ok, the first <len> characters are the same.
222 * Now we need to order the next one, but turn
223 * a '\0' into a '/' for a directory entry.
224 */
e9a95bef
LT
225 c1 = name1[len];
226 c2 = name2[len];
a4f35a2d
JH
227 if (!c1 && !c2)
228 /*
229 * git-write-tree used to write out a nonsense tree that has
230 * entries with the same name, one blob and one tree. Make
231 * sure we do not have duplicate entries.
232 */
233 return TREE_HAS_DUPS;
e9a95bef 234 if (!c1 && S_ISDIR(mode1))
85003492 235 c1 = '/';
e9a95bef 236 if (!c2 && S_ISDIR(mode2))
85003492 237 c2 = '/';
a4f35a2d 238 return c1 < c2 ? 0 : TREE_UNORDERED;
85003492
LT
239}
240
c418eda4 241static int fsck_tree(struct tree *item)
20222118 242{
64071805 243 int retval;
85003492 244 int has_full_path = 0;
cb2cada6 245 int has_empty_name = 0;
64071805
LT
246 int has_zero_pad = 0;
247 int has_bad_modes = 0;
248 int has_dup_entries = 0;
249 int not_properly_sorted = 0;
e9a95bef
LT
250 struct tree_desc desc;
251 unsigned o_mode;
252 const char *o_name;
253 const unsigned char *o_sha1;
85003492 254
20f1eb6b
JS
255 if (verbose)
256 fprintf(stderr, "Checking tree %s\n",
257 sha1_to_hex(item->object.sha1));
258
6fda5e51 259 init_tree_desc(&desc, item->buffer, item->size);
e9a95bef
LT
260
261 o_mode = 0;
262 o_name = NULL;
263 o_sha1 = NULL;
264 while (desc.size) {
265 unsigned mode;
266 const char *name;
267 const unsigned char *sha1;
268
269 sha1 = tree_entry_extract(&desc, &name, &mode);
270
271 if (strchr(name, '/'))
85003492 272 has_full_path = 1;
cb2cada6
SP
273 if (!*name)
274 has_empty_name = 1;
6fda5e51 275 has_zero_pad |= *(char *)desc.buffer == '0';
e9a95bef 276 update_tree_entry(&desc);
85003492 277
e9a95bef 278 switch (mode) {
42ea9cb2 279 /*
e9a95bef 280 * Standard modes..
42ea9cb2
LT
281 */
282 case S_IFREG | 0755:
283 case S_IFREG | 0644:
284 case S_IFLNK:
285 case S_IFDIR:
302b9282 286 case S_IFGITLINK:
42ea9cb2
LT
287 break;
288 /*
289 * This is nonstandard, but we had a few of these
290 * early on when we honored the full set of mode
291 * bits..
292 */
293 case S_IFREG | 0664:
de2eb7f6
LT
294 if (!check_strict)
295 break;
42ea9cb2 296 default:
64071805 297 has_bad_modes = 1;
42ea9cb2
LT
298 }
299
e9a95bef
LT
300 if (o_name) {
301 switch (verify_ordered(o_mode, o_name, mode, name)) {
a4f35a2d 302 case TREE_UNORDERED:
64071805
LT
303 not_properly_sorted = 1;
304 break;
a4f35a2d 305 case TREE_HAS_DUPS:
64071805
LT
306 has_dup_entries = 1;
307 break;
a4f35a2d
JH
308 default:
309 break;
85003492
LT
310 }
311 }
312
e9a95bef
LT
313 o_mode = mode;
314 o_name = name;
315 o_sha1 = sha1;
85003492 316 }
136f2e54
LT
317 free(item->buffer);
318 item->buffer = NULL;
85003492 319
64071805 320 retval = 0;
85003492 321 if (has_full_path) {
f1f0d088 322 objwarning(&item->object, "contains full pathnames");
1ea34e36 323 }
cb2cada6
SP
324 if (has_empty_name) {
325 objwarning(&item->object, "contains empty pathname");
326 }
64071805 327 if (has_zero_pad) {
f1f0d088 328 objwarning(&item->object, "contains zero-padded file modes");
64071805
LT
329 }
330 if (has_bad_modes) {
f1f0d088 331 objwarning(&item->object, "contains bad file modes");
64071805
LT
332 }
333 if (has_dup_entries) {
f1f0d088 334 retval = objerror(&item->object, "contains duplicate file entries");
64071805
LT
335 }
336 if (not_properly_sorted) {
f1f0d088 337 retval = objerror(&item->object, "not properly sorted");
64071805
LT
338 }
339 return retval;
1ea34e36
LT
340}
341
c418eda4 342static int fsck_commit(struct commit *commit)
1ea34e36 343{
de2eb7f6 344 char *buffer = commit->buffer;
f1f0d088 345 unsigned char tree_sha1[20], sha1[20];
de2eb7f6 346
20f1eb6b
JS
347 if (verbose)
348 fprintf(stderr, "Checking commit %s\n",
349 sha1_to_hex(commit->object.sha1));
350
de2eb7f6 351 if (memcmp(buffer, "tree ", 5))
f1f0d088
PB
352 return objerror(&commit->object, "invalid format - expected 'tree' line");
353 if (get_sha1_hex(buffer+5, tree_sha1) || buffer[45] != '\n')
354 return objerror(&commit->object, "invalid 'tree' line format - bad sha1");
de2eb7f6
LT
355 buffer += 46;
356 while (!memcmp(buffer, "parent ", 7)) {
357 if (get_sha1_hex(buffer+7, sha1) || buffer[47] != '\n')
f1f0d088 358 return objerror(&commit->object, "invalid 'parent' line format - bad sha1");
de2eb7f6
LT
359 buffer += 48;
360 }
361 if (memcmp(buffer, "author ", 7))
f1f0d088 362 return objerror(&commit->object, "invalid format - expected 'author' line");
bd1e17e2
LT
363 free(commit->buffer);
364 commit->buffer = NULL;
ff5ebe39 365 if (!commit->tree)
f1f0d088 366 return objerror(&commit->object, "could not load commit's tree %s", tree_sha1);
ab7df187 367 if (!commit->parents && show_root)
c418eda4 368 printf("root %s\n", sha1_to_hex(commit->object.sha1));
e6948b6d 369 if (!commit->date)
a6080a0a 370 printf("bad commit date in %s\n",
c418eda4 371 sha1_to_hex(commit->object.sha1));
4728b861
LT
372 return 0;
373}
374
c418eda4 375static int fsck_tag(struct tag *tag)
ec4465ad 376{
92d4c85d
LT
377 struct object *tagged = tag->tagged;
378
20f1eb6b
JS
379 if (verbose)
380 fprintf(stderr, "Checking tag %s\n",
381 sha1_to_hex(tag->object.sha1));
382
92d4c85d 383 if (!tagged) {
f1f0d088 384 return objerror(&tag->object, "could not load tagged object");
92d4c85d 385 }
889262ea
LT
386 if (!show_tags)
387 return 0;
388
885a86ab 389 printf("tagged %s %s", typename(tagged->type), sha1_to_hex(tagged->sha1));
92d4c85d 390 printf(" (%s) in %s\n", tag->tag, sha1_to_hex(tag->object.sha1));
ff5ebe39 391 return 0;
20222118
LT
392}
393
d72308e0 394static int fsck_sha1(const unsigned char *sha1)
20222118 395{
7e8c174a 396 struct object *obj = parse_object(sha1);
e2b4f635
JH
397 if (!obj) {
398 errors_found |= ERROR_OBJECT;
399 return error("%s: object corrupt or missing",
400 sha1_to_hex(sha1));
401 }
2d9c58c6
LT
402 if (obj->flags & SEEN)
403 return 0;
404 obj->flags |= SEEN;
1974632c 405 if (obj->type == OBJ_BLOB)
7e8c174a 406 return 0;
1974632c 407 if (obj->type == OBJ_TREE)
7e8c174a 408 return fsck_tree((struct tree *) obj);
1974632c 409 if (obj->type == OBJ_COMMIT)
7e8c174a 410 return fsck_commit((struct commit *) obj);
1974632c 411 if (obj->type == OBJ_TAG)
7e8c174a 412 return fsck_tag((struct tag *) obj);
e2b4f635 413
f1f0d088 414 /* By now, parse_object() would've returned NULL instead. */
e2b4f635
JH
415 return objerror(obj, "unknown type '%d' (internal fsck error)",
416 obj->type);
7e8c174a
LT
417}
418
419/*
420 * This is the sorting chunk size: make it reasonably
421 * big so that we can sort well..
422 */
423#define MAX_SHA1_ENTRIES (1024)
424
425struct sha1_entry {
426 unsigned long ino;
20222118 427 unsigned char sha1[20];
7e8c174a
LT
428};
429
430static struct {
431 unsigned long nr;
432 struct sha1_entry *entry[MAX_SHA1_ENTRIES];
433} sha1_list;
434
435static int ino_compare(const void *_a, const void *_b)
436{
437 const struct sha1_entry *a = _a, *b = _b;
438 unsigned long ino1 = a->ino, ino2 = b->ino;
439 return ino1 < ino2 ? -1 : ino1 > ino2 ? 1 : 0;
440}
441
442static void fsck_sha1_list(void)
443{
444 int i, nr = sha1_list.nr;
445
35a730f0
JH
446 if (SORT_DIRENT)
447 qsort(sha1_list.entry, nr,
448 sizeof(struct sha1_entry *), ino_compare);
7e8c174a
LT
449 for (i = 0; i < nr; i++) {
450 struct sha1_entry *entry = sha1_list.entry[i];
451 unsigned char *sha1 = entry->sha1;
452
453 sha1_list.entry[i] = NULL;
f1f0d088 454 fsck_sha1(sha1);
7e8c174a 455 free(entry);
20222118 456 }
7e8c174a
LT
457 sha1_list.nr = 0;
458}
459
460static void add_sha1_list(unsigned char *sha1, unsigned long ino)
461{
462 struct sha1_entry *entry = xmalloc(sizeof(*entry));
463 int nr;
464
465 entry->ino = ino;
e702496e 466 hashcpy(entry->sha1, sha1);
7e8c174a
LT
467 nr = sha1_list.nr;
468 if (nr == MAX_SHA1_ENTRIES) {
469 fsck_sha1_list();
470 nr = 0;
471 }
472 sha1_list.entry[nr] = entry;
473 sha1_list.nr = ++nr;
20222118
LT
474}
475
b5524c82 476static void fsck_dir(int i, char *path)
20222118
LT
477{
478 DIR *dir = opendir(path);
479 struct dirent *de;
480
230f1322 481 if (!dir)
b5524c82 482 return;
20222118 483
20f1eb6b
JS
484 if (verbose)
485 fprintf(stderr, "Checking directory %s\n", path);
486
20222118
LT
487 while ((de = readdir(dir)) != NULL) {
488 char name[100];
7e8c174a 489 unsigned char sha1[20];
20222118
LT
490 int len = strlen(de->d_name);
491
492 switch (len) {
493 case 2:
494 if (de->d_name[1] != '.')
495 break;
496 case 1:
497 if (de->d_name[0] != '.')
498 break;
499 continue;
500 case 38:
501 sprintf(name, "%02x", i);
502 memcpy(name+2, de->d_name, len+1);
7e8c174a
LT
503 if (get_sha1_hex(name, sha1) < 0)
504 break;
35a730f0 505 add_sha1_list(sha1, DIRENT_SORT_HINT(de));
7e8c174a 506 continue;
20222118
LT
507 }
508 fprintf(stderr, "bad sha1 file: %s/%s\n", path, de->d_name);
509 }
510 closedir(dir);
20222118
LT
511}
512
96f1e58f 513static int default_refs;
944d8589 514
883d60fa
JS
515static int fsck_handle_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
516 const char *email, unsigned long timestamp, int tz,
517 const char *message, void *cb_data)
55dd5526
JH
518{
519 struct object *obj;
520
20f1eb6b
JS
521 if (verbose)
522 fprintf(stderr, "Checking reflog %s->%s\n",
523 sha1_to_hex(osha1), sha1_to_hex(nsha1));
524
55dd5526
JH
525 if (!is_null_sha1(osha1)) {
526 obj = lookup_object(osha1);
527 if (obj) {
528 obj->used = 1;
529 mark_reachable(obj, REACHABLE);
530 }
531 }
532 obj = lookup_object(nsha1);
533 if (obj) {
534 obj->used = 1;
535 mark_reachable(obj, REACHABLE);
536 }
537 return 0;
538}
539
eb8381c8
NP
540static int fsck_handle_reflog(const char *logname, const unsigned char *sha1, int flag, void *cb_data)
541{
542 for_each_reflog_ent(logname, fsck_handle_reflog_ent, NULL);
543 return 0;
544}
545
8da19775 546static int fsck_handle_ref(const char *refname, const unsigned char *sha1, int flag, void *cb_data)
1024932f 547{
1024932f
LT
548 struct object *obj;
549
1024932f 550 obj = lookup_object(sha1);
8a498a05 551 if (!obj) {
7aaa715d 552 if (has_sha1_file(sha1)) {
659cacf5 553 default_refs++;
944d8589 554 return 0; /* it is in a pack */
659cacf5 555 }
944d8589
LT
556 error("%s: invalid sha1 pointer %s", refname, sha1_to_hex(sha1));
557 /* We'll continue with the rest despite the error.. */
558 return 0;
8a498a05 559 }
944d8589 560 default_refs++;
1024932f
LT
561 obj->used = 1;
562 mark_reachable(obj, REACHABLE);
55dd5526 563
7c4d07c7 564 return 0;
1024932f
LT
565}
566
1024932f
LT
567static void get_default_heads(void)
568{
cb5d709f 569 for_each_ref(fsck_handle_ref, NULL);
566842f6
SP
570 if (include_reflogs)
571 for_each_reflog(fsck_handle_reflog, NULL);
071fa89e
LT
572
573 /*
574 * Not having any default heads isn't really fatal, but
575 * it does mean that "--unreachable" no longer makes any
576 * sense (since in this case everything will obviously
577 * be unreachable by definition.
578 *
579 * Showing dangling objects is valid, though (as those
580 * dangling objects are likely lost heads).
581 *
582 * So we just print a warning about it, and clear the
583 * "show_unreachable" flag.
584 */
585 if (!default_refs) {
8eb2d0be 586 fprintf(stderr, "notice: No default references\n");
071fa89e
LT
587 show_unreachable = 0;
588 }
1024932f
LT
589}
590
8a498a05
JH
591static void fsck_object_dir(const char *path)
592{
593 int i;
20f1eb6b
JS
594
595 if (verbose)
596 fprintf(stderr, "Checking object directory\n");
597
8a498a05
JH
598 for (i = 0; i < 256; i++) {
599 static char dir[4096];
600 sprintf(dir, "%s/%02x", path, i);
601 fsck_dir(i, dir);
602 }
603 fsck_sha1_list();
604}
605
c3330383
LT
606static int fsck_head_link(void)
607{
c3330383 608 unsigned char sha1[20];
8da19775 609 int flag;
8eb2d0be
JH
610 int null_is_error = 0;
611 const char *head_points_at = resolve_ref("HEAD", sha1, 0, &flag);
612
20f1eb6b
JS
613 if (verbose)
614 fprintf(stderr, "Checking HEAD link\n");
615
8eb2d0be
JH
616 if (!head_points_at)
617 return error("Invalid HEAD");
618 if (!strcmp(head_points_at, "HEAD"))
619 /* detached HEAD */
620 null_is_error = 1;
621 else if (prefixcmp(head_points_at, "refs/heads/"))
8098a178 622 return error("HEAD points to something strange (%s)",
5b10b091 623 head_points_at);
8eb2d0be
JH
624 if (is_null_sha1(sha1)) {
625 if (null_is_error)
626 return error("HEAD: detached HEAD points at nothing");
627 fprintf(stderr, "notice: HEAD points to an unborn branch (%s)\n",
628 head_points_at + 11);
629 }
c3330383
LT
630 return 0;
631}
632
53dc3f3e
JH
633static int fsck_cache_tree(struct cache_tree *it)
634{
635 int i;
636 int err = 0;
637
20f1eb6b
JS
638 if (verbose)
639 fprintf(stderr, "Checking cache tree\n");
640
53dc3f3e
JH
641 if (0 <= it->entry_count) {
642 struct object *obj = parse_object(it->sha1);
6d60bbef
JH
643 if (!obj) {
644 error("%s: invalid sha1 pointer in cache-tree",
645 sha1_to_hex(it->sha1));
646 return 1;
647 }
cdc08b33
JH
648 mark_reachable(obj, REACHABLE);
649 obj->used = 1;
1974632c 650 if (obj->type != OBJ_TREE)
53dc3f3e
JH
651 err |= objerror(obj, "non-tree in cache-tree");
652 }
653 for (i = 0; i < it->subtree_nr; i++)
654 err |= fsck_cache_tree(it->down[i]->cache_tree);
655 return err;
656}
657
e2b4f635
JH
658static const char fsck_usage[] =
659"git-fsck [--tags] [--root] [[--unreachable] [--cache] [--full] "
20f1eb6b 660"[--strict] [--verbose] <head-sha1>*]";
e2b4f635 661
b4dfefe0 662int cmd_fsck(int argc, char **argv, const char *prefix)
20222118 663{
bcee6fd8 664 int i, heads;
20222118 665
3a7c352b 666 track_object_refs = 1;
e2b4f635 667 errors_found = 0;
61e2b015 668
889262ea
LT
669 for (i = 1; i < argc; i++) {
670 const char *arg = argv[i];
671
672 if (!strcmp(arg, "--unreachable")) {
673 show_unreachable = 1;
674 continue;
675 }
676 if (!strcmp(arg, "--tags")) {
677 show_tags = 1;
678 continue;
679 }
ab7df187
LT
680 if (!strcmp(arg, "--root")) {
681 show_root = 1;
682 continue;
683 }
ae7c0c92
JH
684 if (!strcmp(arg, "--cache")) {
685 keep_cache_objects = 1;
686 continue;
687 }
566842f6
SP
688 if (!strcmp(arg, "--no-reflogs")) {
689 include_reflogs = 0;
690 continue;
691 }
8a498a05
JH
692 if (!strcmp(arg, "--full")) {
693 check_full = 1;
694 continue;
695 }
de2eb7f6
LT
696 if (!strcmp(arg, "--strict")) {
697 check_strict = 1;
698 continue;
699 }
20f1eb6b
JS
700 if (!strcmp(arg, "--verbose")) {
701 verbose = 1;
702 continue;
703 }
68f6c019
JS
704 if (!strcmp(arg, "--lost-found")) {
705 check_full = 1;
706 include_reflogs = 0;
707 write_lost_and_found = 1;
708 continue;
709 }
889262ea 710 if (*arg == '-')
e2b4f635 711 usage(fsck_usage);
889262ea
LT
712 }
713
c3330383 714 fsck_head_link();
8a498a05
JH
715 fsck_object_dir(get_object_directory());
716 if (check_full) {
d5a63b99 717 struct alternate_object_database *alt;
8a498a05
JH
718 struct packed_git *p;
719 prepare_alt_odb();
d5a63b99 720 for (alt = alt_odb_list; alt; alt = alt->next) {
a3eb250f 721 char namebuf[PATH_MAX];
d5a63b99
JH
722 int namelen = alt->name - alt->base;
723 memcpy(namebuf, alt->base, namelen);
a3eb250f
JH
724 namebuf[namelen - 1] = 0;
725 fsck_object_dir(namebuf);
8a498a05
JH
726 }
727 prepare_packed_git();
f9253394
JH
728 for (p = packed_git; p; p = p->next)
729 /* verify gives error messages itself */
f3bf9224 730 verify_pack(p, 0);
f9253394 731
8a498a05 732 for (p = packed_git; p; p = p->next) {
b77ffe8a
SP
733 uint32_t i, num;
734 if (open_pack_index(p))
735 continue;
736 num = p->num_objects;
d72308e0
NP
737 for (i = 0; i < num; i++)
738 fsck_sha1(nth_packed_object_sha1(p, i));
8a498a05 739 }
bcee6fd8
LT
740 }
741
742 heads = 0;
d9839e03 743 for (i = 1; i < argc; i++) {
a6080a0a 744 const char *arg = argv[i];
889262ea
LT
745
746 if (*arg == '-')
d9839e03 747 continue;
889262ea 748
3c249c95 749 if (!get_sha1(arg, head_sha1)) {
770896e5 750 struct object *obj = lookup_object(head_sha1);
e1a1388d 751
770896e5
LT
752 /* Error is printed by lookup_object(). */
753 if (!obj)
e1a1388d
JF
754 continue;
755
ff5ebe39
DB
756 obj->used = 1;
757 mark_reachable(obj, REACHABLE);
bcee6fd8 758 heads++;
d9839e03
LT
759 continue;
760 }
f1f0d088 761 error("invalid parameter: expected sha1, got '%s'", arg);
d9839e03 762 }
d9839e03 763
1024932f 764 /*
d1af002d 765 * If we've not been given any explicit head information, do the
e7bd907d
LT
766 * default ones from .git/refs. We also consider the index file
767 * in this case (ie this implies --cache).
1024932f 768 */
e7bd907d 769 if (!heads) {
1024932f
LT
770 get_default_heads();
771 keep_cache_objects = 1;
772 }
773
ae7c0c92
JH
774 if (keep_cache_objects) {
775 int i;
776 read_cache();
777 for (i = 0; i < active_nr; i++) {
8d9721c8
LT
778 unsigned int mode;
779 struct blob *blob;
ae7c0c92 780 struct object *obj;
8d9721c8
LT
781
782 mode = ntohl(active_cache[i]->ce_mode);
302b9282 783 if (S_ISGITLINK(mode))
8d9721c8
LT
784 continue;
785 blob = lookup_blob(active_cache[i]->sha1);
ae7c0c92
JH
786 if (!blob)
787 continue;
788 obj = &blob->object;
789 obj->used = 1;
790 mark_reachable(obj, REACHABLE);
791 }
53dc3f3e
JH
792 if (active_cache_tree)
793 fsck_cache_tree(active_cache_tree);
ae7c0c92
JH
794 }
795
8ba0bbb2 796 check_connectivity();
e2b4f635 797 return errors_found;
20222118 798}