xref: /dflybsd-src/contrib/gcc-8.0/libstdc++-v3/src/c++98/list-aux-2.cc (revision 38fd149817dfbff97799f62fcb70be98c4e32523)
1*38fd1498Szrj // Compatibility symbols for previous versions, list bits -*- C++ -*-
2*38fd1498Szrj 
3*38fd1498Szrj // Copyright (C) 2011-2018 Free Software Foundation, Inc.
4*38fd1498Szrj //
5*38fd1498Szrj // This file is part of the GNU ISO C++ Library.  This library is free
6*38fd1498Szrj // software; you can redistribute it and/or modify it under the
7*38fd1498Szrj // terms of the GNU General Public License as published by the
8*38fd1498Szrj // Free Software Foundation; either version 3, or (at your option)
9*38fd1498Szrj // any later version.
10*38fd1498Szrj 
11*38fd1498Szrj // This library is distributed in the hope that it will be useful,
12*38fd1498Szrj // but WITHOUT ANY WARRANTY; without even the implied warranty of
13*38fd1498Szrj // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14*38fd1498Szrj // GNU General Public License for more details.
15*38fd1498Szrj 
16*38fd1498Szrj // Under Section 7 of GPL version 3, you are granted additional
17*38fd1498Szrj // permissions described in the GCC Runtime Library Exception, version
18*38fd1498Szrj // 3.1, as published by the Free Software Foundation.
19*38fd1498Szrj 
20*38fd1498Szrj // You should have received a copy of the GNU General Public License and
21*38fd1498Szrj // a copy of the GCC Runtime Library Exception along with this program;
22*38fd1498Szrj // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
23*38fd1498Szrj // <http://www.gnu.org/licenses/>.
24*38fd1498Szrj 
25*38fd1498Szrj #include <bits/move.h>
26*38fd1498Szrj 
27*38fd1498Szrj #ifdef _GLIBCXX_SHARED
28*38fd1498Szrj 
29*38fd1498Szrj #ifndef _GLIBCXX_BEGIN_NAMESPACE_COMPAT
30*38fd1498Szrj # define _GLIBCXX_BEGIN_NAMESPACE_COMPAT
31*38fd1498Szrj #endif
32*38fd1498Szrj 
33*38fd1498Szrj #ifndef _GLIBCXX_END_NAMESPACE_COMPAT
34*38fd1498Szrj # define _GLIBCXX_END_NAMESPACE_COMPAT
35*38fd1498Szrj #endif
36*38fd1498Szrj 
37*38fd1498Szrj namespace std _GLIBCXX_VISIBILITY(default)
38*38fd1498Szrj {
39*38fd1498Szrj _GLIBCXX_BEGIN_NAMESPACE_COMPAT
40*38fd1498Szrj 
41*38fd1498Szrj   struct _List_node_base
42*38fd1498Szrj   {
43*38fd1498Szrj     _List_node_base* _M_next;
44*38fd1498Szrj     _List_node_base* _M_prev;
45*38fd1498Szrj 
46*38fd1498Szrj     void
47*38fd1498Szrj     _M_transfer(_List_node_base * const __first,
48*38fd1498Szrj 		_List_node_base * const __last) _GLIBCXX_USE_NOEXCEPT;
49*38fd1498Szrj 
50*38fd1498Szrj     void
51*38fd1498Szrj     _M_reverse() _GLIBCXX_USE_NOEXCEPT;
52*38fd1498Szrj 
53*38fd1498Szrj     void
54*38fd1498Szrj     _M_hook(_List_node_base * const __position) _GLIBCXX_USE_NOEXCEPT;
55*38fd1498Szrj 
56*38fd1498Szrj     void
57*38fd1498Szrj     _M_unhook() _GLIBCXX_USE_NOEXCEPT;
58*38fd1498Szrj   };
59*38fd1498Szrj 
60*38fd1498Szrj   void
61*38fd1498Szrj   _List_node_base::
_M_transfer(_List_node_base * const __first,_List_node_base * const __last)62*38fd1498Szrj   _M_transfer(_List_node_base * const __first,
63*38fd1498Szrj 	      _List_node_base * const __last) _GLIBCXX_USE_NOEXCEPT
64*38fd1498Szrj   {
65*38fd1498Szrj     if (this != __last)
66*38fd1498Szrj     {
67*38fd1498Szrj       // Remove [first, last) from its old position.
68*38fd1498Szrj       __last->_M_prev->_M_next  = this;
69*38fd1498Szrj       __first->_M_prev->_M_next = __last;
70*38fd1498Szrj       this->_M_prev->_M_next    = __first;
71*38fd1498Szrj 
72*38fd1498Szrj       // Splice [first, last) into its new position.
73*38fd1498Szrj       _List_node_base* const __tmp = this->_M_prev;
74*38fd1498Szrj       this->_M_prev                = __last->_M_prev;
75*38fd1498Szrj       __last->_M_prev              = __first->_M_prev;
76*38fd1498Szrj       __first->_M_prev             = __tmp;
77*38fd1498Szrj     }
78*38fd1498Szrj   }
79*38fd1498Szrj 
80*38fd1498Szrj   void
_M_reverse()81*38fd1498Szrj   _List_node_base::_M_reverse() _GLIBCXX_USE_NOEXCEPT
82*38fd1498Szrj   {
83*38fd1498Szrj     _List_node_base* __tmp = this;
84*38fd1498Szrj     do
85*38fd1498Szrj     {
86*38fd1498Szrj       std::swap(__tmp->_M_next, __tmp->_M_prev);
87*38fd1498Szrj 
88*38fd1498Szrj       // Old next node is now prev.
89*38fd1498Szrj       __tmp = __tmp->_M_prev;
90*38fd1498Szrj     }
91*38fd1498Szrj     while (__tmp != this);
92*38fd1498Szrj   }
93*38fd1498Szrj 
94*38fd1498Szrj   void
95*38fd1498Szrj   _List_node_base::
_M_hook(_List_node_base * const __position)96*38fd1498Szrj   _M_hook(_List_node_base* const __position) _GLIBCXX_USE_NOEXCEPT
97*38fd1498Szrj   {
98*38fd1498Szrj     this->_M_next = __position;
99*38fd1498Szrj     this->_M_prev = __position->_M_prev;
100*38fd1498Szrj     __position->_M_prev->_M_next = this;
101*38fd1498Szrj     __position->_M_prev = this;
102*38fd1498Szrj   }
103*38fd1498Szrj 
104*38fd1498Szrj   void
_M_unhook()105*38fd1498Szrj   _List_node_base::_M_unhook() _GLIBCXX_USE_NOEXCEPT
106*38fd1498Szrj   {
107*38fd1498Szrj     _List_node_base* const __next_node = this->_M_next;
108*38fd1498Szrj     _List_node_base* const __prev_node = this->_M_prev;
109*38fd1498Szrj     __prev_node->_M_next = __next_node;
110*38fd1498Szrj     __next_node->_M_prev = __prev_node;
111*38fd1498Szrj   }
112*38fd1498Szrj 
113*38fd1498Szrj _GLIBCXX_END_NAMESPACE_COMPAT
114*38fd1498Szrj 
115*38fd1498Szrj } // namespace std
116*38fd1498Szrj 
117*38fd1498Szrj #endif
118