91#ifdef MEM_PERIODIC_CHECK
93ibool mem_block_list_inited;
109 return(
static_cast<char *
>(
mem_heap_dup(heap, str, strlen(str) + 1)));
138 ulint s1_len = strlen(s1);
139 ulint s2_len = strlen(s2);
141 s =
static_cast<char *
>(
mem_heap_alloc(heap, s1_len + s2_len + 1));
143 memcpy(s, s1, s1_len);
144 memcpy(s + s1_len, s2, s2_len);
146 s[s1_len + s2_len] =
'\0';
169 ibool is_long = FALSE;
174 if (*format++ !=
'%') {
180 *buf++ = *(format - 1);
186 if (*format ==
'l') {
195 char* s = va_arg(ap,
char*);
204 memcpy(buf, s, plen);
220 val = va_arg(ap,
unsigned long);
222 plen = sprintf(tmp,
"%lu", val);
226 memcpy(buf, tmp, plen);
281 va_start(ap, format);
282 len = mem_heap_printf_low(NULL, format, ap);
287 va_start(ap, format);
288 mem_heap_printf_low(str, format, ap);
300mem_heap_create_block(
307 const char* file_name,
310#ifndef UNIV_HOTBACKUP
316 ut_ad((type == MEM_HEAP_DYNAMIC) || (type == MEM_HEAP_BUFFER)
317 || (type == MEM_HEAP_BUFFER + MEM_HEAP_BTR_SEARCH));
319 if (heap && heap->magic_n != MEM_BLOCK_MAGIC_N) {
324 len = MEM_BLOCK_HEADER_SIZE + MEM_SPACE_NEEDED(n);
326#ifndef UNIV_HOTBACKUP
327 if (type == MEM_HEAP_DYNAMIC || len < UNIV_PAGE_SIZE / 2) {
329 ut_ad(type == MEM_HEAP_DYNAMIC || n <= MEM_MAX_ALLOC_IN_BUF);
333 len = UNIV_PAGE_SIZE;
335 if ((type & MEM_HEAP_BTR_SEARCH) && heap) {
340 buf_block =
static_cast<buf_block_t *
>(heap->free_block);
341 heap->free_block = NULL;
343 if (UNIV_UNLIKELY(!buf_block)) {
348 buf_block = buf_block_alloc(NULL);
351 block = (mem_block_t*) buf_block->
frame;
355 block->buf_block = buf_block;
356 block->free_block = NULL;
358 len = MEM_BLOCK_HEADER_SIZE + MEM_SPACE_NEEDED(n);
363 block->magic_n = MEM_BLOCK_MAGIC_N;
364 ut_strlcpy_rev(block->file_name, file_name,
sizeof(block->file_name));
367#ifdef MEM_PERIODIC_CHECK
370 if (!mem_block_list_inited) {
371 mem_block_list_inited = TRUE;
379 mem_block_set_len(block, len);
380 mem_block_set_type(block, type);
381 mem_block_set_free(block, MEM_BLOCK_HEADER_SIZE);
382 mem_block_set_start(block, MEM_BLOCK_HEADER_SIZE);
384 if (UNIV_UNLIKELY(heap == NULL)) {
387 block->total_size = len;
391 ut_d(block->total_size = ULINT_UNDEFINED);
392 UNIV_MEM_INVALID(&block->total_size,
393 sizeof block->total_size);
395 heap->total_size += len;
398 ut_ad((ulint)MEM_BLOCK_HEADER_SIZE < len);
415 mem_block_t* new_block;
418 ut_ad(mem_heap_check(heap));
426 new_size = 2 * mem_block_get_len(block);
428 if (heap->type != MEM_HEAP_DYNAMIC) {
430 ut_a(n <= MEM_MAX_ALLOC_IN_BUF);
432 if (new_size > MEM_MAX_ALLOC_IN_BUF) {
433 new_size = MEM_MAX_ALLOC_IN_BUF;
435 }
else if (new_size > MEM_BLOCK_STANDARD_SIZE) {
437 new_size = MEM_BLOCK_STANDARD_SIZE;
444 new_block = mem_heap_create_block(heap, new_size, heap->type,
445 heap->file_name, heap->line);
446 if (new_block == NULL) {
469#ifndef UNIV_HOTBACKUP
473 if (block->magic_n != MEM_BLOCK_MAGIC_N) {
479#ifdef MEM_PERIODIC_CHECK
487 ut_ad(heap->total_size >= block->len);
488 heap->total_size -= block->len;
492 block->magic_n = MEM_FREED_BLOCK_MAGIC_N;
494#ifndef UNIV_HOTBACKUP
499 mem_erase_buf((
byte*)block, len);
501 UNIV_MEM_ASSERT_AND_FREE(block, len);
504 if (type == MEM_HEAP_DYNAMIC || len < UNIV_PAGE_SIZE / 2) {
509 ut_ad(type & MEM_HEAP_BUFFER);
518 mem_erase_buf((
byte*)block, len);
520 UNIV_MEM_ASSERT_AND_FREE(block, len);
526#ifndef UNIV_HOTBACKUP
531mem_heap_free_block_free(
535 if (UNIV_LIKELY_NULL(heap->free_block)) {
539 heap->free_block = NULL;
544#ifdef MEM_PERIODIC_CHECK
550mem_validate_all_blocks(
void)
560 if (block->magic_n != MEM_BLOCK_MAGIC_N) {
UNIV_INLINE void buf_block_free(buf_block_t *block)
struct buf_block_struct buf_block_t
UNIV_INTERN void mem_analyze_corruption(void *ptr)
UNIV_INTERN char * mem_heap_strdup(mem_heap_t *heap, const char *str)
UNIV_INTERN void * mem_heap_dup(mem_heap_t *heap, const void *data, ulint len)
UNIV_INTERN char * mem_heap_strcat(mem_heap_t *heap, const char *s1, const char *s2)
UNIV_INLINE void * mem_heap_alloc(mem_heap_t *heap, ulint n)
UNIV_INTERN char * mem_heap_printf(mem_heap_t *heap, const char *format,...) __attribute__((format(printf
UNIV_INTERN void mem_area_free(void *ptr, mem_pool_t *pool)
UNIV_INTERN void * mem_area_alloc(ulint *psize, mem_pool_t *pool)
mem_pool_t * mem_comm_pool
#define UT_LIST_REMOVE(NAME, BASE, N)
#define UT_LIST_GET_FIRST(BASE)
#define UT_LIST_GET_LAST(BASE)
#define UT_LIST_ADD_LAST(NAME, BASE, N)
#define UT_LIST_GET_NEXT(NAME, N)
#define UT_LIST_INIT(BASE)
#define UT_LIST_INSERT_AFTER(NAME, BASE, NODE1, NODE2)
#define UT_LIST_BASE_NODE_T(TYPE)
UNIV_INTERN ulint ut_strlcpy_rev(char *dst, const char *src, ulint size)
UNIV_INTERN void ut_free(void *ptr)
UNIV_INTERN void * ut_malloc(ulint n)