aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/libs/antlr3_cpp_runtime/include/antlr3memory.hpp
blob: 31a9f7563dace7829ddac8576655bc67f0696dc7 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
#ifndef	_ANTLR3MEMORY_HPP
#define	_ANTLR3MEMORY_HPP

// [The "BSD licence"]
// Copyright (c) 2005-2009 Gokulakannan Somasundaram, ElectronDB

//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
//    notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
//    notice, this list of conditions and the following disclaimer in the
//    documentation and/or other materials provided with the distribution.
// 3. The name of the author may not be used to endorse or promote products
//    derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
// OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
// IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
// NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
// THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

namespace antlr3 {

class DefaultAllocPolicy
{
public:
	//limitation of c++. unable to write a typedef 
	template <class TYPE>
	class AllocatorType : public std::allocator<TYPE>
	{
	public:
		typedef TYPE value_type;
		typedef value_type* pointer;
		typedef const value_type* const_pointer;
		typedef value_type& reference;
		typedef const value_type& const_reference;
		typedef size_t size_type;
		typedef ptrdiff_t difference_type;
		template<class U> struct rebind {
			typedef AllocatorType<U> other;
		};

		AllocatorType() noexcept {} 
		AllocatorType( const AllocatorType& ) noexcept {} 
		template<typename U> AllocatorType(const AllocatorType<U>& ) noexcept{} 
	};

	template<class TYPE>
	class VectorType : public std::vector< TYPE, AllocatorType<TYPE> >
	{
	};
	
	template<class TYPE>
	class ListType : public std::deque< TYPE, AllocatorType<TYPE> >
	{
	};	

	template<class TYPE>
	class StackType : public std::deque< TYPE, AllocatorType<TYPE> >
	{
	public:
		void push( const TYPE& elem ) {  this->push_back(elem); 	}
		void pop()  { this->pop_back(); }
		TYPE& peek() { return this->back(); }
		TYPE& top() { return this->back(); }
		const TYPE& peek() const { return this->back(); }
		const TYPE& top() const { return this->back(); }
	};	


	template<class TYPE>
	class OrderedSetType : public std::set< TYPE, std::less<TYPE>, AllocatorType<TYPE> >
	{
	};

	template<class TYPE>
	class UnOrderedSetType : public std::set< TYPE, std::less<TYPE>, AllocatorType<TYPE> >
	{
	};

	template<class KeyType, class ValueType>
	class UnOrderedMapType : public std::map< KeyType, ValueType, std::less<KeyType>, 
										AllocatorType<std::pair<const KeyType, ValueType> > >
	{
	};

	template<class KeyType, class ValueType>
	class OrderedMapType : public std::map< KeyType, ValueType, std::less<KeyType>, 
										AllocatorType<std::pair<KeyType, ValueType> > >
	{
	};

	template<class TYPE>
	class SmartPtrType : public std::unique_ptr<TYPE, std::default_delete<TYPE> >
	{
		typedef typename std::unique_ptr<TYPE, std::default_delete<TYPE> > BaseType;
	public:
		SmartPtrType() {};
		SmartPtrType( SmartPtrType&& other )
            : BaseType(other)
		{};
		SmartPtrType & operator=(SmartPtrType&& other) //= default;
		{
			BaseType::swap(other);
			//return std::move((BaseType&)other);
			return *this;
		}
	private:
		SmartPtrType & operator=(const SmartPtrType&) /*= delete*/;
		SmartPtrType(const SmartPtrType&) /*= delete*/;
	};

	ANTLR_INLINE static void* operator new (std::size_t bytes)
	{ 
		void* p = alloc(bytes);
		return p;
	}
	ANTLR_INLINE static void* operator new (std::size_t , void* p) { return p; }
	ANTLR_INLINE static void* operator new[]( std::size_t bytes)
	{
		void* p = alloc(bytes); 
		return p;
	}
	ANTLR_INLINE static void operator delete(void* p)
	{
		DefaultAllocPolicy::free(p);
	}
	ANTLR_INLINE static void operator delete(void* , void* ) {} //placement delete

	ANTLR_INLINE static void operator delete[](void* p)
	{
		DefaultAllocPolicy::free(p);
	}

	ANTLR_INLINE static void* alloc( std::size_t bytes )
	{
		void* p = malloc(bytes); 
		if( p== NULL )
			throw std::bad_alloc();
		return p;
	}

	ANTLR_INLINE static void* alloc0( std::size_t bytes )
	{
		void* p = calloc(1, bytes);
		if( p== NULL )
			throw std::bad_alloc();
		return p;
	}

	ANTLR_INLINE static void  free( void* p )
	{
		return ::free(p);
	}
	
	ANTLR_INLINE static void* realloc(void *ptr, size_t size)
	{
		return ::realloc( ptr, size );
	}
};

}

#endif	/* _ANTLR3MEMORY_H */