1 // Profiling list implementation -*- C++ -*-
3 // Copyright (C) 2009, 2010, 2011 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 and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 /** @file profile/list
26 * This file is a GNU profile extension to the Standard C++ Library.
29 #ifndef _GLIBCXX_PROFILE_LIST
30 #define _GLIBCXX_PROFILE_LIST 1
33 #include <profile/base.h>
34 #include <profile/iterator_tracker.h>
36 namespace std _GLIBCXX_VISIBILITY(default)
40 /** @brief List wrapper with performance instrumentation. */
41 template<typename _Tp, typename _Allocator = std::allocator<_Tp> >
43 : public _GLIBCXX_STD_C::list<_Tp, _Allocator>
45 typedef _GLIBCXX_STD_C::list<_Tp, _Allocator> _Base;
48 typedef typename _Base::reference reference;
49 typedef typename _Base::const_reference const_reference;
51 typedef __iterator_tracker<typename _Base::iterator, list>
53 typedef __iterator_tracker<typename _Base::const_iterator, list>
56 typedef typename _Base::size_type size_type;
57 typedef typename _Base::difference_type difference_type;
59 typedef _Tp value_type;
60 typedef _Allocator allocator_type;
61 typedef typename _Base::pointer pointer;
62 typedef typename _Base::const_pointer const_pointer;
63 typedef std::reverse_iterator<iterator> reverse_iterator;
64 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
66 // 23.2.2.1 construct/copy/destroy:
68 list(const _Allocator& __a = _Allocator())
71 __profcxx_list_construct(this); // list2slist
72 __profcxx_list_construct2(this); // list2vector
75 #ifdef __GXX_EXPERIMENTAL_CXX0X__
80 __profcxx_list_construct(this);
81 __profcxx_list_construct2(this);
84 list(size_type __n, const _Tp& __value,
85 const _Allocator& __a = _Allocator())
86 : _Base(__n, __value, __a)
88 __profcxx_list_construct(this);
89 __profcxx_list_construct2(this);
93 list(size_type __n, const _Tp& __value = _Tp(),
94 const _Allocator& __a = _Allocator())
95 : _Base(__n, __value, __a)
97 __profcxx_list_construct(this);
98 __profcxx_list_construct2(this);
102 template<class _InputIterator>
103 list(_InputIterator __first, _InputIterator __last,
104 const _Allocator& __a = _Allocator())
105 : _Base(__first, __last, __a)
107 __profcxx_list_construct(this);
108 __profcxx_list_construct2(this);
111 list(const list& __x)
114 __profcxx_list_construct(this);
115 __profcxx_list_construct2(this);
118 list(const _Base& __x)
121 __profcxx_list_construct(this);
122 __profcxx_list_construct2(this);
125 #ifdef __GXX_EXPERIMENTAL_CXX0X__
126 list(list&& __x) noexcept
127 : _Base(std::move(__x))
129 __profcxx_list_construct(this);
130 __profcxx_list_construct2(this);
133 list(initializer_list<value_type> __l,
134 const allocator_type& __a = allocator_type())
135 : _Base(__l, __a) { }
138 ~list() _GLIBCXX_NOEXCEPT
140 __profcxx_list_destruct(this);
141 __profcxx_list_destruct2(this);
145 operator=(const list& __x)
147 static_cast<_Base&>(*this) = __x;
151 #ifdef __GXX_EXPERIMENTAL_CXX0X__
153 operator=(list&& __x)
163 operator=(initializer_list<value_type> __l)
165 static_cast<_Base&>(*this) = __l;
170 assign(initializer_list<value_type> __l)
171 { _Base::assign(__l); }
174 template<class _InputIterator>
176 assign(_InputIterator __first, _InputIterator __last)
177 { _Base::assign(__first, __last); }
180 assign(size_type __n, const _Tp& __t)
181 { _Base::assign(__n, __t); }
183 using _Base::get_allocator;
187 begin() _GLIBCXX_NOEXCEPT
188 { return iterator(_Base::begin(), this); }
191 begin() const _GLIBCXX_NOEXCEPT
192 { return const_iterator(_Base::begin(), this); }
195 end() _GLIBCXX_NOEXCEPT
197 __profcxx_list_rewind(this);
198 return iterator(_Base::end(), this);
202 end() const _GLIBCXX_NOEXCEPT
204 __profcxx_list_rewind(this);
205 return const_iterator(_Base::end(), this);
209 rbegin() _GLIBCXX_NOEXCEPT
211 __profcxx_list_rewind(this);
212 return reverse_iterator(end());
215 const_reverse_iterator
216 rbegin() const _GLIBCXX_NOEXCEPT
218 __profcxx_list_rewind(this);
219 return const_reverse_iterator(end());
223 rend() _GLIBCXX_NOEXCEPT
224 { return reverse_iterator(begin()); }
226 const_reverse_iterator
227 rend() const _GLIBCXX_NOEXCEPT
228 { return const_reverse_iterator(begin()); }
230 #ifdef __GXX_EXPERIMENTAL_CXX0X__
232 cbegin() const noexcept
233 { return const_iterator(_Base::begin(), this); }
236 cend() const noexcept
237 { return const_iterator(_Base::end(), this); }
239 const_reverse_iterator
240 crbegin() const noexcept
241 { return const_reverse_iterator(end()); }
243 const_reverse_iterator
244 crend() const noexcept
245 { return const_reverse_iterator(begin()); }
248 // 23.2.2.2 capacity:
251 using _Base::max_size;
253 #ifdef __GXX_EXPERIMENTAL_CXX0X__
255 resize(size_type __sz)
256 { _Base::resize(__sz); }
259 resize(size_type __sz, const _Tp& __c)
260 { _Base::resize(__sz, __c); }
263 resize(size_type __sz, _Tp __c = _Tp())
264 { _Base::resize(__sz, __c); }
270 { return _Base::front(); }
274 { return _Base::front(); }
279 __profcxx_list_rewind(this);
280 return _Base::back();
286 __profcxx_list_rewind(this);
287 return _Base::back();
290 // 23.2.2.3 modifiers:
292 push_front(const value_type& __x)
294 __profcxx_list_invalid_operator(this);
295 __profcxx_list_operation(this);
296 _Base::push_front(__x);
299 #ifdef __GXX_EXPERIMENTAL_CXX0X__
300 using _Base::emplace_front;
306 __profcxx_list_operation(this);
310 using _Base::push_back;
312 #ifdef __GXX_EXPERIMENTAL_CXX0X__
313 using _Base::emplace_back;
319 iterator __victim = end();
322 __profcxx_list_rewind(this);
325 #ifdef __GXX_EXPERIMENTAL_CXX0X__
326 template<typename... _Args>
328 emplace(iterator __position, _Args&&... __args)
330 return iterator(_Base::emplace(__position.base(),
331 std::forward<_Args>(__args)...));
336 insert(iterator __position, const _Tp& __x)
338 _M_profile_insert(this, __position, size());
339 return iterator(_Base::insert(__position.base(), __x), this);
342 #ifdef __GXX_EXPERIMENTAL_CXX0X__
344 insert(iterator __position, _Tp&& __x)
346 _M_profile_insert(this, __position, size());
347 return iterator(_Base::emplace(__position.base(), std::move(__x)),
352 insert(iterator __position, initializer_list<value_type> __l)
354 _M_profile_insert(this, __position, size());
355 _Base::insert(__position.base(), __l);
360 insert(iterator __position, size_type __n, const _Tp& __x)
362 _M_profile_insert(this, __position, size());
363 _Base::insert(__position.base(), __n, __x);
366 template<class _InputIterator>
368 insert(iterator __position, _InputIterator __first,
369 _InputIterator __last)
371 _M_profile_insert(this, __position, size());
372 _Base::insert(__position.base(), __first, __last);
376 erase(iterator __position)
377 { return iterator(_Base::erase(__position.base()), this); }
380 erase(iterator __position, iterator __last)
382 // _GLIBCXX_RESOLVE_LIB_DEFECTS
383 // 151. can't currently clear() empty container
384 return iterator(_Base::erase(__position.base(), __last.base()), this);
389 { _Base::swap(__x); }
392 clear() _GLIBCXX_NOEXCEPT
395 // 23.2.2.4 list operations:
397 #ifdef __GXX_EXPERIMENTAL_CXX0X__
398 splice(iterator __position, list&& __x)
400 splice(iterator __position, list& __x)
402 { this->splice(__position, _GLIBCXX_MOVE(__x), __x.begin(), __x.end()); }
404 #ifdef __GXX_EXPERIMENTAL_CXX0X__
406 splice(iterator __position, list& __x)
407 { this->splice(__position, std::move(__x)); }
410 #ifdef __GXX_EXPERIMENTAL_CXX0X__
412 splice(iterator __position, list& __x, iterator __i)
413 { this->splice(__position, std::move(__x), __i); }
417 #ifdef __GXX_EXPERIMENTAL_CXX0X__
418 splice(iterator __position, list&& __x, iterator __i)
420 splice(iterator __position, list& __x, iterator __i)
423 // We used to perform the splice_alloc check: not anymore, redundant
424 // after implementing the relevant bits of N1599.
426 // _GLIBCXX_RESOLVE_LIB_DEFECTS
427 _Base::splice(__position.base(), _GLIBCXX_MOVE(__x._M_base()),
432 #ifdef __GXX_EXPERIMENTAL_CXX0X__
433 splice(iterator __position, list&& __x, iterator __first,
436 splice(iterator __position, list& __x, iterator __first,
440 // We used to perform the splice_alloc check: not anymore, redundant
441 // after implementing the relevant bits of N1599.
443 _Base::splice(__position.base(), _GLIBCXX_MOVE(__x._M_base()),
444 __first.base(), __last.base());
447 #ifdef __GXX_EXPERIMENTAL_CXX0X__
449 splice(iterator __position, list& __x, iterator __first, iterator __last)
450 { this->splice(__position, std::move(__x), __first, __last); }
454 remove(const _Tp& __value)
456 for (iterator __x = begin(); __x != end(); )
465 template<class _Predicate>
467 remove_if(_Predicate __pred)
469 for (iterator __x = begin(); __x != end(); )
471 __profcxx_list_operation(this);
482 iterator __first = begin();
483 iterator __last = end();
484 if (__first == __last)
486 iterator __next = __first;
487 while (++__next != __last)
489 __profcxx_list_operation(this);
490 if (*__first == *__next)
498 template<class _BinaryPredicate>
500 unique(_BinaryPredicate __binary_pred)
502 iterator __first = begin();
503 iterator __last = end();
504 if (__first == __last)
506 iterator __next = __first;
507 while (++__next != __last)
509 __profcxx_list_operation(this);
510 if (__binary_pred(*__first, *__next))
519 #ifdef __GXX_EXPERIMENTAL_CXX0X__
525 // _GLIBCXX_RESOLVE_LIB_DEFECTS
526 // 300. list::merge() specification incomplete
528 { _Base::merge(_GLIBCXX_MOVE(__x._M_base())); }
531 #ifdef __GXX_EXPERIMENTAL_CXX0X__
534 { this->merge(std::move(__x)); }
537 template<class _Compare>
539 #ifdef __GXX_EXPERIMENTAL_CXX0X__
540 merge(list&& __x, _Compare __comp)
542 merge(list& __x, _Compare __comp)
545 // _GLIBCXX_RESOLVE_LIB_DEFECTS
546 // 300. list::merge() specification incomplete
548 { _Base::merge(_GLIBCXX_MOVE(__x._M_base()), __comp); }
551 #ifdef __GXX_EXPERIMENTAL_CXX0X__
552 template<typename _Compare>
554 merge(list& __x, _Compare __comp)
555 { this->merge(std::move(__x), __comp); }
559 sort() { _Base::sort(); }
561 template<typename _StrictWeakOrdering>
563 sort(_StrictWeakOrdering __pred) { _Base::sort(__pred); }
565 using _Base::reverse;
568 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
571 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
573 void _M_profile_find() const
576 void _M_profile_iterate(int __rewind = 0) const
578 __profcxx_list_operation(this);
579 __profcxx_list_iterate(this);
581 __profcxx_list_rewind(this);
585 size_type _M_profile_insert(void* obj, iterator __pos, size_type __size)
587 size_type __shift = 0;
588 typename _Base::iterator __it = __pos.base();
589 for ( ; __it!=_Base::end(); __it++)
591 __profcxx_list_rewind(this);
592 __profcxx_list_operation(this);
593 __profcxx_list_insert(this, __shift, __size);
597 template<typename _Tp, typename _Alloc>
599 operator==(const list<_Tp, _Alloc>& __lhs,
600 const list<_Tp, _Alloc>& __rhs)
601 { return __lhs._M_base() == __rhs._M_base(); }
603 template<typename _Tp, typename _Alloc>
605 operator!=(const list<_Tp, _Alloc>& __lhs,
606 const list<_Tp, _Alloc>& __rhs)
607 { return __lhs._M_base() != __rhs._M_base(); }
609 template<typename _Tp, typename _Alloc>
611 operator<(const list<_Tp, _Alloc>& __lhs,
612 const list<_Tp, _Alloc>& __rhs)
613 { return __lhs._M_base() < __rhs._M_base(); }
615 template<typename _Tp, typename _Alloc>
617 operator<=(const list<_Tp, _Alloc>& __lhs,
618 const list<_Tp, _Alloc>& __rhs)
619 { return __lhs._M_base() <= __rhs._M_base(); }
621 template<typename _Tp, typename _Alloc>
623 operator>=(const list<_Tp, _Alloc>& __lhs,
624 const list<_Tp, _Alloc>& __rhs)
625 { return __lhs._M_base() >= __rhs._M_base(); }
627 template<typename _Tp, typename _Alloc>
629 operator>(const list<_Tp, _Alloc>& __lhs,
630 const list<_Tp, _Alloc>& __rhs)
631 { return __lhs._M_base() > __rhs._M_base(); }
633 template<typename _Tp, typename _Alloc>
635 swap(list<_Tp, _Alloc>& __lhs, list<_Tp, _Alloc>& __rhs)
636 { __lhs.swap(__rhs); }
638 } // namespace __profile