--
990253454819ce26ff1dda9ab4bbc145b61d01e4 by Xiaoyi Zhang <zhangxy@google.com>:
Import github PR https://github.com/abseil/abseil-cpp/pull/645
PiperOrigin-RevId: 303119797
--
5ac845cb7929b7d1eaf59a309afd811db5001175 by Abseil Team <absl-team@google.com>:
Fix internal exception spec compatibility error
PiperOrigin-RevId: 303104081
--
3290595dd866eecab3c7044e2e3ca0adb74f1bf5 by Gennadiy Rozental <rogeeff@google.com>:
Use FlagValue<T> to represent the value of a flag. Place it directly after
FlagImpl and use a computed offset refer to it.
The offset is computed based on the assumption that the `value_` data member
is placed directly after the impl_ data member in Flag<T>.
This change will allow us to migrate to `T`-specific storage in the generic case.
This change decreases the overhead for int flags by 32 bytes.
PiperOrigin-RevId: 303038099
--
f2b37722cd7a6d3a60ef9713f0d2bbff56f3ddbf by Derek Mauro <dmauro@google.com>:
Minor correctness fix for an ABSL_HAVE_BUILTIN conditional
PiperOrigin-RevId: 302980666
--
39c079a6141ae1c5728af8bf33a39c8aff9deb9f by Abseil Team <absl-team@google.com>:
Use ABSL_HARDENING_ASSERT in b-tree and SwissTable iterators.
PiperOrigin-RevId: 302970075
--
9668a044e080c789df32bcaa1ffb5100831cd9fa by Benjamin Barenblat <bbaren@google.com>:
Correct `add_subdirectory` line in CMake googletest support
Commit bcefbdcdf6 added support for building with CMake against a local googletest checkout, but I missed a line when constructing the diff. Change the `add_subdirectory` line to reference the correct directories.
PiperOrigin-RevId: 302947488
--
0a3c10fabf80a43ca69ab8b1570030e55f2be741 by Andy Soffer <asoffer@google.com>:
Remove unused distribution format traits.
PiperOrigin-RevId: 302896176
--
0478f2f6270e5ed64c0e28ec09556ca90b2d46a9 by Samuel Benzaquen <sbenza@google.com>:
Fix for CWG:2310.
PiperOrigin-RevId: 302734089
--
3cb978dda5cae5905affdc0914dcc2d27671ed11 by Samuel Benzaquen <sbenza@google.com>:
Fix the Allocate/Deallocate functions to use the same underlying allocator type.
PiperOrigin-RevId: 302721804
--
ae38d3984fb68b4e3ddc165fa8d5c24d5936be52 by Matthew Brown <matthewbr@google.com>:
Internal Change
PiperOrigin-RevId: 302717314
--
7357cf7abd03cc60b6e82b5f28a8e34935c3b4dc by Andy Getzendanner <durandal@google.com>:
Fix typo: s/ABSL_HARDENED_ASSERT/ABSL_HARDENING_ASSERT/
PiperOrigin-RevId: 302532164
GitOrigin-RevId: 990253454819ce26ff1dda9ab4bbc145b61d01e4
Change-Id: Ie595a221c16e1e7e1255ad42e029b646c5f3e11d
		
	
			
		
			
				
	
	
		
			228 lines
		
	
	
	
		
			6.5 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			228 lines
		
	
	
	
		
			6.5 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
 | |
| //
 | |
| //      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/container/internal/container_memory.h"
 | |
| 
 | |
| #include <cstdint>
 | |
| #include <tuple>
 | |
| #include <typeindex>
 | |
| #include <typeinfo>
 | |
| #include <utility>
 | |
| 
 | |
| #include "gmock/gmock.h"
 | |
| #include "gtest/gtest.h"
 | |
| #include "absl/strings/string_view.h"
 | |
| 
 | |
| namespace absl {
 | |
| ABSL_NAMESPACE_BEGIN
 | |
| namespace container_internal {
 | |
| namespace {
 | |
| 
 | |
| using ::testing::Gt;
 | |
| using ::testing::_;
 | |
| using ::testing::ElementsAre;
 | |
| using ::testing::Pair;
 | |
| 
 | |
| TEST(Memory, AlignmentLargerThanBase) {
 | |
|   std::allocator<int8_t> alloc;
 | |
|   void* mem = Allocate<2>(&alloc, 3);
 | |
|   EXPECT_EQ(0, reinterpret_cast<uintptr_t>(mem) % 2);
 | |
|   memcpy(mem, "abc", 3);
 | |
|   Deallocate<2>(&alloc, mem, 3);
 | |
| }
 | |
| 
 | |
| TEST(Memory, AlignmentSmallerThanBase) {
 | |
|   std::allocator<int64_t> alloc;
 | |
|   void* mem = Allocate<2>(&alloc, 3);
 | |
|   EXPECT_EQ(0, reinterpret_cast<uintptr_t>(mem) % 2);
 | |
|   memcpy(mem, "abc", 3);
 | |
|   Deallocate<2>(&alloc, mem, 3);
 | |
| }
 | |
| 
 | |
| std::map<std::type_index, int>& AllocationMap() {
 | |
|   static auto* map = new std::map<std::type_index, int>;
 | |
|   return *map;
 | |
| }
 | |
| 
 | |
| template <typename T>
 | |
| struct TypeCountingAllocator {
 | |
|   TypeCountingAllocator() = default;
 | |
|   template <typename U>
 | |
|   TypeCountingAllocator(const TypeCountingAllocator<U>&) {}  // NOLINT
 | |
| 
 | |
|   using value_type = T;
 | |
| 
 | |
|   T* allocate(size_t n, const void* = nullptr) {
 | |
|     AllocationMap()[typeid(T)] += n;
 | |
|     return std::allocator<T>().allocate(n);
 | |
|   }
 | |
|   void deallocate(T* p, std::size_t n) {
 | |
|     AllocationMap()[typeid(T)] -= n;
 | |
|     return std::allocator<T>().deallocate(p, n);
 | |
|   }
 | |
| };
 | |
| 
 | |
| TEST(Memory, AllocateDeallocateMatchType) {
 | |
|   TypeCountingAllocator<int> alloc;
 | |
|   void* mem = Allocate<1>(&alloc, 1);
 | |
|   // Verify that it was allocated
 | |
|   EXPECT_THAT(AllocationMap(), ElementsAre(Pair(_, Gt(0))));
 | |
|   Deallocate<1>(&alloc, mem, 1);
 | |
|   // Verify that the deallocation matched.
 | |
|   EXPECT_THAT(AllocationMap(), ElementsAre(Pair(_, 0)));
 | |
| }
 | |
| 
 | |
| class Fixture : public ::testing::Test {
 | |
|   using Alloc = std::allocator<std::string>;
 | |
| 
 | |
|  public:
 | |
|   Fixture() { ptr_ = std::allocator_traits<Alloc>::allocate(*alloc(), 1); }
 | |
|   ~Fixture() override {
 | |
|     std::allocator_traits<Alloc>::destroy(*alloc(), ptr_);
 | |
|     std::allocator_traits<Alloc>::deallocate(*alloc(), ptr_, 1);
 | |
|   }
 | |
|   std::string* ptr() { return ptr_; }
 | |
|   Alloc* alloc() { return &alloc_; }
 | |
| 
 | |
|  private:
 | |
|   Alloc alloc_;
 | |
|   std::string* ptr_;
 | |
| };
 | |
| 
 | |
| TEST_F(Fixture, ConstructNoArgs) {
 | |
|   ConstructFromTuple(alloc(), ptr(), std::forward_as_tuple());
 | |
|   EXPECT_EQ(*ptr(), "");
 | |
| }
 | |
| 
 | |
| TEST_F(Fixture, ConstructOneArg) {
 | |
|   ConstructFromTuple(alloc(), ptr(), std::forward_as_tuple("abcde"));
 | |
|   EXPECT_EQ(*ptr(), "abcde");
 | |
| }
 | |
| 
 | |
| TEST_F(Fixture, ConstructTwoArg) {
 | |
|   ConstructFromTuple(alloc(), ptr(), std::forward_as_tuple(5, 'a'));
 | |
|   EXPECT_EQ(*ptr(), "aaaaa");
 | |
| }
 | |
| 
 | |
| TEST(PairArgs, NoArgs) {
 | |
|   EXPECT_THAT(PairArgs(),
 | |
|               Pair(std::forward_as_tuple(), std::forward_as_tuple()));
 | |
| }
 | |
| 
 | |
| TEST(PairArgs, TwoArgs) {
 | |
|   EXPECT_EQ(
 | |
|       std::make_pair(std::forward_as_tuple(1), std::forward_as_tuple('A')),
 | |
|       PairArgs(1, 'A'));
 | |
| }
 | |
| 
 | |
| TEST(PairArgs, Pair) {
 | |
|   EXPECT_EQ(
 | |
|       std::make_pair(std::forward_as_tuple(1), std::forward_as_tuple('A')),
 | |
|       PairArgs(std::make_pair(1, 'A')));
 | |
| }
 | |
| 
 | |
| TEST(PairArgs, Piecewise) {
 | |
|   EXPECT_EQ(
 | |
|       std::make_pair(std::forward_as_tuple(1), std::forward_as_tuple('A')),
 | |
|       PairArgs(std::piecewise_construct, std::forward_as_tuple(1),
 | |
|                std::forward_as_tuple('A')));
 | |
| }
 | |
| 
 | |
| TEST(WithConstructed, Simple) {
 | |
|   EXPECT_EQ(1, WithConstructed<absl::string_view>(
 | |
|                    std::make_tuple(std::string("a")),
 | |
|                    [](absl::string_view str) { return str.size(); }));
 | |
| }
 | |
| 
 | |
| template <class F, class Arg>
 | |
| decltype(DecomposeValue(std::declval<F>(), std::declval<Arg>()))
 | |
| DecomposeValueImpl(int, F&& f, Arg&& arg) {
 | |
|   return DecomposeValue(std::forward<F>(f), std::forward<Arg>(arg));
 | |
| }
 | |
| 
 | |
| template <class F, class Arg>
 | |
| const char* DecomposeValueImpl(char, F&& f, Arg&& arg) {
 | |
|   return "not decomposable";
 | |
| }
 | |
| 
 | |
| template <class F, class Arg>
 | |
| decltype(DecomposeValueImpl(0, std::declval<F>(), std::declval<Arg>()))
 | |
| TryDecomposeValue(F&& f, Arg&& arg) {
 | |
|   return DecomposeValueImpl(0, std::forward<F>(f), std::forward<Arg>(arg));
 | |
| }
 | |
| 
 | |
| TEST(DecomposeValue, Decomposable) {
 | |
|   auto f = [](const int& x, int&& y) {
 | |
|     EXPECT_EQ(&x, &y);
 | |
|     EXPECT_EQ(42, x);
 | |
|     return 'A';
 | |
|   };
 | |
|   EXPECT_EQ('A', TryDecomposeValue(f, 42));
 | |
| }
 | |
| 
 | |
| TEST(DecomposeValue, NotDecomposable) {
 | |
|   auto f = [](void*) {
 | |
|     ADD_FAILURE() << "Must not be called";
 | |
|     return 'A';
 | |
|   };
 | |
|   EXPECT_STREQ("not decomposable", TryDecomposeValue(f, 42));
 | |
| }
 | |
| 
 | |
| template <class F, class... Args>
 | |
| decltype(DecomposePair(std::declval<F>(), std::declval<Args>()...))
 | |
| DecomposePairImpl(int, F&& f, Args&&... args) {
 | |
|   return DecomposePair(std::forward<F>(f), std::forward<Args>(args)...);
 | |
| }
 | |
| 
 | |
| template <class F, class... Args>
 | |
| const char* DecomposePairImpl(char, F&& f, Args&&... args) {
 | |
|   return "not decomposable";
 | |
| }
 | |
| 
 | |
| template <class F, class... Args>
 | |
| decltype(DecomposePairImpl(0, std::declval<F>(), std::declval<Args>()...))
 | |
| TryDecomposePair(F&& f, Args&&... args) {
 | |
|   return DecomposePairImpl(0, std::forward<F>(f), std::forward<Args>(args)...);
 | |
| }
 | |
| 
 | |
| TEST(DecomposePair, Decomposable) {
 | |
|   auto f = [](const int& x, std::piecewise_construct_t, std::tuple<int&&> k,
 | |
|               std::tuple<double>&& v) {
 | |
|     EXPECT_EQ(&x, &std::get<0>(k));
 | |
|     EXPECT_EQ(42, x);
 | |
|     EXPECT_EQ(0.5, std::get<0>(v));
 | |
|     return 'A';
 | |
|   };
 | |
|   EXPECT_EQ('A', TryDecomposePair(f, 42, 0.5));
 | |
|   EXPECT_EQ('A', TryDecomposePair(f, std::make_pair(42, 0.5)));
 | |
|   EXPECT_EQ('A', TryDecomposePair(f, std::piecewise_construct,
 | |
|                                   std::make_tuple(42), std::make_tuple(0.5)));
 | |
| }
 | |
| 
 | |
| TEST(DecomposePair, NotDecomposable) {
 | |
|   auto f = [](...) {
 | |
|     ADD_FAILURE() << "Must not be called";
 | |
|     return 'A';
 | |
|   };
 | |
|   EXPECT_STREQ("not decomposable",
 | |
|                TryDecomposePair(f));
 | |
|   EXPECT_STREQ("not decomposable",
 | |
|                TryDecomposePair(f, std::piecewise_construct, std::make_tuple(),
 | |
|                                 std::make_tuple(0.5)));
 | |
| }
 | |
| 
 | |
| }  // namespace
 | |
| }  // namespace container_internal
 | |
| ABSL_NAMESPACE_END
 | |
| }  // namespace absl
 |