2016-02-10 00:12:00 +01:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2013-10-16 23:59:46 +02:00
|
|
|
// This source code is licensed under the BSD-style license found in the
|
|
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
//
|
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_writer.h"
|
|
|
|
|
|
|
|
#include <stdint.h>
|
2013-08-23 17:38:13 +02:00
|
|
|
#include "rocksdb/env.h"
|
2011-03-18 23:37:00 +01:00
|
|
|
#include "util/coding.h"
|
|
|
|
#include "util/crc32c.h"
|
Move rate_limiter, write buffering, most perf context instrumentation and most random kill out of Env
Summary: We want to keep Env a think layer for better portability. Less platform dependent codes should be moved out of Env. In this patch, I create a wrapper of file readers and writers, and put rate limiting, write buffering, as well as most perf context instrumentation and random kill out of Env. It will make it easier to maintain multiple Env in the future.
Test Plan: Run all existing unit tests.
Reviewers: anthony, kradhakrishnan, IslamAbdelRahman, yhchiang, igor
Reviewed By: igor
Subscribers: leveldb, dhruba
Differential Revision: https://reviews.facebook.net/D42321
2015-07-18 01:16:11 +02:00
|
|
|
#include "util/file_reader_writer.h"
|
2011-03-18 23:37:00 +01:00
|
|
|
|
2013-10-04 06:49:15 +02:00
|
|
|
namespace rocksdb {
|
2011-03-18 23:37:00 +01:00
|
|
|
namespace log {
|
|
|
|
|
2015-10-08 19:07:15 +02:00
|
|
|
Writer::Writer(unique_ptr<WritableFileWriter>&& dest,
|
|
|
|
uint64_t log_number, bool recycle_log_files)
|
|
|
|
: dest_(std::move(dest)),
|
|
|
|
block_offset_(0),
|
|
|
|
log_number_(log_number),
|
|
|
|
recycle_log_files_(recycle_log_files) {
|
2011-03-18 23:37:00 +01:00
|
|
|
for (int i = 0; i <= kMaxRecordType; i++) {
|
|
|
|
char t = static_cast<char>(i);
|
|
|
|
type_crc_[i] = crc32c::Value(&t, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Writer::~Writer() {
|
|
|
|
}
|
|
|
|
|
|
|
|
Status Writer::AddRecord(const Slice& slice) {
|
|
|
|
const char* ptr = slice.data();
|
|
|
|
size_t left = slice.size();
|
|
|
|
|
2015-10-19 23:24:05 +02:00
|
|
|
// Header size varies depending on whether we are recycling or not.
|
|
|
|
const int header_size =
|
|
|
|
recycle_log_files_ ? kRecyclableHeaderSize : kHeaderSize;
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
// Fragment the record if necessary and emit it. Note that if slice
|
|
|
|
// is empty, we still want to iterate once to emit a single
|
|
|
|
// zero-length record
|
|
|
|
Status s;
|
2011-05-21 04:17:43 +02:00
|
|
|
bool begin = true;
|
2011-03-18 23:37:00 +01:00
|
|
|
do {
|
2015-11-15 19:49:14 +01:00
|
|
|
const int64_t leftover = kBlockSize - block_offset_;
|
2011-03-18 23:37:00 +01:00
|
|
|
assert(leftover >= 0);
|
2015-10-19 23:24:05 +02:00
|
|
|
if (leftover < header_size) {
|
2011-03-18 23:37:00 +01:00
|
|
|
// Switch to a new block
|
|
|
|
if (leftover > 0) {
|
2015-10-19 23:24:05 +02:00
|
|
|
// Fill the trailer (literal below relies on kHeaderSize and
|
|
|
|
// kRecyclableHeaderSize being <= 11)
|
|
|
|
assert(header_size <= 11);
|
|
|
|
dest_->Append(
|
|
|
|
Slice("\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00", leftover));
|
2011-03-18 23:37:00 +01:00
|
|
|
}
|
|
|
|
block_offset_ = 0;
|
|
|
|
}
|
|
|
|
|
2015-10-19 23:24:05 +02:00
|
|
|
// Invariant: we never leave < header_size bytes in a block.
|
2015-11-15 19:49:14 +01:00
|
|
|
assert(static_cast<int64_t>(kBlockSize - block_offset_) >= header_size);
|
2011-03-18 23:37:00 +01:00
|
|
|
|
2015-10-19 23:24:05 +02:00
|
|
|
const size_t avail = kBlockSize - block_offset_ - header_size;
|
2011-03-18 23:37:00 +01:00
|
|
|
const size_t fragment_length = (left < avail) ? left : avail;
|
|
|
|
|
|
|
|
RecordType type;
|
|
|
|
const bool end = (left == fragment_length);
|
|
|
|
if (begin && end) {
|
2015-10-19 23:24:05 +02:00
|
|
|
type = recycle_log_files_ ? kRecyclableFullType : kFullType;
|
2011-03-18 23:37:00 +01:00
|
|
|
} else if (begin) {
|
2015-10-19 23:24:05 +02:00
|
|
|
type = recycle_log_files_ ? kRecyclableFirstType : kFirstType;
|
2011-03-18 23:37:00 +01:00
|
|
|
} else if (end) {
|
2015-10-19 23:24:05 +02:00
|
|
|
type = recycle_log_files_ ? kRecyclableLastType : kLastType;
|
2011-03-18 23:37:00 +01:00
|
|
|
} else {
|
2015-10-19 23:24:05 +02:00
|
|
|
type = recycle_log_files_ ? kRecyclableMiddleType : kMiddleType;
|
2011-03-18 23:37:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
s = EmitPhysicalRecord(type, ptr, fragment_length);
|
|
|
|
ptr += fragment_length;
|
|
|
|
left -= fragment_length;
|
2011-05-21 04:17:43 +02:00
|
|
|
begin = false;
|
2011-03-18 23:37:00 +01:00
|
|
|
} while (s.ok() && left > 0);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
Status Writer::EmitPhysicalRecord(RecordType t, const char* ptr, size_t n) {
|
|
|
|
assert(n <= 0xffff); // Must fit in two bytes
|
2015-10-19 23:24:05 +02:00
|
|
|
|
|
|
|
size_t header_size;
|
|
|
|
char buf[kRecyclableHeaderSize];
|
2011-03-18 23:37:00 +01:00
|
|
|
|
|
|
|
// Format the header
|
|
|
|
buf[4] = static_cast<char>(n & 0xff);
|
|
|
|
buf[5] = static_cast<char>(n >> 8);
|
|
|
|
buf[6] = static_cast<char>(t);
|
|
|
|
|
2015-10-19 23:24:05 +02:00
|
|
|
uint32_t crc = type_crc_[t];
|
|
|
|
if (t < kRecyclableFullType) {
|
|
|
|
// Legacy record format
|
|
|
|
assert(block_offset_ + kHeaderSize + n <= kBlockSize);
|
|
|
|
header_size = kHeaderSize;
|
|
|
|
} else {
|
|
|
|
// Recyclable record format
|
|
|
|
assert(block_offset_ + kRecyclableHeaderSize + n <= kBlockSize);
|
|
|
|
header_size = kRecyclableHeaderSize;
|
|
|
|
|
|
|
|
// Only encode low 32-bits of the 64-bit log number. This means
|
|
|
|
// we will fail to detect an old record if we recycled a log from
|
|
|
|
// ~4 billion logs ago, but that is effectively impossible, and
|
|
|
|
// even if it were we'dbe far more likely to see a false positive
|
|
|
|
// on the 32-bit CRC.
|
|
|
|
EncodeFixed32(buf + 7, static_cast<uint32_t>(log_number_));
|
|
|
|
crc = crc32c::Extend(crc, buf + 7, 4);
|
|
|
|
}
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
// Compute the crc of the record type and the payload.
|
2015-10-19 23:24:05 +02:00
|
|
|
crc = crc32c::Extend(crc, ptr, n);
|
|
|
|
crc = crc32c::Mask(crc); // Adjust for storage
|
2011-03-18 23:37:00 +01:00
|
|
|
EncodeFixed32(buf, crc);
|
|
|
|
|
|
|
|
// Write the header and the payload
|
2015-10-19 23:24:05 +02:00
|
|
|
Status s = dest_->Append(Slice(buf, header_size));
|
2011-03-18 23:37:00 +01:00
|
|
|
if (s.ok()) {
|
|
|
|
s = dest_->Append(Slice(ptr, n));
|
|
|
|
if (s.ok()) {
|
|
|
|
s = dest_->Flush();
|
|
|
|
}
|
|
|
|
}
|
2015-10-19 23:24:05 +02:00
|
|
|
block_offset_ += header_size + n;
|
2011-03-18 23:37:00 +01:00
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2011-10-31 18:22:06 +01:00
|
|
|
} // namespace log
|
2013-10-04 06:49:15 +02:00
|
|
|
} // namespace rocksdb
|