/***************************************************************************** Copyright (c) 1994, 2009, Innobase Oy. All Rights Reserved. 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; version 2 of the License. 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *****************************************************************************/ /********************************************************************//** @file ut/ut0mem.c Memory primitives Created 5/11/1994 Heikki Tuuri *************************************************************************/ #include "ut0mem.h" #ifdef UNIV_NONINL #include "ut0mem.ic" #endif #ifndef UNIV_HOTBACKUP # include "os0thread.h" # include "srv0srv.h" #include /** This struct is placed first in every allocated memory block */ typedef struct ut_mem_block_struct ut_mem_block_t; /** The total amount of memory currently allocated from the operating system with os_mem_alloc_large() or malloc(). Does not count malloc() if srv_use_sys_malloc is set. Protected by ut_list_mutex. */ UNIV_INTERN ulint ut_total_allocated_memory = 0; /** Mutex protecting ut_total_allocated_memory and ut_mem_block_list */ UNIV_INTERN os_fast_mutex_t ut_list_mutex; /** Dynamically allocated memory block */ struct ut_mem_block_struct{ UT_LIST_NODE_T(ut_mem_block_t) mem_block_list; /*!< mem block list node */ ulint size; /*!< size of allocated memory */ ulint magic_n;/*!< magic number (UT_MEM_MAGIC_N) */ }; /** The value of ut_mem_block_struct::magic_n. Used in detecting memory corruption. */ #define UT_MEM_MAGIC_N 1601650166 /** List of all memory blocks allocated from the operating system with malloc. Protected by ut_list_mutex. */ static UT_LIST_BASE_NODE_T(ut_mem_block_t) ut_mem_block_list; /** Flag: has ut_mem_block_list been initialized? */ static ibool ut_mem_block_list_inited = FALSE; /** A dummy pointer for generating a null pointer exception in ut_malloc_low() */ static ulint* ut_mem_null_ptr = NULL; /**********************************************************************//** Initializes the mem block list at database startup. */ UNIV_INTERN void ut_mem_init(void) /*=============*/ { ut_a(!ut_mem_block_list_inited); os_fast_mutex_init(&ut_list_mutex); UT_LIST_INIT(ut_mem_block_list); ut_mem_block_list_inited = TRUE; } #endif /* !UNIV_HOTBACKUP */ /**********************************************************************//** Allocates memory. Sets it also to zero if UNIV_SET_MEM_TO_ZERO is defined and set_to_zero is TRUE. @return own: allocated memory */ UNIV_INTERN void* ut_malloc_low( /*==========*/ ulint n, /*!< in: number of bytes to allocate */ ibool set_to_zero, /*!< in: TRUE if allocated memory should be set to zero if UNIV_SET_MEM_TO_ZERO is defined */ ibool assert_on_error)/*!< in: if TRUE, we crash mysqld if the memory cannot be allocated */ { #ifndef UNIV_HOTBACKUP ulint retry_count; void* ret; if (UNIV_LIKELY(srv_use_sys_malloc)) { ret = malloc(n); ut_a(ret || !assert_on_error); #ifdef UNIV_SET_MEM_TO_ZERO if (set_to_zero) { memset(ret, '\0', n); UNIV_MEM_ALLOC(ret, n); } #endif return(ret); } ut_ad((sizeof(ut_mem_block_t) % 8) == 0); /* check alignment ok */ ut_a(ut_mem_block_list_inited); retry_count = 0; retry: os_fast_mutex_lock(&ut_list_mutex); ret = malloc(n + sizeof(ut_mem_block_t)); if (ret == NULL && retry_count < 60) { if (retry_count == 0) { ut_print_timestamp(stderr); fprintf(stderr, " InnoDB: Error: cannot allocate" " %lu bytes of\n" "InnoDB: memory with malloc!" " Total allocated memory\n" "InnoDB: by InnoDB %lu bytes." " Operating system errno: %lu\n" "InnoDB: Check if you should" " increase the swap file or\n" "InnoDB: ulimits of your operating system.\n" "InnoDB: On FreeBSD check you" " have compiled the OS with\n" "InnoDB: a big enough maximum process size.\n" "InnoDB: Note that in most 32-bit" " computers the process\n" "InnoDB: memory space is limited" " to 2 GB or 4 GB.\n" "InnoDB: We keep retrying" " the allocation for 60 seconds...\n", (ulong) n, (ulong) ut_total_allocated_memory, #ifdef __WIN__ (ulong) GetLastError() #else (ulong) errno #endif ); } os_fast_mutex_unlock(&ut_list_mutex); /* Sleep for a second and retry the allocation; maybe this is just a temporary shortage of memory */ os_thread_sleep(1000000); retry_count++; goto retry; } if (ret == NULL) { /* Flush stderr to make more probable that the error message gets in the error file before we generate a seg fault */ fflush(stderr); os_fast_mutex_unlock(&ut_list_mutex); /* Make an intentional seg fault so that we get a stack trace */ /* Intentional segfault on NetWare causes an abend. Avoid this by graceful exit handling in ut_a(). */ #if (!defined __NETWARE__) if (assert_on_error) { ut_print_timestamp(stderr); fprintf(stderr, " InnoDB: We now intentionally" " generate a seg fault so that\n" "InnoDB: on Linux we get a stack trace.\n"); if (*ut_mem_null_ptr) ut_mem_null_ptr = 0; } else { return(NULL); } #else ut_a(0); #endif } if (set_to_zero) { #ifdef UNIV_SET_MEM_TO_ZERO memset(ret, '\0', n + sizeof(ut_mem_block_t)); #endif } UNIV_MEM_ALLOC(ret, n + sizeof(ut_mem_block_t)); ((ut_mem_block_t*)ret)->size = n + sizeof(ut_mem_block_t); ((ut_mem_block_t*)ret)->magic_n = UT_MEM_MAGIC_N; ut_total_allocated_memory += n + sizeof(ut_mem_block_t); UT_LIST_ADD_FIRST(mem_block_list, ut_mem_block_list, ((ut_mem_block_t*)ret)); os_fast_mutex_unlock(&ut_list_mutex); return((void*)((byte*)ret + sizeof(ut_mem_block_t))); #else /* !UNIV_HOTBACKUP */ void* ret = malloc(n); ut_a(ret || !assert_on_error); # ifdef UNIV_SET_MEM_TO_ZERO if (set_to_zero) { memset(ret, '\0', n); } # endif return(ret); #endif /* !UNIV_HOTBACKUP */ } /**********************************************************************//** Allocates memory. Sets it also to zero if UNIV_SET_MEM_TO_ZERO is defined. @return own: allocated memory */ UNIV_INTERN void* ut_malloc( /*======*/ ulint n) /*!< in: number of bytes to allocate */ { #ifndef UNIV_HOTBACKUP return(ut_malloc_low(n, TRUE, TRUE)); #else /* !UNIV_HOTBACKUP */ return(malloc(n)); #endif /* !UNIV_HOTBACKUP */ } #ifndef UNIV_HOTBACKUP /**********************************************************************//** Tests if malloc of n bytes would succeed. ut_malloc() asserts if memory runs out. It cannot be used if we want to return an error message. Prints to stderr a message if fails. @return TRUE if succeeded */ UNIV_INTERN ibool ut_test_malloc( /*===========*/ ulint n) /*!< in: try to allocate this many bytes */ { void* ret; ret = malloc(n); if (ret == NULL) { ut_print_timestamp(stderr); fprintf(stderr, " InnoDB: Error: cannot allocate" " %lu bytes of memory for\n" "InnoDB: a BLOB with malloc! Total allocated memory\n" "InnoDB: by InnoDB %lu bytes." " Operating system errno: %d\n" "InnoDB: Check if you should increase" " the swap file or\n" "InnoDB: ulimits of your operating system.\n" "InnoDB: On FreeBSD check you have" " compiled the OS with\n" "InnoDB: a big enough maximum process size.\n", (ulong) n, (ulong) ut_total_allocated_memory, (int) errno); return(FALSE); } free(ret); return(TRUE); } #endif /* !UNIV_HOTBACKUP */ /**********************************************************************//** Frees a memory block allocated with ut_malloc. Freeing a NULL pointer is a nop. */ UNIV_INTERN void ut_free( /*====*/ void* ptr) /*!< in, own: memory block */ { #ifndef UNIV_HOTBACKUP ut_mem_block_t* block; if (ptr == NULL) { return; } else if (UNIV_LIKELY(srv_use_sys_malloc)) { free(ptr); return; } block = (ut_mem_block_t*)((byte*)ptr - sizeof(ut_mem_block_t)); os_fast_mutex_lock(&ut_list_mutex); ut_a(block->magic_n == UT_MEM_MAGIC_N); ut_a(ut_total_allocated_memory >= block->size); ut_total_allocated_memory -= block->size; UT_LIST_REMOVE(mem_block_list, ut_mem_block_list, block); free(block); os_fast_mutex_unlock(&ut_list_mutex); #else /* !UNIV_HOTBACKUP */ free(ptr); #endif /* !UNIV_HOTBACKUP */ } #ifndef UNIV_HOTBACKUP /**********************************************************************//** Implements realloc. This is needed by /pars/lexyy.c. Otherwise, you should not use this function because the allocation functions in mem0mem.h are the recommended ones in InnoDB. man realloc in Linux, 2004: realloc() changes the size of the memory block pointed to by ptr to size bytes. The contents will be unchanged to the minimum of the old and new sizes; newly allocated mem- ory will be uninitialized. If ptr is NULL, the call is equivalent to malloc(size); if size is equal to zero, the call is equivalent to free(ptr). Unless ptr is NULL, it must have been returned by an earlier call to malloc(), calloc() or realloc(). RETURN VALUE realloc() returns a pointer to the newly allocated memory, which is suitably aligned for any kind of variable and may be different from ptr, or NULL if the request fails. If size was equal to 0, either NULL or a pointer suitable to be passed to free() is returned. If realloc() fails the original block is left untouched - it is not freed or moved. @return own: pointer to new mem block or NULL */ UNIV_INTERN void* ut_realloc( /*=======*/ void* ptr, /*!< in: pointer to old block or NULL */ ulint size) /*!< in: desired size */ { ut_mem_block_t* block; ulint old_size; ulint min_size; void* new_ptr; if (UNIV_LIKELY(srv_use_sys_malloc)) { return(realloc(ptr, size)); } if (ptr == NULL) { return(ut_malloc(size)); } if (size == 0) { ut_free(ptr); return(NULL); } block = (ut_mem_block_t*)((byte*)ptr - sizeof(ut_mem_block_t)); ut_a(block->magic_n == UT_MEM_MAGIC_N); old_size = block->size - sizeof(ut_mem_block_t); if (size < old_size) { min_size = size; } else { min_size = old_size; } new_ptr = ut_malloc(size); if (new_ptr == NULL) { return(NULL); } /* Copy the old data from ptr */ ut_memcpy(new_ptr, ptr, min_size); ut_free(ptr); return(new_ptr); } /**********************************************************************//** Frees in shutdown all allocated memory not freed yet. */ UNIV_INTERN void ut_free_all_mem(void) /*=================*/ { ut_mem_block_t* block; ut_a(ut_mem_block_list_inited); ut_mem_block_list_inited = FALSE; os_fast_mutex_free(&ut_list_mutex); while ((block = UT_LIST_GET_FIRST(ut_mem_block_list))) { ut_a(block->magic_n == UT_MEM_MAGIC_N); ut_a(ut_total_allocated_memory >= block->size); ut_total_allocated_memory -= block->size; UT_LIST_REMOVE(mem_block_list, ut_mem_block_list, block); free(block); } if (ut_total_allocated_memory != 0) { fprintf(stderr, "InnoDB: Warning: after shutdown" " total allocated memory is %lu\n", (ulong) ut_total_allocated_memory); } ut_mem_block_list_inited = FALSE; } #endif /* !UNIV_HOTBACKUP */ /**********************************************************************//** Copies up to size - 1 characters from the NUL-terminated string src to dst, NUL-terminating the result. Returns strlen(src), so truncation occurred if the return value >= size. @return strlen(src) */ UNIV_INTERN ulint ut_strlcpy( /*=======*/ char* dst, /*!< in: destination buffer */ const char* src, /*!< in: source buffer */ ulint size) /*!< in: size of destination buffer */ { ulint src_size = strlen(src); if (size != 0) { ulint n = ut_min(src_size, size - 1); memcpy(dst, src, n); dst[n] = '\0'; } return(src_size); } /**********************************************************************//** Like ut_strlcpy, but if src doesn't fit in dst completely, copies the last (size - 1) bytes of src, not the first. @return strlen(src) */ UNIV_INTERN ulint ut_strlcpy_rev( /*===========*/ char* dst, /*!< in: destination buffer */ const char* src, /*!< in: source buffer */ ulint size) /*!< in: size of destination buffer */ { ulint src_size = strlen(src); if (size != 0) { ulint n = ut_min(src_size, size - 1); memcpy(dst, src + src_size - n, n + 1); } return(src_size); } /**********************************************************************//** Make a quoted copy of a NUL-terminated string. Leading and trailing quotes will not be included; only embedded quotes will be escaped. See also ut_strlenq() and ut_memcpyq(). @return pointer to end of dest */ UNIV_INTERN char* ut_strcpyq( /*=======*/ char* dest, /*!< in: output buffer */ char q, /*!< in: the quote character */ const char* src) /*!< in: null-terminated string */ { while (*src) { if ((*dest++ = *src++) == q) { *dest++ = q; } } return(dest); } /**********************************************************************//** Make a quoted copy of a fixed-length string. Leading and trailing quotes will not be included; only embedded quotes will be escaped. See also ut_strlenq() and ut_strcpyq(). @return pointer to end of dest */ UNIV_INTERN char* ut_memcpyq( /*=======*/ char* dest, /*!< in: output buffer */ char q, /*!< in: the quote character */ const char* src, /*!< in: string to be quoted */ ulint len) /*!< in: length of src */ { const char* srcend = src + len; while (src < srcend) { if ((*dest++ = *src++) == q) { *dest++ = q; } } return(dest); } #ifndef UNIV_HOTBACKUP /**********************************************************************//** Return the number of times s2 occurs in s1. Overlapping instances of s2 are only counted once. @return the number of times s2 occurs in s1 */ UNIV_INTERN ulint ut_strcount( /*========*/ const char* s1, /*!< in: string to search in */ const char* s2) /*!< in: string to search for */ { ulint count = 0; ulint len = strlen(s2); if (len == 0) { return(0); } for (;;) { s1 = strstr(s1, s2); if (!s1) { break; } count++; s1 += len; } return(count); } /**********************************************************************//** Replace every occurrence of s1 in str with s2. Overlapping instances of s1 are only replaced once. @return own: modified string, must be freed with mem_free() */ UNIV_INTERN char* ut_strreplace( /*==========*/ const char* str, /*!< in: string to operate on */ const char* s1, /*!< in: string to replace */ const char* s2) /*!< in: string to replace s1 with */ { char* new_str; char* ptr; const char* str_end; ulint str_len = strlen(str); ulint s1_len = strlen(s1); ulint s2_len = strlen(s2); ulint count = 0; int len_delta = (int)s2_len - (int)s1_len; str_end = str + str_len; if (len_delta <= 0) { len_delta = 0; } else { count = ut_strcount(str, s1); } new_str = mem_alloc(str_len + count * len_delta + 1); ptr = new_str; while (str) { const char* next = strstr(str, s1); if (!next) { next = str_end; } memcpy(ptr, str, next - str); ptr += next - str; if (next == str_end) { break; } memcpy(ptr, s2, s2_len); ptr += s2_len; str = next + s1_len; } *ptr = '\0'; return(new_str); } #ifdef UNIV_COMPILE_TEST_FUNCS void test_ut_str_sql_format() { char buf[128]; ulint ret; #define CALL_AND_TEST(str, str_len, buf, buf_size, ret_expected, buf_expected)\ do {\ ibool ok = TRUE;\ memset(buf, 'x', 10);\ buf[10] = '\0';\ fprintf(stderr, "TESTING \"%s\", %lu, %lu\n",\ str, (ulint) str_len, (ulint) buf_size);\ ret = ut_str_sql_format(str, str_len, buf, buf_size);\ if (ret != ret_expected) {\ fprintf(stderr, "expected ret %lu, got %lu\n",\ (ulint) ret_expected, ret);\ ok = FALSE;\ }\ if (strcmp((char*) buf, buf_expected) != 0) {\ fprintf(stderr, "expected buf \"%s\", got \"%s\"\n",\ buf_expected, buf);\ ok = FALSE;\ }\ if (ok) {\ fprintf(stderr, "OK: %lu, \"%s\"\n\n",\ (ulint) ret, buf);\ } else {\ return;\ }\ } while (0) CALL_AND_TEST("abcd", 4, buf, 0, 0, "xxxxxxxxxx"); CALL_AND_TEST("abcd", 4, buf, 1, 1, ""); CALL_AND_TEST("abcd", 4, buf, 2, 1, ""); CALL_AND_TEST("abcd", 0, buf, 3, 3, "''"); CALL_AND_TEST("abcd", 1, buf, 3, 1, ""); CALL_AND_TEST("abcd", 2, buf, 3, 1, ""); CALL_AND_TEST("abcd", 3, buf, 3, 1, ""); CALL_AND_TEST("abcd", 4, buf, 3, 1, ""); CALL_AND_TEST("abcd", 0, buf, 4, 3, "''"); CALL_AND_TEST("abcd", 1, buf, 4, 4, "'a'"); CALL_AND_TEST("abcd", 2, buf, 4, 4, "'a'"); CALL_AND_TEST("abcd", 3, buf, 4, 4, "'a'"); CALL_AND_TEST("abcd", 4, buf, 4, 4, "'a'"); CALL_AND_TEST("abcde", 5, buf, 4, 4, "'a'"); CALL_AND_TEST("'", 1, buf, 4, 3, "''"); CALL_AND_TEST("''", 2, buf, 4, 3, "''"); CALL_AND_TEST("a'", 2, buf, 4, 4, "'a'"); CALL_AND_TEST("'a", 2, buf, 4, 3, "''"); CALL_AND_TEST("ab", 2, buf, 4, 4, "'a'"); CALL_AND_TEST("abcdef", 0, buf, 5, 3, "''"); CALL_AND_TEST("abcdef", 1, buf, 5, 4, "'a'"); CALL_AND_TEST("abcdef", 2, buf, 5, 5, "'ab'"); CALL_AND_TEST("abcdef", 3, buf, 5, 5, "'ab'"); CALL_AND_TEST("abcdef", 4, buf, 5, 5, "'ab'"); CALL_AND_TEST("abcdef", 5, buf, 5, 5, "'ab'"); CALL_AND_TEST("abcdef", 6, buf, 5, 5, "'ab'"); CALL_AND_TEST("'", 1, buf, 5, 5, "''''"); CALL_AND_TEST("''", 2, buf, 5, 5, "''''"); CALL_AND_TEST("a'", 2, buf, 5, 4, "'a'"); CALL_AND_TEST("'a", 2, buf, 5, 5, "''''"); CALL_AND_TEST("ab", 2, buf, 5, 5, "'ab'"); CALL_AND_TEST("abc", 3, buf, 5, 5, "'ab'"); CALL_AND_TEST("ab", 2, buf, 6, 5, "'ab'"); CALL_AND_TEST("a'b'c", 5, buf, 32, 10, "'a''b''c'"); CALL_AND_TEST("a'b'c'", 6, buf, 32, 12, "'a''b''c'''"); } #endif /* UNIV_COMPILE_TEST_FUNCS */ #endif /* !UNIV_HOTBACKUP */