core/sourcehook/sh_stack.h
author Scott Ehlert <ds@alliedmods.net>
Thu Dec 10 00:59:50 2009 -0600 (2009-12-10)
changeset 689 4065ba5e9155
parent 539 db914129ae01
child 733 2365240861a2
permissions -rw-r--r--
Rewrote user message caching code to always use IServerGameDLL::GetUserMessageInfo (bug 4117, r=dvander).

Games where the above function can crash are handled by detouring tier0's Error() function and jumping back to our own code. So in theory this should work on all games now.
pavolmarko@128
     1
/* ======== SourceMM ========
ds@523
     2
* Copyright (C) 2004-2008 Metamod:Source Development Team
ds@294
     3
* No warranties of any kind
ds@294
     4
*
ds@294
     5
* License: zlib/libpng
ds@294
     6
*
ds@294
     7
* Author(s): Pavol "PM OnoTo" Marko
ds@294
     8
* ============================
ds@294
     9
*/
pavolmarko@128
    10
pavolmarko@128
    11
#ifndef __SH_STACK_H__
pavolmarko@128
    12
#define __SH_STACK_H__
pavolmarko@128
    13
dvander@264
    14
#include <stddef.h>
pavolmarko@380
    15
#include "sh_vector.h"
pavolmarko@128
    16
pavolmarko@128
    17
namespace SourceHook
pavolmarko@128
    18
{
pavolmarko@380
    19
	// May _never_ reallocate used memory!
pavolmarko@380
    20
pavolmarko@128
    21
	template <class T> class CStack
pavolmarko@128
    22
	{
pavolmarko@381
    23
		static const size_t SECTOR_SIZE = 16;
pavolmarko@380
    24
pavolmarko@381
    25
		CVector<T*> m_Sectors;				// Stores sectors
pavolmarko@380
    26
pavolmarko@128
    27
		size_t m_UsedSize;
pavolmarko@380
    28
pavolmarko@380
    29
		void clear()
pavolmarko@380
    30
		{
pavolmarko@381
    31
			typename CVector<T*>::iterator sect_iter;
pavolmarko@381
    32
			for (sect_iter = m_Sectors.begin(); sect_iter != m_Sectors.end(); ++sect_iter)
pavolmarko@380
    33
			{
pavolmarko@380
    34
				delete [] *sect_iter;
pavolmarko@380
    35
			}
pavolmarko@380
    36
			m_Sectors.clear();
pavolmarko@380
    37
		}
pavolmarko@128
    38
	public:
pavolmarko@128
    39
		friend class iterator;
pavolmarko@128
    40
		class iterator
pavolmarko@128
    41
		{
pavolmarko@128
    42
			CStack<T> *m_pParent;
pavolmarko@128
    43
			size_t m_Index;
pavolmarko@128
    44
		public:
pavolmarko@128
    45
			iterator(CStack<T> *pParent, size_t id) : m_pParent(pParent), m_Index(id)
pavolmarko@128
    46
			{
pavolmarko@128
    47
			}
pavolmarko@128
    48
pavolmarko@128
    49
			iterator(CStack<T> *pParent) : m_pParent(pParent), m_Index(0)
pavolmarko@128
    50
			{
pavolmarko@128
    51
			}
pavolmarko@128
    52
			
pavolmarko@128
    53
			iterator() : m_pParent(NULL), m_Index(0)
pavolmarko@128
    54
			{
pavolmarko@128
    55
			}
pavolmarko@128
    56
pavolmarko@128
    57
			T &operator *()
pavolmarko@128
    58
			{
pavolmarko@380
    59
				return m_pParent->at(m_Index);
pavolmarko@128
    60
			}
pavolmarko@128
    61
			const T &operator *() const
pavolmarko@128
    62
			{
pavolmarko@380
    63
				return m_pParent->at(m_Index);
pavolmarko@128
    64
			}
pavolmarko@128
    65
			
pavolmarko@128
    66
			T * operator->()
pavolmarko@128
    67
			{
pavolmarko@380
    68
				return &(m_pParent->at(m_Index));
pavolmarko@128
    69
			}
pavolmarko@128
    70
pavolmarko@128
    71
			const T * operator->() const
pavolmarko@128
    72
			{
pavolmarko@380
    73
				return &(m_pParent->at(m_Index));
pavolmarko@128
    74
			}
pavolmarko@128
    75
pavolmarko@128
    76
			iterator & operator++()		// preincrement
pavolmarko@128
    77
			{
pavolmarko@128
    78
				++m_Index;
pavolmarko@128
    79
				return (*this);
pavolmarko@128
    80
			}
pavolmarko@128
    81
pavolmarko@128
    82
			iterator operator++(int)	// postincrement
pavolmarko@128
    83
			{
pavolmarko@128
    84
				iterator tmp = *this;
pavolmarko@129
    85
				++m_Index;
pavolmarko@128
    86
				return tmp;
pavolmarko@128
    87
			}
pavolmarko@128
    88
pavolmarko@128
    89
			iterator & operator--()		// predecrement
pavolmarko@128
    90
			{
pavolmarko@128
    91
				--m_Index;
pavolmarko@128
    92
				return (*this);
pavolmarko@128
    93
			}
pavolmarko@128
    94
pavolmarko@128
    95
			iterator operator--(int)	// postdecrememnt
pavolmarko@128
    96
			{
pavolmarko@128
    97
				iterator tmp = *this;
pavolmarko@129
    98
				--m_Index;
pavolmarko@128
    99
				return tmp;
pavolmarko@128
   100
			}
pavolmarko@128
   101
pavolmarko@128
   102
			bool operator==(const iterator & right) const
pavolmarko@128
   103
			{
pavolmarko@128
   104
				return (m_pParent == right.m_pParent && m_Index == right.m_Index);
pavolmarko@128
   105
			}
pavolmarko@128
   106
pavolmarko@128
   107
			bool operator!=(const iterator & right) const
pavolmarko@128
   108
			{
pavolmarko@128
   109
				return !(*this == right);
pavolmarko@128
   110
			}
pavolmarko@128
   111
		};
pavolmarko@380
   112
		CStack() : m_UsedSize(0)
pavolmarko@128
   113
		{
pavolmarko@128
   114
		}
pavolmarko@128
   115
pavolmarko@380
   116
		CStack(const CStack &other)
pavolmarko@129
   117
		{
pavolmarko@381
   118
			for (typename CVector<T*>::iterator sect_iter = other.m_Sectors.begin();
pavolmarko@380
   119
				sect_iter != other.m_Sectors.end(); ++sect_iter)
pavolmarko@380
   120
			{
pavolmarko@380
   121
				m_Sectors.push_back(new T[SECTOR_SIZE]);
pavolmarko@380
   122
				for (size_t i = 0; i < SECTOR_SIZE; ++i)
pavolmarko@380
   123
					m_Sectors.back()[i] = (*sect_iter)[i];
pavolmarko@380
   124
			}
pavolmarko@129
   125
			m_UsedSize = other.m_UsedSize;
pavolmarko@380
   126
		}
pavolmarko@380
   127
pavolmarko@380
   128
		CStack & operator =(const CStack &other)
pavolmarko@380
   129
		{
pavolmarko@380
   130
			clear();
pavolmarko@381
   131
			for (typename CVector<T*>::iterator sect_iter = other.m_Sectors.begin();
pavolmarko@380
   132
				sect_iter != other.m_Sectors.end(); ++sect_iter)
pavolmarko@380
   133
			{
pavolmarko@380
   134
				m_Sectors.push_back(new T[SECTOR_SIZE]);
pavolmarko@380
   135
				for (size_t i = 0; i < SECTOR_SIZE; ++i)
pavolmarko@380
   136
					m_Sectors.back()[i] = (*sect_iter)[i];
pavolmarko@380
   137
			}
pavolmarko@380
   138
			m_UsedSize = other.m_UsedSize;
pavolmarko@380
   139
			return *this;
pavolmarko@129
   140
		}
pavolmarko@129
   141
pavolmarko@128
   142
		~CStack()
pavolmarko@128
   143
		{
pavolmarko@380
   144
			clear();
pavolmarko@128
   145
		}
pavolmarko@380
   146
pavolmarko@380
   147
		T &at(size_t x)
pavolmarko@129
   148
		{
pavolmarko@380
   149
			return m_Sectors[x / SECTOR_SIZE][x % SECTOR_SIZE];
pavolmarko@380
   150
		}
pavolmarko@380
   151
pavolmarko@380
   152
		const T &at(size_t x) const
pavolmarko@380
   153
		{
pavolmarko@380
   154
			return m_Sectors[x / SECTOR_SIZE][x % SECTOR_SIZE];
pavolmarko@129
   155
		}
pavolmarko@129
   156
pavolmarko@128
   157
		bool push(const T &val)
pavolmarko@128
   158
		{
pavolmarko@380
   159
			if ((m_UsedSize / SECTOR_SIZE) >= m_Sectors.size())
pavolmarko@128
   160
			{
pavolmarko@380
   161
				// New sector
pavolmarko@380
   162
				m_Sectors.push_back(new T[SECTOR_SIZE]);
pavolmarko@128
   163
			}
pavolmarko@380
   164
pavolmarko@380
   165
			at(m_UsedSize) = val;
pavolmarko@380
   166
pavolmarko@380
   167
			++m_UsedSize;
pavolmarko@128
   168
			return true;
pavolmarko@128
   169
		}
dvander@252
   170
pavolmarko@380
   171
		T *make_next()
pavolmarko@380
   172
		{
pavolmarko@380
   173
			if ((m_UsedSize / SECTOR_SIZE) >= m_Sectors.size())
pavolmarko@380
   174
			{
pavolmarko@380
   175
				// New sector
pavolmarko@380
   176
				m_Sectors.push_back(new T[SECTOR_SIZE]);
pavolmarko@380
   177
			}
pavolmarko@380
   178
pavolmarko@380
   179
			return &(at(m_UsedSize++));
pavolmarko@380
   180
		}
pavolmarko@380
   181
pavolmarko@128
   182
		void pop()
pavolmarko@128
   183
		{
pavolmarko@128
   184
			--m_UsedSize;
pavolmarko@128
   185
		}
pavolmarko@128
   186
dvander@252
   187
		void popall()
dvander@252
   188
		{
dvander@252
   189
			m_UsedSize = 0;
dvander@252
   190
		}
dvander@252
   191
pavolmarko@128
   192
		T &front()
pavolmarko@128
   193
		{
pavolmarko@380
   194
			return at(m_UsedSize-1);
pavolmarko@128
   195
		}
pavolmarko@128
   196
pavolmarko@128
   197
		const T &front() const
pavolmarko@128
   198
		{
pavolmarko@380
   199
			return at(m_UsedSize-1);
pavolmarko@128
   200
		}
pavolmarko@128
   201
pavolmarko@162
   202
		T &second()
pavolmarko@162
   203
		{
pavolmarko@380
   204
			return at(m_UsedSize-2);
pavolmarko@162
   205
		}
pavolmarko@162
   206
pavolmarko@162
   207
		const T &second() const
pavolmarko@162
   208
		{
pavolmarko@380
   209
			return at(m_UsedSize-2);
pavolmarko@162
   210
		}
pavolmarko@162
   211
pavolmarko@128
   212
		iterator begin()
pavolmarko@128
   213
		{
pavolmarko@128
   214
			return iterator(this, 0);
pavolmarko@128
   215
		}
pavolmarko@128
   216
		iterator end()
pavolmarko@128
   217
		{
pavolmarko@128
   218
			return iterator(this, m_UsedSize);
pavolmarko@128
   219
		}
pavolmarko@129
   220
pavolmarko@129
   221
		size_t size()
pavolmarko@129
   222
		{
pavolmarko@129
   223
			return m_UsedSize;
pavolmarko@129
   224
		}
pavolmarko@129
   225
		bool empty()
pavolmarko@129
   226
		{
pavolmarko@129
   227
			return m_UsedSize == 0 ? true : false;
pavolmarko@129
   228
		}
pavolmarko@128
   229
	};
pavolmarko@128
   230
};	//namespace SourceHook
pavolmarko@128
   231
pavolmarko@128
   232
#endif