129 lines
3.6 KiB
C++
129 lines
3.6 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef TEST_STD_CONTAINERS_SEQUENCES_VECTOR_COMMON_H
|
|
#define TEST_STD_CONTAINERS_SEQUENCES_VECTOR_COMMON_H
|
|
|
|
#include <cassert>
|
|
#include <cstddef>
|
|
#include <memory>
|
|
#include <type_traits>
|
|
|
|
#include "count_new.h"
|
|
|
|
struct throwing_t {
|
|
int* throw_after_n_ = nullptr;
|
|
throwing_t() { throw 0; }
|
|
|
|
explicit throwing_t(int& throw_after_n) : throw_after_n_(&throw_after_n) {
|
|
if (throw_after_n == 0)
|
|
throw 0;
|
|
--throw_after_n;
|
|
}
|
|
|
|
throwing_t(const throwing_t& rhs) : throw_after_n_(rhs.throw_after_n_) {
|
|
if (throw_after_n_ == nullptr || *throw_after_n_ == 0)
|
|
throw 1;
|
|
--*throw_after_n_;
|
|
}
|
|
|
|
throwing_t& operator=(const throwing_t& rhs) {
|
|
throw_after_n_ = rhs.throw_after_n_;
|
|
if (throw_after_n_ == nullptr || *throw_after_n_ == 0)
|
|
throw 1;
|
|
--*throw_after_n_;
|
|
return *this;
|
|
}
|
|
|
|
friend bool operator==(const throwing_t& lhs, const throwing_t& rhs) {
|
|
return lhs.throw_after_n_ == rhs.throw_after_n_;
|
|
}
|
|
friend bool operator!=(const throwing_t& lhs, const throwing_t& rhs) {
|
|
return lhs.throw_after_n_ != rhs.throw_after_n_;
|
|
}
|
|
};
|
|
|
|
template <class T>
|
|
struct throwing_allocator {
|
|
using value_type = T;
|
|
|
|
bool throw_on_copy_ = false;
|
|
|
|
explicit throwing_allocator(bool throw_on_ctor = true) {
|
|
if (throw_on_ctor)
|
|
throw 0;
|
|
}
|
|
|
|
explicit throwing_allocator(bool throw_on_ctor, bool throw_on_copy) : throw_on_copy_(throw_on_copy) {
|
|
if (throw_on_ctor)
|
|
throw 0;
|
|
}
|
|
|
|
throwing_allocator(const throwing_allocator& rhs) : throw_on_copy_(rhs.throw_on_copy_) {
|
|
if (throw_on_copy_)
|
|
throw 0;
|
|
}
|
|
|
|
template <class U>
|
|
throwing_allocator(const throwing_allocator<U>& rhs) : throw_on_copy_(rhs.throw_on_copy_) {
|
|
if (throw_on_copy_)
|
|
throw 0;
|
|
}
|
|
|
|
T* allocate(std::size_t n) { return std::allocator<T>().allocate(n); }
|
|
void deallocate(T* ptr, std::size_t n) { std::allocator<T>().deallocate(ptr, n); }
|
|
|
|
template <class U>
|
|
friend bool operator==(const throwing_allocator&, const throwing_allocator<U>&) {
|
|
return true;
|
|
}
|
|
};
|
|
|
|
template <class T, class IterCat>
|
|
struct throwing_iterator {
|
|
using iterator_category = IterCat;
|
|
using difference_type = std::ptrdiff_t;
|
|
using value_type = T;
|
|
using reference = T&;
|
|
using pointer = T*;
|
|
|
|
int i_;
|
|
T v_;
|
|
|
|
explicit throwing_iterator(int i = 0, const T& v = T()) : i_(i), v_(v) {}
|
|
|
|
reference operator*() {
|
|
if (i_ == 1)
|
|
throw 1;
|
|
return v_;
|
|
}
|
|
|
|
friend bool operator==(const throwing_iterator& lhs, const throwing_iterator& rhs) { return lhs.i_ == rhs.i_; }
|
|
friend bool operator!=(const throwing_iterator& lhs, const throwing_iterator& rhs) { return lhs.i_ != rhs.i_; }
|
|
|
|
throwing_iterator& operator++() {
|
|
++i_;
|
|
return *this;
|
|
}
|
|
|
|
throwing_iterator operator++(int) {
|
|
auto tmp = *this;
|
|
++i_;
|
|
return tmp;
|
|
}
|
|
};
|
|
|
|
inline void check_new_delete_called() {
|
|
assert(globalMemCounter.new_called == globalMemCounter.delete_called);
|
|
assert(globalMemCounter.new_array_called == globalMemCounter.delete_array_called);
|
|
assert(globalMemCounter.aligned_new_called == globalMemCounter.aligned_delete_called);
|
|
assert(globalMemCounter.aligned_new_array_called == globalMemCounter.aligned_delete_array_called);
|
|
}
|
|
|
|
#endif // TEST_STD_CONTAINERS_SEQUENCES_VECTOR_COMMON_H
|