core/sourcehook/test/testlist.cpp
author Scott Ehlert <ds@alliedmods.net>
Thu Dec 10 00:59:50 2009 -0600 (2009-12-10)
changeset 689 4065ba5e9155
parent 539 db914129ae01
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.
     1 #include <string>
     2 #include "sh_list.h"
     3 #include "sh_stack.h"
     4 #include "sh_tinyhash.h"
     5 #include "sh_vector.h"
     6 #include "testevents.h"
     7 
     8 // TEST LIST
     9 // Tests sh_list, sh_tinyhash, sh_vector
    10 
    11 // :TODO: vector test, list insert test
    12 
    13 namespace
    14 {
    15 	struct Hmm
    16 	{
    17 		Hmm *m_This;
    18 		int m_Int;
    19 		Hmm(const Hmm &other) : m_Int(other.m_Int)
    20 		{
    21 			m_This = this;
    22 		}
    23 		Hmm(int i) : m_Int(i)
    24 		{
    25 			m_This = this;
    26 		}
    27 		Hmm() : m_Int(0)
    28 		{
    29 			m_This = this;
    30 		}
    31 		void operator = (const Hmm &other)
    32 		{
    33 			m_Int = other.m_Int;
    34 		}
    35 		operator int () const
    36 		{
    37 			return m_Int;
    38 		}
    39 	};
    40 
    41 	#define LIST_THIS_CHECK(lst, err) \
    42 		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter) \
    43 			CHECK_COND(&(*iter) == iter->m_This, err);
    44 
    45 	bool DoTestList(std::string &error)
    46 	{
    47 		typedef SourceHook::List<Hmm> ListType;
    48 		ListType lst;
    49 
    50 		CHECK_COND(lst.empty(), "Part1");
    51 
    52 		for (int i = 1; i <= 100; ++i)
    53 			lst.push_back(i);
    54 
    55 		LIST_THIS_CHECK(lst, "PartA1");
    56 
    57 		CHECK_COND(!lst.empty(), "Part2");
    58 
    59 		lst.clear();
    60 
    61 		CHECK_COND(lst.empty(), "Part3");
    62 
    63 		for (int i = 1; i <= 100; ++i)
    64 			lst.push_back(i);
    65 
    66 		CHECK_COND(lst.back() == 100, "Part4");
    67 		LIST_THIS_CHECK(lst, "PartA2");
    68 
    69 		int ver = 1;
    70 		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
    71 			CHECK_COND(*iter == ver++, "Part5");
    72 
    73 		CHECK_COND(ver == 101, "Part 6");
    74 
    75 		ListType::iterator iter50 = lst.find(50);
    76 		CHECK_COND(*iter50 == 50, "Part7");
    77 
    78 		iter50 = lst.erase(iter50);
    79 		CHECK_COND(*iter50 == 51, "Part8");
    80 		CHECK_COND(*--iter50 == 49, "Part8.2");
    81 
    82 		lst.remove(80);
    83 
    84 		ver = 1;
    85 		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
    86 		{
    87 			CHECK_COND(*iter == ver++, "Part9");
    88 			if (ver == 50 || ver == 80)
    89 				++ver;
    90 		}
    91 		CHECK_COND(ver == 101, "Part10");
    92 		LIST_THIS_CHECK(lst, "PartA3");
    93 
    94 		ListType lst2;
    95 		lst = lst2;
    96 		CHECK_COND(lst.empty(), "Part11");
    97 
    98 		for (int i = 1; i <= 100; ++i)
    99 			lst.push_back(i);
   100 		lst2 = lst;
   101 		CHECK_COND(lst2.size() == 100, "Part11.2");
   102 
   103 		LIST_THIS_CHECK(lst, "PartA4");
   104 		LIST_THIS_CHECK(lst2, "PartA5");
   105 
   106 		ver = 1;
   107 		for (ListType::iterator iter = lst2.begin(); iter != lst2.end(); ++iter)
   108 			CHECK_COND(*iter == ver++, "Part12");
   109 
   110 		lst.clear();
   111 		for (int i = 401; i <= 500; ++i)
   112 			lst.push_back(i);
   113 		lst = lst2;
   114 		CHECK_COND(lst2.size() == 100, "Part13");
   115 
   116 		ver = 1;
   117 		for (ListType::iterator iter = lst.begin(); iter != lst.end(); ++iter)
   118 			CHECK_COND(*iter == ver++, "Part14");
   119 
   120 		LIST_THIS_CHECK(lst, "PartA6");
   121 		LIST_THIS_CHECK(lst2, "PartA7");
   122 
   123 		return true;
   124 	}
   125 
   126 	bool DoTestTinyHash(std::string &error)
   127 	{
   128 		const int mymax = 5000;
   129 
   130 		typedef SourceHook::THash<int, int> HashType;
   131 		HashType hash;
   132 
   133 		for (int i = 1; i <= mymax; ++i)
   134 			hash[i] = i + 5000;
   135 
   136 		for (int i = 1; i <= mymax; ++i)
   137 			CHECK_COND(hash[i] == i + 5000, "Part1");
   138 
   139 		// Find
   140 		int ver = 1;
   141 		HashType::iterator iter;
   142 		for (iter = hash.begin(); iter != hash.end(); ++iter)
   143 			CHECK_COND(iter->key == ver && iter->val == (ver++) + 5000, "Part2");
   144 
   145 		CHECK_COND(ver == mymax+1, "Part2.1");
   146 
   147 		iter = hash.find(300);
   148 		CHECK_COND(iter != hash.end() && iter->val == 300+5000, "Part3.1");
   149 		iter = hash.find(mymax+200);
   150 		CHECK_COND(iter == hash.end(), "Part3.2");
   151 
   152 		HashType hash2;
   153 		for (int i = 1; i <= mymax; ++i)
   154 			hash2[i] = i + 5000;
   155 
   156 		hash2.erase(mymax - 100);
   157 		CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.1");
   158 		CHECK_COND(hash2.find(mymax - 99) != hash2.end(), "Part 4.2");
   159 		CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.3");
   160 		hash2.erase(mymax - 99);
   161 		CHECK_COND(hash2.find(mymax - 101) != hash2.end(), "Part 4.4");
   162 		CHECK_COND(hash2.find(mymax - 99) == hash2.end(), "Part 4.5");
   163 		CHECK_COND(hash2.find(mymax - 100) == hash2.end(), "Part 4.6");
   164 
   165 		return true;
   166 	}
   167 
   168 	bool DoTestStack(std::string &error)
   169 	{
   170 		typedef SourceHook::CStack<int> IntStack;
   171 		IntStack stk;
   172 		int i;
   173 
   174 		CHECK_COND(stk.size() == 0 && stk.empty(), "A0");
   175 
   176 		for (i = 0; i < 5000; ++i)
   177 			stk.push(i);
   178 
   179 		CHECK_COND(stk.front() == 4999, "1");
   180 		CHECK_COND(stk.size() == 5000 && !stk.empty(), "A1");
   181 
   182 		IntStack::iterator iter;
   183 		i = 0;
   184 		for (iter = stk.begin(); iter != stk.end(); ++iter, ++i)
   185 			CHECK_COND(*iter == i, "2");
   186 
   187 		i = 0;
   188 		for (iter = stk.begin(); iter != stk.end(); iter++, ++i)
   189 			CHECK_COND(*iter == i, "3");
   190 
   191 		--iter;
   192 		iter--;
   193 		*iter = 'g'+'a'+'b'+'e'+'n';
   194 		stk.pop();
   195 
   196 		CHECK_COND(stk.size() == 4999 && !stk.empty(), "A2");
   197 		CHECK_COND(stk.front() == 'g'+'a'+'b'+'e'+'n', "4");
   198 		
   199 		IntStack stk2(stk);
   200 		CHECK_COND(stk2.size() == 4999 && !stk2.empty(), "A3");
   201 
   202 		IntStack::iterator iter2 = stk2.begin();
   203 		for (iter = stk.begin(); iter != stk.end(); ++iter, iter2++)
   204 			CHECK_COND(*iter == *iter2, "5");
   205 
   206 		while (!stk2.empty())
   207 			stk2.pop();
   208 		CHECK_COND(stk2.size() == 0 && stk2.empty(), "A4");
   209 		stk = stk2;
   210 		CHECK_COND(stk.size() == 0 && stk.empty(), "A5");
   211 
   212 		return true;
   213 	}
   214 
   215 	bool DoTestVec(std::string &error)
   216 	{
   217 		typedef SourceHook::CVector<int> IntVector;
   218 		IntVector vec1;
   219 		IntVector::iterator iter;
   220 		int i;
   221 		
   222 		CHECK_COND(vec1.size() == 0 && vec1.empty(), "V1");
   223 		for (i = 0; i < 500; ++i)
   224 			vec1.push_back(i);
   225 
   226 		CHECK_COND(vec1.size() == 500 && !vec1.empty(), "V2");
   227 
   228 		for (i = 0; i < 500; ++i)
   229 			CHECK_COND(vec1[i] == i, "V3");
   230 
   231 		for (i = 0, iter = vec1.begin(); iter != vec1.end(); ++iter, ++i)
   232 			CHECK_COND(*iter == i, "V4");
   233 
   234 		vec1.resize(1000);
   235 		for (i = 0; i < 500; ++i)
   236 			CHECK_COND(vec1[i] == i, "V5.1");
   237 		for (i = 500; i < 1000; ++i)
   238 			CHECK_COND(vec1[i] == 0, "V5.2");
   239 
   240 		vec1.resize(200);
   241 		for (i = 0; i < 200; ++i)
   242 			CHECK_COND(vec1[i] == i, "V6");
   243 
   244 		vec1.resize(500, 0x12345678);
   245 		for (i = 0; i < 200; ++i)
   246 			CHECK_COND(vec1[i] == i, "V7.1");
   247 		for (i = 200; i < 500; ++i)
   248 			CHECK_COND(vec1[i] == 0x12345678, "V7.2");
   249 
   250 		IntVector vec2(vec1);
   251 		CHECK_COND(vec2.size() == vec1.size() && vec2.empty() == vec1.empty(), "V8.0");
   252 		for (i = 0; i < 200; ++i)
   253 			CHECK_COND(vec2[i] == i, "V8.1");
   254 		for (i = 200; i < 500; ++i)
   255 			CHECK_COND(vec2[i] == 0x12345678, "V8.2");
   256 
   257 
   258 		vec1.clear();
   259 		CHECK_COND(vec1.size() == 0 && vec1.empty() && vec1.begin() == vec1.end(), "V9");
   260 		vec2 = vec1;
   261 		CHECK_COND(vec2.size() == 0 && vec2.empty() && vec2.begin() == vec2.end(), "V9");
   262 
   263 		return true;
   264 	}
   265 }
   266 
   267 bool TestList(std::string &error)
   268 {
   269 	if (!DoTestList(error))
   270 		return false;
   271 
   272 	if (!DoTestTinyHash(error))
   273 		return false;
   274 
   275 	if (!DoTestStack(error))
   276 		return false;
   277 
   278 	if (!DoTestVec(error))
   279 		return false;
   280 
   281 	return true;
   282 }