mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-22 22:40:25 +08:00
df9262681b
* algorithm alloc.h defalloc.h hash_map.h hash_set.h iterator memory pthread_alloc pthread_alloc.h rope ropeimpl.h stl_algo.h stl_algobase.h stl_alloc.h stl_bvector.h stl_config.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 tempbuf.h type_traits.h: Update to SGI STL 3.11. From-SVN: r22190
88 lines
2.3 KiB
C++
88 lines
2.3 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.
|
|
*
|
|
*/
|
|
|
|
// Inclusion of this file is DEPRECATED. This is the original HP
|
|
// default allocator. It is provided only for backward compatibility.
|
|
// This file WILL BE REMOVED in a future release.
|
|
//
|
|
// DO NOT USE THIS FILE unless you have an old container implementation
|
|
// that requires an allocator with the HP-style interface.
|
|
//
|
|
// Standard-conforming allocators have a very different interface. The
|
|
// standard default allocator is declared in the header <memory>.
|
|
|
|
#ifndef DEFALLOC_H
|
|
#define DEFALLOC_H
|
|
|
|
#include <new.h>
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
#include <limits.h>
|
|
#include <iostream.h>
|
|
#include <algobase.h>
|
|
|
|
|
|
template <class T>
|
|
inline T* allocate(ptrdiff_t size, T*) {
|
|
set_new_handler(0);
|
|
T* tmp = (T*)(::operator new((size_t)(size * sizeof(T))));
|
|
if (tmp == 0) {
|
|
cerr << "out of memory" << endl;
|
|
exit(1);
|
|
}
|
|
return tmp;
|
|
}
|
|
|
|
|
|
template <class T>
|
|
inline void deallocate(T* buffer) {
|
|
::operator delete(buffer);
|
|
}
|
|
|
|
template <class T>
|
|
class allocator {
|
|
public:
|
|
typedef T value_type;
|
|
typedef T* pointer;
|
|
typedef const T* const_pointer;
|
|
typedef T& reference;
|
|
typedef const T& const_reference;
|
|
typedef size_t size_type;
|
|
typedef ptrdiff_t difference_type;
|
|
pointer allocate(size_type n) {
|
|
return ::allocate((difference_type)n, (pointer)0);
|
|
}
|
|
void deallocate(pointer p) { ::deallocate(p); }
|
|
pointer address(reference x) { return (pointer)&x; }
|
|
const_pointer const_address(const_reference x) {
|
|
return (const_pointer)&x;
|
|
}
|
|
size_type init_page_size() {
|
|
return max(size_type(1), size_type(4096/sizeof(T)));
|
|
}
|
|
size_type max_size() const {
|
|
return max(size_type(1), size_type(UINT_MAX/sizeof(T)));
|
|
}
|
|
};
|
|
|
|
class allocator<void> {
|
|
public:
|
|
typedef void* pointer;
|
|
};
|
|
|
|
|
|
|
|
#endif
|