mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-29 20:25:54 +08:00
bb84e66919
* Makefile.in (install): Some of HEADERS come from the stl dir now. * algorithm, deque, functional, iterator, list, map, memory, numeric, queue, set, stack, utility, vector: Now in stl dir. stl/: * algo.h, algobase.h, alloc.h, bvector.h, defalloc.h, deque.h, function.h, hash_map.h, hash_set.h, hashtable.h, heap.h, iterator.h, list.h, map.h, multimap.h, multiset.h, pair.h, pthread_alloc.h, rope.h, ropeimpl.h, set.h, slist.h, stack.h, stl_config.h, tempbuf.h, tree.h, type_traits.h, vector.h: Update to October 27 SGI snapshot. * algorithm, deque, functional, hash_map, hash_set, iterator, list, map, memory, numeric, pthread_alloc, queue, rope, set, slist, stack, stl_algo.h, stl_algobase.h, stl_alloc.h, stl_bvector.h, stl_construct.h, stl_deque.h, stl_function.h, stl_hash_fun.h, stl_hash_map.h, stl_hash_set.h, stl_hashtable.h, stl_heap.h, stl_iterator.h, stl_list.h, stl_map.h, stl_multimap.h, stl_multiset.h, stl_numeric.h, stl_pair.h, stl_queue.h, stl_raw_storage_iter.h, stl_relops.h, stl_rope.h, stl_set.h, stl_slist.h, stl_stack.h, stl_tempbuf.h, stl_tree.h, stl_uninitialized.h, stl_vector.h, utility, vector: New files in October 27 SGI snapshot. From-SVN: r16277
124 lines
3.2 KiB
C++
124 lines
3.2 KiB
C++
/*
|
|
*
|
|
* Copyright (c) 1994
|
|
* Hewlett-Packard Company
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
* provided that the above copyright notice appear in all copies and
|
|
* that both that copyright notice and this permission notice appear
|
|
* in supporting documentation. Hewlett-Packard Company makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*
|
|
*
|
|
* Copyright (c) 1996,1997
|
|
* Silicon Graphics Computer Systems, Inc.
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
* provided that the above copyright notice appear in all copies and
|
|
* that both that copyright notice and this permission notice appear
|
|
* in supporting documentation. Silicon Graphics makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*/
|
|
|
|
/* NOTE: This is an internal header file, included by other STL headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef __SGI_STL_INTERNAL_TEMPBUF_H
|
|
#define __SGI_STL_INTERNAL_TEMPBUF_H
|
|
|
|
|
|
__STL_BEGIN_NAMESPACE
|
|
|
|
template <class T>
|
|
pair<T*, ptrdiff_t> get_temporary_buffer(ptrdiff_t len, T*) {
|
|
if (len > ptrdiff_t(INT_MAX / sizeof(T)))
|
|
len = INT_MAX / sizeof(T);
|
|
|
|
while (len > 0) {
|
|
T* tmp = (T*) malloc((size_t)len * sizeof(T));
|
|
if (tmp != 0)
|
|
return pair<T*, ptrdiff_t>(tmp, len);
|
|
len /= 2;
|
|
}
|
|
|
|
return pair<T*, ptrdiff_t>((T*)0, 0);
|
|
}
|
|
|
|
template <class T>
|
|
void return_temporary_buffer(T* p) {
|
|
free(p);
|
|
}
|
|
|
|
template <class ForwardIterator,
|
|
class T
|
|
#ifdef __STL_CLASS_PARTIAL_SPECIALIZATION
|
|
= iterator_traits<ForwardIterator>::value_type
|
|
#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */
|
|
>
|
|
class temporary_buffer {
|
|
private:
|
|
ptrdiff_t original_len;
|
|
ptrdiff_t len;
|
|
T* buffer;
|
|
|
|
void allocate_buffer() {
|
|
original_len = len;
|
|
buffer = 0;
|
|
|
|
if (len > (ptrdiff_t)(INT_MAX / sizeof(T)))
|
|
len = INT_MAX / sizeof(T);
|
|
|
|
while (len > 0) {
|
|
buffer = (T*) malloc(len * sizeof(T));
|
|
if (buffer)
|
|
break;
|
|
len /= 2;
|
|
}
|
|
}
|
|
|
|
void initialize_buffer(const T&, __true_type) {}
|
|
void initialize_buffer(const T& val, __false_type) {
|
|
uninitialized_fill_n(buffer, len, val);
|
|
}
|
|
|
|
public:
|
|
ptrdiff_t size() const { return len; }
|
|
ptrdiff_t requested_size() const { return original_len; }
|
|
T* begin() { return buffer; }
|
|
T* end() { return buffer + len; }
|
|
|
|
temporary_buffer(ForwardIterator first, ForwardIterator last) {
|
|
__STL_TRY {
|
|
len = 0;
|
|
distance(first, last, len);
|
|
allocate_buffer();
|
|
if (len > 0)
|
|
initialize_buffer(*first,
|
|
__type_traits<T>::has_trivial_default_constructor());
|
|
}
|
|
__STL_UNWIND(free(buffer); buffer = 0; len = 0);
|
|
}
|
|
|
|
~temporary_buffer() {
|
|
destroy(buffer, buffer + len);
|
|
free(buffer);
|
|
}
|
|
|
|
private:
|
|
temporary_buffer(const temporary_buffer&) {}
|
|
void operator=(const temporary_buffer&) {}
|
|
};
|
|
|
|
__STL_END_NAMESPACE
|
|
|
|
#endif /* __SGI_STL_INTERNAL_TEMPBUF_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|