janwas
c0ed950657
this snowballed into a massive search+destroy of the hodgepodge of mostly equivalent types we had in use (int, uint, unsigned, unsigned int, i32, u32, ulong, uintN). it is more efficient to use 64-bit types in 64-bit mode, so the preferred default is size_t (for anything remotely resembling a size or index). tile coordinates are ssize_t to allow more efficient conversion to/from floating point. flags are int because we almost never need more than 15 distinct bits, bit test/set is not slower and int is fastest to type. finally, some data that is pretty much directly passed to OpenGL is now typed accordingly. after several hours, the code now requires fewer casts and less guesswork. other changes: - unit and player IDs now have an "invalid id" constant in the respective class to avoid casting and -1 - fix some endian/64-bit bugs in the map (un)packing. added a convenience function to write/read a size_t. - ia32: change CPUID interface to allow passing in ecx (required for cache topology detection, which I need at work). remove some unneeded functions from asm, replace with intrinsics where possible. This was SVN commit r5942.
111 lines
2.9 KiB
C++
111 lines
2.9 KiB
C++
#include "lib/self_test.h"
|
|
|
|
#include "lib/cache_adt.h"
|
|
#include "lib/rand.h"
|
|
|
|
class TestCache: public CxxTest::TestSuite
|
|
{
|
|
public:
|
|
void test_cache_perf()
|
|
{
|
|
Cache<int, int, Landlord_Naive> c1;
|
|
Cache<int, int, Landlord_Naive, Divider_Recip> c1r;
|
|
Cache<int, int, Landlord_Cached> c2;
|
|
Cache<int, int, Landlord_Cached, Divider_Recip> c2r;
|
|
Cache<int, int, Landlord_Lazy> c3;
|
|
Cache<int, int, Landlord_Lazy, Divider_Recip> c3r;
|
|
|
|
#if defined(ENABLE_CACHE_POLICY_BENCHMARK) || 0
|
|
// set max priority, to reduce interference while measuring.
|
|
int old_policy; static sched_param old_param; // (static => 0-init)
|
|
pthread_getschedparam(pthread_self(), &old_policy, &old_param);
|
|
static sched_param max_param;
|
|
max_param.sched_priority = sched_get_priority_max(SCHED_FIFO);
|
|
pthread_setschedparam(pthread_self(), SCHED_FIFO, &max_param);
|
|
|
|
#define MEASURE(c, desc)\
|
|
{\
|
|
srand(1);\
|
|
int cnt = 1;\
|
|
TIMER_BEGIN(desc);\
|
|
for(int i = 0; i < 30000; i++)\
|
|
{\
|
|
/* 70% add (random objects) */\
|
|
bool add = rand(1,10) < 7;\
|
|
if(add)\
|
|
{\
|
|
int key = cnt++;\
|
|
int val = cnt++;\
|
|
size_t size = (size_t)rand(1,100);\
|
|
size_t cost = (size_t)rand(1,100);\
|
|
c.add(key, val, size, cost);\
|
|
}\
|
|
else\
|
|
{\
|
|
size_t size;\
|
|
int value;\
|
|
c.remove_least_valuable(&value, &size);\
|
|
}\
|
|
}\
|
|
TIMER_END(desc);\
|
|
}
|
|
MEASURE(c1, "naive")
|
|
MEASURE(c1r, "naiverecip")
|
|
MEASURE(c2, "cached")
|
|
MEASURE(c2r, "cachedrecip")
|
|
MEASURE(c3, "lazy")
|
|
MEASURE(c3r, "lazyrecip")
|
|
|
|
// restore previous policy and priority.
|
|
pthread_setschedparam(pthread_self(), old_policy, &old_param);
|
|
exit(1134);
|
|
#endif
|
|
}
|
|
|
|
// ensures all 3 variants of Landlord<> behave the same
|
|
// [PT: disabled because it's far too slow]
|
|
void DISABLED_test_cache_policies()
|
|
{
|
|
Cache<int, int, Landlord_Naive > c1;
|
|
Cache<int, int, Landlord_Cached> c2;
|
|
Cache<int, int, Landlord_Lazy > c3;
|
|
|
|
srand(1);
|
|
int cnt = 1;
|
|
for(int i = 0; i < 1000; i++)
|
|
{
|
|
// 70% add (random objects)
|
|
bool add = rand(1,10) < 7;
|
|
if(add)
|
|
{
|
|
int key = cnt++;
|
|
int val = cnt++;
|
|
size_t size = (size_t)rand(1,100);
|
|
size_t cost = (size_t)rand(1,100);
|
|
c1.add(key, val, size, cost);
|
|
c2.add(key, val, size, cost);
|
|
c3.add(key, val, size, cost);
|
|
}
|
|
// 30% delete - make sure "least valuable" was same for all
|
|
else
|
|
{
|
|
size_t size1, size2, size3;
|
|
int value1, value2, value3;
|
|
bool removed1, removed2, removed3;
|
|
removed1 = c1.remove_least_valuable(&value1, &size1);
|
|
removed2 = c2.remove_least_valuable(&value2, &size2);
|
|
removed3 = c3.remove_least_valuable(&value3, &size3);
|
|
TS_ASSERT_EQUALS(removed1, removed2);
|
|
TS_ASSERT_EQUALS(removed2, removed3);
|
|
if (removed1)
|
|
{
|
|
TS_ASSERT_EQUALS(size1, size2);
|
|
TS_ASSERT_EQUALS(value1, value2);
|
|
TS_ASSERT_EQUALS(size2, size3);
|
|
TS_ASSERT_EQUALS(value2, value3);
|
|
}
|
|
} // else
|
|
} // for i
|
|
}
|
|
};
|