]>
Commit | Line | Data |
---|---|---|
f53d0ff1 PC |
1 | // Memory extensions -*- C++ -*- |
2 | ||
bc2631e0 PC |
3 | // Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 |
4 | // Free Software Foundation, Inc. | |
f53d0ff1 PC |
5 | // |
6 | // This file is part of the GNU ISO C++ Library. This library is free | |
7 | // software; you can redistribute it and/or modify it under the | |
8 | // terms of the GNU General Public License as published by the | |
9 | // Free Software Foundation; either version 2, or (at your option) | |
10 | // any later version. | |
11 | ||
12 | // This library is distributed in the hope that it will be useful, | |
13 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | // GNU General Public License for more details. | |
16 | ||
17 | // You should have received a copy of the GNU General Public License along | |
18 | // with this library; see the file COPYING. If not, write to the Free | |
83f51799 | 19 | // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, |
f53d0ff1 PC |
20 | // USA. |
21 | ||
22 | // As a special exception, you may use this file as part of a free software | |
23 | // library without restriction. Specifically, if other files instantiate | |
24 | // templates or use macros or inline functions from this file, or you compile | |
25 | // this file and link it with other files to produce an executable, this | |
26 | // file does not by itself cause the resulting executable to be covered by | |
27 | // the GNU General Public License. This exception does not however | |
28 | // invalidate any other reasons why the executable file might be covered by | |
29 | // the GNU General Public License. | |
30 | ||
31 | /* | |
32 | * | |
33 | * Copyright (c) 1994 | |
34 | * Hewlett-Packard Company | |
35 | * | |
36 | * Permission to use, copy, modify, distribute and sell this software | |
37 | * and its documentation for any purpose is hereby granted without fee, | |
38 | * provided that the above copyright notice appear in all copies and | |
39 | * that both that copyright notice and this permission notice appear | |
40 | * in supporting documentation. Hewlett-Packard Company makes no | |
41 | * representations about the suitability of this software for any | |
42 | * purpose. It is provided "as is" without express or implied warranty. | |
43 | * | |
44 | * | |
45 | * Copyright (c) 1996 | |
46 | * Silicon Graphics Computer Systems, Inc. | |
47 | * | |
48 | * Permission to use, copy, modify, distribute and sell this software | |
49 | * and its documentation for any purpose is hereby granted without fee, | |
50 | * provided that the above copyright notice appear in all copies and | |
51 | * that both that copyright notice and this permission notice appear | |
52 | * in supporting documentation. Silicon Graphics makes no | |
53 | * representations about the suitability of this software for any | |
54 | * purpose. It is provided "as is" without express or implied warranty. | |
55 | */ | |
56 | ||
ffe94f83 PE |
57 | /** @file ext/memory |
58 | * This file is a GNU extension to the Standard C++ Library (possibly | |
0aa06b18 | 59 | * containing extensions from the HP/SGI STL subset). |
ffe94f83 PE |
60 | */ |
61 | ||
f53d0ff1 | 62 | #ifndef _EXT_MEMORY |
b2acb86f | 63 | #define _EXT_MEMORY 1 |
f53d0ff1 PC |
64 | |
65 | #pragma GCC system_header | |
b2acb86f | 66 | |
54c1bf78 | 67 | #include <memory> |
6b20f9b5 | 68 | #include <bits/stl_tempbuf.h> |
f53d0ff1 | 69 | |
3cbc7af0 BK |
70 | _GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx) |
71 | ||
3b007b5d | 72 | using std::ptrdiff_t; |
f53d0ff1 PC |
73 | using std::pair; |
74 | using std::__iterator_category; | |
3b007b5d | 75 | using std::_Temporary_buffer; |
fa30fe72 | 76 | |
f53d0ff1 PC |
77 | template<typename _InputIter, typename _Size, typename _ForwardIter> |
78 | pair<_InputIter, _ForwardIter> | |
79 | __uninitialized_copy_n(_InputIter __first, _Size __count, | |
b2acb86f | 80 | _ForwardIter __result, std::input_iterator_tag) |
f53d0ff1 PC |
81 | { |
82 | _ForwardIter __cur = __result; | |
bc2631e0 | 83 | __try |
b2acb86f | 84 | { |
d962e073 | 85 | for (; __count > 0 ; --__count, ++__first, ++__cur) |
b2acb86f BK |
86 | std::_Construct(&*__cur, *__first); |
87 | return pair<_InputIter, _ForwardIter>(__first, __cur); | |
88 | } | |
bc2631e0 | 89 | __catch(...) |
f53d0ff1 PC |
90 | { |
91 | std::_Destroy(__result, __cur); | |
fa30fe72 | 92 | __throw_exception_again; |
f53d0ff1 PC |
93 | } |
94 | } | |
fa30fe72 | 95 | |
f53d0ff1 PC |
96 | template<typename _RandomAccessIter, typename _Size, typename _ForwardIter> |
97 | inline pair<_RandomAccessIter, _ForwardIter> | |
98 | __uninitialized_copy_n(_RandomAccessIter __first, _Size __count, | |
fa30fe72 | 99 | _ForwardIter __result, |
f53d0ff1 PC |
100 | std::random_access_iterator_tag) |
101 | { | |
102 | _RandomAccessIter __last = __first + __count; | |
d962e073 PC |
103 | return (pair<_RandomAccessIter, _ForwardIter> |
104 | (__last, std::uninitialized_copy(__first, __last, __result))); | |
f53d0ff1 PC |
105 | } |
106 | ||
107 | template<typename _InputIter, typename _Size, typename _ForwardIter> | |
108 | inline pair<_InputIter, _ForwardIter> | |
109 | __uninitialized_copy_n(_InputIter __first, _Size __count, | |
fa30fe72 | 110 | _ForwardIter __result) |
d962e073 PC |
111 | { return __uninitialized_copy_n(__first, __count, __result, |
112 | __iterator_category(__first)); } | |
f53d0ff1 PC |
113 | |
114 | /** | |
115 | * @brief Copies the range [first,last) into result. | |
116 | * @param first An input iterator. | |
117 | * @param last An input iterator. | |
118 | * @param result An output iterator. | |
119 | * @return result + (first - last) | |
ffe94f83 | 120 | * @ingroup SGIextensions |
f53d0ff1 PC |
121 | * |
122 | * Like copy(), but does not require an initialized output range. | |
123 | */ | |
124 | template<typename _InputIter, typename _Size, typename _ForwardIter> | |
125 | inline pair<_InputIter, _ForwardIter> | |
126 | uninitialized_copy_n(_InputIter __first, _Size __count, | |
fa30fe72 | 127 | _ForwardIter __result) |
d962e073 PC |
128 | { return __uninitialized_copy_n(__first, __count, __result, |
129 | __iterator_category(__first)); } | |
3b007b5d | 130 | |
1985f1cd MA |
131 | |
132 | // An alternative version of uninitialized_copy_n that constructs | |
133 | // and destroys objects with a user-provided allocator. | |
134 | template<typename _InputIter, typename _Size, typename _ForwardIter, | |
135 | typename _Allocator> | |
136 | pair<_InputIter, _ForwardIter> | |
137 | __uninitialized_copy_n_a(_InputIter __first, _Size __count, | |
138 | _ForwardIter __result, | |
139 | _Allocator __alloc) | |
140 | { | |
141 | _ForwardIter __cur = __result; | |
bc2631e0 | 142 | __try |
1985f1cd MA |
143 | { |
144 | for (; __count > 0 ; --__count, ++__first, ++__cur) | |
145 | __alloc.construct(&*__cur, *__first); | |
146 | return pair<_InputIter, _ForwardIter>(__first, __cur); | |
147 | } | |
bc2631e0 | 148 | __catch(...) |
1985f1cd MA |
149 | { |
150 | std::_Destroy(__result, __cur, __alloc); | |
151 | __throw_exception_again; | |
152 | } | |
153 | } | |
154 | ||
155 | template<typename _InputIter, typename _Size, typename _ForwardIter, | |
156 | typename _Tp> | |
157 | inline pair<_InputIter, _ForwardIter> | |
158 | __uninitialized_copy_n_a(_InputIter __first, _Size __count, | |
159 | _ForwardIter __result, | |
160 | std::allocator<_Tp>) | |
161 | { | |
162 | return uninitialized_copy_n(__first, __count, __result); | |
163 | } | |
164 | ||
3b007b5d | 165 | /** |
ffe94f83 PE |
166 | * This class provides similar behavior and semantics of the standard |
167 | * functions get_temporary_buffer() and return_temporary_buffer(), but | |
168 | * encapsulated in a type vaguely resembling a standard container. | |
169 | * | |
170 | * By default, a temporary_buffer<Iter> stores space for objects of | |
171 | * whatever type the Iter iterator points to. It is constructed from a | |
172 | * typical [first,last) range, and provides the begin(), end(), size() | |
173 | * functions, as well as requested_size(). For non-trivial types, copies | |
174 | * of *first will be used to initialize the storage. | |
175 | * | |
176 | * @c malloc is used to obtain underlying storage. | |
177 | * | |
178 | * Like get_temporary_buffer(), not all the requested memory may be | |
179 | * available. Ideally, the created buffer will be large enough to hold a | |
180 | * copy of [first,last), but if size() is less than requested_size(), | |
181 | * then this didn't happen. | |
182 | * | |
6b20f9b5 PE |
183 | * @ingroup SGIextensions |
184 | */ | |
fa30fe72 | 185 | template <class _ForwardIterator, class _Tp |
d962e073 PC |
186 | = typename std::iterator_traits<_ForwardIterator>::value_type > |
187 | struct temporary_buffer : public _Temporary_buffer<_ForwardIterator, _Tp> | |
188 | { | |
189 | /// Requests storage large enough to hold a copy of [first,last). | |
190 | temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) | |
191 | : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) { } | |
192 | ||
193 | /// Destroys objects and frees storage. | |
194 | ~temporary_buffer() { } | |
195 | }; | |
3cbc7af0 BK |
196 | |
197 | _GLIBCXX_END_NAMESPACE | |
f53d0ff1 | 198 | |
b2acb86f | 199 | #endif |
f53d0ff1 | 200 |