2016-02-09 23:12:00 +00:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2015-09-11 16:57:02 +00: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.
|
2017-04-28 00:50:56 +00:00
|
|
|
// This source code is also licensed under the GPLv2 license found in the
|
|
|
|
// COPYING file in the root directory of this source tree.
|
2015-09-11 16:57:02 +00: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.
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
#include "port/port.h"
|
|
|
|
|
|
|
|
namespace rocksdb {
|
|
|
|
|
|
|
|
inline size_t TruncateToPageBoundary(size_t page_size, size_t s) {
|
|
|
|
s -= (s & (page_size - 1));
|
|
|
|
assert((s % page_size) == 0);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline size_t Roundup(size_t x, size_t y) {
|
|
|
|
return ((x + y - 1) / y) * y;
|
|
|
|
}
|
|
|
|
|
|
|
|
// This class is to manage an aligned user
|
2016-12-22 20:51:29 +00:00
|
|
|
// allocated buffer for direct I/O purposes
|
2015-09-12 00:36:48 +00:00
|
|
|
// though can be used for any purpose.
|
2015-09-11 16:57:02 +00:00
|
|
|
class AlignedBuffer {
|
|
|
|
size_t alignment_;
|
|
|
|
std::unique_ptr<char[]> buf_;
|
|
|
|
size_t capacity_;
|
|
|
|
size_t cursize_;
|
|
|
|
char* bufstart_;
|
|
|
|
|
|
|
|
public:
|
|
|
|
AlignedBuffer()
|
|
|
|
: alignment_(),
|
|
|
|
capacity_(0),
|
|
|
|
cursize_(0),
|
|
|
|
bufstart_(nullptr) {
|
|
|
|
}
|
|
|
|
|
|
|
|
AlignedBuffer(AlignedBuffer&& o) ROCKSDB_NOEXCEPT {
|
|
|
|
*this = std::move(o);
|
|
|
|
}
|
|
|
|
|
|
|
|
AlignedBuffer& operator=(AlignedBuffer&& o) ROCKSDB_NOEXCEPT {
|
|
|
|
alignment_ = std::move(o.alignment_);
|
|
|
|
buf_ = std::move(o.buf_);
|
|
|
|
capacity_ = std::move(o.capacity_);
|
|
|
|
cursize_ = std::move(o.cursize_);
|
|
|
|
bufstart_ = std::move(o.bufstart_);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
AlignedBuffer(const AlignedBuffer&) = delete;
|
|
|
|
|
|
|
|
AlignedBuffer& operator=(const AlignedBuffer&) = delete;
|
|
|
|
|
2017-01-12 00:42:07 +00:00
|
|
|
static bool isAligned(const void* ptr, size_t alignment) {
|
|
|
|
return reinterpret_cast<uintptr_t>(ptr) % alignment == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool isAligned(size_t n, size_t alignment) {
|
|
|
|
return n % alignment == 0;
|
|
|
|
}
|
|
|
|
|
2015-09-12 00:36:48 +00:00
|
|
|
size_t Alignment() const {
|
2015-09-11 16:57:02 +00:00
|
|
|
return alignment_;
|
|
|
|
}
|
|
|
|
|
2015-09-12 00:36:48 +00:00
|
|
|
size_t Capacity() const {
|
2015-09-11 16:57:02 +00:00
|
|
|
return capacity_;
|
|
|
|
}
|
|
|
|
|
2015-09-12 00:36:48 +00:00
|
|
|
size_t CurrentSize() const {
|
2015-09-11 16:57:02 +00:00
|
|
|
return cursize_;
|
|
|
|
}
|
|
|
|
|
2015-09-12 00:36:48 +00:00
|
|
|
const char* BufferStart() const {
|
2015-09-11 16:57:02 +00:00
|
|
|
return bufstart_;
|
|
|
|
}
|
|
|
|
|
2017-01-12 00:42:07 +00:00
|
|
|
char* BufferStart() { return bufstart_; }
|
|
|
|
|
2015-09-11 16:57:02 +00:00
|
|
|
void Clear() {
|
|
|
|
cursize_ = 0;
|
|
|
|
}
|
|
|
|
|
2015-09-12 00:36:48 +00:00
|
|
|
void Alignment(size_t alignment) {
|
2015-09-11 16:57:02 +00:00
|
|
|
assert(alignment > 0);
|
|
|
|
assert((alignment & (alignment - 1)) == 0);
|
|
|
|
alignment_ = alignment;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Allocates a new buffer and sets bufstart_ to the aligned first byte
|
|
|
|
void AllocateNewBuffer(size_t requestedCapacity) {
|
|
|
|
|
|
|
|
assert(alignment_ > 0);
|
|
|
|
assert((alignment_ & (alignment_ - 1)) == 0);
|
|
|
|
|
|
|
|
size_t size = Roundup(requestedCapacity, alignment_);
|
|
|
|
buf_.reset(new char[size + alignment_]);
|
|
|
|
|
|
|
|
char* p = buf_.get();
|
|
|
|
bufstart_ = reinterpret_cast<char*>(
|
|
|
|
(reinterpret_cast<uintptr_t>(p)+(alignment_ - 1)) &
|
|
|
|
~static_cast<uintptr_t>(alignment_ - 1));
|
|
|
|
capacity_ = size;
|
|
|
|
cursize_ = 0;
|
|
|
|
}
|
|
|
|
// Used for write
|
|
|
|
// Returns the number of bytes appended
|
|
|
|
size_t Append(const char* src, size_t append_size) {
|
|
|
|
size_t buffer_remaining = capacity_ - cursize_;
|
|
|
|
size_t to_copy = std::min(append_size, buffer_remaining);
|
|
|
|
|
|
|
|
if (to_copy > 0) {
|
|
|
|
memcpy(bufstart_ + cursize_, src, to_copy);
|
|
|
|
cursize_ += to_copy;
|
|
|
|
}
|
|
|
|
return to_copy;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t Read(char* dest, size_t offset, size_t read_size) const {
|
|
|
|
assert(offset < cursize_);
|
2017-04-27 19:19:55 +00:00
|
|
|
|
|
|
|
size_t to_read = 0;
|
|
|
|
if(offset < cursize_) {
|
|
|
|
to_read = std::min(cursize_ - offset, read_size);
|
|
|
|
}
|
2015-09-11 16:57:02 +00:00
|
|
|
if (to_read > 0) {
|
|
|
|
memcpy(dest, bufstart_ + offset, to_read);
|
|
|
|
}
|
|
|
|
return to_read;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Pad to alignment
|
|
|
|
void PadToAlignmentWith(int padding) {
|
|
|
|
size_t total_size = Roundup(cursize_, alignment_);
|
|
|
|
size_t pad_size = total_size - cursize_;
|
|
|
|
|
|
|
|
if (pad_size > 0) {
|
|
|
|
assert((pad_size + cursize_) <= capacity_);
|
|
|
|
memset(bufstart_ + cursize_, padding, pad_size);
|
|
|
|
cursize_ += pad_size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// After a partial flush move the tail to the beginning of the buffer
|
|
|
|
void RefitTail(size_t tail_offset, size_t tail_size) {
|
|
|
|
if (tail_size > 0) {
|
|
|
|
memmove(bufstart_, bufstart_ + tail_offset, tail_size);
|
|
|
|
}
|
|
|
|
cursize_ = tail_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns place to start writing
|
2015-09-12 00:36:48 +00:00
|
|
|
char* Destination() {
|
2015-09-11 16:57:02 +00:00
|
|
|
return bufstart_ + cursize_;
|
|
|
|
}
|
|
|
|
|
2015-09-12 00:36:48 +00:00
|
|
|
void Size(size_t cursize) {
|
2015-09-11 16:57:02 +00:00
|
|
|
cursize_ = cursize;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|