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.
52 lines
1.4 KiB
C++
52 lines
1.4 KiB
C++
#include "lib/self_test.h"
|
|
|
|
#include "lib/res/file/file_cache.h"
|
|
#include "lib/rand.h"
|
|
|
|
class TestFileCache : public CxxTest::TestSuite
|
|
{
|
|
enum { TEST_ALLOC_TOTAL = 100*1000*1000 };
|
|
public:
|
|
void test_cache_allocator()
|
|
{
|
|
// allocated address -> its size
|
|
typedef std::map<void*, size_t> AllocMap;
|
|
AllocMap allocations;
|
|
|
|
// put allocator through its paces by allocating several times
|
|
// its capacity (this ensures memory is reused)
|
|
srand(1);
|
|
size_t total_size_used = 0;
|
|
while(total_size_used < TEST_ALLOC_TOTAL)
|
|
{
|
|
size_t size = rand(1, TEST_ALLOC_TOTAL/16);
|
|
total_size_used += size;
|
|
void* p;
|
|
// until successful alloc:
|
|
for(;;)
|
|
{
|
|
p = file_cache_allocator_alloc(size);
|
|
if(p)
|
|
break;
|
|
// out of room - remove a previous allocation
|
|
// .. choose one at random
|
|
size_t chosen_idx = (size_t)rand(0, (size_t)allocations.size());
|
|
AllocMap::iterator it = allocations.begin();
|
|
for(; chosen_idx != 0; chosen_idx--)
|
|
++it;
|
|
file_cache_allocator_free(it->first, it->second);
|
|
allocations.erase(it);
|
|
}
|
|
|
|
// must not already have been allocated
|
|
TS_ASSERT_EQUALS(allocations.find(p), allocations.end());
|
|
allocations[p] = size;
|
|
}
|
|
|
|
// reset to virginal state
|
|
// note: even though everything has now been freed, this is
|
|
// necessary since the freelists may be a bit scattered already.
|
|
file_cache_allocator_reset();
|
|
}
|
|
};
|