xref: /dflybsd-src/contrib/gcc-8.0/libstdc++-v3/src/c++98/list.cc (revision 38fd149817dfbff97799f62fcb70be98c4e32523)
1*38fd1498Szrj // std::list utilities implementation -*- C++ -*-
2*38fd1498Szrj 
3*38fd1498Szrj // Copyright (C) 2003-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 /*
26*38fd1498Szrj  *
27*38fd1498Szrj  * Copyright (c) 1994
28*38fd1498Szrj  * Hewlett-Packard Company
29*38fd1498Szrj  *
30*38fd1498Szrj  * Permission to use, copy, modify, distribute and sell this software
31*38fd1498Szrj  * and its documentation for any purpose is hereby granted without fee,
32*38fd1498Szrj  * provided that the above copyright notice appear in all copies and
33*38fd1498Szrj  * that both that copyright notice and this permission notice appear
34*38fd1498Szrj  * in supporting documentation.  Hewlett-Packard Company makes no
35*38fd1498Szrj  * representations about the suitability of this software for any
36*38fd1498Szrj  * purpose.  It is provided "as is" without express or implied warranty.
37*38fd1498Szrj  *
38*38fd1498Szrj  *
39*38fd1498Szrj  * Copyright (c) 1996,1997
40*38fd1498Szrj  * Silicon Graphics Computer Systems, Inc.
41*38fd1498Szrj  *
42*38fd1498Szrj  * Permission to use, copy, modify, distribute and sell this software
43*38fd1498Szrj  * and its documentation for any purpose is hereby granted without fee,
44*38fd1498Szrj  * provided that the above copyright notice appear in all copies and
45*38fd1498Szrj  * that both that copyright notice and this permission notice appear
46*38fd1498Szrj  * in supporting documentation.  Silicon Graphics makes no
47*38fd1498Szrj  * representations about the suitability of this software for any
48*38fd1498Szrj  * purpose.  It is provided "as is" without express or implied warranty.
49*38fd1498Szrj  */
50*38fd1498Szrj 
51*38fd1498Szrj #include <list>
52*38fd1498Szrj 
53*38fd1498Szrj namespace std _GLIBCXX_VISIBILITY(default)
54*38fd1498Szrj {
55*38fd1498Szrj _GLIBCXX_BEGIN_NAMESPACE_VERSION
56*38fd1498Szrj 
57*38fd1498Szrj   namespace __detail
58*38fd1498Szrj   {
59*38fd1498Szrj     void
swap(_List_node_base & __x,_List_node_base & __y)60*38fd1498Szrj     _List_node_base::swap(_List_node_base& __x,
61*38fd1498Szrj 			  _List_node_base& __y) _GLIBCXX_USE_NOEXCEPT
62*38fd1498Szrj     {
63*38fd1498Szrj       if ( __x._M_next != &__x )
64*38fd1498Szrj 	{
65*38fd1498Szrj 	  if ( __y._M_next != &__y )
66*38fd1498Szrj 	    {
67*38fd1498Szrj 	      // Both __x and __y are not empty.
68*38fd1498Szrj 	      std::swap(__x._M_next,__y._M_next);
69*38fd1498Szrj 	      std::swap(__x._M_prev,__y._M_prev);
70*38fd1498Szrj 	      __x._M_next->_M_prev = __x._M_prev->_M_next = &__x;
71*38fd1498Szrj 	      __y._M_next->_M_prev = __y._M_prev->_M_next = &__y;
72*38fd1498Szrj 	    }
73*38fd1498Szrj 	  else
74*38fd1498Szrj 	    {
75*38fd1498Szrj 	      // __x is not empty, __y is empty.
76*38fd1498Szrj 	      __y._M_next = __x._M_next;
77*38fd1498Szrj 	      __y._M_prev = __x._M_prev;
78*38fd1498Szrj 	      __y._M_next->_M_prev = __y._M_prev->_M_next = &__y;
79*38fd1498Szrj 	      __x._M_next = __x._M_prev = &__x;
80*38fd1498Szrj 	    }
81*38fd1498Szrj 	}
82*38fd1498Szrj       else if ( __y._M_next != &__y )
83*38fd1498Szrj 	{
84*38fd1498Szrj 	  // __x is empty, __y is not empty.
85*38fd1498Szrj 	  __x._M_next = __y._M_next;
86*38fd1498Szrj 	  __x._M_prev = __y._M_prev;
87*38fd1498Szrj 	  __x._M_next->_M_prev = __x._M_prev->_M_next = &__x;
88*38fd1498Szrj 	  __y._M_next = __y._M_prev = &__y;
89*38fd1498Szrj 	}
90*38fd1498Szrj     }
91*38fd1498Szrj 
92*38fd1498Szrj     void
93*38fd1498Szrj     _List_node_base::
_M_transfer(_List_node_base * const __first,_List_node_base * const __last)94*38fd1498Szrj     _M_transfer(_List_node_base * const __first,
95*38fd1498Szrj 		_List_node_base * const __last) _GLIBCXX_USE_NOEXCEPT
96*38fd1498Szrj     {
97*38fd1498Szrj       if (this != __last)
98*38fd1498Szrj 	{
99*38fd1498Szrj 	  // Remove [first, last) from its old position.
100*38fd1498Szrj 	  __last->_M_prev->_M_next  = this;
101*38fd1498Szrj 	  __first->_M_prev->_M_next = __last;
102*38fd1498Szrj 	  this->_M_prev->_M_next    = __first;
103*38fd1498Szrj 
104*38fd1498Szrj 	  // Splice [first, last) into its new position.
105*38fd1498Szrj 	  _List_node_base* const __tmp = this->_M_prev;
106*38fd1498Szrj 	  this->_M_prev                = __last->_M_prev;
107*38fd1498Szrj 	  __last->_M_prev              = __first->_M_prev;
108*38fd1498Szrj 	  __first->_M_prev             = __tmp;
109*38fd1498Szrj 	}
110*38fd1498Szrj     }
111*38fd1498Szrj 
112*38fd1498Szrj     void
_M_reverse()113*38fd1498Szrj     _List_node_base::_M_reverse() _GLIBCXX_USE_NOEXCEPT
114*38fd1498Szrj     {
115*38fd1498Szrj       _List_node_base* __tmp = this;
116*38fd1498Szrj       do
117*38fd1498Szrj 	{
118*38fd1498Szrj 	  std::swap(__tmp->_M_next, __tmp->_M_prev);
119*38fd1498Szrj 
120*38fd1498Szrj 	  // Old next node is now prev.
121*38fd1498Szrj 	  __tmp = __tmp->_M_prev;
122*38fd1498Szrj 	}
123*38fd1498Szrj       while (__tmp != this);
124*38fd1498Szrj     }
125*38fd1498Szrj 
126*38fd1498Szrj     void
127*38fd1498Szrj     _List_node_base::
_M_hook(_List_node_base * const __position)128*38fd1498Szrj     _M_hook(_List_node_base* const __position) _GLIBCXX_USE_NOEXCEPT
129*38fd1498Szrj     {
130*38fd1498Szrj       this->_M_next = __position;
131*38fd1498Szrj       this->_M_prev = __position->_M_prev;
132*38fd1498Szrj       __position->_M_prev->_M_next = this;
133*38fd1498Szrj       __position->_M_prev = this;
134*38fd1498Szrj     }
135*38fd1498Szrj 
136*38fd1498Szrj     void
_M_unhook()137*38fd1498Szrj     _List_node_base::_M_unhook() _GLIBCXX_USE_NOEXCEPT
138*38fd1498Szrj     {
139*38fd1498Szrj       _List_node_base* const __next_node = this->_M_next;
140*38fd1498Szrj       _List_node_base* const __prev_node = this->_M_prev;
141*38fd1498Szrj       __prev_node->_M_next = __next_node;
142*38fd1498Szrj       __next_node->_M_prev = __prev_node;
143*38fd1498Szrj     }
144*38fd1498Szrj   } // namespace __detail
145*38fd1498Szrj 
146*38fd1498Szrj _GLIBCXX_END_NAMESPACE_VERSION
147*38fd1498Szrj } // namespace std
148