YugabyteDB (2.13.1.0-b60, 21121d69985fbf76aa6958d8f04a9bfa936293b5)

//  Copyright (c) 2011-present, Facebook, Inc.  All rights reserved.

//  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.

//

// The following only applies to changes made to this file as part of YugaByte development.

//

// Portions Copyright (c) YugaByte, Inc.

//

// Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except

// in compliance with the License.  You may obtain a copy of the License at

//

// http://www.apache.org/licenses/LICENSE-2.0

//

// Unless required by applicable law or agreed to in writing, software distributed under the License

// is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express

// or implied.  See the License for the specific language governing permissions and limitations

// under the License.

//

// 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 "yb/rocksdb/db/log_writer.h"

#include <stdint.h>

#include "yb/rocksdb/env.h"

#include "yb/rocksdb/util/coding.h"

#include "yb/rocksdb/util/crc32c.h"

#include "yb/rocksdb/util/file_reader_writer.h"

namespace rocksdb {

namespace log {

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) {

  for (int i = 0; i <= kMaxRecordType; 
i++10.4M
) {

    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.cdata();

  size_t left = slice.size();

  // Header size varies depending on whether we are recycling or not.

  const int header_size =

      recycle_log_files_ ? 
kRecyclableHeaderSize127k
 : 
kHeaderSize20.0M
;

  // 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;

  bool begin = true;

  do {

    const int64_t leftover = kBlockSize - block_offset_;

    assert(leftover >= 0);

    if (leftover < header_size) {

      // Switch to a new block

      if (leftover > 0) {

        // Fill the trailer (literal below relies on kHeaderSize and

        // kRecyclableHeaderSize being <= 11)

        assert(header_size <= 11);

        RETURN_NOT_OK(dest_->Append(

            Slice("\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00", leftover)));

      }

      block_offset_ = 0;

    }

    // Invariant: we never leave < header_size bytes in a block.

    assert(static_cast<int64_t>(kBlockSize - block_offset_) >= header_size);

    const size_t avail = kBlockSize - block_offset_ - header_size;

    const size_t fragment_length = (left < avail) ? 
left20.2M
 : 
avail610k
;

    RecordType type;

    const bool end = (left == fragment_length);

    if (begin && 
end20.2M
) {

      type = recycle_log_files_ ? 
kRecyclableFullType116k
 : 
kFullType19.7M
;

    } else 
if (1.00M
begin1.00M
) {

      type = recycle_log_files_ ? 
kRecyclableFirstType11.2k
 : 
kFirstType386k
;

    } else if (end) {

      type = recycle_log_files_ ? 
kRecyclableLastType11.2k
 : 
kLastType386k
;

    } else {

      type = recycle_log_files_ ? 
kRecyclableMiddleType7.20k
 : 
kMiddleType202k
;

    }

    s = EmitPhysicalRecord(type, ptr, fragment_length);

    ptr += fragment_length;

    left -= fragment_length;

    begin = false;

  } while (
s.ok()20.8M
 && left > 0);

  return s;

}

Status Writer::EmitPhysicalRecord(RecordType t, const char* ptr, size_t n) {

  assert(n <= 0xffff);  // Must fit in two bytes

  size_t header_size;

  char buf[kRecyclableHeaderSize];

  // Format the header

  buf[4] = static_cast<char>(n & 0xff);

  buf[5] = static_cast<char>(n >> 8);

  buf[6] = static_cast<char>(t);

  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'd be 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);

  }

  // Compute the crc of the record type and the payload.

  crc = crc32c::Extend(crc, ptr, n);

  crc = crc32c::Mask(crc);  // Adjust for storage

  EncodeFixed32(buf, crc);

  // Write the header and the payload

  Status s = dest_->Append(Slice(buf, header_size));

  if (s.ok()) {

    s = dest_->Append(Slice(ptr, n));

    if (
s.ok()20.8M
) {

      s = dest_->Flush();

    }

  }

  block_offset_ += header_size + n;

  return s;

}

}  // namespace log

}  // namespace rocksdb