2019-03-19 19:14:01 +01:00
|
|
|
// 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_CONTAINER_INTERNAL_INLINED_VECTOR_INTERNAL_H_
|
|
|
|
#define ABSL_CONTAINER_INTERNAL_INLINED_VECTOR_INTERNAL_H_
|
|
|
|
|
|
|
|
#include <cstddef>
|
2019-05-10 21:38:49 +02:00
|
|
|
#include <cstring>
|
2019-03-19 19:14:01 +01:00
|
|
|
#include <iterator>
|
|
|
|
#include <memory>
|
2019-04-04 17:13:57 +02:00
|
|
|
#include <utility>
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
#include "absl/base/macros.h"
|
2019-04-04 17:13:57 +02:00
|
|
|
#include "absl/container/internal/compressed_tuple.h"
|
2019-05-30 17:42:34 +02:00
|
|
|
#include "absl/memory/memory.h"
|
2019-03-19 19:14:01 +01:00
|
|
|
#include "absl/meta/type_traits.h"
|
|
|
|
|
|
|
|
namespace absl {
|
|
|
|
namespace inlined_vector_internal {
|
|
|
|
|
2019-04-16 21:11:35 +02:00
|
|
|
template <typename Iterator>
|
|
|
|
using IsAtLeastForwardIterator = std::is_convertible<
|
|
|
|
typename std::iterator_traits<Iterator>::iterator_category,
|
|
|
|
std::forward_iterator_tag>;
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
template <typename AllocatorType>
|
|
|
|
using IsMemcpyOk = absl::conjunction<
|
|
|
|
std::is_same<std::allocator<typename AllocatorType::value_type>,
|
|
|
|
AllocatorType>,
|
|
|
|
absl::is_trivially_copy_constructible<typename AllocatorType::value_type>,
|
|
|
|
absl::is_trivially_copy_assignable<typename AllocatorType::value_type>,
|
|
|
|
absl::is_trivially_destructible<typename AllocatorType::value_type>>;
|
|
|
|
|
2019-05-10 21:38:49 +02:00
|
|
|
template <typename AllocatorType, typename ValueType, typename SizeType>
|
2019-05-22 14:06:50 +02:00
|
|
|
void DestroyElements(AllocatorType* alloc_ptr, ValueType* destroy_first,
|
2019-05-10 21:38:49 +02:00
|
|
|
SizeType destroy_size) {
|
2019-05-30 17:42:34 +02:00
|
|
|
using AllocatorTraits = absl::allocator_traits<AllocatorType>;
|
2019-05-10 21:38:49 +02:00
|
|
|
for (SizeType i = 0; i < destroy_size; ++i) {
|
2019-05-22 14:06:50 +02:00
|
|
|
AllocatorTraits::destroy(*alloc_ptr, destroy_first + i);
|
2019-05-10 21:38:49 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef NDEBUG
|
|
|
|
// Overwrite unused memory with `0xab` so we can catch uninitialized usage.
|
|
|
|
//
|
|
|
|
// Cast to `void*` to tell the compiler that we don't care that we might be
|
|
|
|
// scribbling on a vtable pointer.
|
|
|
|
void* memory = reinterpret_cast<void*>(destroy_first);
|
|
|
|
size_t memory_size = sizeof(ValueType) * destroy_size;
|
|
|
|
std::memset(memory, 0xab, memory_size);
|
|
|
|
#endif // NDEBUG
|
|
|
|
}
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
template <typename AllocatorType, typename ValueType, typename ValueAdapter,
|
|
|
|
typename SizeType>
|
|
|
|
void ConstructElements(AllocatorType* alloc_ptr, ValueType* construct_first,
|
|
|
|
ValueAdapter* values_ptr, SizeType construct_size) {
|
|
|
|
// If any construction fails, all completed constructions are rolled back.
|
|
|
|
for (SizeType i = 0; i < construct_size; ++i) {
|
|
|
|
ABSL_INTERNAL_TRY {
|
|
|
|
values_ptr->ConstructNext(alloc_ptr, construct_first + i);
|
|
|
|
}
|
|
|
|
ABSL_INTERNAL_CATCH_ANY {
|
|
|
|
inlined_vector_internal::DestroyElements(alloc_ptr, construct_first, i);
|
|
|
|
|
|
|
|
ABSL_INTERNAL_RETHROW;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
template <typename AllocatorType>
|
|
|
|
struct StorageView {
|
|
|
|
using pointer = typename AllocatorType::pointer;
|
|
|
|
using size_type = typename AllocatorType::size_type;
|
|
|
|
|
|
|
|
pointer data;
|
|
|
|
size_type size;
|
|
|
|
size_type capacity;
|
|
|
|
};
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
template <typename AllocatorType, typename Iterator>
|
|
|
|
class IteratorValueAdapter {
|
|
|
|
using pointer = typename AllocatorType::pointer;
|
|
|
|
using AllocatorTraits = absl::allocator_traits<AllocatorType>;
|
|
|
|
|
|
|
|
public:
|
|
|
|
explicit IteratorValueAdapter(const Iterator& it) : it_(it) {}
|
|
|
|
|
|
|
|
void ConstructNext(AllocatorType* alloc_ptr, pointer construct_at) {
|
|
|
|
AllocatorTraits::construct(*alloc_ptr, construct_at, *it_);
|
|
|
|
++it_;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
Iterator it_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename AllocatorType>
|
|
|
|
class CopyValueAdapter {
|
|
|
|
using pointer = typename AllocatorType::pointer;
|
|
|
|
using const_pointer = typename AllocatorType::const_pointer;
|
|
|
|
using const_reference = typename AllocatorType::const_reference;
|
|
|
|
using AllocatorTraits = absl::allocator_traits<AllocatorType>;
|
|
|
|
|
|
|
|
public:
|
|
|
|
explicit CopyValueAdapter(const_reference v) : ptr_(std::addressof(v)) {}
|
|
|
|
|
|
|
|
void ConstructNext(AllocatorType* alloc_ptr, pointer construct_at) {
|
|
|
|
AllocatorTraits::construct(*alloc_ptr, construct_at, *ptr_);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const_pointer ptr_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename AllocatorType>
|
|
|
|
class DefaultValueAdapter {
|
|
|
|
using pointer = typename AllocatorType::pointer;
|
|
|
|
using value_type = typename AllocatorType::value_type;
|
|
|
|
using AllocatorTraits = absl::allocator_traits<AllocatorType>;
|
|
|
|
|
|
|
|
public:
|
|
|
|
explicit DefaultValueAdapter() {}
|
|
|
|
|
|
|
|
void ConstructNext(AllocatorType* alloc_ptr, pointer construct_at) {
|
|
|
|
AllocatorTraits::construct(*alloc_ptr, construct_at);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2019-05-08 23:20:43 +02:00
|
|
|
template <typename T, size_t N, typename A>
|
|
|
|
class Storage {
|
2019-03-19 19:14:01 +01:00
|
|
|
public:
|
|
|
|
using allocator_type = A;
|
|
|
|
using value_type = typename allocator_type::value_type;
|
|
|
|
using pointer = typename allocator_type::pointer;
|
|
|
|
using const_pointer = typename allocator_type::const_pointer;
|
|
|
|
using reference = typename allocator_type::reference;
|
|
|
|
using const_reference = typename allocator_type::const_reference;
|
|
|
|
using rvalue_reference = typename allocator_type::value_type&&;
|
|
|
|
using size_type = typename allocator_type::size_type;
|
|
|
|
using difference_type = typename allocator_type::difference_type;
|
|
|
|
using iterator = pointer;
|
|
|
|
using const_iterator = const_pointer;
|
|
|
|
using reverse_iterator = std::reverse_iterator<iterator>;
|
|
|
|
using const_reverse_iterator = std::reverse_iterator<const_iterator>;
|
2019-06-18 22:05:50 +02:00
|
|
|
using MoveIterator = std::move_iterator<iterator>;
|
2019-05-30 17:42:34 +02:00
|
|
|
using AllocatorTraits = absl::allocator_traits<allocator_type>;
|
2019-06-18 22:05:50 +02:00
|
|
|
using IsMemcpyOk = inlined_vector_internal::IsMemcpyOk<allocator_type>;
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
using StorageView = inlined_vector_internal::StorageView<allocator_type>;
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
template <typename Iterator>
|
|
|
|
using IteratorValueAdapter =
|
|
|
|
inlined_vector_internal::IteratorValueAdapter<allocator_type, Iterator>;
|
|
|
|
using CopyValueAdapter =
|
|
|
|
inlined_vector_internal::CopyValueAdapter<allocator_type>;
|
|
|
|
using DefaultValueAdapter =
|
|
|
|
inlined_vector_internal::DefaultValueAdapter<allocator_type>;
|
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
Storage() : metadata_() {}
|
|
|
|
|
2019-04-04 17:13:57 +02:00
|
|
|
explicit Storage(const allocator_type& alloc)
|
|
|
|
: metadata_(alloc, /* empty and inlined */ 0) {}
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
~Storage() { DestroyAndDeallocate(); }
|
|
|
|
|
2019-04-04 17:13:57 +02:00
|
|
|
size_type GetSize() const { return GetSizeAndIsAllocated() >> 1; }
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-04-04 17:13:57 +02:00
|
|
|
bool GetIsAllocated() const { return GetSizeAndIsAllocated() & 1; }
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-04-04 17:13:57 +02:00
|
|
|
pointer GetInlinedData() {
|
|
|
|
return reinterpret_cast<pointer>(
|
2019-04-05 18:05:22 +02:00
|
|
|
std::addressof(data_.inlined.inlined_data[0]));
|
2019-04-04 17:13:57 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
const_pointer GetInlinedData() const {
|
|
|
|
return reinterpret_cast<const_pointer>(
|
2019-04-05 18:05:22 +02:00
|
|
|
std::addressof(data_.inlined.inlined_data[0]));
|
2019-04-04 17:13:57 +02:00
|
|
|
}
|
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
pointer GetAllocatedData() { return data_.allocated.allocated_data; }
|
2019-04-04 17:13:57 +02:00
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
const_pointer GetAllocatedData() const {
|
|
|
|
return data_.allocated.allocated_data;
|
|
|
|
}
|
2019-04-04 17:13:57 +02:00
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
size_type GetAllocatedCapacity() const {
|
|
|
|
return data_.allocated.allocated_capacity;
|
|
|
|
}
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
StorageView MakeStorageView() {
|
|
|
|
return GetIsAllocated() ? StorageView{GetAllocatedData(), GetSize(),
|
|
|
|
GetAllocatedCapacity()}
|
|
|
|
: StorageView{GetInlinedData(), GetSize(),
|
|
|
|
static_cast<size_type>(N)};
|
|
|
|
}
|
|
|
|
|
2019-05-22 14:06:50 +02:00
|
|
|
allocator_type* GetAllocPtr() {
|
|
|
|
return std::addressof(metadata_.template get<0>());
|
|
|
|
}
|
2019-04-04 17:13:57 +02:00
|
|
|
|
2019-05-22 14:06:50 +02:00
|
|
|
const allocator_type* GetAllocPtr() const {
|
|
|
|
return std::addressof(metadata_.template get<0>());
|
2019-04-04 17:13:57 +02:00
|
|
|
}
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
void SetIsAllocated() { GetSizeAndIsAllocated() |= 1; }
|
|
|
|
|
2019-04-04 17:13:57 +02:00
|
|
|
void SetAllocatedSize(size_type size) {
|
|
|
|
GetSizeAndIsAllocated() = (size << 1) | static_cast<size_type>(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void SetInlinedSize(size_type size) { GetSizeAndIsAllocated() = size << 1; }
|
|
|
|
|
|
|
|
void AddSize(size_type count) { GetSizeAndIsAllocated() += count << 1; }
|
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
void SetAllocatedData(pointer data, size_type capacity) {
|
|
|
|
data_.allocated.allocated_data = data;
|
2019-04-05 18:05:22 +02:00
|
|
|
data_.allocated.allocated_capacity = capacity;
|
2019-04-04 17:13:57 +02:00
|
|
|
}
|
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
void SwapSizeAndIsAllocated(Storage* other) {
|
2019-04-04 17:13:57 +02:00
|
|
|
using std::swap;
|
2019-04-05 18:05:22 +02:00
|
|
|
swap(GetSizeAndIsAllocated(), other->GetSizeAndIsAllocated());
|
2019-04-04 17:13:57 +02:00
|
|
|
}
|
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
void SwapAllocatedSizeAndCapacity(Storage* other) {
|
|
|
|
using std::swap;
|
|
|
|
swap(data_.allocated, other->data_.allocated);
|
|
|
|
}
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
void MemcpyContents(const Storage& other) {
|
|
|
|
assert(IsMemcpyOk::value);
|
|
|
|
|
|
|
|
GetSizeAndIsAllocated() = other.GetSizeAndIsAllocated();
|
|
|
|
data_ = other.data_;
|
|
|
|
}
|
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
void DestroyAndDeallocate();
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
template <typename ValueAdapter>
|
|
|
|
void Initialize(ValueAdapter values, size_type new_size);
|
|
|
|
|
2019-04-04 17:13:57 +02:00
|
|
|
private:
|
|
|
|
size_type& GetSizeAndIsAllocated() { return metadata_.template get<1>(); }
|
|
|
|
|
|
|
|
const size_type& GetSizeAndIsAllocated() const {
|
|
|
|
return metadata_.template get<1>();
|
|
|
|
}
|
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
using Metadata =
|
|
|
|
container_internal::CompressedTuple<allocator_type, size_type>;
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
struct Allocated {
|
|
|
|
pointer allocated_data;
|
|
|
|
size_type allocated_capacity;
|
|
|
|
};
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
struct Inlined {
|
|
|
|
using InlinedDataElement =
|
|
|
|
absl::aligned_storage_t<sizeof(value_type), alignof(value_type)>;
|
|
|
|
InlinedDataElement inlined_data[N];
|
|
|
|
};
|
2019-03-19 19:14:01 +01:00
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
union Data {
|
|
|
|
Allocated allocated;
|
|
|
|
Inlined inlined;
|
2019-03-19 19:14:01 +01:00
|
|
|
};
|
|
|
|
|
2019-04-05 18:05:22 +02:00
|
|
|
Metadata metadata_;
|
|
|
|
Data data_;
|
2019-03-19 19:14:01 +01:00
|
|
|
};
|
|
|
|
|
2019-06-05 17:26:58 +02:00
|
|
|
template <typename T, size_t N, typename A>
|
|
|
|
void Storage<T, N, A>::DestroyAndDeallocate() {
|
|
|
|
StorageView storage_view = MakeStorageView();
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
inlined_vector_internal::DestroyElements(GetAllocPtr(), storage_view.data,
|
|
|
|
storage_view.size);
|
2019-06-05 17:26:58 +02:00
|
|
|
|
|
|
|
if (GetIsAllocated()) {
|
|
|
|
AllocatorTraits::deallocate(*GetAllocPtr(), storage_view.data,
|
|
|
|
storage_view.capacity);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-06-18 22:05:50 +02:00
|
|
|
template <typename T, size_t N, typename A>
|
|
|
|
template <typename ValueAdapter>
|
|
|
|
auto Storage<T, N, A>::Initialize(ValueAdapter values, size_type new_size)
|
|
|
|
-> void {
|
|
|
|
// Only callable from constructors!
|
|
|
|
assert(!GetIsAllocated());
|
|
|
|
assert(GetSize() == 0);
|
|
|
|
|
|
|
|
pointer construct_data;
|
|
|
|
|
|
|
|
if (new_size > static_cast<size_type>(N)) {
|
|
|
|
// Because this is only called from the `InlinedVector` constructors, it's
|
|
|
|
// safe to take on the allocation with size `0`. If `ConstructElements(...)`
|
|
|
|
// throws, deallocation will be automatically handled by `~Storage()`.
|
|
|
|
construct_data = AllocatorTraits::allocate(*GetAllocPtr(), new_size);
|
|
|
|
SetAllocatedData(construct_data, new_size);
|
|
|
|
SetIsAllocated();
|
|
|
|
} else {
|
|
|
|
construct_data = GetInlinedData();
|
|
|
|
}
|
|
|
|
|
|
|
|
inlined_vector_internal::ConstructElements(GetAllocPtr(), construct_data,
|
|
|
|
&values, new_size);
|
|
|
|
|
|
|
|
// Since the initial size was guaranteed to be `0` and the allocated bit is
|
|
|
|
// already correct for either case, *adding* `new_size` gives us the correct
|
|
|
|
// result faster than setting it directly.
|
|
|
|
AddSize(new_size);
|
|
|
|
}
|
|
|
|
|
2019-03-19 19:14:01 +01:00
|
|
|
} // namespace inlined_vector_internal
|
|
|
|
} // namespace absl
|
|
|
|
|
|
|
|
#endif // ABSL_CONTAINER_INTERNAL_INLINED_VECTOR_INTERNAL_H_
|