1*38fd1498Szrj// Memory extensions -*- C++ -*- 2*38fd1498Szrj 3*38fd1498Szrj// Copyright (C) 2002-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 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/** @file ext/memory 52*38fd1498Szrj * This file is a GNU extension to the Standard C++ Library (possibly 53*38fd1498Szrj * containing extensions from the HP/SGI STL subset). 54*38fd1498Szrj */ 55*38fd1498Szrj 56*38fd1498Szrj#ifndef _EXT_MEMORY 57*38fd1498Szrj#define _EXT_MEMORY 1 58*38fd1498Szrj 59*38fd1498Szrj#pragma GCC system_header 60*38fd1498Szrj 61*38fd1498Szrj#include <memory> 62*38fd1498Szrj#include <bits/stl_tempbuf.h> 63*38fd1498Szrj 64*38fd1498Szrjnamespace __gnu_cxx _GLIBCXX_VISIBILITY(default) 65*38fd1498Szrj{ 66*38fd1498Szrj_GLIBCXX_BEGIN_NAMESPACE_VERSION 67*38fd1498Szrj 68*38fd1498Szrj using std::ptrdiff_t; 69*38fd1498Szrj using std::pair; 70*38fd1498Szrj using std::__iterator_category; 71*38fd1498Szrj using std::_Temporary_buffer; 72*38fd1498Szrj 73*38fd1498Szrj template<typename _InputIter, typename _Size, typename _ForwardIter> 74*38fd1498Szrj pair<_InputIter, _ForwardIter> 75*38fd1498Szrj __uninitialized_copy_n(_InputIter __first, _Size __count, 76*38fd1498Szrj _ForwardIter __result, std::input_iterator_tag) 77*38fd1498Szrj { 78*38fd1498Szrj _ForwardIter __cur = __result; 79*38fd1498Szrj __try 80*38fd1498Szrj { 81*38fd1498Szrj for (; __count > 0 ; --__count, ++__first, ++__cur) 82*38fd1498Szrj std::_Construct(&*__cur, *__first); 83*38fd1498Szrj return pair<_InputIter, _ForwardIter>(__first, __cur); 84*38fd1498Szrj } 85*38fd1498Szrj __catch(...) 86*38fd1498Szrj { 87*38fd1498Szrj std::_Destroy(__result, __cur); 88*38fd1498Szrj __throw_exception_again; 89*38fd1498Szrj } 90*38fd1498Szrj } 91*38fd1498Szrj 92*38fd1498Szrj template<typename _RandomAccessIter, typename _Size, typename _ForwardIter> 93*38fd1498Szrj inline pair<_RandomAccessIter, _ForwardIter> 94*38fd1498Szrj __uninitialized_copy_n(_RandomAccessIter __first, _Size __count, 95*38fd1498Szrj _ForwardIter __result, 96*38fd1498Szrj std::random_access_iterator_tag) 97*38fd1498Szrj { 98*38fd1498Szrj _RandomAccessIter __last = __first + __count; 99*38fd1498Szrj return (pair<_RandomAccessIter, _ForwardIter> 100*38fd1498Szrj (__last, std::uninitialized_copy(__first, __last, __result))); 101*38fd1498Szrj } 102*38fd1498Szrj 103*38fd1498Szrj template<typename _InputIter, typename _Size, typename _ForwardIter> 104*38fd1498Szrj inline pair<_InputIter, _ForwardIter> 105*38fd1498Szrj __uninitialized_copy_n(_InputIter __first, _Size __count, 106*38fd1498Szrj _ForwardIter __result) 107*38fd1498Szrj { return __gnu_cxx::__uninitialized_copy_n(__first, __count, __result, 108*38fd1498Szrj __iterator_category(__first)); } 109*38fd1498Szrj 110*38fd1498Szrj /** 111*38fd1498Szrj * @brief Copies the range [first,last) into result. 112*38fd1498Szrj * @param __first An input iterator. 113*38fd1498Szrj * @param __count Length 114*38fd1498Szrj * @param __result An output iterator. 115*38fd1498Szrj * @return __result + (__first + __count) 116*38fd1498Szrj * @ingroup SGIextensions 117*38fd1498Szrj * 118*38fd1498Szrj * Like copy(), but does not require an initialized output range. 119*38fd1498Szrj */ 120*38fd1498Szrj template<typename _InputIter, typename _Size, typename _ForwardIter> 121*38fd1498Szrj inline pair<_InputIter, _ForwardIter> 122*38fd1498Szrj uninitialized_copy_n(_InputIter __first, _Size __count, 123*38fd1498Szrj _ForwardIter __result) 124*38fd1498Szrj { return __gnu_cxx::__uninitialized_copy_n(__first, __count, __result, 125*38fd1498Szrj __iterator_category(__first)); } 126*38fd1498Szrj 127*38fd1498Szrj 128*38fd1498Szrj // An alternative version of uninitialized_copy_n that constructs 129*38fd1498Szrj // and destroys objects with a user-provided allocator. 130*38fd1498Szrj template<typename _InputIter, typename _Size, typename _ForwardIter, 131*38fd1498Szrj typename _Allocator> 132*38fd1498Szrj pair<_InputIter, _ForwardIter> 133*38fd1498Szrj __uninitialized_copy_n_a(_InputIter __first, _Size __count, 134*38fd1498Szrj _ForwardIter __result, 135*38fd1498Szrj _Allocator __alloc) 136*38fd1498Szrj { 137*38fd1498Szrj _ForwardIter __cur = __result; 138*38fd1498Szrj __try 139*38fd1498Szrj { 140*38fd1498Szrj for (; __count > 0 ; --__count, ++__first, ++__cur) 141*38fd1498Szrj __alloc.construct(&*__cur, *__first); 142*38fd1498Szrj return pair<_InputIter, _ForwardIter>(__first, __cur); 143*38fd1498Szrj } 144*38fd1498Szrj __catch(...) 145*38fd1498Szrj { 146*38fd1498Szrj std::_Destroy(__result, __cur, __alloc); 147*38fd1498Szrj __throw_exception_again; 148*38fd1498Szrj } 149*38fd1498Szrj } 150*38fd1498Szrj 151*38fd1498Szrj template<typename _InputIter, typename _Size, typename _ForwardIter, 152*38fd1498Szrj typename _Tp> 153*38fd1498Szrj inline pair<_InputIter, _ForwardIter> 154*38fd1498Szrj __uninitialized_copy_n_a(_InputIter __first, _Size __count, 155*38fd1498Szrj _ForwardIter __result, 156*38fd1498Szrj std::allocator<_Tp>) 157*38fd1498Szrj { 158*38fd1498Szrj return __gnu_cxx::uninitialized_copy_n(__first, __count, __result); 159*38fd1498Szrj } 160*38fd1498Szrj 161*38fd1498Szrj /** 162*38fd1498Szrj * This class provides similar behavior and semantics of the standard 163*38fd1498Szrj * functions get_temporary_buffer() and return_temporary_buffer(), but 164*38fd1498Szrj * encapsulated in a type vaguely resembling a standard container. 165*38fd1498Szrj * 166*38fd1498Szrj * By default, a temporary_buffer<Iter> stores space for objects of 167*38fd1498Szrj * whatever type the Iter iterator points to. It is constructed from a 168*38fd1498Szrj * typical [first,last) range, and provides the begin(), end(), size() 169*38fd1498Szrj * functions, as well as requested_size(). For non-trivial types, copies 170*38fd1498Szrj * of *first will be used to initialize the storage. 171*38fd1498Szrj * 172*38fd1498Szrj * @c malloc is used to obtain underlying storage. 173*38fd1498Szrj * 174*38fd1498Szrj * Like get_temporary_buffer(), not all the requested memory may be 175*38fd1498Szrj * available. Ideally, the created buffer will be large enough to hold a 176*38fd1498Szrj * copy of [first,last), but if size() is less than requested_size(), 177*38fd1498Szrj * then this didn't happen. 178*38fd1498Szrj * 179*38fd1498Szrj * @ingroup SGIextensions 180*38fd1498Szrj */ 181*38fd1498Szrj template <class _ForwardIterator, class _Tp 182*38fd1498Szrj = typename std::iterator_traits<_ForwardIterator>::value_type > 183*38fd1498Szrj struct temporary_buffer : public _Temporary_buffer<_ForwardIterator, _Tp> 184*38fd1498Szrj { 185*38fd1498Szrj /// Requests storage large enough to hold a copy of [first,last). 186*38fd1498Szrj temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) 187*38fd1498Szrj : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) { } 188*38fd1498Szrj 189*38fd1498Szrj /// Destroys objects and frees storage. 190*38fd1498Szrj ~temporary_buffer() { } 191*38fd1498Szrj }; 192*38fd1498Szrj 193*38fd1498Szrj_GLIBCXX_END_NAMESPACE_VERSION 194*38fd1498Szrj} // namespace 195*38fd1498Szrj 196*38fd1498Szrj#endif 197*38fd1498Szrj 198