Make "struct tree" contain the pointer to the tree buffer
[git/git.git] / fsck-objects.c
CommitLineData
20222118
LT
1#include <sys/types.h>
2#include <dirent.h>
3
4b182421 4#include "cache.h"
ff5ebe39
DB
5#include "commit.h"
6#include "tree.h"
7#include "blob.h"
c418eda4 8#include "tag.h"
944d8589 9#include "refs.h"
f9253394 10#include "pack.h"
53dc3f3e 11#include "cache-tree.h"
ff5ebe39
DB
12
13#define REACHABLE 0x0001
d9839e03 14
ab7df187 15static int show_root = 0;
889262ea 16static int show_tags = 0;
d9839e03 17static int show_unreachable = 0;
8a498a05 18static int check_full = 0;
de2eb7f6 19static int check_strict = 0;
7aaa715d 20static int keep_cache_objects = 0;
d9839e03
LT
21static unsigned char head_sha1[20];
22
962554c6 23#ifdef NO_D_INO_IN_DIRENT
35a730f0
JH
24#define SORT_DIRENT 0
25#define DIRENT_SORT_HINT(de) 0
26#else
27#define SORT_DIRENT 1
28#define DIRENT_SORT_HINT(de) ((de)->d_ino)
29#endif
f1f0d088
PB
30
31static void objreport(struct object *obj, const char *severity,
32 const char *err, va_list params)
33{
34 fprintf(stderr, "%s in %s %s: ",
35 severity, obj->type, sha1_to_hex(obj->sha1));
36 vfprintf(stderr, err, params);
37 fputs("\n", stderr);
38}
39
a7928f8e 40static int objerror(struct object *obj, const char *err, ...)
f1f0d088
PB
41{
42 va_list params;
43 va_start(params, err);
44 objreport(obj, "error", err, params);
45 va_end(params);
46 return -1;
47}
48
a7928f8e 49static int objwarning(struct object *obj, const char *err, ...)
f1f0d088
PB
50{
51 va_list params;
52 va_start(params, err);
53 objreport(obj, "warning", err, params);
54 va_end(params);
55 return -1;
56}
57
58
8ba0bbb2
LT
59static void check_connectivity(void)
60{
61 int i;
62
8ba0bbb2 63 /* Look up all the requirements, warn about missing objects.. */
070879ca 64 for (i = 0; i < obj_allocs; i++) {
ff5ebe39 65 struct object *obj = objs[i];
8ba0bbb2 66
070879ca
JS
67 if (!obj)
68 continue;
69
3a6a23e6 70 if (!obj->parsed) {
7aaa715d 71 if (has_sha1_file(obj->sha1))
8a498a05
JH
72 ; /* it is in pack */
73 else
74 printf("missing %s %s\n",
75 obj->type, sha1_to_hex(obj->sha1));
3a6a23e6
LT
76 continue;
77 }
78
4a4e6fd7
SV
79 if (obj->refs) {
80 const struct object_refs *refs = obj->refs;
81 unsigned j;
82 for (j = 0; j < refs->count; j++) {
83 struct object *ref = refs->ref[j];
84 if (ref->parsed ||
7aaa715d 85 (has_sha1_file(ref->sha1)))
4a4e6fd7
SV
86 continue;
87 printf("broken link from %7s %s\n",
88 obj->type, sha1_to_hex(obj->sha1));
89 printf(" to %7s %s\n",
90 ref->type, sha1_to_hex(ref->sha1));
91 }
3a6a23e6
LT
92 }
93
ff5ebe39 94 if (show_unreachable && !(obj->flags & REACHABLE)) {
c4584ae3
JH
95 printf("unreachable %s %s\n",
96 obj->type, sha1_to_hex(obj->sha1));
8ba0bbb2 97 continue;
d9839e03 98 }
8ba0bbb2 99
ff5ebe39
DB
100 if (!obj->used) {
101 printf("dangling %s %s\n", obj->type,
102 sha1_to_hex(obj->sha1));
d9839e03 103 }
8ba0bbb2
LT
104 }
105}
106
85003492
LT
107/*
108 * The entries in a tree are ordered in the _path_ order,
109 * which means that a directory entry is ordered by adding
110 * a slash to the end of it.
111 *
112 * So a directory called "a" is ordered _after_ a file
113 * called "a.c", because "a/" sorts after "a.c".
114 */
a4f35a2d
JH
115#define TREE_UNORDERED (-1)
116#define TREE_HAS_DUPS (-2)
117
85003492
LT
118static int verify_ordered(struct tree_entry_list *a, struct tree_entry_list *b)
119{
120 int len1 = strlen(a->name);
121 int len2 = strlen(b->name);
122 int len = len1 < len2 ? len1 : len2;
123 unsigned char c1, c2;
124 int cmp;
125
126 cmp = memcmp(a->name, b->name, len);
127 if (cmp < 0)
128 return 0;
129 if (cmp > 0)
a4f35a2d 130 return TREE_UNORDERED;
85003492
LT
131
132 /*
133 * Ok, the first <len> characters are the same.
134 * Now we need to order the next one, but turn
135 * a '\0' into a '/' for a directory entry.
136 */
137 c1 = a->name[len];
138 c2 = b->name[len];
a4f35a2d
JH
139 if (!c1 && !c2)
140 /*
141 * git-write-tree used to write out a nonsense tree that has
142 * entries with the same name, one blob and one tree. Make
143 * sure we do not have duplicate entries.
144 */
145 return TREE_HAS_DUPS;
85003492
LT
146 if (!c1 && a->directory)
147 c1 = '/';
148 if (!c2 && b->directory)
149 c2 = '/';
a4f35a2d 150 return c1 < c2 ? 0 : TREE_UNORDERED;
85003492
LT
151}
152
c418eda4 153static int fsck_tree(struct tree *item)
20222118 154{
64071805 155 int retval;
85003492 156 int has_full_path = 0;
64071805
LT
157 int has_zero_pad = 0;
158 int has_bad_modes = 0;
159 int has_dup_entries = 0;
160 int not_properly_sorted = 0;
85003492
LT
161 struct tree_entry_list *entry, *last;
162
163 last = NULL;
164 for (entry = item->entries; entry; entry = entry->next) {
165 if (strchr(entry->name, '/'))
166 has_full_path = 1;
64071805 167 has_zero_pad |= entry->zeropad;
85003492 168
42ea9cb2
LT
169 switch (entry->mode) {
170 /*
171 * Standard modes..
172 */
173 case S_IFREG | 0755:
174 case S_IFREG | 0644:
175 case S_IFLNK:
176 case S_IFDIR:
177 break;
178 /*
179 * This is nonstandard, but we had a few of these
180 * early on when we honored the full set of mode
181 * bits..
182 */
183 case S_IFREG | 0664:
de2eb7f6
LT
184 if (!check_strict)
185 break;
42ea9cb2 186 default:
64071805 187 has_bad_modes = 1;
42ea9cb2
LT
188 }
189
85003492 190 if (last) {
a4f35a2d
JH
191 switch (verify_ordered(last, entry)) {
192 case TREE_UNORDERED:
64071805
LT
193 not_properly_sorted = 1;
194 break;
a4f35a2d 195 case TREE_HAS_DUPS:
64071805
LT
196 has_dup_entries = 1;
197 break;
a4f35a2d
JH
198 default:
199 break;
85003492 200 }
545f229a 201 free(last);
85003492
LT
202 }
203
204 last = entry;
205 }
136f2e54 206 if (last)
545f229a 207 free(last);
545f229a 208 item->entries = NULL;
136f2e54
LT
209 free(item->buffer);
210 item->buffer = NULL;
85003492 211
64071805 212 retval = 0;
85003492 213 if (has_full_path) {
f1f0d088 214 objwarning(&item->object, "contains full pathnames");
1ea34e36 215 }
64071805 216 if (has_zero_pad) {
f1f0d088 217 objwarning(&item->object, "contains zero-padded file modes");
64071805
LT
218 }
219 if (has_bad_modes) {
f1f0d088 220 objwarning(&item->object, "contains bad file modes");
64071805
LT
221 }
222 if (has_dup_entries) {
f1f0d088 223 retval = objerror(&item->object, "contains duplicate file entries");
64071805
LT
224 }
225 if (not_properly_sorted) {
f1f0d088 226 retval = objerror(&item->object, "not properly sorted");
64071805
LT
227 }
228 return retval;
1ea34e36
LT
229}
230
c418eda4 231static int fsck_commit(struct commit *commit)
1ea34e36 232{
de2eb7f6 233 char *buffer = commit->buffer;
f1f0d088 234 unsigned char tree_sha1[20], sha1[20];
de2eb7f6
LT
235
236 if (memcmp(buffer, "tree ", 5))
f1f0d088
PB
237 return objerror(&commit->object, "invalid format - expected 'tree' line");
238 if (get_sha1_hex(buffer+5, tree_sha1) || buffer[45] != '\n')
239 return objerror(&commit->object, "invalid 'tree' line format - bad sha1");
de2eb7f6
LT
240 buffer += 46;
241 while (!memcmp(buffer, "parent ", 7)) {
242 if (get_sha1_hex(buffer+7, sha1) || buffer[47] != '\n')
f1f0d088 243 return objerror(&commit->object, "invalid 'parent' line format - bad sha1");
de2eb7f6
LT
244 buffer += 48;
245 }
246 if (memcmp(buffer, "author ", 7))
f1f0d088 247 return objerror(&commit->object, "invalid format - expected 'author' line");
bd1e17e2
LT
248 free(commit->buffer);
249 commit->buffer = NULL;
ff5ebe39 250 if (!commit->tree)
f1f0d088 251 return objerror(&commit->object, "could not load commit's tree %s", tree_sha1);
ab7df187 252 if (!commit->parents && show_root)
c418eda4 253 printf("root %s\n", sha1_to_hex(commit->object.sha1));
e6948b6d 254 if (!commit->date)
c418eda4
DB
255 printf("bad commit date in %s\n",
256 sha1_to_hex(commit->object.sha1));
4728b861
LT
257 return 0;
258}
259
c418eda4 260static int fsck_tag(struct tag *tag)
ec4465ad 261{
92d4c85d
LT
262 struct object *tagged = tag->tagged;
263
264 if (!tagged) {
f1f0d088 265 return objerror(&tag->object, "could not load tagged object");
92d4c85d 266 }
889262ea
LT
267 if (!show_tags)
268 return 0;
269
92d4c85d
LT
270 printf("tagged %s %s", tagged->type, sha1_to_hex(tagged->sha1));
271 printf(" (%s) in %s\n", tag->tag, sha1_to_hex(tag->object.sha1));
ff5ebe39 272 return 0;
20222118
LT
273}
274
7e8c174a 275static int fsck_sha1(unsigned char *sha1)
20222118 276{
7e8c174a
LT
277 struct object *obj = parse_object(sha1);
278 if (!obj)
f1f0d088 279 return error("%s: object not found", sha1_to_hex(sha1));
7e8c174a
LT
280 if (obj->type == blob_type)
281 return 0;
282 if (obj->type == tree_type)
283 return fsck_tree((struct tree *) obj);
284 if (obj->type == commit_type)
285 return fsck_commit((struct commit *) obj);
286 if (obj->type == tag_type)
287 return fsck_tag((struct tag *) obj);
f1f0d088
PB
288 /* By now, parse_object() would've returned NULL instead. */
289 return objerror(obj, "unknown type '%s' (internal fsck error)", obj->type);
7e8c174a
LT
290}
291
292/*
293 * This is the sorting chunk size: make it reasonably
294 * big so that we can sort well..
295 */
296#define MAX_SHA1_ENTRIES (1024)
297
298struct sha1_entry {
299 unsigned long ino;
20222118 300 unsigned char sha1[20];
7e8c174a
LT
301};
302
303static struct {
304 unsigned long nr;
305 struct sha1_entry *entry[MAX_SHA1_ENTRIES];
306} sha1_list;
307
308static int ino_compare(const void *_a, const void *_b)
309{
310 const struct sha1_entry *a = _a, *b = _b;
311 unsigned long ino1 = a->ino, ino2 = b->ino;
312 return ino1 < ino2 ? -1 : ino1 > ino2 ? 1 : 0;
313}
314
315static void fsck_sha1_list(void)
316{
317 int i, nr = sha1_list.nr;
318
35a730f0
JH
319 if (SORT_DIRENT)
320 qsort(sha1_list.entry, nr,
321 sizeof(struct sha1_entry *), ino_compare);
7e8c174a
LT
322 for (i = 0; i < nr; i++) {
323 struct sha1_entry *entry = sha1_list.entry[i];
324 unsigned char *sha1 = entry->sha1;
325
326 sha1_list.entry[i] = NULL;
f1f0d088 327 fsck_sha1(sha1);
7e8c174a 328 free(entry);
20222118 329 }
7e8c174a
LT
330 sha1_list.nr = 0;
331}
332
333static void add_sha1_list(unsigned char *sha1, unsigned long ino)
334{
335 struct sha1_entry *entry = xmalloc(sizeof(*entry));
336 int nr;
337
338 entry->ino = ino;
339 memcpy(entry->sha1, sha1, 20);
340 nr = sha1_list.nr;
341 if (nr == MAX_SHA1_ENTRIES) {
342 fsck_sha1_list();
343 nr = 0;
344 }
345 sha1_list.entry[nr] = entry;
346 sha1_list.nr = ++nr;
20222118
LT
347}
348
349static int fsck_dir(int i, char *path)
350{
351 DIR *dir = opendir(path);
352 struct dirent *de;
353
230f1322
LT
354 if (!dir)
355 return 0;
20222118
LT
356
357 while ((de = readdir(dir)) != NULL) {
358 char name[100];
7e8c174a 359 unsigned char sha1[20];
20222118
LT
360 int len = strlen(de->d_name);
361
362 switch (len) {
363 case 2:
364 if (de->d_name[1] != '.')
365 break;
366 case 1:
367 if (de->d_name[0] != '.')
368 break;
369 continue;
370 case 38:
371 sprintf(name, "%02x", i);
372 memcpy(name+2, de->d_name, len+1);
7e8c174a
LT
373 if (get_sha1_hex(name, sha1) < 0)
374 break;
35a730f0 375 add_sha1_list(sha1, DIRENT_SORT_HINT(de));
7e8c174a 376 continue;
20222118
LT
377 }
378 fprintf(stderr, "bad sha1 file: %s/%s\n", path, de->d_name);
379 }
380 closedir(dir);
381 return 0;
382}
383
944d8589
LT
384static int default_refs = 0;
385
386static int fsck_handle_ref(const char *refname, const unsigned char *sha1)
1024932f 387{
1024932f
LT
388 struct object *obj;
389
1024932f 390 obj = lookup_object(sha1);
8a498a05 391 if (!obj) {
7aaa715d 392 if (has_sha1_file(sha1)) {
659cacf5 393 default_refs++;
944d8589 394 return 0; /* it is in a pack */
659cacf5 395 }
944d8589
LT
396 error("%s: invalid sha1 pointer %s", refname, sha1_to_hex(sha1));
397 /* We'll continue with the rest despite the error.. */
398 return 0;
8a498a05 399 }
944d8589 400 default_refs++;
1024932f
LT
401 obj->used = 1;
402 mark_reachable(obj, REACHABLE);
7c4d07c7 403 return 0;
1024932f
LT
404}
405
1024932f
LT
406static void get_default_heads(void)
407{
944d8589
LT
408 for_each_ref(fsck_handle_ref);
409 if (!default_refs)
477606f5 410 die("No default references");
1024932f
LT
411}
412
8a498a05
JH
413static void fsck_object_dir(const char *path)
414{
415 int i;
416 for (i = 0; i < 256; i++) {
417 static char dir[4096];
418 sprintf(dir, "%s/%02x", path, i);
419 fsck_dir(i, dir);
420 }
421 fsck_sha1_list();
422}
423
c3330383
LT
424static int fsck_head_link(void)
425{
c3330383 426 unsigned char sha1[20];
8098a178
JH
427 const char *git_HEAD = strdup(git_path("HEAD"));
428 const char *git_refs_heads_master = resolve_ref(git_HEAD, sha1, 1);
429 int pfxlen = strlen(git_HEAD) - 4; /* strip .../.git/ part */
430
431 if (!git_refs_heads_master)
432 return error("HEAD is not a symbolic ref");
433 if (strncmp(git_refs_heads_master + pfxlen, "refs/heads/", 11))
434 return error("HEAD points to something strange (%s)",
435 git_refs_heads_master + pfxlen);
436 if (!memcmp(null_sha1, sha1, 20))
c3330383
LT
437 return error("HEAD: not a valid git pointer");
438 return 0;
439}
440
53dc3f3e
JH
441static int fsck_cache_tree(struct cache_tree *it)
442{
443 int i;
444 int err = 0;
445
446 if (0 <= it->entry_count) {
447 struct object *obj = parse_object(it->sha1);
6d60bbef
JH
448 if (!obj) {
449 error("%s: invalid sha1 pointer in cache-tree",
450 sha1_to_hex(it->sha1));
451 return 1;
452 }
cdc08b33
JH
453 mark_reachable(obj, REACHABLE);
454 obj->used = 1;
53dc3f3e
JH
455 if (obj->type != tree_type)
456 err |= objerror(obj, "non-tree in cache-tree");
457 }
458 for (i = 0; i < it->subtree_nr; i++)
459 err |= fsck_cache_tree(it->down[i]->cache_tree);
460 return err;
461}
462
20222118
LT
463int main(int argc, char **argv)
464{
bcee6fd8 465 int i, heads;
20222118 466
61e2b015
JH
467 setup_git_directory();
468
889262ea
LT
469 for (i = 1; i < argc; i++) {
470 const char *arg = argv[i];
471
472 if (!strcmp(arg, "--unreachable")) {
473 show_unreachable = 1;
474 continue;
475 }
476 if (!strcmp(arg, "--tags")) {
477 show_tags = 1;
478 continue;
479 }
ab7df187
LT
480 if (!strcmp(arg, "--root")) {
481 show_root = 1;
482 continue;
483 }
ae7c0c92
JH
484 if (!strcmp(arg, "--cache")) {
485 keep_cache_objects = 1;
486 continue;
487 }
8a498a05
JH
488 if (!strcmp(arg, "--full")) {
489 check_full = 1;
490 continue;
491 }
de2eb7f6
LT
492 if (!strcmp(arg, "--strict")) {
493 check_strict = 1;
494 continue;
495 }
889262ea 496 if (*arg == '-')
7aaa715d 497 usage("git-fsck-objects [--tags] [--root] [[--unreachable] [--cache] [--full] [--strict] <head-sha1>*]");
889262ea
LT
498 }
499
c3330383 500 fsck_head_link();
8a498a05
JH
501 fsck_object_dir(get_object_directory());
502 if (check_full) {
d5a63b99 503 struct alternate_object_database *alt;
8a498a05
JH
504 struct packed_git *p;
505 prepare_alt_odb();
d5a63b99 506 for (alt = alt_odb_list; alt; alt = alt->next) {
a3eb250f 507 char namebuf[PATH_MAX];
d5a63b99
JH
508 int namelen = alt->name - alt->base;
509 memcpy(namebuf, alt->base, namelen);
a3eb250f
JH
510 namebuf[namelen - 1] = 0;
511 fsck_object_dir(namebuf);
8a498a05
JH
512 }
513 prepare_packed_git();
f9253394
JH
514 for (p = packed_git; p; p = p->next)
515 /* verify gives error messages itself */
f3bf9224 516 verify_pack(p, 0);
f9253394 517
8a498a05
JH
518 for (p = packed_git; p; p = p->next) {
519 int num = num_packed_objects(p);
520 for (i = 0; i < num; i++) {
521 unsigned char sha1[20];
522 nth_packed_object_sha1(p, i, sha1);
f1f0d088 523 fsck_sha1(sha1);
8a498a05
JH
524 }
525 }
bcee6fd8
LT
526 }
527
528 heads = 0;
d9839e03 529 for (i = 1; i < argc; i++) {
889262ea
LT
530 const char *arg = argv[i];
531
532 if (*arg == '-')
d9839e03 533 continue;
889262ea 534
3c249c95 535 if (!get_sha1(arg, head_sha1)) {
770896e5 536 struct object *obj = lookup_object(head_sha1);
e1a1388d 537
770896e5
LT
538 /* Error is printed by lookup_object(). */
539 if (!obj)
e1a1388d
JF
540 continue;
541
ff5ebe39
DB
542 obj->used = 1;
543 mark_reachable(obj, REACHABLE);
bcee6fd8 544 heads++;
d9839e03
LT
545 continue;
546 }
f1f0d088 547 error("invalid parameter: expected sha1, got '%s'", arg);
d9839e03 548 }
d9839e03 549
1024932f 550 /*
d1af002d 551 * If we've not been given any explicit head information, do the
e7bd907d
LT
552 * default ones from .git/refs. We also consider the index file
553 * in this case (ie this implies --cache).
1024932f 554 */
e7bd907d 555 if (!heads) {
1024932f
LT
556 get_default_heads();
557 keep_cache_objects = 1;
558 }
559
ae7c0c92
JH
560 if (keep_cache_objects) {
561 int i;
562 read_cache();
563 for (i = 0; i < active_nr; i++) {
564 struct blob *blob = lookup_blob(active_cache[i]->sha1);
565 struct object *obj;
566 if (!blob)
567 continue;
568 obj = &blob->object;
569 obj->used = 1;
570 mark_reachable(obj, REACHABLE);
571 }
53dc3f3e
JH
572 if (active_cache_tree)
573 fsck_cache_tree(active_cache_tree);
ae7c0c92
JH
574 }
575
8ba0bbb2 576 check_connectivity();
20222118
LT
577 return 0;
578}