284378a71b
-- 22fa219d17b2281c0695642830c4300711bd65ea by CJ Johnson <johnsoncj@google.com>: Rearrange the private method declarations in InlinedVector PiperOrigin-RevId: 224202447 -- eed3c9f488f23b521bee41d3683eb6cc22517ded by Derek Mauro <dmauro@google.com>: Fix leak_check target (it was always a no-op when LSAN isn't available). Fixes https://github.com/abseil/abseil-cpp/issues/232 PiperOrigin-RevId: 224201634 -- fc08039e175204b14a9561f618fcfc0234586801 by Greg Falcon <gfalcon@google.com>: Add parens around more invocations of min() and max() missed in my prior CL. PiperOrigin-RevId: 224162430 -- 0ec5476a8293c7796cd84928a1a558b14f14f222 by Abseil Team <absl-team@google.com>: Update absl/numeric/CMakeLists.txt to use new functions i.e. absl_cc_(library|test) PiperOrigin-RevId: 224139165 -- 2b46aa6fabb20c589661f8bbc84030ecf39ce394 by Abseil Team <absl-team@google.com>: Update absl/meta/CMakeLists.txt to use new functions i.e. absl_cc_(library|test) PiperOrigin-RevId: 224117258 -- 6c951c798f8c6903bd8793a8a4b5f69244be8aa9 by Abseil Team <absl-team@google.com>: Fix 2 Unused C++ BUILD Dependencies PiperOrigin-RevId: 224070093 -- 0ee7bd191708708f91fc5209c197fd93f6e4a8b3 by Greg Falcon <gfalcon@google.com>: Inside Abseil headers, wrap most invocations of methods and functions named `min` and `max` in parentheses, for better interoperability with Windows toolchains. CCTZ fixes will appear in a follow-up CL. PiperOrigin-RevId: 224051960 -- f562f56577b84a8bc07e5873775c01d068531bca by Jon Cohen <cohenjon@google.com>: Generate Abseil compile options. The single source of truth is now absl/copts/copts.py The way this works goes something like this: copts.py acts as the configuration file. We use python because unlike JSON it allows comments. It has two maps in it: one from names to external flags, and one from names to internal flags. generate_copts.py imports the maps and loops through them to write GENERATED_copts.bzl and GENERATED_AbseilCopts.cmake AbseilConfigureCopts.cmake and configure_copts.bzl import their respective copts args and set the platform-appropriate copts into ABSL_DEFAULT_COPTS, ABSL_TEST_COPTS, ABSL_EXCEPTIONS_FLAG, and ABSL_EXCEPTIONS_LINKOPTS For Bazel, each BUILD file load()s configure_copts.bzl For CMake, AbseilHelpers.cmake include()s AbseilConfigureCopts.cmake to get the final copts and both inserts them as needed into legacy target rules and also makes them available to the rest of our CMakeLists.txt file. We may instead want to include() AbseilConfigureCopts.cmake directly into each CMakeLists.txt file for consistency, but I'm not sure what the deal is with cmake and include guards, or if they are even needed. That's also not as idiomatic -- CMake tends to use directory scope where globals set at a higher level CMakeLists.txt file are used in the subdirectory CMakeLists.txt files. PiperOrigin-RevId: 224039419 -- f7402f6bb65037e668a7355f0a003f5c05a3b6a7 by Abseil Team <absl-team@google.com>: Import of CCTZ from GitHub. PiperOrigin-RevId: 224036622 GitOrigin-RevId: 22fa219d17b2281c0695642830c4300711bd65ea Change-Id: I6b505360539ff2aef8aa30c51a5f7d55db1c75cf
108 lines
4 KiB
C++
108 lines
4 KiB
C++
// Copyright 2018 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
|
|
//
|
|
// 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.
|
|
//
|
|
// This library provides APIs to debug the probing behavior of hash tables.
|
|
//
|
|
// In general, the probing behavior is a black box for users and only the
|
|
// side effects can be measured in the form of performance differences.
|
|
// These APIs give a glimpse on the actual behavior of the probing algorithms in
|
|
// these hashtables given a specified hash function and a set of elements.
|
|
//
|
|
// The probe count distribution can be used to assess the quality of the hash
|
|
// function for that particular hash table. Note that a hash function that
|
|
// performs well in one hash table implementation does not necessarily performs
|
|
// well in a different one.
|
|
//
|
|
// This library supports std::unordered_{set,map}, dense_hash_{set,map} and
|
|
// absl::{flat,node,string}_hash_{set,map}.
|
|
|
|
#ifndef ABSL_CONTAINER_INTERNAL_HASHTABLE_DEBUG_H_
|
|
#define ABSL_CONTAINER_INTERNAL_HASHTABLE_DEBUG_H_
|
|
|
|
#include <cstddef>
|
|
#include <algorithm>
|
|
#include <type_traits>
|
|
#include <vector>
|
|
|
|
#include "absl/container/internal/hashtable_debug_hooks.h"
|
|
|
|
namespace absl {
|
|
namespace container_internal {
|
|
|
|
// Returns the number of probes required to lookup `key`. Returns 0 for a
|
|
// search with no collisions. Higher values mean more hash collisions occurred;
|
|
// however, the exact meaning of this number varies according to the container
|
|
// type.
|
|
template <typename C>
|
|
size_t GetHashtableDebugNumProbes(
|
|
const C& c, const typename C::key_type& key) {
|
|
return absl::container_internal::hashtable_debug_internal::
|
|
HashtableDebugAccess<C>::GetNumProbes(c, key);
|
|
}
|
|
|
|
// Gets a histogram of the number of probes for each elements in the container.
|
|
// The sum of all the values in the vector is equal to container.size().
|
|
template <typename C>
|
|
std::vector<size_t> GetHashtableDebugNumProbesHistogram(const C& container) {
|
|
std::vector<size_t> v;
|
|
for (auto it = container.begin(); it != container.end(); ++it) {
|
|
size_t num_probes = GetHashtableDebugNumProbes(
|
|
container,
|
|
absl::container_internal::hashtable_debug_internal::GetKey<C>(*it, 0));
|
|
v.resize((std::max)(v.size(), num_probes + 1));
|
|
v[num_probes]++;
|
|
}
|
|
return v;
|
|
}
|
|
|
|
struct HashtableDebugProbeSummary {
|
|
size_t total_elements;
|
|
size_t total_num_probes;
|
|
double mean;
|
|
};
|
|
|
|
// Gets a summary of the probe count distribution for the elements in the
|
|
// container.
|
|
template <typename C>
|
|
HashtableDebugProbeSummary GetHashtableDebugProbeSummary(const C& container) {
|
|
auto probes = GetHashtableDebugNumProbesHistogram(container);
|
|
HashtableDebugProbeSummary summary = {};
|
|
for (size_t i = 0; i < probes.size(); ++i) {
|
|
summary.total_elements += probes[i];
|
|
summary.total_num_probes += probes[i] * i;
|
|
}
|
|
summary.mean = 1.0 * summary.total_num_probes / summary.total_elements;
|
|
return summary;
|
|
}
|
|
|
|
// Returns the number of bytes requested from the allocator by the container
|
|
// and not freed.
|
|
template <typename C>
|
|
size_t AllocatedByteSize(const C& c) {
|
|
return absl::container_internal::hashtable_debug_internal::
|
|
HashtableDebugAccess<C>::AllocatedByteSize(c);
|
|
}
|
|
|
|
// Returns a tight lower bound for AllocatedByteSize(c) where `c` is of type `C`
|
|
// and `c.size()` is equal to `num_elements`.
|
|
template <typename C>
|
|
size_t LowerBoundAllocatedByteSize(size_t num_elements) {
|
|
return absl::container_internal::hashtable_debug_internal::
|
|
HashtableDebugAccess<C>::LowerBoundAllocatedByteSize(num_elements);
|
|
}
|
|
|
|
} // namespace container_internal
|
|
} // namespace absl
|
|
|
|
#endif // ABSL_CONTAINER_INTERNAL_HASHTABLE_DEBUG_H_
|