2011-09-15 02:33:51 +08:00
|
|
|
// -*- C++ -*-
|
|
|
|
//===--------------------------- __debug ----------------------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef _LIBCPP_DEBUG_H
|
|
|
|
#define _LIBCPP_DEBUG_H
|
|
|
|
|
2013-08-24 01:37:05 +08:00
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
|
|
#pragma GCC system_header
|
|
|
|
#endif
|
|
|
|
|
2011-09-17 01:29:17 +08:00
|
|
|
#if _LIBCPP_DEBUG_LEVEL >= 1
|
|
|
|
|
2011-09-15 02:33:51 +08:00
|
|
|
# include <cstdlib>
|
|
|
|
# include <cstdio>
|
|
|
|
# include <cstddef>
|
2013-03-26 03:29:35 +08:00
|
|
|
# ifndef _LIBCPP_ASSERT
|
|
|
|
# define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : (_VSTD::printf("%s\n", m), _VSTD::abort()))
|
|
|
|
# endif
|
2011-09-15 02:33:51 +08:00
|
|
|
|
2011-09-17 01:29:17 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#if _LIBCPP_DEBUG_LEVEL >= 2
|
|
|
|
|
2011-09-15 02:33:51 +08:00
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
|
2013-03-07 07:30:19 +08:00
|
|
|
struct _LIBCPP_TYPE_VIS __c_node;
|
2011-09-15 02:33:51 +08:00
|
|
|
|
2013-03-07 07:30:19 +08:00
|
|
|
struct _LIBCPP_TYPE_VIS __i_node
|
2011-09-15 02:33:51 +08:00
|
|
|
{
|
|
|
|
void* __i_;
|
|
|
|
__i_node* __next_;
|
|
|
|
__c_node* __c_;
|
|
|
|
|
2013-08-24 01:37:05 +08:00
|
|
|
#ifndef _LIBCPP_HAS_NO_DELETED_FUNCTIONS
|
2011-09-15 02:33:51 +08:00
|
|
|
__i_node(const __i_node&) = delete;
|
|
|
|
__i_node& operator=(const __i_node&) = delete;
|
2013-08-24 01:37:05 +08:00
|
|
|
#else
|
|
|
|
private:
|
|
|
|
__i_node(const __i_node&);
|
|
|
|
__i_node& operator=(const __i_node&);
|
|
|
|
public:
|
|
|
|
#endif
|
2011-09-15 02:33:51 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
|
|
__i_node(void* __i, __i_node* __next, __c_node* __c)
|
|
|
|
: __i_(__i), __next_(__next), __c_(__c) {}
|
|
|
|
~__i_node();
|
|
|
|
};
|
|
|
|
|
2013-03-07 07:30:19 +08:00
|
|
|
struct _LIBCPP_TYPE_VIS __c_node
|
2011-09-15 02:33:51 +08:00
|
|
|
{
|
|
|
|
void* __c_;
|
|
|
|
__c_node* __next_;
|
|
|
|
__i_node** beg_;
|
|
|
|
__i_node** end_;
|
|
|
|
__i_node** cap_;
|
|
|
|
|
2013-08-24 01:37:05 +08:00
|
|
|
#ifndef _LIBCPP_HAS_NO_DELETED_FUNCTIONS
|
2011-09-15 02:33:51 +08:00
|
|
|
__c_node(const __c_node&) = delete;
|
|
|
|
__c_node& operator=(const __c_node&) = delete;
|
2013-08-24 01:37:05 +08:00
|
|
|
#else
|
|
|
|
private:
|
|
|
|
__c_node(const __c_node&);
|
|
|
|
__c_node& operator=(const __c_node&);
|
|
|
|
public:
|
|
|
|
#endif
|
2011-09-15 02:33:51 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
|
|
__c_node(void* __c, __c_node* __next)
|
|
|
|
: __c_(__c), __next_(__next), beg_(nullptr), end_(nullptr), cap_(nullptr) {}
|
|
|
|
virtual ~__c_node();
|
|
|
|
|
|
|
|
virtual bool __dereferenceable(const void*) const = 0;
|
|
|
|
virtual bool __decrementable(const void*) const = 0;
|
|
|
|
virtual bool __addable(const void*, ptrdiff_t) const = 0;
|
|
|
|
virtual bool __subscriptable(const void*, ptrdiff_t) const = 0;
|
|
|
|
|
2011-09-28 07:55:03 +08:00
|
|
|
void __add(__i_node* __i);
|
2011-09-15 02:33:51 +08:00
|
|
|
_LIBCPP_HIDDEN void __remove(__i_node* __i);
|
|
|
|
};
|
|
|
|
|
|
|
|
template <class _Cont>
|
|
|
|
struct _C_node
|
|
|
|
: public __c_node
|
|
|
|
{
|
|
|
|
_C_node(void* __c, __c_node* __n)
|
|
|
|
: __c_node(__c, __n) {}
|
|
|
|
|
|
|
|
virtual bool __dereferenceable(const void*) const;
|
|
|
|
virtual bool __decrementable(const void*) const;
|
|
|
|
virtual bool __addable(const void*, ptrdiff_t) const;
|
|
|
|
virtual bool __subscriptable(const void*, ptrdiff_t) const;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <class _Cont>
|
|
|
|
bool
|
|
|
|
_C_node<_Cont>::__dereferenceable(const void* __i) const
|
|
|
|
{
|
|
|
|
typedef typename _Cont::const_iterator iterator;
|
|
|
|
const iterator* __j = static_cast<const iterator*>(__i);
|
2011-11-30 02:15:50 +08:00
|
|
|
_Cont* _Cp = static_cast<_Cont*>(__c_);
|
|
|
|
return _Cp->__dereferenceable(__j);
|
2011-09-15 02:33:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Cont>
|
|
|
|
bool
|
|
|
|
_C_node<_Cont>::__decrementable(const void* __i) const
|
|
|
|
{
|
|
|
|
typedef typename _Cont::const_iterator iterator;
|
|
|
|
const iterator* __j = static_cast<const iterator*>(__i);
|
2011-11-30 02:15:50 +08:00
|
|
|
_Cont* _Cp = static_cast<_Cont*>(__c_);
|
|
|
|
return _Cp->__decrementable(__j);
|
2011-09-15 02:33:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Cont>
|
|
|
|
bool
|
|
|
|
_C_node<_Cont>::__addable(const void* __i, ptrdiff_t __n) const
|
|
|
|
{
|
|
|
|
typedef typename _Cont::const_iterator iterator;
|
|
|
|
const iterator* __j = static_cast<const iterator*>(__i);
|
2011-11-30 02:15:50 +08:00
|
|
|
_Cont* _Cp = static_cast<_Cont*>(__c_);
|
|
|
|
return _Cp->__addable(__j, __n);
|
2011-09-15 02:33:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class _Cont>
|
|
|
|
bool
|
|
|
|
_C_node<_Cont>::__subscriptable(const void* __i, ptrdiff_t __n) const
|
|
|
|
{
|
|
|
|
typedef typename _Cont::const_iterator iterator;
|
|
|
|
const iterator* __j = static_cast<const iterator*>(__i);
|
2011-11-30 02:15:50 +08:00
|
|
|
_Cont* _Cp = static_cast<_Cont*>(__c_);
|
|
|
|
return _Cp->__subscriptable(__j, __n);
|
2011-09-15 02:33:51 +08:00
|
|
|
}
|
|
|
|
|
2013-03-07 07:30:19 +08:00
|
|
|
class _LIBCPP_TYPE_VIS __libcpp_db
|
2011-09-15 02:33:51 +08:00
|
|
|
{
|
|
|
|
__c_node** __cbeg_;
|
|
|
|
__c_node** __cend_;
|
|
|
|
size_t __csz_;
|
|
|
|
__i_node** __ibeg_;
|
|
|
|
__i_node** __iend_;
|
|
|
|
size_t __isz_;
|
|
|
|
|
|
|
|
__libcpp_db();
|
|
|
|
public:
|
2013-08-24 01:37:05 +08:00
|
|
|
#ifndef _LIBCPP_HAS_NO_DELETED_FUNCTIONS
|
2011-09-15 02:33:51 +08:00
|
|
|
__libcpp_db(const __libcpp_db&) = delete;
|
|
|
|
__libcpp_db& operator=(const __libcpp_db&) = delete;
|
2013-08-24 01:37:05 +08:00
|
|
|
#else
|
|
|
|
private:
|
|
|
|
__libcpp_db(const __libcpp_db&);
|
|
|
|
__libcpp_db& operator=(const __libcpp_db&);
|
|
|
|
public:
|
|
|
|
#endif
|
2011-09-15 02:33:51 +08:00
|
|
|
~__libcpp_db();
|
|
|
|
|
|
|
|
class __db_c_iterator;
|
|
|
|
class __db_c_const_iterator;
|
|
|
|
class __db_i_iterator;
|
|
|
|
class __db_i_const_iterator;
|
|
|
|
|
|
|
|
__db_c_const_iterator __c_end() const;
|
|
|
|
__db_i_const_iterator __i_end() const;
|
|
|
|
|
|
|
|
template <class _Cont>
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
|
|
void __insert_c(_Cont* __c)
|
|
|
|
{
|
|
|
|
__c_node* __n = __insert_c(static_cast<void*>(__c));
|
|
|
|
::new(__n) _C_node<_Cont>(__n->__c_, __n->__next_);
|
|
|
|
}
|
|
|
|
|
2011-09-17 03:52:23 +08:00
|
|
|
void __insert_i(void* __i);
|
2011-09-15 02:33:51 +08:00
|
|
|
__c_node* __insert_c(void* __c);
|
|
|
|
void __erase_c(void* __c);
|
|
|
|
|
|
|
|
void __insert_ic(void* __i, const void* __c);
|
|
|
|
void __iterator_copy(void* __i, const void* __i0);
|
|
|
|
void __erase_i(void* __i);
|
|
|
|
|
|
|
|
void* __find_c_from_i(void* __i) const;
|
|
|
|
void __invalidate_all(void* __c);
|
|
|
|
__c_node* __find_c_and_lock(void* __c) const;
|
2011-09-28 07:55:03 +08:00
|
|
|
__c_node* __find_c(void* __c) const;
|
2011-09-15 02:33:51 +08:00
|
|
|
void unlock() const;
|
|
|
|
|
|
|
|
void swap(void* __c1, void* __c2);
|
|
|
|
|
|
|
|
|
|
|
|
bool __dereferenceable(const void* __i) const;
|
|
|
|
bool __decrementable(const void* __i) const;
|
|
|
|
bool __addable(const void* __i, ptrdiff_t __n) const;
|
|
|
|
bool __subscriptable(const void* __i, ptrdiff_t __n) const;
|
Ok, 3 major changes for debug mode in one commit:
1. I had been detecting and trapping iterator == and \!= among iterators
in different containers as an error. But the trapping itself is actually
an error.
Consider:
#include <iostream>
#include <vector>
#include <algorithm>
template <class C>
void
display(const C& c)
{
std::cout << "{";
bool first = true;
for (const auto& x : c)
{
if (\!first)
std::cout << ", ";
first = false;
std::cout << x;
}
std::cout << "}\n";
}
int
main()
{
typedef std::vector<int> V;
V v1 = {1, 3, 5};
V v2 = {2, 4, 6};
display(v1);
display(v2);
V::iterator i = std::find(v1.begin(), v1.end(), 1);
V::iterator j = std::find(v2.begin(), v2.end(), 2);
if (*i == *j)
i = j; // perfectly legal
// ...
if (i \!= j) // the only way to check
v2.push_back(*i);
display(v1);
display(v2);
}
It is legal to assign an iterator from one container to another of the
same type. This is required to work. One might want to test whether or
not such an assignment had been made. The way one performs such a check
is using the iterator's ==, \!= operator. This is a logical and necessary
function and does not constitute an error.
2. I had a header circular dependence bug when _LIBCPP_DEBUG2 is defined.
This caused a problem in several of the libc++ tests.
Fixed.
3. There is a serious problem when _LIBCPP_DEBUG2=1 at the moment in that
std::basic_string is inoperable. std::basic_string uses __wrap_iterator
to implement its iterators. __wrap_iterator has been rigged up in debug
mode to support vector. But string hasn't been rigged up yet. This means
that one gets false positives when using std::string in debug mode. I've
upped std::string's priority in www/debug_mode.html.
llvm-svn: 187636
2013-08-02 08:26:35 +08:00
|
|
|
bool __less_than_comparable(const void* __i, const void* __j) const;
|
2011-09-15 02:33:51 +08:00
|
|
|
private:
|
|
|
|
_LIBCPP_HIDDEN
|
|
|
|
__i_node* __insert_iterator(void* __i);
|
|
|
|
_LIBCPP_HIDDEN
|
|
|
|
__i_node* __find_iterator(const void* __i) const;
|
|
|
|
|
2013-03-07 07:30:19 +08:00
|
|
|
friend _LIBCPP_FUNC_VIS __libcpp_db* __get_db();
|
2011-09-15 02:33:51 +08:00
|
|
|
};
|
|
|
|
|
2013-03-07 07:30:19 +08:00
|
|
|
_LIBCPP_FUNC_VIS __libcpp_db* __get_db();
|
|
|
|
_LIBCPP_FUNC_VIS const __libcpp_db* __get_const_db();
|
2011-09-15 02:33:51 +08:00
|
|
|
|
|
|
|
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
|
2011-09-17 01:29:17 +08:00
|
|
|
#endif
|
|
|
|
|
2011-09-15 02:33:51 +08:00
|
|
|
#endif // _LIBCPP_DEBUG_H
|
|
|
|
|