rocksdb-native 2.6.2 → 2.6.4

package/vendor/librocksdb/vendor/rocksdb/util/user_comparator_wrapper.h

@@ -1,64 +0,0 @@
-// Copyright (c) 2011-present, Facebook, Inc.  All rights reserved.
-//  This source code is licensed under both the GPLv2 (found in the
-//  COPYING file in the root directory) and Apache 2.0 License
-//  (found in the LICENSE.Apache file in the root directory).
-// 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 "monitoring/perf_context_imp.h"
-#include "rocksdb/comparator.h"
-
-namespace ROCKSDB_NAMESPACE {
-
-// Wrapper of user comparator, with auto increment to
-// perf_context.user_key_comparison_count.
-class UserComparatorWrapper {
- public:
-  // `UserComparatorWrapper`s constructed with the default constructor are not
-  // usable and will segfault on any attempt to use them for comparisons.
-  UserComparatorWrapper() : user_comparator_(nullptr) {}
-
-  explicit UserComparatorWrapper(const Comparator* const user_cmp)
-      : user_comparator_(user_cmp) {}
-
-  ~UserComparatorWrapper() = default;
-
-  const Comparator* user_comparator() const { return user_comparator_; }
-
-  int Compare(const Slice& a, const Slice& b) const {
-    PERF_COUNTER_ADD(user_key_comparison_count, 1);
-    return user_comparator_->Compare(a, b);
-  }
-
-  bool Equal(const Slice& a, const Slice& b) const {
-    PERF_COUNTER_ADD(user_key_comparison_count, 1);
-    return user_comparator_->Equal(a, b);
-  }
-
-  int CompareTimestamp(const Slice& ts1, const Slice& ts2) const {
-    return user_comparator_->CompareTimestamp(ts1, ts2);
-  }
-
-  int CompareWithoutTimestamp(const Slice& a, const Slice& b) const {
-    PERF_COUNTER_ADD(user_key_comparison_count, 1);
-    return user_comparator_->CompareWithoutTimestamp(a, b);
-  }
-
-  int CompareWithoutTimestamp(const Slice& a, bool a_has_ts, const Slice& b,
-                              bool b_has_ts) const {
-    PERF_COUNTER_ADD(user_key_comparison_count, 1);
-    return user_comparator_->CompareWithoutTimestamp(a, a_has_ts, b, b_has_ts);
-  }
-
-  bool EqualWithoutTimestamp(const Slice& a, const Slice& b) const {
-    return user_comparator_->EqualWithoutTimestamp(a, b);
-  }
-
- private:
-  const Comparator* user_comparator_;
-};
-
-}  // namespace ROCKSDB_NAMESPACE

package/vendor/librocksdb/vendor/rocksdb/util/vector_iterator.h

@@ -1,114 +0,0 @@
-// Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
-#pragma once
-
-#include <algorithm>
-#include <string>
-#include <vector>
-
-#include "db/dbformat.h"
-#include "rocksdb/comparator.h"
-#include "rocksdb/iterator.h"
-#include "rocksdb/slice.h"
-#include "table/internal_iterator.h"
-
-namespace ROCKSDB_NAMESPACE {
-
-// Iterator over a vector of keys/values
-class VectorIterator : public InternalIterator {
- public:
-  VectorIterator(std::vector<std::string> keys, std::vector<std::string> values,
-                 const CompareInterface* icmp = nullptr)
-      : keys_(std::move(keys)),
-        values_(std::move(values)),
-        current_(keys_.size()),
-        indexed_cmp_(icmp, &keys_) {
-    assert(keys_.size() == values_.size());
-
-    indices_.reserve(keys_.size());
-    for (size_t i = 0; i < keys_.size(); i++) {
-      indices_.push_back(i);
-    }
-    if (icmp != nullptr) {
-      std::sort(indices_.begin(), indices_.end(), indexed_cmp_);
-    }
-  }
-
-  bool Valid() const override {
-    return !indices_.empty() && current_ < indices_.size();
-  }
-
-  void SeekToFirst() override { current_ = 0; }
-  void SeekToLast() override { current_ = indices_.size() - 1; }
-
-  void Seek(const Slice& target) override {
-    if (indexed_cmp_.cmp != nullptr) {
-      current_ = std::lower_bound(indices_.begin(), indices_.end(), target,
-                                  indexed_cmp_) -
-                 indices_.begin();
-    } else {
-      current_ =
-          std::lower_bound(keys_.begin(), keys_.end(), target.ToString()) -
-          keys_.begin();
-    }
-  }
-
-  void SeekForPrev(const Slice& target) override {
-    if (indexed_cmp_.cmp != nullptr) {
-      current_ = std::upper_bound(indices_.begin(), indices_.end(), target,
-                                  indexed_cmp_) -
-                 indices_.begin();
-    } else {
-      current_ =
-          std::upper_bound(keys_.begin(), keys_.end(), target.ToString()) -
-          keys_.begin();
-    }
-    if (!Valid()) {
-      SeekToLast();
-    } else {
-      Prev();
-    }
-  }
-
-  void Next() override { current_++; }
-  void Prev() override { current_--; }
-
-  Slice key() const override { return Slice(keys_[indices_[current_]]); }
-  Slice value() const override { return Slice(values_[indices_[current_]]); }
-
-  Status status() const override { return Status::OK(); }
-
-  bool IsKeyPinned() const override { return true; }
-  bool IsValuePinned() const override { return true; }
-
- protected:
-  std::vector<std::string> keys_;
-  std::vector<std::string> values_;
-  size_t current_;
-
- private:
-  struct IndexedKeyComparator {
-    IndexedKeyComparator(const CompareInterface* c,
-                         const std::vector<std::string>* ks)
-        : cmp(c), keys(ks) {}
-
-    bool operator()(size_t a, size_t b) const {
-      return cmp->Compare((*keys)[a], (*keys)[b]) < 0;
-    }
-
-    bool operator()(size_t a, const Slice& b) const {
-      return cmp->Compare((*keys)[a], b) < 0;
-    }
-
-    bool operator()(const Slice& a, size_t b) const {
-      return cmp->Compare(a, (*keys)[b]) < 0;
-    }
-
-    const CompareInterface* cmp;
-    const std::vector<std::string>* keys;
-  };
-
-  IndexedKeyComparator indexed_cmp_;
-  std::vector<size_t> indices_;
-};
-
-}  // namespace ROCKSDB_NAMESPACE

package/vendor/librocksdb/vendor/rocksdb/util/work_queue.h

@@ -1,150 +0,0 @@
-//  Copyright (c) 2011-present, Facebook, Inc.  All rights reserved.
-//  This source code is licensed under both the GPLv2 (found in the
-//  COPYING file in the root directory) and Apache 2.0 License
-//  (found in the LICENSE.Apache file in the root directory).
-
-/*
- * Copyright (c) 2016-present, Facebook, Inc.
- * All rights reserved.
- *
- * This source code is licensed under both the BSD-style license (found in the
- * LICENSE file in the root directory of this source tree) and the GPLv2 (found
- * in the COPYING file in the root directory of this source tree).
- */
-#pragma once
-
-#include <atomic>
-#include <cassert>
-#include <condition_variable>
-#include <cstddef>
-#include <functional>
-#include <mutex>
-#include <queue>
-
-#include "rocksdb/rocksdb_namespace.h"
-
-namespace ROCKSDB_NAMESPACE {
-
-/// Unbounded thread-safe work queue.
-//
-// This file is an excerpt from Facebook's zstd repo at
-// https://github.com/facebook/zstd/. The relevant file is
-// contrib/pzstd/utils/WorkQueue.h.
-
-template <typename T>
-class WorkQueue {
-  // Protects all member variable access
-  std::mutex mutex_;
-  std::condition_variable readerCv_;
-  std::condition_variable writerCv_;
-  std::condition_variable finishCv_;
-
-  std::queue<T> queue_;
-  bool done_;
-  std::size_t maxSize_;
-
-  // Must have lock to call this function
-  bool full() const {
-    if (maxSize_ == 0) {
-      return false;
-    }
-    return queue_.size() >= maxSize_;
-  }
-
- public:
-  /**
-   * Constructs an empty work queue with an optional max size.
-   * If `maxSize == 0` the queue size is unbounded.
-   *
-   * @param maxSize The maximum allowed size of the work queue.
-   */
-  WorkQueue(std::size_t maxSize = 0) : done_(false), maxSize_(maxSize) {}
-
-  /**
-   * Push an item onto the work queue.  Notify a single thread that work is
-   * available.  If `finish()` has been called, do nothing and return false.
-   * If `push()` returns false, then `item` has not been copied from.
-   *
-   * @param item  Item to push onto the queue.
-   * @returns     True upon success, false if `finish()` has been called.  An
-   *               item was pushed iff `push()` returns true.
-   */
-  template <typename U>
-  bool push(U&& item) {
-    {
-      std::unique_lock<std::mutex> lock(mutex_);
-      while (full() && !done_) {
-        writerCv_.wait(lock);
-      }
-      if (done_) {
-        return false;
-      }
-      queue_.push(std::forward<U>(item));
-    }
-    readerCv_.notify_one();
-    return true;
-  }
-
-  /**
-   * Attempts to pop an item off the work queue.  It will block until data is
-   * available or `finish()` has been called.
-   *
-   * @param[out] item  If `pop` returns `true`, it contains the popped item.
-   *                    If `pop` returns `false`, it is unmodified.
-   * @returns          True upon success.  False if the queue is empty and
-   *                    `finish()` has been called.
-   */
-  bool pop(T& item) {
-    {
-      std::unique_lock<std::mutex> lock(mutex_);
-      while (queue_.empty() && !done_) {
-        readerCv_.wait(lock);
-      }
-      if (queue_.empty()) {
-        assert(done_);
-        return false;
-      }
-      item = queue_.front();
-      queue_.pop();
-    }
-    writerCv_.notify_one();
-    return true;
-  }
-
-  /**
-   * Sets the maximum queue size.  If `maxSize == 0` then it is unbounded.
-   *
-   * @param maxSize The new maximum queue size.
-   */
-  void setMaxSize(std::size_t maxSize) {
-    {
-      std::lock_guard<std::mutex> lock(mutex_);
-      maxSize_ = maxSize;
-    }
-    writerCv_.notify_all();
-  }
-
-  /**
-   * Promise that `push()` won't be called again, so once the queue is empty
-   * there will never any more work.
-   */
-  void finish() {
-    {
-      std::lock_guard<std::mutex> lock(mutex_);
-      assert(!done_);
-      done_ = true;
-    }
-    readerCv_.notify_all();
-    writerCv_.notify_all();
-    finishCv_.notify_all();
-  }
-
-  /// Blocks until `finish()` has been called (but the queue may not be empty).
-  void waitUntilFinished() {
-    std::unique_lock<std::mutex> lock(mutex_);
-    while (!done_) {
-      finishCv_.wait(lock);
-    }
-  }
-};
-}  // namespace ROCKSDB_NAMESPACE

package/vendor/librocksdb/vendor/rocksdb/util/write_batch_util.cc

@@ -1,25 +0,0 @@
-//  Copyright (c) Meta Platforms, Inc. and affiliates.
-//
-//  This source code is licensed under both the GPLv2 (found in the
-//  COPYING file in the root directory) and Apache 2.0 License
-//  (found in the LICENSE.Apache file in the root directory).
-
-#include "util/write_batch_util.h"
-
-namespace ROCKSDB_NAMESPACE {
-
-Status CollectColumnFamilyIdsFromWriteBatch(
-    const WriteBatch& batch, std::vector<uint32_t>* column_family_ids) {
-  assert(column_family_ids != nullptr);
-  column_family_ids->clear();
-  ColumnFamilyCollector handler;
-  Status s = batch.Iterate(&handler);
-  if (s.ok()) {
-    for (const auto& cf : handler.column_families()) {
-      column_family_ids->push_back(cf);
-    }
-  }
-  return s;
-}
-
-}  // namespace ROCKSDB_NAMESPACE

package/vendor/librocksdb/vendor/rocksdb/util/write_batch_util.h

@@ -1,90 +0,0 @@
-//  Copyright (c) Meta Platforms, Inc. and affiliates.
-//
-//  This source code is licensed under both the GPLv2 (found in the
-//  COPYING file in the root directory) and Apache 2.0 License
-//  (found in the LICENSE.Apache file in the root directory).
-
-#pragma once
-#include <unordered_set>
-#include <vector>
-
-#include "rocksdb/slice.h"
-#include "rocksdb/status.h"
-#include "rocksdb/write_batch.h"
-
-namespace ROCKSDB_NAMESPACE {
-// ColumnFamilyCollector is a write batch handler which does nothing
-// except recording unique column family IDs
-class ColumnFamilyCollector : public WriteBatch::Handler {
-  std::unordered_set<uint32_t> column_family_ids_;
-
-  Status AddColumnFamilyId(uint32_t column_family_id) {
-    column_family_ids_.insert(column_family_id);
-    return Status::OK();
-  }
-
- public:
-  explicit ColumnFamilyCollector() {}
-
-  ~ColumnFamilyCollector() override {}
-
-  Status PutCF(uint32_t column_family_id, const Slice&, const Slice&) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status PutEntityCF(uint32_t column_family_id, const Slice&,
-                     const Slice&) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status TimedPutCF(uint32_t column_family_id, const Slice&, const Slice&,
-                    uint64_t) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status DeleteCF(uint32_t column_family_id, const Slice&) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status SingleDeleteCF(uint32_t column_family_id, const Slice&) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status DeleteRangeCF(uint32_t column_family_id, const Slice&,
-                       const Slice&) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status MergeCF(uint32_t column_family_id, const Slice&,
-                 const Slice&) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status PutBlobIndexCF(uint32_t column_family_id, const Slice&,
-                        const Slice&) override {
-    return AddColumnFamilyId(column_family_id);
-  }
-
-  Status MarkBeginPrepare(bool) override { return Status::OK(); }
-
-  Status MarkEndPrepare(const Slice&) override { return Status::OK(); }
-
-  Status MarkRollback(const Slice&) override { return Status::OK(); }
-
-  Status MarkCommit(const Slice&) override { return Status::OK(); }
-
-  Status MarkCommitWithTimestamp(const Slice&, const Slice&) override {
-    return Status::OK();
-  }
-
-  Status MarkNoop(bool) override { return Status::OK(); }
-
-  const std::unordered_set<uint32_t>& column_families() const {
-    return column_family_ids_;
-  }
-};
-
-Status CollectColumnFamilyIdsFromWriteBatch(
-    const WriteBatch& batch, std::vector<uint32_t>* column_family_ids);
-
-}  // namespace ROCKSDB_NAMESPACE

package/vendor/librocksdb/vendor/rocksdb/util/xxhash.cc

@@ -1,48 +0,0 @@
-//  Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
-//  This source code is licensed under both the GPLv2 (found in the
-//  COPYING file in the root directory) and Apache 2.0 License
-//  (found in the LICENSE.Apache file in the root directory).
-/*
- * xxHash - Extremely Fast Hash algorithm
- * Copyright (C) 2012-2020 Yann Collet
- *
- * BSD 2-Clause License (https://www.opensource.org/licenses/bsd-license.php)
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are
- * met:
- *
- *    * Redistributions of source code must retain the above copyright
- *      notice, this list of conditions and the following disclaimer.
- *    * Redistributions in binary form must reproduce the above
- *      copyright notice, this list of conditions and the following disclaimer
- *      in the documentation and/or other materials provided with the
- *      distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
- * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * You can contact the author at:
- *   - xxHash homepage: https://www.xxhash.com
- *   - xxHash source repository: https://github.com/Cyan4973/xxHash
- */
-
-/*
- * xxhash.c instantiates functions defined in xxhash.h
- */
-// clang-format off
-#ifndef XXH_STATIC_LINKING_ONLY
-#define XXH_STATIC_LINKING_ONLY   /* access advanced declarations */
-#endif // !defined(XXH_STATIC_LINKING_ONLY)
-#define XXH_IMPLEMENTATION   /* access definitions */
-
-#include "xxhash.h"