1 // Profiling vector implementation -*- C++ -*-
3 // Copyright (C) 2009-2012 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License along
21 // with this library; see the file COPYING3. If not see
22 // <http://www.gnu.org/licenses/>.
24 /** @file profile/vector
25 * This file is a GNU profile extension to the Standard C++ Library.
28 #ifndef _GLIBCXX_PROFILE_VECTOR
29 #define _GLIBCXX_PROFILE_VECTOR 1
33 #include <profile/base.h>
34 #include <profile/iterator_tracker.h>
36 namespace std _GLIBCXX_VISIBILITY(default)
40 template<typename _Tp,
41 typename _Allocator = std::allocator<_Tp> >
43 : public _GLIBCXX_STD_C::vector<_Tp, _Allocator>
45 typedef _GLIBCXX_STD_C::vector<_Tp, _Allocator> _Base;
47 #ifdef __GXX_EXPERIMENTAL_CXX0X__
48 typedef __gnu_cxx::__alloc_traits<_Allocator> _Alloc_traits;
52 typedef typename _Base::reference reference;
53 typedef typename _Base::const_reference const_reference;
55 typedef __iterator_tracker<typename _Base::iterator, vector>
57 typedef __iterator_tracker<typename _Base::const_iterator, vector>
60 typedef typename _Base::size_type size_type;
61 typedef typename _Base::difference_type difference_type;
63 typedef _Tp value_type;
64 typedef _Allocator allocator_type;
65 typedef typename _Base::pointer pointer;
66 typedef typename _Base::const_pointer const_pointer;
67 typedef std::reverse_iterator<iterator> reverse_iterator;
68 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
71 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
74 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
76 // 23.2.4.1 construct/copy/destroy:
78 vector(const _Allocator& __a = _Allocator())
81 __profcxx_vector_construct(this, this->capacity());
82 __profcxx_vector_construct2(this);
85 #ifdef __GXX_EXPERIMENTAL_CXX0X__
87 vector(size_type __n, const _Allocator& __a = _Allocator())
90 __profcxx_vector_construct(this, this->capacity());
91 __profcxx_vector_construct2(this);
94 vector(size_type __n, const _Tp& __value,
95 const _Allocator& __a = _Allocator())
96 : _Base(__n, __value, __a)
98 __profcxx_vector_construct(this, this->capacity());
99 __profcxx_vector_construct2(this);
103 vector(size_type __n, const _Tp& __value = _Tp(),
104 const _Allocator& __a = _Allocator())
105 : _Base(__n, __value, __a)
107 __profcxx_vector_construct(this, this->capacity());
108 __profcxx_vector_construct2(this);
112 #ifdef __GXX_EXPERIMENTAL_CXX0X__
113 template<typename _InputIterator,
114 typename = std::_RequireInputIter<_InputIterator>>
116 template<typename _InputIterator>
118 vector(_InputIterator __first, _InputIterator __last,
119 const _Allocator& __a = _Allocator())
120 : _Base(__first, __last, __a)
122 __profcxx_vector_construct(this, this->capacity());
123 __profcxx_vector_construct2(this);
126 vector(const vector& __x)
129 __profcxx_vector_construct(this, this->capacity());
130 __profcxx_vector_construct2(this);
133 /// Construction from a release-mode vector
134 vector(const _Base& __x)
137 __profcxx_vector_construct(this, this->capacity());
138 __profcxx_vector_construct2(this);
141 #ifdef __GXX_EXPERIMENTAL_CXX0X__
142 vector(vector&& __x) noexcept
143 : _Base(std::move(__x))
145 __profcxx_vector_construct(this, this->capacity());
146 __profcxx_vector_construct2(this);
149 vector(const _Base& __x, const _Allocator& __a)
152 __profcxx_vector_construct(this, this->capacity());
153 __profcxx_vector_construct2(this);
156 vector(vector&& __x, const _Allocator& __a) noexcept
157 : _Base(std::move(__x), __a)
159 __profcxx_vector_construct(this, this->capacity());
160 __profcxx_vector_construct2(this);
163 vector(initializer_list<value_type> __l,
164 const allocator_type& __a = allocator_type())
165 : _Base(__l, __a) { }
168 ~vector() _GLIBCXX_NOEXCEPT
170 __profcxx_vector_destruct(this, this->capacity(), this->size());
171 __profcxx_vector_destruct2(this);
175 operator=(const vector& __x)
177 static_cast<_Base&>(*this) = __x;
181 #ifdef __GXX_EXPERIMENTAL_CXX0X__
183 operator=(vector&& __x) noexcept(_Alloc_traits::_S_nothrow_move())
185 __profcxx_vector_destruct(this, this->capacity(), this->size());
186 __profcxx_vector_destruct2(this);
187 static_cast<_Base&>(*this) = std::move(__x);
192 operator=(initializer_list<value_type> __l)
194 static_cast<_Base&>(*this) = __l;
200 using _Base::get_allocator;
205 begin() _GLIBCXX_NOEXCEPT
206 { return iterator(_Base::begin(), this); }
209 begin() const _GLIBCXX_NOEXCEPT
210 { return const_iterator(_Base::begin(), this); }
213 end() _GLIBCXX_NOEXCEPT
214 { return iterator(_Base::end(), this); }
217 end() const _GLIBCXX_NOEXCEPT
218 { return const_iterator(_Base::end(), this); }
221 rbegin() _GLIBCXX_NOEXCEPT
222 { return reverse_iterator(end()); }
224 const_reverse_iterator
225 rbegin() const _GLIBCXX_NOEXCEPT
226 { return const_reverse_iterator(end()); }
229 rend() _GLIBCXX_NOEXCEPT
230 { return reverse_iterator(begin()); }
232 const_reverse_iterator
233 rend() const _GLIBCXX_NOEXCEPT
234 { return const_reverse_iterator(begin()); }
236 #ifdef __GXX_EXPERIMENTAL_CXX0X__
238 cbegin() const noexcept
239 { return const_iterator(_Base::begin(), this); }
242 cend() const noexcept
243 { return const_iterator(_Base::end(), this); }
245 const_reverse_iterator
246 crbegin() const noexcept
247 { return const_reverse_iterator(end()); }
249 const_reverse_iterator
250 crend() const noexcept
251 { return const_reverse_iterator(begin()); }
254 // 23.2.4.2 capacity:
256 using _Base::max_size;
258 #ifdef __GXX_EXPERIMENTAL_CXX0X__
260 resize(size_type __sz)
262 __profcxx_vector_invalid_operator(this);
263 _M_profile_resize(this, this->capacity(), __sz);
268 resize(size_type __sz, const _Tp& __c)
270 __profcxx_vector_invalid_operator(this);
271 _M_profile_resize(this, this->capacity(), __sz);
272 _Base::resize(__sz, __c);
276 resize(size_type __sz, _Tp __c = _Tp())
278 __profcxx_vector_invalid_operator(this);
279 _M_profile_resize(this, this->capacity(), __sz);
280 _Base::resize(__sz, __c);
284 #ifdef __GXX_EXPERIMENTAL_CXX0X__
285 using _Base::shrink_to_fit;
292 operator[](size_type __n)
294 __profcxx_vector_invalid_operator(this);
295 return _M_base()[__n];
298 operator[](size_type __n) const
300 __profcxx_vector_invalid_operator(this);
301 return _M_base()[__n];
309 return _Base::front();
315 return _Base::front();
321 return _Base::back();
327 return _Base::back();
330 // _GLIBCXX_RESOLVE_LIB_DEFECTS
331 // DR 464. Suggestion for new member functions in standard containers.
334 // 23.2.4.3 modifiers:
336 push_back(const _Tp& __x)
338 size_type __old_size = this->capacity();
339 _Base::push_back(__x);
340 _M_profile_resize(this, __old_size, this->capacity());
343 #ifdef __GXX_EXPERIMENTAL_CXX0X__
347 size_type __old_size = this->capacity();
348 _Base::push_back(std::move(__x));
349 _M_profile_resize(this, __old_size, this->capacity());
355 insert(iterator __position, const _Tp& __x)
357 __profcxx_vector_insert(this, __position.base() - _Base::begin(),
359 size_type __old_size = this->capacity();
360 typename _Base::iterator __res = _Base::insert(__position.base(), __x);
361 _M_profile_resize(this, __old_size, this->capacity());
362 return iterator(__res, this);
365 #ifdef __GXX_EXPERIMENTAL_CXX0X__
367 insert(iterator __position, _Tp&& __x)
369 __profcxx_vector_insert(this, __position.base() - _Base::begin(),
371 size_type __old_size = this->capacity();
372 typename _Base::iterator __res = _Base::insert(__position.base(), __x);
373 _M_profile_resize(this, __old_size, this->capacity());
374 return iterator(__res, this);
378 insert(iterator __position, initializer_list<value_type> __l)
379 { this->insert(__position, __l.begin(), __l.end()); }
382 #ifdef __GXX_EXPERIMENTAL_CXX0X__
392 #ifdef __GXX_EXPERIMENTAL_CXX0X__
393 noexcept(_Alloc_traits::_S_nothrow_swap())
400 insert(iterator __position, size_type __n, const _Tp& __x)
402 __profcxx_vector_insert(this, __position.base() - _Base::begin(),
404 size_type __old_size = this->capacity();
405 _Base::insert(__position, __n, __x);
406 _M_profile_resize(this, __old_size, this->capacity());
409 #ifdef __GXX_EXPERIMENTAL_CXX0X__
410 template<typename _InputIterator,
411 typename = std::_RequireInputIter<_InputIterator>>
413 template<typename _InputIterator>
416 insert(iterator __position,
417 _InputIterator __first, _InputIterator __last)
419 __profcxx_vector_insert(this, __position.base()-_Base::begin(),
421 size_type __old_size = this->capacity();
422 _Base::insert(__position, __first, __last);
423 _M_profile_resize(this, __old_size, this->capacity());
428 erase(iterator __position)
430 typename _Base::iterator __res = _Base::erase(__position.base());
431 return iterator(__res, this);
435 erase(iterator __first, iterator __last)
437 // _GLIBCXX_RESOLVE_LIB_DEFECTS
438 // 151. can't currently clear() empty container
439 typename _Base::iterator __res = _Base::erase(__first.base(),
441 return iterator(__res, this);
445 clear() _GLIBCXX_NOEXCEPT
447 __profcxx_vector_destruct(this, this->capacity(), this->size());
448 __profcxx_vector_destruct2(this);
452 inline void _M_profile_find() const
454 __profcxx_vector_find(this, size());
457 inline void _M_profile_iterate(int __rewind = 0) const
459 __profcxx_vector_iterate(this);
463 void _M_profile_resize(void* obj, size_type __old_size,
464 size_type __new_size)
466 if (__old_size < __new_size) {
467 __profcxx_vector_resize(this, this->size(), __new_size);
468 __profcxx_vector_resize2(this, this->size(), __new_size);
473 template<typename _Tp, typename _Alloc>
475 operator==(const vector<_Tp, _Alloc>& __lhs,
476 const vector<_Tp, _Alloc>& __rhs)
477 { return __lhs._M_base() == __rhs._M_base(); }
479 template<typename _Tp, typename _Alloc>
481 operator!=(const vector<_Tp, _Alloc>& __lhs,
482 const vector<_Tp, _Alloc>& __rhs)
483 { return __lhs._M_base() != __rhs._M_base(); }
485 template<typename _Tp, typename _Alloc>
487 operator<(const vector<_Tp, _Alloc>& __lhs,
488 const vector<_Tp, _Alloc>& __rhs)
489 { return __lhs._M_base() < __rhs._M_base(); }
491 template<typename _Tp, typename _Alloc>
493 operator<=(const vector<_Tp, _Alloc>& __lhs,
494 const vector<_Tp, _Alloc>& __rhs)
495 { return __lhs._M_base() <= __rhs._M_base(); }
497 template<typename _Tp, typename _Alloc>
499 operator>=(const vector<_Tp, _Alloc>& __lhs,
500 const vector<_Tp, _Alloc>& __rhs)
501 { return __lhs._M_base() >= __rhs._M_base(); }
503 template<typename _Tp, typename _Alloc>
505 operator>(const vector<_Tp, _Alloc>& __lhs,
506 const vector<_Tp, _Alloc>& __rhs)
507 { return __lhs._M_base() > __rhs._M_base(); }
509 template<typename _Tp, typename _Alloc>
511 swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>& __rhs)
512 { __lhs.swap(__rhs); }
514 #ifdef __GXX_EXPERIMENTAL_CXX0X__
515 template<typename _Tp, typename _Alloc>
517 swap(vector<_Tp, _Alloc>&& __lhs, vector<_Tp, _Alloc>& __rhs)
518 { __lhs.swap(__rhs); }
520 template<typename _Tp, typename _Alloc>
522 swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>&& __rhs)
523 { __lhs.swap(__rhs); }
526 } // namespace __profile
528 #ifdef __GXX_EXPERIMENTAL_CXX0X__
530 /// std::hash specialization for vector<bool>.
531 template<typename _Alloc>
532 struct hash<__profile::vector<bool, _Alloc>>
533 : public __hash_base<size_t, __profile::vector<bool, _Alloc>>
536 operator()(const __profile::vector<bool, _Alloc>& __b) const noexcept
537 { return std::hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>()