aboutsummaryrefslogtreecommitdiff
path: root/headers
diff options
context:
space:
mode:
Diffstat (limited to 'headers')
-rw-r--r--headers/arena_test.cu52
1 files changed, 0 insertions, 52 deletions
diff --git a/headers/arena_test.cu b/headers/arena_test.cu
deleted file mode 100644
index 68fc8ff..0000000
--- a/headers/arena_test.cu
+++ /dev/null
@@ -1,52 +0,0 @@
-#include "arena.cuh"
-#include "random.h"
-
-using namespace cleveldb;
-
-int main() {
- std::vector<std::pair<size_t, char*>> allocated;
- Arena arena;
- const int N = 100000;
- size_t bytes = 0;
- Random rnd(301);
- for (int i = 0; i < N; i++) {
- size_t s;
- if (i % (N / 10) == 0) {
- s = i;
- } else {
- s = rnd.OneIn(4000)
- ? rnd.Uniform(6000)
- : (rnd.OneIn(10) ? rnd.Uniform(100) : rnd.Uniform(20));
- }
- if (s == 0) {
- // Our arena disallows size 0 allocations.
- s = 1;
- }
- char* r;
- if (rnd.OneIn(10)) {
- r = arena.AllocateAligned(s);
- } else {
- r = arena.Allocate(s);
- }
-
- for (size_t b = 0; b < s; b++) {
- // Fill the "i"th allocation with a known bit pattern
- r[b] = i % 256;
- }
- bytes += s;
- allocated.push_back(std::make_pair(s, r));
- assert(arena.MemoryUsage() >= bytes);
- if (i > N / 10) {
- assert(arena.MemoryUsage() <= bytes * 1.10);
- }
- }
- for (size_t i = 0; i < allocated.size(); i++) {
- size_t num_bytes = allocated[i].first;
- const char* p = allocated[i].second;
- for (size_t b = 0; b < num_bytes; b++) {
- // Check the "i"th allocation for the known bit pattern
- assert((int(p[b]) & 0xff) == (i % 256));
- }
- }
- return 0;
-}