vlsvrs 1.0.0

VLSV reader with C and Python bindings
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

 /*
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301,
 USA.
 */

#include "../include/genericTsPool.h"
#include <cassert>
#include <gtest/gtest.h>
#include <iostream>
#include <random>

template <typename T>
bool allocate_to_the_brim_and_test(size_t len) {

   T* data = new T[len];
   if (!data) {
      std::cerr << "Failed to allocate initial buffer" << std::endl;
      return false;
   }

   std::random_device dev;
   std::mt19937 rng(dev());
   std::uniform_int_distribution<size_t> dist(1 << 2, len / 2);
   GENERIC_TS_POOL::MemPool p(data, len * sizeof(T));

   bool ok = true;
   int step = 0;
   std::vector<T*> ptrs;
   for (;;) {
      size_t sz = dist(rng);
      T* array = p.allocate<T>(sz);
      if (array == nullptr) {
         // printf("Reached max allocation with load = %f.\n",p.load());
         assert(p.load() < 1.0 && "erroneous load factor in pool!");
         if (step == 0) {
            step++;
            p.release();
            ptrs.clear();
            continue;
         } else {
            break;
         }
      }
      ptrs.push_back(array);

      // Set
      for (size_t i = 0; i < sz; ++i) {
         array[i] = i;
      }

      // Check
      for (size_t i = 0; i < sz; ++i) {
         if (array[i] != (T)i) {
            std::cout << "ERROR: Expected " << i << " got " << array[i] << std::endl;
            ok = false;
            break;
         }
      }
   }

   for (auto ptr : ptrs) {
      p.deallocate(ptr);
   }
   p.defrag();
   // Now we should have 0 alloc blocks and only one large degraged full free block
   ok = ok && (p.size() == 0);
   delete[] data;
   data = nullptr;
   return ok;
}

int main() {
   size_t test_size = 1 << 24;
   for (size_t i = 0; i < 10; ++i) {
      printf("Running test rep %zu/10...\n", i);
      auto ok1 = allocate_to_the_brim_and_test<float>(test_size);
      auto ok2 = allocate_to_the_brim_and_test<double>(test_size);
      auto ok3 = allocate_to_the_brim_and_test<int>(test_size);
      EXPECT_TRUE(ok1);
      EXPECT_TRUE(ok2);
      EXPECT_TRUE(ok3);
   }
   return 0;
}