2011-03-18 23:37:00 +01:00
|
|
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
|
|
|
|
|
|
#include "db/log_reader.h"
|
|
|
|
|
2011-03-30 20:35:40 +02:00
|
|
|
#include "leveldb/env.h"
|
2011-03-18 23:37:00 +01:00
|
|
|
#include "util/coding.h"
|
|
|
|
#include "util/crc32c.h"
|
|
|
|
|
|
|
|
namespace leveldb {
|
|
|
|
namespace log {
|
|
|
|
|
|
|
|
Reader::Reporter::~Reporter() {
|
|
|
|
}
|
|
|
|
|
2011-05-21 04:17:43 +02:00
|
|
|
Reader::Reader(SequentialFile* file, Reporter* reporter, bool checksum,
|
|
|
|
uint64_t initial_offset)
|
2011-03-18 23:37:00 +01:00
|
|
|
: file_(file),
|
|
|
|
reporter_(reporter),
|
|
|
|
checksum_(checksum),
|
|
|
|
backing_store_(new char[kBlockSize]),
|
|
|
|
buffer_(),
|
2011-05-21 04:17:43 +02:00
|
|
|
eof_(false),
|
|
|
|
last_record_offset_(0),
|
|
|
|
end_of_buffer_offset_(0),
|
|
|
|
initial_offset_(initial_offset) {
|
2011-03-18 23:37:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
Reader::~Reader() {
|
|
|
|
delete[] backing_store_;
|
|
|
|
}
|
|
|
|
|
2011-05-21 04:17:43 +02:00
|
|
|
bool Reader::SkipToInitialBlock() {
|
|
|
|
size_t offset_in_block = initial_offset_ % kBlockSize;
|
|
|
|
uint64_t block_start_location = initial_offset_ - offset_in_block;
|
|
|
|
|
|
|
|
// Don't search a block if we'd be in the trailer
|
|
|
|
if (offset_in_block > kBlockSize - 6) {
|
|
|
|
offset_in_block = 0;
|
|
|
|
block_start_location += kBlockSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
end_of_buffer_offset_ = block_start_location;
|
|
|
|
|
|
|
|
// Skip to start of first block that can contain the initial record
|
|
|
|
if (block_start_location > 0) {
|
|
|
|
Status skip_status = file_->Skip(block_start_location);
|
|
|
|
if (!skip_status.ok()) {
|
|
|
|
ReportDrop(block_start_location, skip_status);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
bool Reader::ReadRecord(Slice* record, std::string* scratch) {
|
2011-05-21 04:17:43 +02:00
|
|
|
if (last_record_offset_ < initial_offset_) {
|
|
|
|
if (!SkipToInitialBlock()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
scratch->clear();
|
|
|
|
record->clear();
|
|
|
|
bool in_fragmented_record = false;
|
2011-05-21 04:17:43 +02:00
|
|
|
// Record offset of the logical record that we're reading
|
|
|
|
// 0 is a dummy value to make compilers happy
|
|
|
|
uint64_t prospective_record_offset = 0;
|
2011-03-18 23:37:00 +01:00
|
|
|
|
|
|
|
Slice fragment;
|
|
|
|
while (true) {
|
2011-05-21 04:17:43 +02:00
|
|
|
uint64_t physical_record_offset = end_of_buffer_offset_ - buffer_.size();
|
2011-03-18 23:37:00 +01:00
|
|
|
switch (ReadPhysicalRecord(&fragment)) {
|
|
|
|
case kFullType:
|
|
|
|
if (in_fragmented_record) {
|
2011-05-21 04:17:43 +02:00
|
|
|
// Handle bug in earlier versions of log::Writer where
|
|
|
|
// it could emit an empty kFirstType record at the tail end
|
|
|
|
// of a block followed by a kFullType or kFirstType record
|
|
|
|
// at the beginning of the next block.
|
|
|
|
if (scratch->empty()) {
|
|
|
|
in_fragmented_record = false;
|
|
|
|
} else {
|
|
|
|
ReportCorruption(scratch->size(), "partial record without end(1)");
|
|
|
|
}
|
2011-03-18 23:37:00 +01:00
|
|
|
}
|
2011-05-21 04:17:43 +02:00
|
|
|
prospective_record_offset = physical_record_offset;
|
2011-03-18 23:37:00 +01:00
|
|
|
scratch->clear();
|
|
|
|
*record = fragment;
|
2011-05-21 04:17:43 +02:00
|
|
|
last_record_offset_ = prospective_record_offset;
|
2011-03-18 23:37:00 +01:00
|
|
|
return true;
|
|
|
|
|
|
|
|
case kFirstType:
|
|
|
|
if (in_fragmented_record) {
|
2011-05-21 04:17:43 +02:00
|
|
|
// Handle bug in earlier versions of log::Writer where
|
|
|
|
// it could emit an empty kFirstType record at the tail end
|
|
|
|
// of a block followed by a kFullType or kFirstType record
|
|
|
|
// at the beginning of the next block.
|
|
|
|
if (scratch->empty()) {
|
|
|
|
in_fragmented_record = false;
|
|
|
|
} else {
|
|
|
|
ReportCorruption(scratch->size(), "partial record without end(2)");
|
|
|
|
}
|
2011-03-18 23:37:00 +01:00
|
|
|
}
|
2011-05-21 04:17:43 +02:00
|
|
|
prospective_record_offset = physical_record_offset;
|
2011-03-18 23:37:00 +01:00
|
|
|
scratch->assign(fragment.data(), fragment.size());
|
|
|
|
in_fragmented_record = true;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case kMiddleType:
|
|
|
|
if (!in_fragmented_record) {
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(fragment.size(),
|
|
|
|
"missing start of fragmented record(1)");
|
2011-03-18 23:37:00 +01:00
|
|
|
} else {
|
|
|
|
scratch->append(fragment.data(), fragment.size());
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case kLastType:
|
|
|
|
if (!in_fragmented_record) {
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(fragment.size(),
|
|
|
|
"missing start of fragmented record(2)");
|
2011-03-18 23:37:00 +01:00
|
|
|
} else {
|
|
|
|
scratch->append(fragment.data(), fragment.size());
|
|
|
|
*record = Slice(*scratch);
|
2011-05-21 04:17:43 +02:00
|
|
|
last_record_offset_ = prospective_record_offset;
|
2011-03-18 23:37:00 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case kEof:
|
|
|
|
if (in_fragmented_record) {
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(scratch->size(), "partial record without end(3)");
|
2011-03-18 23:37:00 +01:00
|
|
|
scratch->clear();
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
|
|
|
|
case kBadRecord:
|
|
|
|
if (in_fragmented_record) {
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(scratch->size(), "error in middle of record");
|
2011-03-18 23:37:00 +01:00
|
|
|
in_fragmented_record = false;
|
|
|
|
scratch->clear();
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(
|
2011-03-18 23:37:00 +01:00
|
|
|
(fragment.size() + (in_fragmented_record ? scratch->size() : 0)),
|
|
|
|
"unknown record type");
|
|
|
|
in_fragmented_record = false;
|
|
|
|
scratch->clear();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-05-21 04:17:43 +02:00
|
|
|
uint64_t Reader::LastRecordOffset() {
|
|
|
|
return last_record_offset_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Reader::ReportCorruption(size_t bytes, const char* reason) {
|
|
|
|
ReportDrop(bytes, Status::Corruption(reason));
|
|
|
|
}
|
|
|
|
|
|
|
|
void Reader::ReportDrop(size_t bytes, const Status& reason) {
|
|
|
|
if (reporter_ != NULL &&
|
|
|
|
end_of_buffer_offset_ - buffer_.size() - bytes >= initial_offset_) {
|
|
|
|
reporter_->Corruption(bytes, reason);
|
2011-03-18 23:37:00 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int Reader::ReadPhysicalRecord(Slice* result) {
|
|
|
|
while (true) {
|
2011-03-28 22:43:44 +02:00
|
|
|
if (buffer_.size() < kHeaderSize) {
|
2011-03-18 23:37:00 +01:00
|
|
|
if (!eof_) {
|
|
|
|
// Last read was a full read, so this is a trailer to skip
|
|
|
|
buffer_.clear();
|
|
|
|
Status status = file_->Read(kBlockSize, &buffer_, backing_store_);
|
2011-05-21 04:17:43 +02:00
|
|
|
end_of_buffer_offset_ += buffer_.size();
|
2011-03-18 23:37:00 +01:00
|
|
|
if (!status.ok()) {
|
|
|
|
buffer_.clear();
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportDrop(kBlockSize, status);
|
2011-03-18 23:37:00 +01:00
|
|
|
eof_ = true;
|
|
|
|
return kEof;
|
|
|
|
} else if (buffer_.size() < kBlockSize) {
|
|
|
|
eof_ = true;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
} else if (buffer_.size() == 0) {
|
|
|
|
// End of file
|
|
|
|
return kEof;
|
2011-03-28 22:43:44 +02:00
|
|
|
} else {
|
2011-05-21 04:17:43 +02:00
|
|
|
size_t drop_size = buffer_.size();
|
2011-03-18 23:37:00 +01:00
|
|
|
buffer_.clear();
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(drop_size, "truncated record at end of file");
|
2011-03-18 23:37:00 +01:00
|
|
|
return kEof;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Parse the header
|
|
|
|
const char* header = buffer_.data();
|
|
|
|
const uint32_t a = static_cast<uint32_t>(header[4]) & 0xff;
|
|
|
|
const uint32_t b = static_cast<uint32_t>(header[5]) & 0xff;
|
|
|
|
const unsigned int type = header[6];
|
|
|
|
const uint32_t length = a | (b << 8);
|
|
|
|
if (kHeaderSize + length > buffer_.size()) {
|
2011-05-21 04:17:43 +02:00
|
|
|
size_t drop_size = buffer_.size();
|
2011-03-18 23:37:00 +01:00
|
|
|
buffer_.clear();
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(drop_size, "bad record length");
|
2011-03-18 23:37:00 +01:00
|
|
|
return kBadRecord;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check crc
|
|
|
|
if (checksum_) {
|
|
|
|
if (type == kZeroType && length == 0) {
|
2011-03-21 20:40:57 +01:00
|
|
|
// Skip zero length record without reporting any drops since
|
|
|
|
// such records are produced by the mmap based writing code in
|
|
|
|
// env_posix.cc that preallocates file regions.
|
|
|
|
buffer_.clear();
|
2011-03-18 23:37:00 +01:00
|
|
|
return kBadRecord;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t expected_crc = crc32c::Unmask(DecodeFixed32(header));
|
|
|
|
uint32_t actual_crc = crc32c::Value(header + 6, 1 + length);
|
|
|
|
if (actual_crc != expected_crc) {
|
2011-03-21 20:40:57 +01:00
|
|
|
// Drop the rest of the buffer since "length" itself may have
|
|
|
|
// been corrupted and if we trust it, we could find some
|
|
|
|
// fragment of a real log record that just happens to look
|
|
|
|
// like a valid log record.
|
2011-05-21 04:17:43 +02:00
|
|
|
size_t drop_size = buffer_.size();
|
2011-03-21 20:40:57 +01:00
|
|
|
buffer_.clear();
|
2011-05-21 04:17:43 +02:00
|
|
|
ReportCorruption(drop_size, "checksum mismatch");
|
2011-03-18 23:37:00 +01:00
|
|
|
return kBadRecord;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer_.remove_prefix(kHeaderSize + length);
|
2011-05-21 04:17:43 +02:00
|
|
|
|
|
|
|
// Skip physical record that started before initial_offset_
|
|
|
|
if (end_of_buffer_offset_ - buffer_.size() - kHeaderSize - length <
|
|
|
|
initial_offset_) {
|
|
|
|
result->clear();
|
|
|
|
return kBadRecord;
|
|
|
|
}
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
*result = Slice(header + kHeaderSize, length);
|
|
|
|
return type;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|