10225501448 李度 10225101546 陈胤遒 10215501422 高宇菲
Vous ne pouvez pas sélectionner plus de 25 sujets Les noms de sujets doivent commencer par une lettre ou un nombre, peuvent contenir des tirets ('-') et peuvent comporter jusqu'à 35 caractères.

382 lignes
11 KiB

  1. // Copyright (c) 2011 The LevelDB Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file. See the AUTHORS file for names of contributors.
  4. //
  5. // We recover the contents of the descriptor from the other files we find.
  6. // (1) Any log files are first converted to tables
  7. // (2) We scan every table to compute
  8. // (a) smallest/largest for the table
  9. // (b) largest sequence number in the table
  10. // (3) We generate descriptor contents:
  11. // - log number is set to zero
  12. // - next-file-number is set to 1 + largest file number we found
  13. // - last-sequence-number is set to largest sequence# found across
  14. // all tables (see 2c)
  15. // - compaction pointers are cleared
  16. // - every table file is added at level 0
  17. //
  18. // Possible optimization 1:
  19. // (a) Compute total size and use to pick appropriate max-level M
  20. // (b) Sort tables by largest sequence# in the table
  21. // (c) For each table: if it overlaps earlier table, place in level-0,
  22. // else place in level-M.
  23. // Possible optimization 2:
  24. // Store per-table metadata (smallest, largest, largest-seq#, ...)
  25. // in the table's meta section to speed up ScanTable.
  26. #include "db/builder.h"
  27. #include "db/db_impl.h"
  28. #include "db/dbformat.h"
  29. #include "db/filename.h"
  30. #include "db/log_reader.h"
  31. #include "db/log_writer.h"
  32. #include "db/memtable.h"
  33. #include "db/table_cache.h"
  34. #include "db/version_edit.h"
  35. #include "db/write_batch_internal.h"
  36. #include "leveldb/comparator.h"
  37. #include "leveldb/db.h"
  38. #include "leveldb/env.h"
  39. namespace leveldb {
  40. namespace {
  41. class Repairer {
  42. public:
  43. Repairer(const std::string& dbname, const Options& options)
  44. : dbname_(dbname),
  45. env_(options.env),
  46. icmp_(options.comparator),
  47. options_(SanitizeOptions(dbname, &icmp_, options)),
  48. owns_info_log_(options_.info_log != options.info_log),
  49. next_file_number_(1) {
  50. // TableCache can be small since we expect each table to be opened once.
  51. table_cache_ = new TableCache(dbname_, &options_, 10);
  52. }
  53. ~Repairer() {
  54. delete table_cache_;
  55. if (owns_info_log_) {
  56. delete options_.info_log;
  57. }
  58. }
  59. Status Run() {
  60. Status status = FindFiles();
  61. if (status.ok()) {
  62. ConvertLogFilesToTables();
  63. ExtractMetaData();
  64. status = WriteDescriptor();
  65. }
  66. if (status.ok()) {
  67. unsigned long long bytes = 0;
  68. for (size_t i = 0; i < tables_.size(); i++) {
  69. bytes += tables_[i].meta.file_size;
  70. }
  71. Log(env_, options_.info_log,
  72. "**** Repaired leveldb %s; "
  73. "recovered %d files; %llu bytes. "
  74. "Some data may have been lost. "
  75. "****",
  76. dbname_.c_str(),
  77. static_cast<int>(tables_.size()),
  78. bytes);
  79. }
  80. return status;
  81. }
  82. private:
  83. struct TableInfo {
  84. FileMetaData meta;
  85. SequenceNumber max_sequence;
  86. };
  87. std::string const dbname_;
  88. Env* const env_;
  89. InternalKeyComparator const icmp_;
  90. Options const options_;
  91. bool owns_info_log_;
  92. TableCache* table_cache_;
  93. VersionEdit edit_;
  94. std::vector<std::string> manifests_;
  95. std::vector<uint64_t> table_numbers_;
  96. std::vector<uint64_t> logs_;
  97. std::vector<TableInfo> tables_;
  98. uint64_t next_file_number_;
  99. Status FindFiles() {
  100. std::vector<std::string> filenames;
  101. Status status = env_->GetChildren(dbname_, &filenames);
  102. if (!status.ok()) {
  103. return status;
  104. }
  105. if (filenames.empty()) {
  106. return Status::IOError(dbname_, "repair found no files");
  107. }
  108. uint64_t number;
  109. FileType type;
  110. for (size_t i = 0; i < filenames.size(); i++) {
  111. if (ParseFileName(filenames[i], &number, &type)) {
  112. if (type == kDescriptorFile) {
  113. manifests_.push_back(filenames[i]);
  114. } else {
  115. if (number + 1 > next_file_number_) {
  116. next_file_number_ = number + 1;
  117. }
  118. if (type == kLogFile) {
  119. logs_.push_back(number);
  120. } else if (type == kTableFile) {
  121. table_numbers_.push_back(number);
  122. } else {
  123. // Ignore other files
  124. }
  125. }
  126. }
  127. }
  128. return status;
  129. }
  130. void ConvertLogFilesToTables() {
  131. for (size_t i = 0; i < logs_.size(); i++) {
  132. std::string logname = LogFileName(dbname_, logs_[i]);
  133. Status status = ConvertLogToTable(logs_[i]);
  134. if (!status.ok()) {
  135. Log(env_, options_.info_log, "Log #%llu: ignoring conversion error: %s",
  136. (unsigned long long) logs_[i],
  137. status.ToString().c_str());
  138. }
  139. ArchiveFile(logname);
  140. }
  141. }
  142. Status ConvertLogToTable(uint64_t log) {
  143. struct LogReporter : public log::Reader::Reporter {
  144. Env* env;
  145. WritableFile* info_log;
  146. uint64_t lognum;
  147. virtual void Corruption(size_t bytes, const Status& s) {
  148. // We print error messages for corruption, but continue repairing.
  149. Log(env, info_log, "Log #%llu: dropping %d bytes; %s",
  150. (unsigned long long) lognum,
  151. static_cast<int>(bytes),
  152. s.ToString().c_str());
  153. }
  154. };
  155. // Open the log file
  156. std::string logname = LogFileName(dbname_, log);
  157. SequentialFile* lfile;
  158. Status status = env_->NewSequentialFile(logname, &lfile);
  159. if (!status.ok()) {
  160. return status;
  161. }
  162. // Create the log reader.
  163. LogReporter reporter;
  164. reporter.env = env_;
  165. reporter.info_log = options_.info_log;
  166. reporter.lognum = log;
  167. // We intentially make log::Reader do checksumming so that
  168. // corruptions cause entire commits to be skipped instead of
  169. // propagating bad information (like overly large sequence
  170. // numbers).
  171. log::Reader reader(lfile, &reporter, false/*do not checksum*/,
  172. 0/*initial_offset*/);
  173. // Read all the records and add to a memtable
  174. std::string scratch;
  175. Slice record;
  176. WriteBatch batch;
  177. MemTable* mem = new MemTable(icmp_);
  178. mem->Ref();
  179. int counter = 0;
  180. while (reader.ReadRecord(&record, &scratch)) {
  181. if (record.size() < 12) {
  182. reporter.Corruption(
  183. record.size(), Status::Corruption("log record too small"));
  184. continue;
  185. }
  186. WriteBatchInternal::SetContents(&batch, record);
  187. status = WriteBatchInternal::InsertInto(&batch, mem);
  188. if (status.ok()) {
  189. counter += WriteBatchInternal::Count(&batch);
  190. } else {
  191. Log(env_, options_.info_log, "Log #%llu: ignoring %s",
  192. (unsigned long long) log,
  193. status.ToString().c_str());
  194. status = Status::OK(); // Keep going with rest of file
  195. }
  196. }
  197. delete lfile;
  198. // Do not record a version edit for this conversion to a Table
  199. // since ExtractMetaData() will also generate edits.
  200. FileMetaData meta;
  201. meta.number = next_file_number_++;
  202. Iterator* iter = mem->NewIterator();
  203. status = BuildTable(dbname_, env_, options_, table_cache_, iter, &meta);
  204. delete iter;
  205. mem->Unref();
  206. mem = NULL;
  207. if (status.ok()) {
  208. if (meta.file_size > 0) {
  209. table_numbers_.push_back(meta.number);
  210. }
  211. }
  212. Log(env_, options_.info_log, "Log #%llu: %d ops saved to Table #%llu %s",
  213. (unsigned long long) log,
  214. counter,
  215. (unsigned long long) meta.number,
  216. status.ToString().c_str());
  217. return status;
  218. }
  219. void ExtractMetaData() {
  220. std::vector<TableInfo> kept;
  221. for (size_t i = 0; i < table_numbers_.size(); i++) {
  222. TableInfo t;
  223. t.meta.number = table_numbers_[i];
  224. Status status = ScanTable(&t);
  225. if (!status.ok()) {
  226. std::string fname = TableFileName(dbname_, table_numbers_[i]);
  227. Log(env_, options_.info_log, "Table #%llu: ignoring %s",
  228. (unsigned long long) table_numbers_[i],
  229. status.ToString().c_str());
  230. ArchiveFile(fname);
  231. } else {
  232. tables_.push_back(t);
  233. }
  234. }
  235. }
  236. Status ScanTable(TableInfo* t) {
  237. std::string fname = TableFileName(dbname_, t->meta.number);
  238. int counter = 0;
  239. Status status = env_->GetFileSize(fname, &t->meta.file_size);
  240. if (status.ok()) {
  241. Iterator* iter = table_cache_->NewIterator(
  242. ReadOptions(), t->meta.number, t->meta.file_size);
  243. bool empty = true;
  244. ParsedInternalKey parsed;
  245. t->max_sequence = 0;
  246. for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
  247. Slice key = iter->key();
  248. if (!ParseInternalKey(key, &parsed)) {
  249. Log(env_, options_.info_log, "Table #%llu: unparsable key %s",
  250. (unsigned long long) t->meta.number,
  251. EscapeString(key).c_str());
  252. continue;
  253. }
  254. counter++;
  255. if (empty) {
  256. empty = false;
  257. t->meta.smallest.DecodeFrom(key);
  258. }
  259. t->meta.largest.DecodeFrom(key);
  260. if (parsed.sequence > t->max_sequence) {
  261. t->max_sequence = parsed.sequence;
  262. }
  263. }
  264. if (!iter->status().ok()) {
  265. status = iter->status();
  266. }
  267. delete iter;
  268. }
  269. Log(env_, options_.info_log, "Table #%llu: %d entries %s",
  270. (unsigned long long) t->meta.number,
  271. counter,
  272. status.ToString().c_str());
  273. return status;
  274. }
  275. Status WriteDescriptor() {
  276. std::string tmp = TempFileName(dbname_, 1);
  277. WritableFile* file;
  278. Status status = env_->NewWritableFile(tmp, &file);
  279. if (!status.ok()) {
  280. return status;
  281. }
  282. SequenceNumber max_sequence = 0;
  283. for (size_t i = 0; i < tables_.size(); i++) {
  284. if (max_sequence < tables_[i].max_sequence) {
  285. max_sequence = tables_[i].max_sequence;
  286. }
  287. }
  288. edit_.SetComparatorName(icmp_.user_comparator()->Name());
  289. edit_.SetLogNumber(0);
  290. edit_.SetNextFile(next_file_number_);
  291. edit_.SetLastSequence(max_sequence);
  292. for (size_t i = 0; i < tables_.size(); i++) {
  293. // TODO(opt): separate out into multiple levels
  294. const TableInfo& t = tables_[i];
  295. edit_.AddFile(0, t.meta.number, t.meta.file_size,
  296. t.meta.smallest, t.meta.largest);
  297. }
  298. //fprintf(stderr, "NewDescriptor:\n%s\n", edit_.DebugString().c_str());
  299. {
  300. log::Writer log(file);
  301. std::string record;
  302. edit_.EncodeTo(&record);
  303. status = log.AddRecord(record);
  304. }
  305. if (status.ok()) {
  306. status = file->Close();
  307. }
  308. delete file;
  309. file = NULL;
  310. if (!status.ok()) {
  311. env_->DeleteFile(tmp);
  312. } else {
  313. // Discard older manifests
  314. for (size_t i = 0; i < manifests_.size(); i++) {
  315. ArchiveFile(dbname_ + "/" + manifests_[i]);
  316. }
  317. // Install new manifest
  318. status = env_->RenameFile(tmp, DescriptorFileName(dbname_, 1));
  319. if (status.ok()) {
  320. status = SetCurrentFile(env_, dbname_, 1);
  321. } else {
  322. env_->DeleteFile(tmp);
  323. }
  324. }
  325. return status;
  326. }
  327. void ArchiveFile(const std::string& fname) {
  328. // Move into another directory. E.g., for
  329. // dir/foo
  330. // rename to
  331. // dir/lost/foo
  332. const char* slash = strrchr(fname.c_str(), '/');
  333. std::string new_dir;
  334. if (slash != NULL) {
  335. new_dir.assign(fname.data(), slash - fname.data());
  336. }
  337. new_dir.append("/lost");
  338. env_->CreateDir(new_dir); // Ignore error
  339. std::string new_file = new_dir;
  340. new_file.append("/");
  341. new_file.append((slash == NULL) ? fname.c_str() : slash + 1);
  342. Status s = env_->RenameFile(fname, new_file);
  343. Log(env_, options_.info_log, "Archiving %s: %s\n",
  344. fname.c_str(), s.ToString().c_str());
  345. }
  346. };
  347. }
  348. Status RepairDB(const std::string& dbname, const Options& options) {
  349. Repairer repairer(dbname, options);
  350. return repairer.Run();
  351. }
  352. }