/usr/include/tulip/memorypool.h is in libtulip-dev 4.6.0dfsg-2+b5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip 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.
*
*/
///@cond DOXYGEN_HIDDEN
#ifndef MEMORYPOOL_H
#define MEMORYPOOL_H
#include <vector>
#include <iostream>
#include <cstdlib>
#include <cassert>
#ifdef _OPENMP
#include <omp.h>
#endif
#ifdef _OPENMP
#define THREAD_NUMBER omp_get_thread_num()
static const size_t MAXNBTHREADS = 128;
#else
#define THREAD_NUMBER 0
static const size_t MAXNBTHREADS = 1;
#endif
static const size_t BUFFOBJ = 20;
namespace tlp {
/**
* @class MemoryPool
* \brief That class enables to easily create a memory pool for an a class
*
* It allocates chunk of BUFFOBJ size of continous memory to allocate
* instance of the class. After a delete the memory is not free, and
* will be reused at the next new of the class.
*
* @warning it is not recommended to inherit from an object that inherit of that class
*
* The following code only calls malloc one time even if NBTRY object are created
* in that example, the speedup is about 23, without MemoryPool malloc is called NBTRY times
* @code
* class A : public MemoryPool<A> {
* public:
* A(){}
* ~A(){}
* int data[1000];
* };
*
* size_t NBTRY = 1000 * 1000;
* for (size_t j=0; j < NBTRY; ++j) {
* A *a = new A();
* a->data[100] = j;
* r1 += a->data[100];
* delete a;
* }
* @endcode
*
*/
template <typename TYPE >
class MemoryPool {
public:
MemoryPool() {
}
#ifndef NDEBUG
inline void *operator new( size_t sizeofObj) {
#else
inline void *operator new( size_t ) {
#endif
assert(sizeof(TYPE) == sizeofObj); //to prevent inheritance with different size of object
TYPE * t;
t = getObject(THREAD_NUMBER);
return t;
}
inline void operator delete( void *p ) {
_freeObject[THREAD_NUMBER].push_back(p);
}
private:
static std::vector<void * > _freeObject[MAXNBTHREADS];
static TYPE* getObject(size_t threadId) {
TYPE *result;
if (_freeObject[threadId].empty()) {
TYPE * p = (TYPE *)malloc(BUFFOBJ * sizeof(TYPE));
for (size_t j=0; j< BUFFOBJ - 1; ++j) {
_freeObject[threadId].push_back((void *)p);
p += 1;
}
result = p;
}
else {
result = (TYPE *)_freeObject[threadId].back();
_freeObject[threadId].pop_back();
}
return result;
}
};
template <typename TYPE >
std::vector<void * > MemoryPool<TYPE>::_freeObject[MAXNBTHREADS];
}
#endif // MEMORYPOOL_H
///@endcond
|