pack-check.c 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203
  1. #include "cache.h"
  2. #include "repository.h"
  3. #include "pack.h"
  4. #include "pack-revindex.h"
  5. #include "progress.h"
  6. #include "packfile.h"
  7. #include "object-store.h"
  8. struct idx_entry {
  9. off_t offset;
  10. unsigned int nr;
  11. };
  12. static int compare_entries(const void *e1, const void *e2)
  13. {
  14. const struct idx_entry *entry1 = e1;
  15. const struct idx_entry *entry2 = e2;
  16. if (entry1->offset < entry2->offset)
  17. return -1;
  18. if (entry1->offset > entry2->offset)
  19. return 1;
  20. return 0;
  21. }
  22. int check_pack_crc(struct packed_git *p, struct pack_window **w_curs,
  23. off_t offset, off_t len, unsigned int nr)
  24. {
  25. const uint32_t *index_crc;
  26. uint32_t data_crc = crc32(0, NULL, 0);
  27. do {
  28. unsigned long avail;
  29. void *data = use_pack(p, w_curs, offset, &avail);
  30. if (avail > len)
  31. avail = len;
  32. data_crc = crc32(data_crc, data, avail);
  33. offset += avail;
  34. len -= avail;
  35. } while (len);
  36. index_crc = p->index_data;
  37. index_crc += 2 + 256 + p->num_objects * (the_hash_algo->rawsz/4) + nr;
  38. return data_crc != ntohl(*index_crc);
  39. }
  40. static int verify_packfile(struct repository *r,
  41. struct packed_git *p,
  42. struct pack_window **w_curs,
  43. verify_fn fn,
  44. struct progress *progress, uint32_t base_count)
  45. {
  46. off_t index_size = p->index_size;
  47. const unsigned char *index_base = p->index_data;
  48. git_hash_ctx ctx;
  49. unsigned char hash[GIT_MAX_RAWSZ], *pack_sig;
  50. off_t offset = 0, pack_sig_ofs = 0;
  51. uint32_t nr_objects, i;
  52. int err = 0;
  53. struct idx_entry *entries;
  54. if (!is_pack_valid(p))
  55. return error("packfile %s cannot be accessed", p->pack_name);
  56. r->hash_algo->init_fn(&ctx);
  57. do {
  58. unsigned long remaining;
  59. unsigned char *in = use_pack(p, w_curs, offset, &remaining);
  60. offset += remaining;
  61. if (!pack_sig_ofs)
  62. pack_sig_ofs = p->pack_size - r->hash_algo->rawsz;
  63. if (offset > pack_sig_ofs)
  64. remaining -= (unsigned int)(offset - pack_sig_ofs);
  65. r->hash_algo->update_fn(&ctx, in, remaining);
  66. } while (offset < pack_sig_ofs);
  67. r->hash_algo->final_fn(hash, &ctx);
  68. pack_sig = use_pack(p, w_curs, pack_sig_ofs, NULL);
  69. if (!hasheq(hash, pack_sig))
  70. err = error("%s pack checksum mismatch",
  71. p->pack_name);
  72. if (!hasheq(index_base + index_size - r->hash_algo->hexsz, pack_sig))
  73. err = error("%s pack checksum does not match its index",
  74. p->pack_name);
  75. unuse_pack(w_curs);
  76. /* Make sure everything reachable from idx is valid. Since we
  77. * have verified that nr_objects matches between idx and pack,
  78. * we do not do scan-streaming check on the pack file.
  79. */
  80. nr_objects = p->num_objects;
  81. ALLOC_ARRAY(entries, nr_objects + 1);
  82. entries[nr_objects].offset = pack_sig_ofs;
  83. /* first sort entries by pack offset, since unpacking them is more efficient that way */
  84. for (i = 0; i < nr_objects; i++) {
  85. entries[i].offset = nth_packed_object_offset(p, i);
  86. entries[i].nr = i;
  87. }
  88. QSORT(entries, nr_objects, compare_entries);
  89. for (i = 0; i < nr_objects; i++) {
  90. void *data;
  91. struct object_id oid;
  92. enum object_type type;
  93. unsigned long size;
  94. off_t curpos;
  95. int data_valid;
  96. if (nth_packed_object_id(&oid, p, entries[i].nr) < 0)
  97. BUG("unable to get oid of object %lu from %s",
  98. (unsigned long)entries[i].nr, p->pack_name);
  99. if (p->index_version > 1) {
  100. off_t offset = entries[i].offset;
  101. off_t len = entries[i+1].offset - offset;
  102. unsigned int nr = entries[i].nr;
  103. if (check_pack_crc(p, w_curs, offset, len, nr))
  104. err = error("index CRC mismatch for object %s "
  105. "from %s at offset %"PRIuMAX"",
  106. oid_to_hex(&oid),
  107. p->pack_name, (uintmax_t)offset);
  108. }
  109. curpos = entries[i].offset;
  110. type = unpack_object_header(p, w_curs, &curpos, &size);
  111. unuse_pack(w_curs);
  112. if (type == OBJ_BLOB && big_file_threshold <= size) {
  113. /*
  114. * Let check_object_signature() check it with
  115. * the streaming interface; no point slurping
  116. * the data in-core only to discard.
  117. */
  118. data = NULL;
  119. data_valid = 0;
  120. } else {
  121. data = unpack_entry(r, p, entries[i].offset, &type, &size);
  122. data_valid = 1;
  123. }
  124. if (data_valid && !data)
  125. err = error("cannot unpack %s from %s at offset %"PRIuMAX"",
  126. oid_to_hex(&oid), p->pack_name,
  127. (uintmax_t)entries[i].offset);
  128. else if (check_object_signature(r, &oid, data, size, type_name(type)))
  129. err = error("packed %s from %s is corrupt",
  130. oid_to_hex(&oid), p->pack_name);
  131. else if (fn) {
  132. int eaten = 0;
  133. err |= fn(&oid, type, size, data, &eaten);
  134. if (eaten)
  135. data = NULL;
  136. }
  137. if (((base_count + i) & 1023) == 0)
  138. display_progress(progress, base_count + i);
  139. free(data);
  140. }
  141. display_progress(progress, base_count + i);
  142. free(entries);
  143. return err;
  144. }
  145. int verify_pack_index(struct packed_git *p)
  146. {
  147. off_t index_size;
  148. const unsigned char *index_base;
  149. git_hash_ctx ctx;
  150. unsigned char hash[GIT_MAX_RAWSZ];
  151. int err = 0;
  152. if (open_pack_index(p))
  153. return error("packfile %s index not opened", p->pack_name);
  154. index_size = p->index_size;
  155. index_base = p->index_data;
  156. /* Verify SHA1 sum of the index file */
  157. the_hash_algo->init_fn(&ctx);
  158. the_hash_algo->update_fn(&ctx, index_base, (unsigned int)(index_size - the_hash_algo->rawsz));
  159. the_hash_algo->final_fn(hash, &ctx);
  160. if (!hasheq(hash, index_base + index_size - the_hash_algo->rawsz))
  161. err = error("Packfile index for %s hash mismatch",
  162. p->pack_name);
  163. return err;
  164. }
  165. int verify_pack(struct repository *r, struct packed_git *p, verify_fn fn,
  166. struct progress *progress, uint32_t base_count)
  167. {
  168. int err = 0;
  169. struct pack_window *w_curs = NULL;
  170. err |= verify_pack_index(p);
  171. if (!p->index_data)
  172. return -1;
  173. err |= verify_packfile(r, p, &w_curs, fn, progress, base_count);
  174. unuse_pack(&w_curs);
  175. return err;
  176. }