fsck-cache.c

   1 #include <sys/types.h>
   2 #include <dirent.h>
   3
   4 #include "cache.h"
   5 #include "commit.h"
   6 #include "tree.h"
   7 #include "blob.h"
   8 #include "tag.h"
   9
  10 #define REACHABLE 0x0001
  11
  12 static int show_root = 0;
  13 static int show_tags = 0;
  14 static int show_unreachable = 0;
  15 static int keep_cache_objects = 0;
  16 static unsigned char head_sha1[20];
  17
  18 static void check_connectivity(void)
  19 {
  20         int i;
  21
  22         /* Look up all the requirements, warn about missing objects.. */
  23         for (i = 0; i < nr_objs; i++) {
  24                 struct object *obj = objs[i];
  25                 struct object_list *refs;
  26
  27                 if (!obj->parsed) {
  28                         printf("missing %s %s\n", obj->type, sha1_to_hex(obj->sha1));
  29                         continue;
  30                 }
  31
  32                 for (refs = obj->refs; refs; refs = refs->next) {
  33                         if (refs->item->parsed)
  34                                 continue;
  35                         printf("broken link from %7s %s\n",
  36                                obj->type, sha1_to_hex(obj->sha1));
  37                         printf("              to %7s %s\n",
  38                                refs->item->type, sha1_to_hex(refs->item->sha1));
  39                 }
  40
  41                 /* Don't bother with tag reachability. */
  42                 if (obj->type == tag_type)
  43                         continue;
  44
  45                 if (show_unreachable && !(obj->flags & REACHABLE)) {
  46                         printf("unreachable %s %s\n", obj->type, sha1_to_hex(obj->sha1));
  47                         continue;
  48                 }
  49
  50                 if (!obj->used) {
  51                         printf("dangling %s %s\n", obj->type,
  52                                sha1_to_hex(obj->sha1));
  53                 }
  54         }
  55 }
  56
  57 /*
  58  * The entries in a tree are ordered in the _path_ order,
  59  * which means that a directory entry is ordered by adding
  60  * a slash to the end of it.
  61  *
  62  * So a directory called "a" is ordered _after_ a file
  63  * called "a.c", because "a/" sorts after "a.c".
  64  */
  65 #define TREE_UNORDERED (-1)
  66 #define TREE_HAS_DUPS  (-2)
  67
  68 static int verify_ordered(struct tree_entry_list *a, struct tree_entry_list *b)
  69 {
  70         int len1 = strlen(a->name);
  71         int len2 = strlen(b->name);
  72         int len = len1 < len2 ? len1 : len2;
  73         unsigned char c1, c2;
  74         int cmp;
  75
  76         cmp = memcmp(a->name, b->name, len);
  77         if (cmp < 0)
  78                 return 0;
  79         if (cmp > 0)
  80                 return TREE_UNORDERED;
  81
  82         /*
  83          * Ok, the first <len> characters are the same.
  84          * Now we need to order the next one, but turn
  85          * a '\0' into a '/' for a directory entry.
  86          */
  87         c1 = a->name[len];
  88         c2 = b->name[len];
  89         if (!c1 && !c2)
  90                 /*
  91                  * git-write-tree used to write out a nonsense tree that has
  92                  * entries with the same name, one blob and one tree.  Make
  93                  * sure we do not have duplicate entries.
  94                  */
  95                 return TREE_HAS_DUPS;
  96         if (!c1 && a->directory)
  97                 c1 = '/';
  98         if (!c2 && b->directory)
  99                 c2 = '/';
 100         return c1 < c2 ? 0 : TREE_UNORDERED;
 101 }
 102
 103 static int fsck_tree(struct tree *item)
 104 {
 105         int has_full_path = 0;
 106         struct tree_entry_list *entry, *last;
 107
 108         last = NULL;
 109         for (entry = item->entries; entry; entry = entry->next) {
 110                 if (strchr(entry->name, '/'))
 111                         has_full_path = 1;
 112
 113                 switch (entry->mode) {
 114                 /*
 115                  * Standard modes..
 116                  */
 117                 case S_IFREG | 0755:
 118                 case S_IFREG | 0644:
 119                 case S_IFLNK:
 120                 case S_IFDIR:
 121                         break;
 122                 /*
 123                  * This is nonstandard, but we had a few of these
 124                  * early on when we honored the full set of mode
 125                  * bits..
 126                  */
 127                 case S_IFREG | 0664:
 128                         break;
 129                 default:
 130                         printf("tree %s has entry %o %s\n",
 131                                 sha1_to_hex(item->object.sha1),
 132                                 entry->mode, entry->name);
 133                 }
 134
 135                 if (last) {
 136                         switch (verify_ordered(last, entry)) {
 137                         case TREE_UNORDERED:
 138                                 fprintf(stderr, "tree %s not ordered\n",
 139                                         sha1_to_hex(item->object.sha1));
 140                                 return -1;
 141                         case TREE_HAS_DUPS:
 142                                 fprintf(stderr, "tree %s has duplicate entries for '%s'\n",
 143                                         sha1_to_hex(item->object.sha1),
 144                                         entry->name);
 145                                 return -1;
 146                         default:
 147                                 break;
 148                         }
 149                 }
 150
 151                 last = entry;
 152         }
 153
 154         if (has_full_path) {
 155                 fprintf(stderr, "warning: fsck-cache: tree %s "
 156                         "has full pathnames in it\n",
 157                         sha1_to_hex(item->object.sha1));
 158         }
 159
 160         return 0;
 161 }
 162
 163 static int fsck_commit(struct commit *commit)
 164 {
 165         if (!commit->tree)
 166                 return -1;
 167         if (!commit->parents && show_root)
 168                 printf("root %s\n", sha1_to_hex(commit->object.sha1));
 169         if (!commit->date)
 170                 printf("bad commit date in %s\n",
 171                        sha1_to_hex(commit->object.sha1));
 172         return 0;
 173 }
 174
 175 static int fsck_tag(struct tag *tag)
 176 {
 177         struct object *tagged = tag->tagged;
 178
 179         if (!tagged) {
 180                 printf("bad object in tag %s\n", sha1_to_hex(tag->object.sha1));
 181                 return -1;
 182         }
 183         if (!show_tags)
 184                 return 0;
 185
 186         printf("tagged %s %s", tagged->type, sha1_to_hex(tagged->sha1));
 187         printf(" (%s) in %s\n", tag->tag, sha1_to_hex(tag->object.sha1));
 188         return 0;
 189 }
 190
 191 static int fsck_sha1(unsigned char *sha1)
 192 {
 193         struct object *obj = parse_object(sha1);
 194         if (!obj)
 195                 return -1;
 196         if (obj->type == blob_type)
 197                 return 0;
 198         if (obj->type == tree_type)
 199                 return fsck_tree((struct tree *) obj);
 200         if (obj->type == commit_type)
 201                 return fsck_commit((struct commit *) obj);
 202         if (obj->type == tag_type)
 203                 return fsck_tag((struct tag *) obj);
 204         return -1;
 205 }
 206
 207 /*
 208  * This is the sorting chunk size: make it reasonably
 209  * big so that we can sort well..
 210  */
 211 #define MAX_SHA1_ENTRIES (1024)
 212
 213 struct sha1_entry {
 214         unsigned long ino;
 215         unsigned char sha1[20];
 216 };
 217
 218 static struct {
 219         unsigned long nr;
 220         struct sha1_entry *entry[MAX_SHA1_ENTRIES];
 221 } sha1_list;
 222
 223 static int ino_compare(const void *_a, const void *_b)
 224 {
 225         const struct sha1_entry *a = _a, *b = _b;
 226         unsigned long ino1 = a->ino, ino2 = b->ino;
 227         return ino1 < ino2 ? -1 : ino1 > ino2 ? 1 : 0;
 228 }
 229
 230 static void fsck_sha1_list(void)
 231 {
 232         int i, nr = sha1_list.nr;
 233
 234         qsort(sha1_list.entry, nr, sizeof(struct sha1_entry *), ino_compare);
 235         for (i = 0; i < nr; i++) {
 236                 struct sha1_entry *entry = sha1_list.entry[i];
 237                 unsigned char *sha1 = entry->sha1;
 238
 239                 sha1_list.entry[i] = NULL;
 240                 if (fsck_sha1(sha1) < 0)
 241                         fprintf(stderr, "bad sha1 entry '%s'\n", sha1_to_hex(sha1));
 242                 free(entry);
 243         }
 244         sha1_list.nr = 0;
 245 }
 246
 247 static void add_sha1_list(unsigned char *sha1, unsigned long ino)
 248 {
 249         struct sha1_entry *entry = xmalloc(sizeof(*entry));
 250         int nr;
 251
 252         entry->ino = ino;
 253         memcpy(entry->sha1, sha1, 20);
 254         nr = sha1_list.nr;
 255         if (nr == MAX_SHA1_ENTRIES) {
 256                 fsck_sha1_list();
 257                 nr = 0;
 258         }
 259         sha1_list.entry[nr] = entry;
 260         sha1_list.nr = ++nr;
 261 }
 262
 263 static int fsck_dir(int i, char *path)
 264 {
 265         DIR *dir = opendir(path);
 266         struct dirent *de;
 267
 268         if (!dir) {
 269                 return error("missing sha1 directory '%s'", path);
 270         }
 271
 272         while ((de = readdir(dir)) != NULL) {
 273                 char name[100];
 274                 unsigned char sha1[20];
 275                 int len = strlen(de->d_name);
 276
 277                 switch (len) {
 278                 case 2:
 279                         if (de->d_name[1] != '.')
 280                                 break;
 281                 case 1:
 282                         if (de->d_name[0] != '.')
 283                                 break;
 284                         continue;
 285                 case 38:
 286                         sprintf(name, "%02x", i);
 287                         memcpy(name+2, de->d_name, len+1);
 288                         if (get_sha1_hex(name, sha1) < 0)
 289                                 break;
 290                         add_sha1_list(sha1, de->d_ino);
 291                         continue;
 292                 }
 293                 fprintf(stderr, "bad sha1 file: %s/%s\n", path, de->d_name);
 294         }
 295         closedir(dir);
 296         return 0;
 297 }
 298
 299 int main(int argc, char **argv)
 300 {
 301         int i, heads;
 302         char *sha1_dir;
 303
 304         for (i = 1; i < argc; i++) {
 305                 const char *arg = argv[i];
 306
 307                 if (!strcmp(arg, "--unreachable")) {
 308                         show_unreachable = 1;
 309                         continue;
 310                 }
 311                 if (!strcmp(arg, "--tags")) {
 312                         show_tags = 1;
 313                         continue;
 314                 }
 315                 if (!strcmp(arg, "--root")) {
 316                         show_root = 1;
 317                         continue;
 318                 }
 319                 if (!strcmp(arg, "--cache")) {
 320                         keep_cache_objects = 1;
 321                         continue;
 322                 }
 323                 if (*arg == '-')
 324                         usage("fsck-cache [--tags] [[--unreachable] [--cache] <head-sha1>*]");
 325         }
 326
 327         sha1_dir = get_object_directory();
 328         for (i = 0; i < 256; i++) {
 329                 static char dir[4096];
 330                 sprintf(dir, "%s/%02x", sha1_dir, i);
 331                 fsck_dir(i, dir);
 332         }
 333         fsck_sha1_list();
 334
 335         heads = 0;
 336         for (i = 1; i < argc; i++) {
 337                 const char *arg = argv[i];
 338
 339                 if (*arg == '-')
 340                         continue;
 341
 342                 if (!get_sha1(arg, head_sha1)) {
 343                         struct object *obj = lookup_object(head_sha1);
 344
 345                         /* Error is printed by lookup_object(). */
 346                         if (!obj)
 347                                 continue;
 348
 349                         obj->used = 1;
 350                         mark_reachable(obj, REACHABLE);
 351                         heads++;
 352                         continue;
 353                 }
 354                 error("expected sha1, got %s", arg);
 355         }
 356
 357         if (keep_cache_objects) {
 358                 int i;
 359                 read_cache();
 360                 for (i = 0; i < active_nr; i++) {
 361                         struct blob *blob = lookup_blob(active_cache[i]->sha1);
 362                         struct object *obj;
 363                         if (!blob)
 364                                 continue;
 365                         obj = &blob->object;
 366                         obj->used = 1;
 367                         mark_reachable(obj, REACHABLE);
 368                 }
 369         }
 370
 371         if (!heads && !keep_cache_objects) {
 372                 if (show_unreachable) {
 373                         fprintf(stderr, "unable to do reachability without a head nor --cache\n");
 374                         show_unreachable = 0;
 375                 }
 376                 if (!heads)
 377                         fprintf(stderr, "expect dangling commits - potential heads - due to lack of head information\n");
 378         }
 379
 380         check_connectivity();
 381         return 0;
 382 }