@nxtedition/rocksdb 15.2.2 → 15.2.4

package/deps/abseil-cpp/absl/profiling/CMakeLists.txt

@@ -1,132 +0,0 @@
-# Copyright 2021 The Abseil Authors
-#
-# 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
-#
-#     https://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.
-
-absl_cc_library(
-  NAME
-    sample_recorder
-  HDRS
-    "internal/sample_recorder.h"
-  COPTS
-    ${ABSL_DEFAULT_COPTS}
-  DEPS
-    absl::base
-    absl::synchronization
-)
-
-absl_cc_test(
-  NAME
-    sample_recorder_test
-  SRCS
-    "internal/sample_recorder_test.cc"
-  COPTS
-    ${ABSL_TEST_COPTS}
-  DEPS
-    absl::random_random
-    absl::sample_recorder
-    absl::time
-    GTest::gmock_main
-)
-
-absl_cc_library(
-  NAME
-    exponential_biased
-  SRCS
-    "internal/exponential_biased.cc"
-  HDRS
-    "internal/exponential_biased.h"
-  COPTS
-    ${ABSL_DEFAULT_COPTS}
-  DEPS
-    absl::config
-    absl::core_headers
-)
-
-absl_cc_test(
-  NAME
-    exponential_biased_test
-  SRCS
-    "internal/exponential_biased_test.cc"
-  COPTS
-    ${ABSL_TEST_COPTS}
-  DEPS
-    absl::exponential_biased
-    absl::strings
-    GTest::gmock_main
-)
-
-absl_cc_library(
-  NAME
-    periodic_sampler
-  SRCS
-    "internal/periodic_sampler.cc"
-  HDRS
-    "internal/periodic_sampler.h"
-  COPTS
-    ${ABSL_DEFAULT_COPTS}
-  DEPS
-    absl::core_headers
-    absl::exponential_biased
-)
-
-absl_cc_test(
-  NAME
-    periodic_sampler_test
-  SRCS
-    "internal/periodic_sampler_test.cc"
-  COPTS
-    ${ABSL_TEST_COPTS}
-  DEPS
-    absl::core_headers
-    absl::periodic_sampler
-    GTest::gmock_main
-)
-
-# Internal-only target, do not depend on directly
-absl_cc_library(
-  NAME
-    profile_builder
-  HDRS
-    "internal/profile_builder.h"
-  SRCS
-    "internal/profile_builder.cc"
-  COPTS
-    ${ABSL_DEFAULT_COPTS}
-  DEPS
-    absl::config
-    absl::core_headers
-    absl::raw_logging_internal
-    absl::flat_hash_map
-    absl::btree
-    absl::strings
-    absl::str_format
-    absl::span
-)
-
-absl_cc_library(
-  NAME
-    hashtable_profiler
-  HDRS
-    "hashtable.h"
-  SRCS
-    "hashtable.cc"
-  COPTS
-    ${ABSL_DEFAULT_COPTS}
-  DEPS
-    absl::profile_builder
-    absl::config
-    absl::core_headers
-    absl::strings
-    absl::span
-    absl::hashtablez_sampler
-)

package/deps/abseil-cpp/absl/profiling/hashtable.cc

@@ -1,135 +0,0 @@
-// Copyright 2025 The Abseil Authors
-//
-// 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
-//
-//     https://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.
-
-#include "absl/profiling/hashtable.h"
-
-#include <atomic>
-#include <cstddef>
-#include <cstdint>
-#include <string>
-#include <utility>
-#include <vector>
-
-#include "absl/base/config.h"
-#include "absl/container/internal/hashtablez_sampler.h"
-#include "absl/profiling/internal/profile_builder.h"
-#include "absl/status/statusor.h"
-#include "absl/strings/str_cat.h"
-#include "absl/strings/string_view.h"
-#include "absl/time/clock.h"
-#include "absl/time/time.h"
-#include "absl/types/span.h"
-
-namespace absl {
-ABSL_NAMESPACE_BEGIN
-
-StatusOr<std::string> MarshalHashtableProfile() {
-  return debugging_internal::MarshalHashtableProfile(
-      container_internal::GlobalHashtablezSampler(), Now());
-}
-
-namespace debugging_internal {
-
-static void DroppedHashtableSample() {}
-
-StatusOr<std::string> MarshalHashtableProfile(
-    container_internal::HashtablezSampler& sampler, Time now) {
-  static constexpr absl::string_view kDropFrames =
-      "(::)?absl::container_internal::.*|"
-      "(::)?absl::(flat|node)_hash_(map|set).*";
-
-  ProfileBuilder builder;
-  StringId drop_frames_id = builder.InternString(kDropFrames);
-  builder.set_drop_frames_id(drop_frames_id);
-  builder.AddSampleType(builder.InternString("capacity"),
-                        builder.InternString("count"));
-  builder.set_default_sample_type_id(builder.InternString("capacity"));
-
-  const auto capacity_id = builder.InternString("capacity");
-  const auto size_id = builder.InternString("size");
-  const auto num_erases_id = builder.InternString("num_erases");
-  const auto num_insert_hits_id = builder.InternString("num_insert_hits");
-  const auto num_rehashes_id = builder.InternString("num_rehashes");
-  const auto max_probe_length_id = builder.InternString("max_probe_length");
-  const auto total_probe_length_id = builder.InternString("total_probe_length");
-  const auto stuck_bits_id = builder.InternString("stuck_bits");
-  const auto inline_element_size_id =
-      builder.InternString("inline_element_size");
-  const auto key_size_id = builder.InternString("key_size");
-  const auto value_size_id = builder.InternString("value_size");
-  const auto soo_capacity_id = builder.InternString("soo_capacity");
-  const auto table_age_id = builder.InternString("table_age");
-  const auto max_reserve_id = builder.InternString("max_reserve");
-
-  size_t dropped =
-      sampler.Iterate([&](const container_internal::HashtablezInfo& info) {
-        const size_t capacity = info.capacity.load(std::memory_order_relaxed);
-        std::vector<std::pair<StringId, int64_t>> labels;
-
-        auto add_label = [&](StringId tag, uint64_t value) {
-          if (value == 0) {
-            return;
-          }
-          labels.emplace_back(tag, static_cast<int64_t>(value));
-        };
-
-        add_label(capacity_id, capacity);
-        add_label(size_id, info.size.load(std::memory_order_relaxed));
-        add_label(num_erases_id,
-                  info.num_erases.load(std::memory_order_relaxed));
-        // TODO(b/436909492): Revisit whether this value is useful.
-        add_label(num_insert_hits_id,
-                  info.num_insert_hits.load(std::memory_order_relaxed));
-        add_label(num_rehashes_id,
-                  info.num_rehashes.load(std::memory_order_relaxed));
-        add_label(max_probe_length_id,
-                  info.max_probe_length.load(std::memory_order_relaxed));
-        add_label(total_probe_length_id,
-                  info.total_probe_length.load(std::memory_order_relaxed));
-        add_label(stuck_bits_id,
-                  (info.hashes_bitwise_and.load(std::memory_order_relaxed) |
-                   ~info.hashes_bitwise_or.load(std::memory_order_relaxed)));
-        add_label(inline_element_size_id, info.inline_element_size);
-        add_label(key_size_id, info.key_size);
-        add_label(value_size_id, info.value_size);
-        add_label(soo_capacity_id, info.soo_capacity);
-        add_label(
-            table_age_id,
-            static_cast<uint64_t>(ToInt64Microseconds(now - info.create_time)));
-        add_label(max_reserve_id,
-                  info.max_reserve.load(std::memory_order_relaxed));
-        builder.AddSample(static_cast<int64_t>(capacity) * info.weight,
-                          MakeSpan(info.stack, info.depth), labels);
-      });
-
-  if (dropped > 0) {
-    // If we dropped samples, we don't have information for them, including
-    // their sizes.  The non-zero weight allows it to be noticed in the profile
-    // and examined more closely.
-    //
-    // We compensate for the fixup done by AddSample by adjusting the address
-    // here.
-    const void* kFakeStack[] = {
-      absl::bit_cast<void*>(
-          reinterpret_cast<uintptr_t>(&DroppedHashtableSample)+1)};
-    builder.AddSample(static_cast<int64_t>(dropped), kFakeStack, {});
-  }
-  builder.AddCurrentMappings();
-  return std::move(builder).Emit();
-}
-
-}  // namespace debugging_internal
-ABSL_NAMESPACE_END
-}  // namespace absl

package/deps/abseil-cpp/absl/profiling/hashtable.h

@@ -1,40 +0,0 @@
-// Copyright 2025 The Abseil Authors
-//
-// 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
-//
-//     https://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.
-
-#ifndef ABSL_PROFILING_HASHTABLE_H_
-#define ABSL_PROFILING_HASHTABLE_H_
-
-#include <cstdint>
-#include <string>
-
-#include "absl/container/internal/hashtablez_sampler.h"
-#include "absl/status/statusor.h"
-#include "absl/strings/string_view.h"
-#include "absl/time/time.h"
-
-namespace absl {
-ABSL_NAMESPACE_BEGIN
-
-absl::StatusOr<std::string> MarshalHashtableProfile();
-
-namespace debugging_internal {
-
-absl::StatusOr<std::string> MarshalHashtableProfile(
-    container_internal::HashtablezSampler& sampler, absl::Time now);
-
-}  // namespace debugging_internal
-ABSL_NAMESPACE_END
-}  // namespace absl
-
-#endif  // ABSL_PROFILING_HASHTABLE_H_

package/deps/abseil-cpp/absl/profiling/internal/exponential_biased.cc

@@ -1,93 +0,0 @@
-// Copyright 2019 The Abseil Authors.
-//
-// 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
-//
-//     https://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.
-
-#include "absl/profiling/internal/exponential_biased.h"
-
-#include <stdint.h>
-
-#include <algorithm>
-#include <atomic>
-#include <cmath>
-#include <limits>
-
-#include "absl/base/attributes.h"
-#include "absl/base/optimization.h"
-
-namespace absl {
-ABSL_NAMESPACE_BEGIN
-namespace profiling_internal {
-
-// The algorithm generates a random number between 0 and 1 and applies the
-// inverse cumulative distribution function for an exponential. Specifically:
-// Let m be the inverse of the sample period, then the probability
-// distribution function is m*exp(-mx) so the CDF is
-// p = 1 - exp(-mx), so
-// q = 1 - p = exp(-mx)
-// log_e(q) = -mx
-// -log_e(q)/m = x
-// log_2(q) * (-log_e(2) * 1/m) = x
-// In the code, q is actually in the range 1 to 2**26, hence the -26 below
-int64_t ExponentialBiased::GetSkipCount(int64_t mean) {
-  if (ABSL_PREDICT_FALSE(!initialized_)) {
-    Initialize();
-  }
-
-  uint64_t rng = NextRandom(rng_);
-  rng_ = rng;
-
-  // Take the top 26 bits as the random number
-  // (This plus the 1<<58 sampling bound give a max possible step of
-  // 5194297183973780480 bytes.)
-  // The uint32_t cast is to prevent a (hard-to-reproduce) NAN
-  // under piii debug for some binaries.
-  double q = static_cast<uint32_t>(rng >> (kPrngNumBits - 26)) + 1.0;
-  // Put the computed p-value through the CDF of a geometric.
-  double interval = bias_ + (std::log2(q) - 26) * (-std::log(2.0) * mean);
-  // Very large values of interval overflow int64_t. To avoid that, we will
-  // cheat and clamp any huge values to (int64_t max)/2. This is a potential
-  // source of bias, but the mean would need to be such a large value that it's
-  // not likely to come up. For example, with a mean of 1e18, the probability of
-  // hitting this condition is about 1/1000. For a mean of 1e17, standard
-  // calculators claim that this event won't happen.
-  if (interval > static_cast<double>(std::numeric_limits<int64_t>::max() / 2)) {
-    // Assume huge values are bias neutral, retain bias for next call.
-    return std::numeric_limits<int64_t>::max() / 2;
-  }
-  double value = std::rint(interval);
-  bias_ = interval - value;
-  return static_cast<int64_t>(value);
-}
-
-int64_t ExponentialBiased::GetStride(int64_t mean) {
-  return GetSkipCount(mean - 1) + 1;
-}
-
-void ExponentialBiased::Initialize() {
-  // We don't get well distributed numbers from `this` so we call NextRandom() a
-  // bunch to mush the bits around. We use a global_rand to handle the case
-  // where the same thread (by memory address) gets created and destroyed
-  // repeatedly.
-  ABSL_CONST_INIT static std::atomic<uint32_t> global_rand(0);
-  uint64_t r = reinterpret_cast<uint64_t>(this) +
-               global_rand.fetch_add(1, std::memory_order_relaxed);
-  for (int i = 0; i < 20; ++i) {
-    r = NextRandom(r);
-  }
-  rng_ = r;
-  initialized_ = true;
-}
-
-}  // namespace profiling_internal
-ABSL_NAMESPACE_END
-}  // namespace absl

package/deps/abseil-cpp/absl/profiling/internal/exponential_biased.h

@@ -1,130 +0,0 @@
-// Copyright 2019 The Abseil Authors.
-//
-// 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
-//
-//     https://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.
-
-#ifndef ABSL_PROFILING_INTERNAL_EXPONENTIAL_BIASED_H_
-#define ABSL_PROFILING_INTERNAL_EXPONENTIAL_BIASED_H_
-
-#include <stdint.h>
-
-#include "absl/base/config.h"
-#include "absl/base/macros.h"
-
-namespace absl {
-ABSL_NAMESPACE_BEGIN
-namespace profiling_internal {
-
-// ExponentialBiased provides a small and fast random number generator for a
-// rounded exponential distribution. This generator manages very little state,
-// and imposes no synchronization overhead. This makes it useful in specialized
-// scenarios requiring minimum overhead, such as stride based periodic sampling.
-//
-// ExponentialBiased provides two closely related functions, GetSkipCount() and
-// GetStride(), both returning a rounded integer defining a number of events
-// required before some event with a given mean probability occurs.
-//
-// The distribution is useful to generate a random wait time or some periodic
-// event with a given mean probability. For example, if an action is supposed to
-// happen on average once every 'N' events, then we can get a random 'stride'
-// counting down how long before the event to happen. For example, if we'd want
-// to sample one in every 1000 'Frobber' calls, our code could look like this:
-//
-//   Frobber::Frobber() {
-//     stride_ = exponential_biased_.GetStride(1000);
-//   }
-//
-//   void Frobber::Frob(int arg) {
-//     if (--stride == 0) {
-//       SampleFrob(arg);
-//       stride_ = exponential_biased_.GetStride(1000);
-//     }
-//     ...
-//   }
-//
-// The rounding of the return value creates a bias, especially for smaller means
-// where the distribution of the fraction is not evenly distributed. We correct
-// this bias by tracking the fraction we rounded up or down on each iteration,
-// effectively tracking the distance between the cumulative value, and the
-// rounded cumulative value. For example, given a mean of 2:
-//
-//   raw = 1.63076, cumulative = 1.63076, rounded = 2, bias = -0.36923
-//   raw = 0.14624, cumulative = 1.77701, rounded = 2, bias =  0.14624
-//   raw = 4.93194, cumulative = 6.70895, rounded = 7, bias = -0.06805
-//   raw = 0.24206, cumulative = 6.95101, rounded = 7, bias =  0.24206
-//   etc...
-//
-// Adjusting with rounding bias is relatively trivial:
-//
-//    double value = bias_ + exponential_distribution(mean)();
-//    double rounded_value = std::rint(value);
-//    bias_ = value - rounded_value;
-//    return rounded_value;
-//
-// This class is thread-compatible.
-class ExponentialBiased {
- public:
-  // The number of bits set by NextRandom.
-  static constexpr int kPrngNumBits = 48;
-
-  // `GetSkipCount()` returns the number of events to skip before some chosen
-  // event happens. For example, randomly tossing a coin, we will on average
-  // throw heads once before we get tails. We can simulate random coin tosses
-  // using GetSkipCount() as:
-  //
-  //   ExponentialBiased eb;
-  //   for (...) {
-  //     int number_of_heads_before_tail = eb.GetSkipCount(1);
-  //     for (int flips = 0; flips < number_of_heads_before_tail; ++flips) {
-  //       printf("head...");
-  //     }
-  //     printf("tail\n");
-  //   }
-  //
-  int64_t GetSkipCount(int64_t mean);
-
-  // GetStride() returns the number of events required for a specific event to
-  // happen. See the class comments for a usage example. `GetStride()` is
-  // equivalent to `GetSkipCount(mean - 1) + 1`. When to use `GetStride()` or
-  // `GetSkipCount()` depends mostly on what best fits the use case.
-  int64_t GetStride(int64_t mean);
-
-  // Computes a random number in the range [0, 1<<(kPrngNumBits+1) - 1]
-  //
-  // This is public to enable testing.
-  static uint64_t NextRandom(uint64_t rnd);
-
- private:
-  void Initialize();
-
-  uint64_t rng_{0};
-  double bias_{0};
-  bool initialized_{false};
-};
-
-// Returns the next prng value.
-// pRNG is: aX+b mod c with a = 0x5DEECE66D, b =  0xB, c = 1<<48
-// This is the lrand64 generator.
-inline uint64_t ExponentialBiased::NextRandom(uint64_t rnd) {
-  const uint64_t prng_mult = uint64_t{0x5DEECE66D};
-  const uint64_t prng_add = 0xB;
-  const uint64_t prng_mod_power = 48;
-  const uint64_t prng_mod_mask =
-      ~((~static_cast<uint64_t>(0)) << prng_mod_power);
-  return (prng_mult * rnd + prng_add) & prng_mod_mask;
-}
-
-}  // namespace profiling_internal
-ABSL_NAMESPACE_END
-}  // namespace absl
-
-#endif  // ABSL_PROFILING_INTERNAL_EXPONENTIAL_BIASED_H_