12
12
You should have received a copy of the GNU General Public License
13
13
along with this program; if not, write to the Free Software
14
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
18
* @brief Memory root declarations
23
#ifndef DRIZZLED_MEMORY_ROOT_H
24
#define DRIZZLED_MEMORY_ROOT_H
14
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
17
Data structures for mysys/my_alloc.c (root memory allocator)
28
24
#include <drizzled/definitions.h>
30
#include "drizzled/visibility.h"
36
* @namespace drizzled::memory
37
* Memory allocation utils
39
* NB: This namespace documentation may not seem very useful, but without a
40
* comment on the namespace Doxygen won't extract any documentation for
46
static const int KEEP_PREALLOC= 1;
47
/* move used to free list and reuse them */
48
static const int MARK_BLOCKS_FREE= 2;
54
{ /* struct for once_alloc (block) */
56
UsedMemory *next; /* Next block in use */
57
size_t left; /* memory left in block */
58
size_t size; /* size of block */
63
static const size_t ROOT_MIN_BLOCK_SIZE= (MALLOC_OVERHEAD + sizeof(internal::UsedMemory) + 8);
67
class DRIZZLED_API Root
82
Root(size_t block_size_arg)
84
free= used= pre_alloc= 0;
86
block_size= block_size_arg - memory::ROOT_MIN_BLOCK_SIZE;
87
block_num= 4; /* We shift this with >>2 */
95
* blocks with free memory in it
97
internal::UsedMemory *free;
100
* blocks almost without free memory
102
internal::UsedMemory *used;
107
internal::UsedMemory *pre_alloc;
110
* if block have less memory it will be put in 'used' list
26
#if defined(__cplusplus)
30
#define ALLOC_MAX_BLOCK_TO_DROP 4096
31
#define ALLOC_MAX_BLOCK_USAGE_BEFORE_DROP 10
33
typedef struct st_used_mem
34
{ /* struct for once_alloc (block) */
35
struct st_used_mem *next; /* Next block in use */
36
unsigned int left; /* memory left in block */
37
unsigned int size; /* size of block */
41
typedef struct st_mem_root
43
USED_MEM *free; /* blocks with free memory in it */
44
USED_MEM *used; /* blocks almost without free memory */
45
USED_MEM *pre_alloc; /* preallocated block */
46
/* if block have less memory it will be put in 'used' list */
112
47
size_t min_malloc;
114
size_t block_size; ///< initial block size
115
unsigned int block_num; ///< allocated blocks counter
118
* first free block in queue test counter (if it exceed
119
* MAX_BLOCK_USAGE_BEFORE_DROP block will be dropped in 'used' list)
48
size_t block_size; /* initial block size */
49
unsigned int block_num; /* allocated blocks counter */
51
first free block in queue test counter (if it exceed
52
MAX_BLOCK_USAGE_BEFORE_DROP block will be dropped in 'used' list)
121
54
unsigned int first_block_usage;
123
56
void (*error_handler)(void);
124
void reset_root_defaults(size_t block_size, size_t prealloc_size);
125
void *alloc_root(size_t Size);
126
void mark_blocks_free();
127
void *memdup_root(const void *str, size_t len);
128
char *strdup_root(const char *str);
129
char *strmake_root(const char *str,size_t len);
130
void init_alloc_root(size_t block_size= ROOT_MIN_BLOCK_SIZE);
132
inline bool alloc_root_inited()
134
return min_malloc != 0;
136
void free_root(myf MyFLAGS);
137
void *multi_alloc_root(int unused, ...);
140
} /* namespace memory */
141
} /* namespace drizzled */
143
#endif /* DRIZZLED_MEMORY_ROOT_H */
59
void init_alloc_root(MEM_ROOT *mem_root, size_t block_size,
60
size_t pre_alloc_size);
61
void *alloc_root(MEM_ROOT *mem_root, size_t Size);
62
void *multi_alloc_root(MEM_ROOT *mem_root, ...);
63
void free_root(MEM_ROOT *root, myf MyFLAGS);
64
void set_prealloc_root(MEM_ROOT *root, char *ptr);
65
void reset_root_defaults(MEM_ROOT *mem_root, size_t block_size,
66
size_t prealloc_size);
67
char *strdup_root(MEM_ROOT *root,const char *str);
68
char *strmake_root(MEM_ROOT *root,const char *str,size_t len);
69
void *memdup_root(MEM_ROOT *root,const void *str, size_t len);
71
#if defined(__cplusplus)