]>
| Commit | Line | Data |
|---|---|---|
| 1 | #define USE_THE_REPOSITORY_VARIABLE | |
| 2 | #include "builtin.h" | |
| 3 | #include "gettext.h" | |
| 4 | #include "hex.h" | |
| 5 | #include "config.h" | |
| 6 | #include "commit.h" | |
| 7 | #include "tree.h" | |
| 8 | #include "blob.h" | |
| 9 | #include "tag.h" | |
| 10 | #include "refs.h" | |
| 11 | #include "pack.h" | |
| 12 | #include "cache-tree.h" | |
| 13 | #include "fsck.h" | |
| 14 | #include "parse-options.h" | |
| 15 | #include "progress.h" | |
| 16 | #include "streaming.h" | |
| 17 | #include "packfile.h" | |
| 18 | #include "object-file.h" | |
| 19 | #include "object-name.h" | |
| 20 | #include "odb.h" | |
| 21 | #include "path.h" | |
| 22 | #include "read-cache-ll.h" | |
| 23 | #include "replace-object.h" | |
| 24 | #include "resolve-undo.h" | |
| 25 | #include "run-command.h" | |
| 26 | #include "sparse-index.h" | |
| 27 | #include "worktree.h" | |
| 28 | #include "pack-revindex.h" | |
| 29 | #include "pack-bitmap.h" | |
| 30 | ||
| 31 | #define REACHABLE 0x0001 | |
| 32 | #define SEEN 0x0002 | |
| 33 | #define HAS_OBJ 0x0004 | |
| 34 | /* This flag is set if something points to this object. */ | |
| 35 | #define USED 0x0008 | |
| 36 | ||
| 37 | static int show_root; | |
| 38 | static int show_tags; | |
| 39 | static int show_unreachable; | |
| 40 | static int include_reflogs = 1; | |
| 41 | static int check_full = 1; | |
| 42 | static int connectivity_only; | |
| 43 | static int check_strict; | |
| 44 | static int keep_cache_objects; | |
| 45 | static struct fsck_options fsck_walk_options = FSCK_OPTIONS_DEFAULT; | |
| 46 | static struct fsck_options fsck_obj_options = FSCK_OPTIONS_DEFAULT; | |
| 47 | static int errors_found; | |
| 48 | static int write_lost_and_found; | |
| 49 | static int verbose; | |
| 50 | static int show_progress = -1; | |
| 51 | static int show_dangling = 1; | |
| 52 | static int name_objects; | |
| 53 | static int check_references = 1; | |
| 54 | #define ERROR_OBJECT 01 | |
| 55 | #define ERROR_REACHABLE 02 | |
| 56 | #define ERROR_PACK 04 | |
| 57 | #define ERROR_REFS 010 | |
| 58 | #define ERROR_COMMIT_GRAPH 020 | |
| 59 | #define ERROR_MULTI_PACK_INDEX 040 | |
| 60 | #define ERROR_PACK_REV_INDEX 0100 | |
| 61 | #define ERROR_BITMAP 0200 | |
| 62 | ||
| 63 | static const char *describe_object(const struct object_id *oid) | |
| 64 | { | |
| 65 | return fsck_describe_object(&fsck_walk_options, oid); | |
| 66 | } | |
| 67 | ||
| 68 | static const char *printable_type(const struct object_id *oid, | |
| 69 | enum object_type type) | |
| 70 | { | |
| 71 | const char *ret; | |
| 72 | ||
| 73 | if (type == OBJ_NONE) | |
| 74 | type = odb_read_object_info(the_repository->objects, | |
| 75 | oid, NULL); | |
| 76 | ||
| 77 | ret = type_name(type); | |
| 78 | if (!ret) | |
| 79 | ret = _("unknown"); | |
| 80 | ||
| 81 | return ret; | |
| 82 | } | |
| 83 | ||
| 84 | static int objerror(struct object *obj, const char *err) | |
| 85 | { | |
| 86 | errors_found |= ERROR_OBJECT; | |
| 87 | /* TRANSLATORS: e.g. error in tree 01bfda: <more explanation> */ | |
| 88 | fprintf_ln(stderr, _("error in %s %s: %s"), | |
| 89 | printable_type(&obj->oid, obj->type), | |
| 90 | describe_object(&obj->oid), err); | |
| 91 | return -1; | |
| 92 | } | |
| 93 | ||
| 94 | static int fsck_objects_error_func(struct fsck_options *o UNUSED, | |
| 95 | void *fsck_report, | |
| 96 | enum fsck_msg_type msg_type, | |
| 97 | enum fsck_msg_id msg_id UNUSED, | |
| 98 | const char *message) | |
| 99 | { | |
| 100 | struct fsck_object_report *report = fsck_report; | |
| 101 | const struct object_id *oid = report->oid; | |
| 102 | enum object_type object_type = report->object_type; | |
| 103 | ||
| 104 | switch (msg_type) { | |
| 105 | case FSCK_WARN: | |
| 106 | /* TRANSLATORS: e.g. warning in tree 01bfda: <more explanation> */ | |
| 107 | fprintf_ln(stderr, _("warning in %s %s: %s"), | |
| 108 | printable_type(oid, object_type), | |
| 109 | describe_object(oid), message); | |
| 110 | return 0; | |
| 111 | case FSCK_ERROR: | |
| 112 | /* TRANSLATORS: e.g. error in tree 01bfda: <more explanation> */ | |
| 113 | fprintf_ln(stderr, _("error in %s %s: %s"), | |
| 114 | printable_type(oid, object_type), | |
| 115 | describe_object(oid), message); | |
| 116 | return 1; | |
| 117 | default: | |
| 118 | BUG("%d (FSCK_IGNORE?) should never trigger this callback", | |
| 119 | msg_type); | |
| 120 | } | |
| 121 | } | |
| 122 | ||
| 123 | static struct object_array pending; | |
| 124 | ||
| 125 | static int mark_object(struct object *obj, enum object_type type, | |
| 126 | void *data, struct fsck_options *options UNUSED) | |
| 127 | { | |
| 128 | struct object *parent = data; | |
| 129 | ||
| 130 | /* | |
| 131 | * The only case data is NULL or type is OBJ_ANY is when | |
| 132 | * mark_object_reachable() calls us. All the callers of | |
| 133 | * that function has non-NULL obj hence ... | |
| 134 | */ | |
| 135 | if (!obj) { | |
| 136 | /* ... these references to parent->fld are safe here */ | |
| 137 | printf_ln(_("broken link from %7s %s"), | |
| 138 | printable_type(&parent->oid, parent->type), | |
| 139 | describe_object(&parent->oid)); | |
| 140 | printf_ln(_("broken link from %7s %s"), | |
| 141 | (type == OBJ_ANY ? _("unknown") : type_name(type)), | |
| 142 | _("unknown")); | |
| 143 | errors_found |= ERROR_REACHABLE; | |
| 144 | return 1; | |
| 145 | } | |
| 146 | ||
| 147 | if (type != OBJ_ANY && obj->type != type) | |
| 148 | /* ... and the reference to parent is safe here */ | |
| 149 | objerror(parent, _("wrong object type in link")); | |
| 150 | ||
| 151 | if (obj->flags & REACHABLE) | |
| 152 | return 0; | |
| 153 | obj->flags |= REACHABLE; | |
| 154 | ||
| 155 | if (is_promisor_object(the_repository, &obj->oid)) | |
| 156 | /* | |
| 157 | * Further recursion does not need to be performed on this | |
| 158 | * object since it is a promisor object (so it does not need to | |
| 159 | * be added to "pending"). | |
| 160 | */ | |
| 161 | return 0; | |
| 162 | ||
| 163 | if (!(obj->flags & HAS_OBJ)) { | |
| 164 | if (parent && !odb_has_object(the_repository->objects, &obj->oid, 1)) { | |
| 165 | printf_ln(_("broken link from %7s %s\n" | |
| 166 | " to %7s %s"), | |
| 167 | printable_type(&parent->oid, parent->type), | |
| 168 | describe_object(&parent->oid), | |
| 169 | printable_type(&obj->oid, obj->type), | |
| 170 | describe_object(&obj->oid)); | |
| 171 | errors_found |= ERROR_REACHABLE; | |
| 172 | } | |
| 173 | return 1; | |
| 174 | } | |
| 175 | ||
| 176 | add_object_array(obj, NULL, &pending); | |
| 177 | return 0; | |
| 178 | } | |
| 179 | ||
| 180 | static void mark_object_reachable(struct object *obj) | |
| 181 | { | |
| 182 | mark_object(obj, OBJ_ANY, NULL, NULL); | |
| 183 | } | |
| 184 | ||
| 185 | static int traverse_one_object(struct object *obj) | |
| 186 | { | |
| 187 | int result = fsck_walk(obj, obj, &fsck_walk_options); | |
| 188 | ||
| 189 | if (obj->type == OBJ_TREE) { | |
| 190 | struct tree *tree = (struct tree *)obj; | |
| 191 | free_tree_buffer(tree); | |
| 192 | } | |
| 193 | return result; | |
| 194 | } | |
| 195 | ||
| 196 | static int traverse_reachable(void) | |
| 197 | { | |
| 198 | struct progress *progress = NULL; | |
| 199 | unsigned int nr = 0; | |
| 200 | int result = 0; | |
| 201 | if (show_progress) | |
| 202 | progress = start_delayed_progress(the_repository, | |
| 203 | _("Checking connectivity"), 0); | |
| 204 | while (pending.nr) { | |
| 205 | result |= traverse_one_object(object_array_pop(&pending)); | |
| 206 | display_progress(progress, ++nr); | |
| 207 | } | |
| 208 | stop_progress(&progress); | |
| 209 | return !!result; | |
| 210 | } | |
| 211 | ||
| 212 | static int mark_used(struct object *obj, enum object_type type UNUSED, | |
| 213 | void *data UNUSED, struct fsck_options *options UNUSED) | |
| 214 | { | |
| 215 | if (!obj) | |
| 216 | return 1; | |
| 217 | obj->flags |= USED; | |
| 218 | return 0; | |
| 219 | } | |
| 220 | ||
| 221 | static void mark_unreachable_referents(const struct object_id *oid) | |
| 222 | { | |
| 223 | struct fsck_options options = FSCK_OPTIONS_DEFAULT; | |
| 224 | struct object *obj = lookup_object(the_repository, oid); | |
| 225 | ||
| 226 | if (!obj || !(obj->flags & HAS_OBJ)) | |
| 227 | return; /* not part of our original set */ | |
| 228 | if (obj->flags & REACHABLE) | |
| 229 | return; /* reachable objects already traversed */ | |
| 230 | ||
| 231 | /* | |
| 232 | * Avoid passing OBJ_NONE to fsck_walk, which will parse the object | |
| 233 | * (and we want to avoid parsing blobs). | |
| 234 | */ | |
| 235 | if (obj->type == OBJ_NONE) { | |
| 236 | enum object_type type = odb_read_object_info(the_repository->objects, | |
| 237 | &obj->oid, NULL); | |
| 238 | if (type > 0) | |
| 239 | object_as_type(obj, type, 0); | |
| 240 | } | |
| 241 | ||
| 242 | options.walk = mark_used; | |
| 243 | fsck_walk(obj, NULL, &options); | |
| 244 | if (obj->type == OBJ_TREE) | |
| 245 | free_tree_buffer((struct tree *)obj); | |
| 246 | } | |
| 247 | ||
| 248 | static int mark_loose_unreachable_referents(const struct object_id *oid, | |
| 249 | const char *path UNUSED, | |
| 250 | void *data UNUSED) | |
| 251 | { | |
| 252 | mark_unreachable_referents(oid); | |
| 253 | return 0; | |
| 254 | } | |
| 255 | ||
| 256 | static int mark_packed_unreachable_referents(const struct object_id *oid, | |
| 257 | struct packed_git *pack UNUSED, | |
| 258 | uint32_t pos UNUSED, | |
| 259 | void *data UNUSED) | |
| 260 | { | |
| 261 | mark_unreachable_referents(oid); | |
| 262 | return 0; | |
| 263 | } | |
| 264 | ||
| 265 | /* | |
| 266 | * Check a single reachable object | |
| 267 | */ | |
| 268 | static void check_reachable_object(struct object *obj) | |
| 269 | { | |
| 270 | /* | |
| 271 | * We obviously want the object to be parsed, | |
| 272 | * except if it was in a pack-file and we didn't | |
| 273 | * do a full fsck | |
| 274 | */ | |
| 275 | if (!(obj->flags & HAS_OBJ)) { | |
| 276 | if (is_promisor_object(the_repository, &obj->oid)) | |
| 277 | return; | |
| 278 | if (has_object_pack(the_repository, &obj->oid)) | |
| 279 | return; /* it is in pack - forget about it */ | |
| 280 | printf_ln(_("missing %s %s"), | |
| 281 | printable_type(&obj->oid, obj->type), | |
| 282 | describe_object(&obj->oid)); | |
| 283 | errors_found |= ERROR_REACHABLE; | |
| 284 | return; | |
| 285 | } | |
| 286 | } | |
| 287 | ||
| 288 | /* | |
| 289 | * Check a single unreachable object | |
| 290 | */ | |
| 291 | static void check_unreachable_object(struct object *obj) | |
| 292 | { | |
| 293 | /* | |
| 294 | * Missing unreachable object? Ignore it. It's not like | |
| 295 | * we miss it (since it can't be reached), nor do we want | |
| 296 | * to complain about it being unreachable (since it does | |
| 297 | * not exist). | |
| 298 | */ | |
| 299 | if (!(obj->flags & HAS_OBJ)) | |
| 300 | return; | |
| 301 | ||
| 302 | /* | |
| 303 | * Unreachable object that exists? Show it if asked to, | |
| 304 | * since this is something that is prunable. | |
| 305 | */ | |
| 306 | if (show_unreachable) { | |
| 307 | printf_ln(_("unreachable %s %s"), | |
| 308 | printable_type(&obj->oid, obj->type), | |
| 309 | describe_object(&obj->oid)); | |
| 310 | return; | |
| 311 | } | |
| 312 | ||
| 313 | /* | |
| 314 | * "!USED" means that nothing at all points to it, including | |
| 315 | * other unreachable objects. In other words, it's the "tip" | |
| 316 | * of some set of unreachable objects, usually a commit that | |
| 317 | * got dropped. | |
| 318 | * | |
| 319 | * Such starting points are more interesting than some random | |
| 320 | * set of unreachable objects, so we show them even if the user | |
| 321 | * hasn't asked for _all_ unreachable objects. If you have | |
| 322 | * deleted a branch by mistake, this is a prime candidate to | |
| 323 | * start looking at, for example. | |
| 324 | */ | |
| 325 | if (!(obj->flags & USED)) { | |
| 326 | if (show_dangling) | |
| 327 | printf_ln(_("dangling %s %s"), | |
| 328 | printable_type(&obj->oid, obj->type), | |
| 329 | describe_object(&obj->oid)); | |
| 330 | if (write_lost_and_found) { | |
| 331 | char *filename = repo_git_path(the_repository, "lost-found/%s/%s", | |
| 332 | obj->type == OBJ_COMMIT ? "commit" : "other", | |
| 333 | describe_object(&obj->oid)); | |
| 334 | FILE *f; | |
| 335 | ||
| 336 | if (safe_create_leading_directories_const(the_repository, filename)) { | |
| 337 | error(_("could not create lost-found")); | |
| 338 | free(filename); | |
| 339 | return; | |
| 340 | } | |
| 341 | f = xfopen(filename, "w"); | |
| 342 | if (obj->type == OBJ_BLOB) { | |
| 343 | if (stream_blob_to_fd(fileno(f), &obj->oid, NULL, 1)) | |
| 344 | die_errno(_("could not write '%s'"), filename); | |
| 345 | } else | |
| 346 | fprintf(f, "%s\n", describe_object(&obj->oid)); | |
| 347 | if (fclose(f)) | |
| 348 | die_errno(_("could not finish '%s'"), | |
| 349 | filename); | |
| 350 | free(filename); | |
| 351 | } | |
| 352 | return; | |
| 353 | } | |
| 354 | ||
| 355 | /* | |
| 356 | * Otherwise? It's there, it's unreachable, and some other unreachable | |
| 357 | * object points to it. Ignore it - it's not interesting, and we showed | |
| 358 | * all the interesting cases above. | |
| 359 | */ | |
| 360 | } | |
| 361 | ||
| 362 | static void check_object(struct object *obj) | |
| 363 | { | |
| 364 | if (verbose) | |
| 365 | fprintf_ln(stderr, _("Checking %s"), describe_object(&obj->oid)); | |
| 366 | ||
| 367 | if (obj->flags & REACHABLE) | |
| 368 | check_reachable_object(obj); | |
| 369 | else | |
| 370 | check_unreachable_object(obj); | |
| 371 | } | |
| 372 | ||
| 373 | static void check_connectivity(void) | |
| 374 | { | |
| 375 | int i, max; | |
| 376 | ||
| 377 | /* Traverse the pending reachable objects */ | |
| 378 | traverse_reachable(); | |
| 379 | ||
| 380 | /* | |
| 381 | * With --connectivity-only, we won't have actually opened and marked | |
| 382 | * unreachable objects with USED. Do that now to make --dangling, etc | |
| 383 | * accurate. | |
| 384 | */ | |
| 385 | if (connectivity_only && (show_dangling || write_lost_and_found)) { | |
| 386 | /* | |
| 387 | * Even though we already have a "struct object" for each of | |
| 388 | * these in memory, we must not iterate over the internal | |
| 389 | * object hash as we do below. Our loop would potentially | |
| 390 | * resize the hash, making our iteration invalid. | |
| 391 | * | |
| 392 | * Instead, we'll just go back to the source list of objects, | |
| 393 | * and ignore any that weren't present in our earlier | |
| 394 | * traversal. | |
| 395 | */ | |
| 396 | for_each_loose_object(the_repository->objects, | |
| 397 | mark_loose_unreachable_referents, NULL, 0); | |
| 398 | for_each_packed_object(the_repository, | |
| 399 | mark_packed_unreachable_referents, | |
| 400 | NULL, | |
| 401 | 0); | |
| 402 | } | |
| 403 | ||
| 404 | /* Look up all the requirements, warn about missing objects.. */ | |
| 405 | max = get_max_object_index(the_repository); | |
| 406 | if (verbose) | |
| 407 | fprintf_ln(stderr, _("Checking connectivity (%d objects)"), max); | |
| 408 | ||
| 409 | for (i = 0; i < max; i++) { | |
| 410 | struct object *obj = get_indexed_object(the_repository, i); | |
| 411 | ||
| 412 | if (obj) | |
| 413 | check_object(obj); | |
| 414 | } | |
| 415 | } | |
| 416 | ||
| 417 | static int fsck_obj(struct object *obj, void *buffer, unsigned long size) | |
| 418 | { | |
| 419 | int err; | |
| 420 | ||
| 421 | if (obj->flags & SEEN) | |
| 422 | return 0; | |
| 423 | obj->flags |= SEEN; | |
| 424 | ||
| 425 | if (verbose) | |
| 426 | fprintf_ln(stderr, _("Checking %s %s"), | |
| 427 | printable_type(&obj->oid, obj->type), | |
| 428 | describe_object(&obj->oid)); | |
| 429 | ||
| 430 | if (fsck_walk(obj, NULL, &fsck_obj_options)) | |
| 431 | objerror(obj, _("broken links")); | |
| 432 | err = fsck_object(obj, buffer, size, &fsck_obj_options); | |
| 433 | if (err) | |
| 434 | goto out; | |
| 435 | ||
| 436 | if (obj->type == OBJ_COMMIT) { | |
| 437 | struct commit *commit = (struct commit *) obj; | |
| 438 | ||
| 439 | if (!commit->parents && show_root) | |
| 440 | printf_ln(_("root %s"), | |
| 441 | describe_object(&commit->object.oid)); | |
| 442 | } | |
| 443 | ||
| 444 | if (obj->type == OBJ_TAG) { | |
| 445 | struct tag *tag = (struct tag *) obj; | |
| 446 | ||
| 447 | if (show_tags && tag->tagged) { | |
| 448 | printf_ln(_("tagged %s %s (%s) in %s"), | |
| 449 | printable_type(&tag->tagged->oid, tag->tagged->type), | |
| 450 | describe_object(&tag->tagged->oid), | |
| 451 | tag->tag, | |
| 452 | describe_object(&tag->object.oid)); | |
| 453 | } | |
| 454 | } | |
| 455 | ||
| 456 | out: | |
| 457 | if (obj->type == OBJ_TREE) | |
| 458 | free_tree_buffer((struct tree *)obj); | |
| 459 | return err; | |
| 460 | } | |
| 461 | ||
| 462 | static int fsck_obj_buffer(const struct object_id *oid, enum object_type type, | |
| 463 | unsigned long size, void *buffer, int *eaten) | |
| 464 | { | |
| 465 | /* | |
| 466 | * Note, buffer may be NULL if type is OBJ_BLOB. See | |
| 467 | * verify_packfile(), data_valid variable for details. | |
| 468 | */ | |
| 469 | struct object *obj; | |
| 470 | obj = parse_object_buffer(the_repository, oid, type, size, buffer, | |
| 471 | eaten); | |
| 472 | if (!obj) { | |
| 473 | errors_found |= ERROR_OBJECT; | |
| 474 | return error(_("%s: object corrupt or missing"), | |
| 475 | oid_to_hex(oid)); | |
| 476 | } | |
| 477 | obj->flags &= ~(REACHABLE | SEEN); | |
| 478 | obj->flags |= HAS_OBJ; | |
| 479 | return fsck_obj(obj, buffer, size); | |
| 480 | } | |
| 481 | ||
| 482 | static int default_refs; | |
| 483 | ||
| 484 | static void fsck_handle_reflog_oid(const char *refname, struct object_id *oid, | |
| 485 | timestamp_t timestamp) | |
| 486 | { | |
| 487 | struct object *obj; | |
| 488 | ||
| 489 | if (!is_null_oid(oid)) { | |
| 490 | obj = lookup_object(the_repository, oid); | |
| 491 | if (obj && (obj->flags & HAS_OBJ)) { | |
| 492 | if (timestamp) | |
| 493 | fsck_put_object_name(&fsck_walk_options, oid, | |
| 494 | "%s@{%"PRItime"}", | |
| 495 | refname, timestamp); | |
| 496 | obj->flags |= USED; | |
| 497 | mark_object_reachable(obj); | |
| 498 | } else if (!is_promisor_object(the_repository, oid)) { | |
| 499 | error(_("%s: invalid reflog entry %s"), | |
| 500 | refname, oid_to_hex(oid)); | |
| 501 | errors_found |= ERROR_REACHABLE; | |
| 502 | } | |
| 503 | } | |
| 504 | } | |
| 505 | ||
| 506 | static int fsck_handle_reflog_ent(const char *refname, | |
| 507 | struct object_id *ooid, struct object_id *noid, | |
| 508 | const char *email UNUSED, | |
| 509 | timestamp_t timestamp, int tz UNUSED, | |
| 510 | const char *message UNUSED, void *cb_data UNUSED) | |
| 511 | { | |
| 512 | if (verbose) | |
| 513 | fprintf_ln(stderr, _("Checking reflog %s->%s"), | |
| 514 | oid_to_hex(ooid), oid_to_hex(noid)); | |
| 515 | ||
| 516 | fsck_handle_reflog_oid(refname, ooid, 0); | |
| 517 | fsck_handle_reflog_oid(refname, noid, timestamp); | |
| 518 | return 0; | |
| 519 | } | |
| 520 | ||
| 521 | static int fsck_handle_reflog(const char *logname, void *cb_data) | |
| 522 | { | |
| 523 | struct strbuf refname = STRBUF_INIT; | |
| 524 | ||
| 525 | strbuf_worktree_ref(cb_data, &refname, logname); | |
| 526 | refs_for_each_reflog_ent(get_main_ref_store(the_repository), | |
| 527 | refname.buf, fsck_handle_reflog_ent, | |
| 528 | NULL); | |
| 529 | strbuf_release(&refname); | |
| 530 | return 0; | |
| 531 | } | |
| 532 | ||
| 533 | static int fsck_handle_ref(const struct reference *ref, void *cb_data UNUSED) | |
| 534 | { | |
| 535 | struct object *obj; | |
| 536 | ||
| 537 | obj = parse_object(the_repository, ref->oid); | |
| 538 | if (!obj) { | |
| 539 | if (is_promisor_object(the_repository, ref->oid)) { | |
| 540 | /* | |
| 541 | * Increment default_refs anyway, because this is a | |
| 542 | * valid ref. | |
| 543 | */ | |
| 544 | default_refs++; | |
| 545 | return 0; | |
| 546 | } | |
| 547 | error(_("%s: invalid sha1 pointer %s"), | |
| 548 | ref->name, oid_to_hex(ref->oid)); | |
| 549 | errors_found |= ERROR_REACHABLE; | |
| 550 | /* We'll continue with the rest despite the error.. */ | |
| 551 | return 0; | |
| 552 | } | |
| 553 | if (obj->type != OBJ_COMMIT && is_branch(ref->name)) { | |
| 554 | error(_("%s: not a commit"), ref->name); | |
| 555 | errors_found |= ERROR_REFS; | |
| 556 | } | |
| 557 | default_refs++; | |
| 558 | obj->flags |= USED; | |
| 559 | fsck_put_object_name(&fsck_walk_options, | |
| 560 | ref->oid, "%s", ref->name); | |
| 561 | mark_object_reachable(obj); | |
| 562 | ||
| 563 | return 0; | |
| 564 | } | |
| 565 | ||
| 566 | static int fsck_head_link(const char *head_ref_name, | |
| 567 | const char **head_points_at, | |
| 568 | struct object_id *head_oid); | |
| 569 | ||
| 570 | static void get_default_heads(void) | |
| 571 | { | |
| 572 | struct worktree **worktrees, **p; | |
| 573 | const char *head_points_at; | |
| 574 | struct object_id head_oid; | |
| 575 | ||
| 576 | refs_for_each_rawref(get_main_ref_store(the_repository), | |
| 577 | fsck_handle_ref, NULL); | |
| 578 | ||
| 579 | worktrees = get_worktrees(); | |
| 580 | for (p = worktrees; *p; p++) { | |
| 581 | struct worktree *wt = *p; | |
| 582 | struct strbuf refname = STRBUF_INIT; | |
| 583 | ||
| 584 | strbuf_worktree_ref(wt, &refname, "HEAD"); | |
| 585 | fsck_head_link(refname.buf, &head_points_at, &head_oid); | |
| 586 | if (head_points_at && !is_null_oid(&head_oid)) { | |
| 587 | struct reference ref = { | |
| 588 | .name = refname.buf, | |
| 589 | .oid = &head_oid, | |
| 590 | }; | |
| 591 | ||
| 592 | fsck_handle_ref(&ref, NULL); | |
| 593 | } | |
| 594 | strbuf_release(&refname); | |
| 595 | ||
| 596 | if (include_reflogs) | |
| 597 | refs_for_each_reflog(get_worktree_ref_store(wt), | |
| 598 | fsck_handle_reflog, wt); | |
| 599 | } | |
| 600 | free_worktrees(worktrees); | |
| 601 | ||
| 602 | /* | |
| 603 | * Not having any default heads isn't really fatal, but | |
| 604 | * it does mean that "--unreachable" no longer makes any | |
| 605 | * sense (since in this case everything will obviously | |
| 606 | * be unreachable by definition. | |
| 607 | * | |
| 608 | * Showing dangling objects is valid, though (as those | |
| 609 | * dangling objects are likely lost heads). | |
| 610 | * | |
| 611 | * So we just print a warning about it, and clear the | |
| 612 | * "show_unreachable" flag. | |
| 613 | */ | |
| 614 | if (!default_refs) { | |
| 615 | fprintf_ln(stderr, _("notice: No default references")); | |
| 616 | show_unreachable = 0; | |
| 617 | } | |
| 618 | } | |
| 619 | ||
| 620 | struct for_each_loose_cb | |
| 621 | { | |
| 622 | struct progress *progress; | |
| 623 | }; | |
| 624 | ||
| 625 | static int fsck_loose(const struct object_id *oid, const char *path, | |
| 626 | void *data UNUSED) | |
| 627 | { | |
| 628 | struct object *obj; | |
| 629 | enum object_type type = OBJ_NONE; | |
| 630 | unsigned long size; | |
| 631 | void *contents = NULL; | |
| 632 | int eaten; | |
| 633 | struct object_info oi = OBJECT_INFO_INIT; | |
| 634 | struct object_id real_oid = *null_oid(the_hash_algo); | |
| 635 | int err = 0; | |
| 636 | ||
| 637 | oi.sizep = &size; | |
| 638 | oi.typep = &type; | |
| 639 | ||
| 640 | if (read_loose_object(the_repository, path, oid, &real_oid, &contents, &oi) < 0) { | |
| 641 | if (contents && !oideq(&real_oid, oid)) | |
| 642 | err = error(_("%s: hash-path mismatch, found at: %s"), | |
| 643 | oid_to_hex(&real_oid), path); | |
| 644 | else | |
| 645 | err = error(_("%s: object corrupt or missing: %s"), | |
| 646 | oid_to_hex(oid), path); | |
| 647 | } | |
| 648 | if (err < 0) { | |
| 649 | errors_found |= ERROR_OBJECT; | |
| 650 | free(contents); | |
| 651 | return 0; /* keep checking other objects */ | |
| 652 | } | |
| 653 | ||
| 654 | if (!contents && type != OBJ_BLOB) | |
| 655 | BUG("read_loose_object streamed a non-blob"); | |
| 656 | ||
| 657 | obj = parse_object_buffer(the_repository, oid, type, size, | |
| 658 | contents, &eaten); | |
| 659 | ||
| 660 | if (!obj) { | |
| 661 | errors_found |= ERROR_OBJECT; | |
| 662 | error(_("%s: object could not be parsed: %s"), | |
| 663 | oid_to_hex(oid), path); | |
| 664 | if (!eaten) | |
| 665 | free(contents); | |
| 666 | return 0; /* keep checking other objects */ | |
| 667 | } | |
| 668 | ||
| 669 | obj->flags &= ~(REACHABLE | SEEN); | |
| 670 | obj->flags |= HAS_OBJ; | |
| 671 | if (fsck_obj(obj, contents, size)) | |
| 672 | errors_found |= ERROR_OBJECT; | |
| 673 | ||
| 674 | if (!eaten) | |
| 675 | free(contents); | |
| 676 | return 0; /* keep checking other objects, even if we saw an error */ | |
| 677 | } | |
| 678 | ||
| 679 | static int fsck_cruft(const char *basename, const char *path, | |
| 680 | void *data UNUSED) | |
| 681 | { | |
| 682 | if (!starts_with(basename, "tmp_obj_")) | |
| 683 | fprintf_ln(stderr, _("bad sha1 file: %s"), path); | |
| 684 | return 0; | |
| 685 | } | |
| 686 | ||
| 687 | static int fsck_subdir(unsigned int nr, const char *path UNUSED, void *data) | |
| 688 | { | |
| 689 | struct for_each_loose_cb *cb_data = data; | |
| 690 | struct progress *progress = cb_data->progress; | |
| 691 | display_progress(progress, nr + 1); | |
| 692 | return 0; | |
| 693 | } | |
| 694 | ||
| 695 | static void fsck_source(struct odb_source *source) | |
| 696 | { | |
| 697 | struct progress *progress = NULL; | |
| 698 | struct for_each_loose_cb cb_data = { | |
| 699 | .progress = progress, | |
| 700 | }; | |
| 701 | ||
| 702 | if (verbose) | |
| 703 | fprintf_ln(stderr, _("Checking object directory")); | |
| 704 | ||
| 705 | if (show_progress) | |
| 706 | progress = start_progress(the_repository, | |
| 707 | _("Checking object directories"), 256); | |
| 708 | ||
| 709 | for_each_loose_file_in_source(source, fsck_loose, | |
| 710 | fsck_cruft, fsck_subdir, &cb_data); | |
| 711 | display_progress(progress, 256); | |
| 712 | stop_progress(&progress); | |
| 713 | } | |
| 714 | ||
| 715 | static int fsck_head_link(const char *head_ref_name, | |
| 716 | const char **head_points_at, | |
| 717 | struct object_id *head_oid) | |
| 718 | { | |
| 719 | int null_is_error = 0; | |
| 720 | ||
| 721 | if (verbose) | |
| 722 | fprintf_ln(stderr, _("Checking %s link"), head_ref_name); | |
| 723 | ||
| 724 | *head_points_at = refs_resolve_ref_unsafe(get_main_ref_store(the_repository), | |
| 725 | head_ref_name, 0, head_oid, | |
| 726 | NULL); | |
| 727 | if (!*head_points_at) { | |
| 728 | errors_found |= ERROR_REFS; | |
| 729 | return error(_("invalid %s"), head_ref_name); | |
| 730 | } | |
| 731 | if (!strcmp(*head_points_at, head_ref_name)) | |
| 732 | /* detached HEAD */ | |
| 733 | null_is_error = 1; | |
| 734 | else if (!starts_with(*head_points_at, "refs/heads/")) { | |
| 735 | errors_found |= ERROR_REFS; | |
| 736 | return error(_("%s points to something strange (%s)"), | |
| 737 | head_ref_name, *head_points_at); | |
| 738 | } | |
| 739 | if (is_null_oid(head_oid)) { | |
| 740 | if (null_is_error) { | |
| 741 | errors_found |= ERROR_REFS; | |
| 742 | return error(_("%s: detached HEAD points at nothing"), | |
| 743 | head_ref_name); | |
| 744 | } | |
| 745 | fprintf_ln(stderr, | |
| 746 | _("notice: %s points to an unborn branch (%s)"), | |
| 747 | head_ref_name, *head_points_at + 11); | |
| 748 | } | |
| 749 | return 0; | |
| 750 | } | |
| 751 | ||
| 752 | static int fsck_cache_tree(struct cache_tree *it, const char *index_path) | |
| 753 | { | |
| 754 | int i; | |
| 755 | int err = 0; | |
| 756 | ||
| 757 | if (verbose) | |
| 758 | fprintf_ln(stderr, _("Checking cache tree of %s"), index_path); | |
| 759 | ||
| 760 | if (0 <= it->entry_count) { | |
| 761 | struct object *obj = parse_object(the_repository, &it->oid); | |
| 762 | if (!obj) { | |
| 763 | error(_("%s: invalid sha1 pointer in cache-tree of %s"), | |
| 764 | oid_to_hex(&it->oid), index_path); | |
| 765 | errors_found |= ERROR_REFS; | |
| 766 | return 1; | |
| 767 | } | |
| 768 | obj->flags |= USED; | |
| 769 | fsck_put_object_name(&fsck_walk_options, &it->oid, ":"); | |
| 770 | mark_object_reachable(obj); | |
| 771 | if (obj->type != OBJ_TREE) | |
| 772 | err |= objerror(obj, _("non-tree in cache-tree")); | |
| 773 | } | |
| 774 | for (i = 0; i < it->subtree_nr; i++) | |
| 775 | err |= fsck_cache_tree(it->down[i]->cache_tree, index_path); | |
| 776 | return err; | |
| 777 | } | |
| 778 | ||
| 779 | static int fsck_resolve_undo(struct index_state *istate, | |
| 780 | const char *index_path) | |
| 781 | { | |
| 782 | struct string_list_item *item; | |
| 783 | struct string_list *resolve_undo = istate->resolve_undo; | |
| 784 | ||
| 785 | if (!resolve_undo) | |
| 786 | return 0; | |
| 787 | ||
| 788 | for_each_string_list_item(item, resolve_undo) { | |
| 789 | const char *path = item->string; | |
| 790 | struct resolve_undo_info *ru = item->util; | |
| 791 | int i; | |
| 792 | ||
| 793 | if (!ru) | |
| 794 | continue; | |
| 795 | for (i = 0; i < 3; i++) { | |
| 796 | struct object *obj; | |
| 797 | ||
| 798 | if (!ru->mode[i] || !S_ISREG(ru->mode[i])) | |
| 799 | continue; | |
| 800 | ||
| 801 | obj = parse_object(the_repository, &ru->oid[i]); | |
| 802 | if (!obj) { | |
| 803 | error(_("%s: invalid sha1 pointer in resolve-undo of %s"), | |
| 804 | oid_to_hex(&ru->oid[i]), | |
| 805 | index_path); | |
| 806 | errors_found |= ERROR_REFS; | |
| 807 | continue; | |
| 808 | } | |
| 809 | obj->flags |= USED; | |
| 810 | fsck_put_object_name(&fsck_walk_options, &ru->oid[i], | |
| 811 | ":(%d):%s", i, path); | |
| 812 | mark_object_reachable(obj); | |
| 813 | } | |
| 814 | } | |
| 815 | return 0; | |
| 816 | } | |
| 817 | ||
| 818 | static void fsck_index(struct index_state *istate, const char *index_path, | |
| 819 | int is_current_worktree) | |
| 820 | { | |
| 821 | unsigned int i; | |
| 822 | ||
| 823 | /* TODO: audit for interaction with sparse-index. */ | |
| 824 | ensure_full_index(istate); | |
| 825 | for (i = 0; i < istate->cache_nr; i++) { | |
| 826 | unsigned int mode; | |
| 827 | struct blob *blob; | |
| 828 | struct object *obj; | |
| 829 | ||
| 830 | mode = istate->cache[i]->ce_mode; | |
| 831 | if (S_ISGITLINK(mode)) | |
| 832 | continue; | |
| 833 | blob = lookup_blob(the_repository, | |
| 834 | &istate->cache[i]->oid); | |
| 835 | if (!blob) | |
| 836 | continue; | |
| 837 | obj = &blob->object; | |
| 838 | obj->flags |= USED; | |
| 839 | fsck_put_object_name(&fsck_walk_options, &obj->oid, | |
| 840 | "%s:%s", | |
| 841 | is_current_worktree ? "" : index_path, | |
| 842 | istate->cache[i]->name); | |
| 843 | mark_object_reachable(obj); | |
| 844 | } | |
| 845 | if (istate->cache_tree) | |
| 846 | fsck_cache_tree(istate->cache_tree, index_path); | |
| 847 | fsck_resolve_undo(istate, index_path); | |
| 848 | } | |
| 849 | ||
| 850 | static void mark_object_for_connectivity(const struct object_id *oid) | |
| 851 | { | |
| 852 | struct object *obj = lookup_unknown_object(the_repository, oid); | |
| 853 | obj->flags |= HAS_OBJ; | |
| 854 | } | |
| 855 | ||
| 856 | static int mark_loose_for_connectivity(const struct object_id *oid, | |
| 857 | const char *path UNUSED, | |
| 858 | void *data UNUSED) | |
| 859 | { | |
| 860 | mark_object_for_connectivity(oid); | |
| 861 | return 0; | |
| 862 | } | |
| 863 | ||
| 864 | static int mark_packed_for_connectivity(const struct object_id *oid, | |
| 865 | struct packed_git *pack UNUSED, | |
| 866 | uint32_t pos UNUSED, | |
| 867 | void *data UNUSED) | |
| 868 | { | |
| 869 | mark_object_for_connectivity(oid); | |
| 870 | return 0; | |
| 871 | } | |
| 872 | ||
| 873 | static int check_pack_rev_indexes(struct repository *r, int show_progress) | |
| 874 | { | |
| 875 | struct progress *progress = NULL; | |
| 876 | struct packed_git *p; | |
| 877 | uint32_t pack_count = 0; | |
| 878 | int res = 0; | |
| 879 | ||
| 880 | if (show_progress) { | |
| 881 | repo_for_each_pack(r, p) | |
| 882 | pack_count++; | |
| 883 | progress = start_delayed_progress(the_repository, | |
| 884 | "Verifying reverse pack-indexes", pack_count); | |
| 885 | pack_count = 0; | |
| 886 | } | |
| 887 | ||
| 888 | repo_for_each_pack(r, p) { | |
| 889 | int load_error = load_pack_revindex_from_disk(p); | |
| 890 | ||
| 891 | if (load_error < 0) { | |
| 892 | error(_("unable to load rev-index for pack '%s'"), p->pack_name); | |
| 893 | res = ERROR_PACK_REV_INDEX; | |
| 894 | } else if (!load_error && | |
| 895 | !load_pack_revindex(r, p) && | |
| 896 | verify_pack_revindex(p)) { | |
| 897 | error(_("invalid rev-index for pack '%s'"), p->pack_name); | |
| 898 | res = ERROR_PACK_REV_INDEX; | |
| 899 | } | |
| 900 | display_progress(progress, ++pack_count); | |
| 901 | } | |
| 902 | stop_progress(&progress); | |
| 903 | ||
| 904 | return res; | |
| 905 | } | |
| 906 | ||
| 907 | static void fsck_refs(struct repository *r) | |
| 908 | { | |
| 909 | struct child_process refs_verify = CHILD_PROCESS_INIT; | |
| 910 | struct progress *progress = NULL; | |
| 911 | ||
| 912 | if (show_progress) | |
| 913 | progress = start_progress(r, _("Checking ref database"), 1); | |
| 914 | ||
| 915 | if (verbose) | |
| 916 | fprintf_ln(stderr, _("Checking ref database")); | |
| 917 | ||
| 918 | child_process_init(&refs_verify); | |
| 919 | refs_verify.git_cmd = 1; | |
| 920 | strvec_pushl(&refs_verify.args, "refs", "verify", NULL); | |
| 921 | if (verbose) | |
| 922 | strvec_push(&refs_verify.args, "--verbose"); | |
| 923 | if (check_strict) | |
| 924 | strvec_push(&refs_verify.args, "--strict"); | |
| 925 | ||
| 926 | if (run_command(&refs_verify)) | |
| 927 | errors_found |= ERROR_REFS; | |
| 928 | ||
| 929 | display_progress(progress, 1); | |
| 930 | stop_progress(&progress); | |
| 931 | } | |
| 932 | ||
| 933 | static char const * const fsck_usage[] = { | |
| 934 | N_("git fsck [--tags] [--root] [--unreachable] [--cache] [--no-reflogs]\n" | |
| 935 | " [--[no-]full] [--strict] [--verbose] [--lost-found]\n" | |
| 936 | " [--[no-]dangling] [--[no-]progress] [--connectivity-only]\n" | |
| 937 | " [--[no-]name-objects] [--[no-]references] [<object>...]"), | |
| 938 | NULL | |
| 939 | }; | |
| 940 | ||
| 941 | static struct option fsck_opts[] = { | |
| 942 | OPT__VERBOSE(&verbose, N_("be verbose")), | |
| 943 | OPT_BOOL(0, "unreachable", &show_unreachable, N_("show unreachable objects")), | |
| 944 | OPT_BOOL(0, "dangling", &show_dangling, N_("show dangling objects")), | |
| 945 | OPT_BOOL(0, "tags", &show_tags, N_("report tags")), | |
| 946 | OPT_BOOL(0, "root", &show_root, N_("report root nodes")), | |
| 947 | OPT_BOOL(0, "cache", &keep_cache_objects, N_("make index objects head nodes")), | |
| 948 | OPT_BOOL(0, "reflogs", &include_reflogs, N_("make reflogs head nodes (default)")), | |
| 949 | OPT_BOOL(0, "full", &check_full, N_("also consider packs and alternate objects")), | |
| 950 | OPT_BOOL(0, "connectivity-only", &connectivity_only, N_("check only connectivity")), | |
| 951 | OPT_BOOL(0, "strict", &check_strict, N_("enable more strict checking")), | |
| 952 | OPT_BOOL(0, "lost-found", &write_lost_and_found, | |
| 953 | N_("write dangling objects in .git/lost-found")), | |
| 954 | OPT_BOOL(0, "progress", &show_progress, N_("show progress")), | |
| 955 | OPT_BOOL(0, "name-objects", &name_objects, N_("show verbose names for reachable objects")), | |
| 956 | OPT_BOOL(0, "references", &check_references, N_("check reference database consistency")), | |
| 957 | OPT_END(), | |
| 958 | }; | |
| 959 | ||
| 960 | int cmd_fsck(int argc, | |
| 961 | const char **argv, | |
| 962 | const char *prefix, | |
| 963 | struct repository *repo UNUSED) | |
| 964 | { | |
| 965 | int i; | |
| 966 | struct odb_source *source; | |
| 967 | ||
| 968 | /* fsck knows how to handle missing promisor objects */ | |
| 969 | fetch_if_missing = 0; | |
| 970 | ||
| 971 | errors_found = 0; | |
| 972 | disable_replace_refs(); | |
| 973 | save_commit_buffer = 0; | |
| 974 | ||
| 975 | argc = parse_options(argc, argv, prefix, fsck_opts, fsck_usage, 0); | |
| 976 | ||
| 977 | fsck_walk_options.walk = mark_object; | |
| 978 | fsck_obj_options.walk = mark_used; | |
| 979 | fsck_obj_options.error_func = fsck_objects_error_func; | |
| 980 | if (check_strict) | |
| 981 | fsck_obj_options.strict = 1; | |
| 982 | ||
| 983 | if (show_progress == -1) | |
| 984 | show_progress = isatty(2); | |
| 985 | if (verbose) | |
| 986 | show_progress = 0; | |
| 987 | ||
| 988 | if (write_lost_and_found) { | |
| 989 | check_full = 1; | |
| 990 | include_reflogs = 0; | |
| 991 | } | |
| 992 | ||
| 993 | if (name_objects) | |
| 994 | fsck_enable_object_names(&fsck_walk_options); | |
| 995 | ||
| 996 | repo_config(the_repository, git_fsck_config, &fsck_obj_options); | |
| 997 | prepare_repo_settings(the_repository); | |
| 998 | ||
| 999 | if (check_references) | |
| 1000 | fsck_refs(the_repository); | |
| 1001 | ||
| 1002 | if (connectivity_only) { | |
| 1003 | for_each_loose_object(the_repository->objects, | |
| 1004 | mark_loose_for_connectivity, NULL, 0); | |
| 1005 | for_each_packed_object(the_repository, | |
| 1006 | mark_packed_for_connectivity, NULL, 0); | |
| 1007 | } else { | |
| 1008 | odb_prepare_alternates(the_repository->objects); | |
| 1009 | for (source = the_repository->objects->sources; source; source = source->next) | |
| 1010 | fsck_source(source); | |
| 1011 | ||
| 1012 | if (check_full) { | |
| 1013 | struct packed_git *p; | |
| 1014 | uint32_t total = 0, count = 0; | |
| 1015 | struct progress *progress = NULL; | |
| 1016 | ||
| 1017 | if (show_progress) { | |
| 1018 | repo_for_each_pack(the_repository, p) { | |
| 1019 | if (open_pack_index(p)) | |
| 1020 | continue; | |
| 1021 | total += p->num_objects; | |
| 1022 | } | |
| 1023 | ||
| 1024 | progress = start_progress(the_repository, | |
| 1025 | _("Checking objects"), total); | |
| 1026 | } | |
| 1027 | ||
| 1028 | repo_for_each_pack(the_repository, p) { | |
| 1029 | /* verify gives error messages itself */ | |
| 1030 | if (verify_pack(the_repository, | |
| 1031 | p, fsck_obj_buffer, | |
| 1032 | progress, count)) | |
| 1033 | errors_found |= ERROR_PACK; | |
| 1034 | count += p->num_objects; | |
| 1035 | } | |
| 1036 | stop_progress(&progress); | |
| 1037 | } | |
| 1038 | ||
| 1039 | if (fsck_finish(&fsck_obj_options)) | |
| 1040 | errors_found |= ERROR_OBJECT; | |
| 1041 | } | |
| 1042 | ||
| 1043 | for (i = 0; i < argc; i++) { | |
| 1044 | const char *arg = argv[i]; | |
| 1045 | struct object_id oid; | |
| 1046 | if (!repo_get_oid(the_repository, arg, &oid)) { | |
| 1047 | struct object *obj = lookup_object(the_repository, | |
| 1048 | &oid); | |
| 1049 | ||
| 1050 | if (!obj || !(obj->flags & HAS_OBJ)) { | |
| 1051 | if (is_promisor_object(the_repository, &oid)) | |
| 1052 | continue; | |
| 1053 | error(_("%s: object missing"), oid_to_hex(&oid)); | |
| 1054 | errors_found |= ERROR_OBJECT; | |
| 1055 | continue; | |
| 1056 | } | |
| 1057 | ||
| 1058 | obj->flags |= USED; | |
| 1059 | fsck_put_object_name(&fsck_walk_options, &oid, | |
| 1060 | "%s", arg); | |
| 1061 | mark_object_reachable(obj); | |
| 1062 | continue; | |
| 1063 | } | |
| 1064 | error(_("invalid parameter: expected sha1, got '%s'"), arg); | |
| 1065 | errors_found |= ERROR_OBJECT; | |
| 1066 | } | |
| 1067 | ||
| 1068 | /* | |
| 1069 | * If we've not been given any explicit head information, do the | |
| 1070 | * default ones from .git/refs. We also consider the index file | |
| 1071 | * in this case (ie this implies --cache). | |
| 1072 | */ | |
| 1073 | if (!argc) { | |
| 1074 | get_default_heads(); | |
| 1075 | keep_cache_objects = 1; | |
| 1076 | } | |
| 1077 | ||
| 1078 | if (keep_cache_objects) { | |
| 1079 | struct worktree **worktrees, **p; | |
| 1080 | ||
| 1081 | verify_index_checksum = 1; | |
| 1082 | verify_ce_order = 1; | |
| 1083 | ||
| 1084 | worktrees = get_worktrees(); | |
| 1085 | for (p = worktrees; *p; p++) { | |
| 1086 | struct worktree *wt = *p; | |
| 1087 | struct index_state istate = | |
| 1088 | INDEX_STATE_INIT(the_repository); | |
| 1089 | char *path, *wt_gitdir; | |
| 1090 | ||
| 1091 | /* | |
| 1092 | * Make a copy since the buffer is reusable | |
| 1093 | * and may get overwritten by other calls | |
| 1094 | * while we're examining the index. | |
| 1095 | */ | |
| 1096 | path = xstrdup(worktree_git_path(the_repository, wt, "index")); | |
| 1097 | wt_gitdir = get_worktree_git_dir(wt); | |
| 1098 | ||
| 1099 | read_index_from(&istate, path, wt_gitdir); | |
| 1100 | fsck_index(&istate, path, wt->is_current); | |
| 1101 | ||
| 1102 | discard_index(&istate); | |
| 1103 | free(wt_gitdir); | |
| 1104 | free(path); | |
| 1105 | } | |
| 1106 | free_worktrees(worktrees); | |
| 1107 | } | |
| 1108 | ||
| 1109 | errors_found |= check_pack_rev_indexes(the_repository, show_progress); | |
| 1110 | if (verify_bitmap_files(the_repository)) | |
| 1111 | errors_found |= ERROR_BITMAP; | |
| 1112 | ||
| 1113 | check_connectivity(); | |
| 1114 | ||
| 1115 | if (the_repository->settings.core_commit_graph) { | |
| 1116 | struct child_process commit_graph_verify = CHILD_PROCESS_INIT; | |
| 1117 | ||
| 1118 | odb_prepare_alternates(the_repository->objects); | |
| 1119 | for (source = the_repository->objects->sources; source; source = source->next) { | |
| 1120 | child_process_init(&commit_graph_verify); | |
| 1121 | commit_graph_verify.git_cmd = 1; | |
| 1122 | strvec_pushl(&commit_graph_verify.args, "commit-graph", | |
| 1123 | "verify", "--object-dir", source->path, NULL); | |
| 1124 | if (show_progress) | |
| 1125 | strvec_push(&commit_graph_verify.args, "--progress"); | |
| 1126 | else | |
| 1127 | strvec_push(&commit_graph_verify.args, "--no-progress"); | |
| 1128 | if (run_command(&commit_graph_verify)) | |
| 1129 | errors_found |= ERROR_COMMIT_GRAPH; | |
| 1130 | } | |
| 1131 | } | |
| 1132 | ||
| 1133 | if (the_repository->settings.core_multi_pack_index) { | |
| 1134 | struct child_process midx_verify = CHILD_PROCESS_INIT; | |
| 1135 | ||
| 1136 | odb_prepare_alternates(the_repository->objects); | |
| 1137 | for (source = the_repository->objects->sources; source; source = source->next) { | |
| 1138 | child_process_init(&midx_verify); | |
| 1139 | midx_verify.git_cmd = 1; | |
| 1140 | strvec_pushl(&midx_verify.args, "multi-pack-index", | |
| 1141 | "verify", "--object-dir", source->path, NULL); | |
| 1142 | if (show_progress) | |
| 1143 | strvec_push(&midx_verify.args, "--progress"); | |
| 1144 | else | |
| 1145 | strvec_push(&midx_verify.args, "--no-progress"); | |
| 1146 | if (run_command(&midx_verify)) | |
| 1147 | errors_found |= ERROR_MULTI_PACK_INDEX; | |
| 1148 | } | |
| 1149 | } | |
| 1150 | ||
| 1151 | return errors_found; | |
| 1152 | } |