libstdc++
__gnu_debug Namespace Reference

Classes

Typedefs

Enumerations

Functions


Detailed Description

GNU debug classes for public use.


Function Documentation

template<typename _Iterator >
_Siter_base<_Iterator>::iterator_type __gnu_debug::__base ( _Iterator  __it) [inline]

Helper function to extract base iterator of random access safe iterator in order to reduce performance impact of debug mode. Limited to random access iterator because it is the only category for which it is possible to check for correct iterators order in the __valid_range function thanks to the < operator.

Definition at line 683 of file safe_iterator.h.

Referenced by std::boolalpha(), std::noboolalpha(), std::showbase(), std::noshowbase(), std::showpoint(), std::noshowpoint(), std::showpos(), std::noshowpos(), std::skipws(), std::noskipws(), std::uppercase(), std::nouppercase(), std::unitbuf(), std::nounitbuf(), std::internal(), std::left(), std::right(), std::dec(), std::hex(), std::oct(), std::fixed(), std::scientific(), __gnu_debug::basic_string::append(), __gnu_debug::basic_string::assign(), and __gnu_parallel::__for_each_template_random_access_workstealing().

template<typename _Iterator >
bool __gnu_debug::__check_dereferenceable ( _Iterator &  ) [inline]

Assume that some arbitrary iterator is dereferenceable, because we can't prove that it isn't.

Definition at line 70 of file functions.h.

template<typename _Tp >
bool __gnu_debug::__check_dereferenceable ( const _Tp *  __ptr) [inline]

Non-NULL pointers are dereferenceable.

Definition at line 76 of file functions.h.

template<typename _Iterator , typename _Sequence >
bool __gnu_debug::__check_dereferenceable ( const _Safe_iterator< _Iterator, _Sequence > &  __x) [inline]

Safe iterators know if they are singular.

Definition at line 82 of file functions.h.

References __gnu_debug::_Safe_iterator::_M_dereferenceable().

template<typename _Tp >
bool __gnu_debug::__check_singular ( const _Tp *  __ptr) [inline]

Non-NULL pointers are nonsingular.

Definition at line 57 of file functions.h.

template<typename _Iterator , typename _Sequence >
bool __gnu_debug::__check_singular ( const _Safe_iterator< _Iterator, _Sequence > &  __x) [inline]

Safe iterators know if they are singular.

Definition at line 63 of file functions.h.

References __gnu_debug::_Safe_iterator_base::_M_singular().

bool __gnu_debug::__check_singular_aux ( const _Safe_iterator_base *  __x) [inline]

Iterators that derive from _Safe_iterator_base but that aren't _Safe_iterators can be determined singular or non-singular via _Safe_iterator_base.

Definition at line 62 of file safe_iterator.h.

References __gnu_debug::_Safe_iterator_base::_M_singular().

template<typename _CharT , typename _Integer >
const _CharT* __gnu_debug::__check_string ( const _CharT *  __s,
const _Integer &__n   __attribute__(__unused__) 
) [inline]

Checks that __s is non-NULL or __n == 0, and then returns __s.

Definition at line 164 of file functions.h.

template<typename _CharT >
const _CharT* __gnu_debug::__check_string ( const _CharT *  __s) [inline]

Checks that __s is non-NULL and then returns __s.

Definition at line 176 of file functions.h.

template<typename _InputIterator >
bool __gnu_debug::__valid_range ( const _InputIterator &  __first,
const _InputIterator &  __last 
) [inline]

Don't know what these iterators are, or if they are even iterators (we may get an integral type for InputIterator), so see if they are integral and pass them on to the next phase otherwise.

Definition at line 134 of file functions.h.

References __valid_range_aux().

template<typename _Iterator , typename _Sequence >
bool __gnu_debug::__valid_range ( const _Safe_iterator< _Iterator, _Sequence > &  __first,
const _Safe_iterator< _Iterator, _Sequence > &  __last 
) [inline]

Safe iterators know how to check if they form a valid range.

Definition at line 143 of file functions.h.

template<typename _Integral >
bool __gnu_debug::__valid_range_aux ( const _Integral &  ,
const _Integral &  ,
std::__true_type   
) [inline]

We say that integral types for a valid range, and defer to other routines to realize what to do with integral types instead of iterators.

Definition at line 111 of file functions.h.

Referenced by __valid_range().

template<typename _InputIterator >
bool __gnu_debug::__valid_range_aux ( const _InputIterator &  __first,
const _InputIterator &  __last,
std::__false_type   
) [inline]

We have iterators, so figure out what kind of iterators that are to see if we can check the range ahead of time.

Definition at line 119 of file functions.h.

References __valid_range_aux2().

template<typename _RandomAccessIterator >
bool __gnu_debug::__valid_range_aux2 ( const _RandomAccessIterator &  __first,
const _RandomAccessIterator &  __last,
std::random_access_iterator_tag   
) [inline]

If the distance between two random access iterators is nonnegative, assume the range is valid.

Definition at line 90 of file functions.h.

Referenced by __valid_range_aux().

template<typename _InputIterator >
bool __gnu_debug::__valid_range_aux2 ( const _InputIterator &  ,
const _InputIterator &  ,
std::input_iterator_tag   
) [inline]

Can't test for a valid range with input iterators, because iteration may be destructive. So we just assume that the range is valid.

Definition at line 101 of file functions.h.