]> git.saurik.com Git - redis.git/blame - src/zmalloc.c
top level make clean also clean hiredis and linoise (deps)
[redis.git] / src / zmalloc.c
CommitLineData
ed9b544e 1/* zmalloc - total amount of allocated memory aware version of malloc()
2 *
12d090d2 3 * Copyright (c) 2009-2010, Salvatore Sanfilippo <antirez at gmail dot com>
ed9b544e 4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * * Redistributions of source code must retain the above copyright notice,
10 * this list of conditions and the following disclaimer.
11 * * Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * * Neither the name of Redis nor the names of its contributors may be used
15 * to endorse or promote products derived from this software without
16 * specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
29 */
30
6b47e12e 31#include <stdio.h>
ed9b544e 32#include <stdlib.h>
33#include <string.h>
a69a0c9c 34#include <pthread.h>
dde65f3f 35#include "config.h"
ec93bba3 36
7cdc98b6
PN
37#ifdef HAVE_MALLOC_SIZE
38#define PREFIX_SIZE (0)
39#else
d8b5f18f 40#if defined(__sun)
7cdc98b6 41#define PREFIX_SIZE (sizeof(long long))
d8b5f18f 42#else
7cdc98b6
PN
43#define PREFIX_SIZE (sizeof(size_t))
44#endif
45#endif
46
47/* Explicitly override malloc/free etc when using tcmalloc. */
48#if defined(USE_TCMALLOC)
49#define malloc(size) tc_malloc(size)
50#define calloc(count,size) tc_calloc(count,size)
51#define realloc(ptr,size) tc_realloc(ptr,size)
52#define free(ptr) tc_free(ptr)
d8b5f18f 53#endif
54
d3277ecd 55#define increment_used_memory(__n) do { \
56 size_t _n = (__n); \
57 if (_n&(sizeof(long)-1)) _n += sizeof(long)-(_n&(sizeof(long)-1)); \
4ad37480 58 if (zmalloc_thread_safe) { \
59 pthread_mutex_lock(&used_memory_mutex); \
60 used_memory += _n; \
61 pthread_mutex_unlock(&used_memory_mutex); \
62 } else { \
63 used_memory += _n; \
64 } \
65} while(0)
66
d3277ecd 67#define decrement_used_memory(__n) do { \
68 size_t _n = (__n); \
69 if (_n&(sizeof(long)-1)) _n += sizeof(long)-(_n&(sizeof(long)-1)); \
4ad37480 70 if (zmalloc_thread_safe) { \
71 pthread_mutex_lock(&used_memory_mutex); \
72 used_memory -= _n; \
73 pthread_mutex_unlock(&used_memory_mutex); \
74 } else { \
75 used_memory -= _n; \
76 } \
77} while(0)
78
ed9b544e 79static size_t used_memory = 0;
4ad37480 80static int zmalloc_thread_safe = 0;
a69a0c9c 81pthread_mutex_t used_memory_mutex = PTHREAD_MUTEX_INITIALIZER;
ed9b544e 82
6b47e12e 83static void zmalloc_oom(size_t size) {
412a8bce 84 fprintf(stderr, "zmalloc: Out of memory trying to allocate %zu bytes\n",
6b47e12e 85 size);
86 fflush(stderr);
87 abort();
88}
89
ed9b544e 90void *zmalloc(size_t size) {
d8b5f18f 91 void *ptr = malloc(size+PREFIX_SIZE);
ed9b544e 92
6b47e12e 93 if (!ptr) zmalloc_oom(size);
ec93bba3 94#ifdef HAVE_MALLOC_SIZE
4ad37480 95 increment_used_memory(redis_malloc_size(ptr));
ec93bba3 96 return ptr;
97#else
ed9b544e 98 *((size_t*)ptr) = size;
4ad37480 99 increment_used_memory(size+PREFIX_SIZE);
d8b5f18f 100 return (char*)ptr+PREFIX_SIZE;
ec93bba3 101#endif
ed9b544e 102}
103
399f2f40
BK
104void *zcalloc(size_t size) {
105 void *ptr = calloc(1, size+PREFIX_SIZE);
106
107 if (!ptr) zmalloc_oom(size);
108#ifdef HAVE_MALLOC_SIZE
109 increment_used_memory(redis_malloc_size(ptr));
110 return ptr;
111#else
112 *((size_t*)ptr) = size;
113 increment_used_memory(size+PREFIX_SIZE);
114 return (char*)ptr+PREFIX_SIZE;
115#endif
116}
117
ed9b544e 118void *zrealloc(void *ptr, size_t size) {
ec93bba3 119#ifndef HAVE_MALLOC_SIZE
ed9b544e 120 void *realptr;
ec93bba3 121#endif
ed9b544e 122 size_t oldsize;
123 void *newptr;
124
125 if (ptr == NULL) return zmalloc(size);
ec93bba3 126#ifdef HAVE_MALLOC_SIZE
127 oldsize = redis_malloc_size(ptr);
128 newptr = realloc(ptr,size);
6b47e12e 129 if (!newptr) zmalloc_oom(size);
ec93bba3 130
4ad37480 131 decrement_used_memory(oldsize);
132 increment_used_memory(redis_malloc_size(newptr));
ec93bba3 133 return newptr;
134#else
d8b5f18f 135 realptr = (char*)ptr-PREFIX_SIZE;
ed9b544e 136 oldsize = *((size_t*)realptr);
d8b5f18f 137 newptr = realloc(realptr,size+PREFIX_SIZE);
6b47e12e 138 if (!newptr) zmalloc_oom(size);
ed9b544e 139
140 *((size_t*)newptr) = size;
4ad37480 141 decrement_used_memory(oldsize);
142 increment_used_memory(size);
d8b5f18f 143 return (char*)newptr+PREFIX_SIZE;
ec93bba3 144#endif
ed9b544e 145}
146
147void zfree(void *ptr) {
ec93bba3 148#ifndef HAVE_MALLOC_SIZE
ed9b544e 149 void *realptr;
150 size_t oldsize;
ec93bba3 151#endif
ed9b544e 152
153 if (ptr == NULL) return;
ec93bba3 154#ifdef HAVE_MALLOC_SIZE
4ad37480 155 decrement_used_memory(redis_malloc_size(ptr));
ec93bba3 156 free(ptr);
157#else
d8b5f18f 158 realptr = (char*)ptr-PREFIX_SIZE;
ed9b544e 159 oldsize = *((size_t*)realptr);
4ad37480 160 decrement_used_memory(oldsize+PREFIX_SIZE);
ed9b544e 161 free(realptr);
ec93bba3 162#endif
ed9b544e 163}
164
165char *zstrdup(const char *s) {
166 size_t l = strlen(s)+1;
167 char *p = zmalloc(l);
168
169 memcpy(p,s,l);
170 return p;
171}
172
173size_t zmalloc_used_memory(void) {
4ad37480 174 size_t um;
175
176 if (zmalloc_thread_safe) pthread_mutex_lock(&used_memory_mutex);
177 um = used_memory;
178 if (zmalloc_thread_safe) pthread_mutex_unlock(&used_memory_mutex);
179 return um;
180}
181
182void zmalloc_enable_thread_safeness(void) {
183 zmalloc_thread_safe = 1;
ed9b544e 184}
eddb388e 185
92e28228 186/* Get the RSS information in an OS-specific way.
187 *
188 * WARNING: the function zmalloc_get_rss() is not designed to be fast
189 * and may not be called in the busy loops where Redis tries to release
190 * memory expiring or swapping out objects.
191 *
192 * For this kind of "fast RSS reporting" usages use instead the
193 * function RedisEstimateRSS() that is a much faster (and less precise)
194 * version of the funciton. */
73db2acc 195
196#if defined(HAVE_PROCFS)
197#include <unistd.h>
198#include <sys/types.h>
199#include <sys/stat.h>
200#include <fcntl.h>
201
92e28228 202size_t zmalloc_get_rss(void) {
eddb388e 203 int page = sysconf(_SC_PAGESIZE);
204 size_t rss;
205 char buf[4096];
206 char filename[256];
207 int fd, count;
208 char *p, *x;
209
210 snprintf(filename,256,"/proc/%d/stat",getpid());
211 if ((fd = open(filename,O_RDONLY)) == -1) return 0;
212 if (read(fd,buf,4096) <= 0) {
213 close(fd);
214 return 0;
215 }
216 close(fd);
217
218 p = buf;
219 count = 23; /* RSS is the 24th field in /proc/<pid>/stat */
220 while(p && count--) {
221 p = strchr(p,' ');
222 if (p) p++;
223 }
224 if (!p) return 0;
225 x = strchr(p,' ');
226 if (!x) return 0;
227 *x = '\0';
228
229 rss = strtoll(p,NULL,10);
230 rss *= page;
92e28228 231 return rss;
73db2acc 232}
233#elif defined(HAVE_TASKINFO)
234#include <unistd.h>
235#include <stdio.h>
236#include <stdlib.h>
237#include <sys/types.h>
238#include <sys/sysctl.h>
239#include <mach/task.h>
240#include <mach/mach_init.h>
241
92e28228 242size_t zmalloc_get_rss(void) {
73db2acc 243 task_t task = MACH_PORT_NULL;
244 struct task_basic_info t_info;
245 mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT;
246
247 if (task_for_pid(current_task(), getpid(), &task) != KERN_SUCCESS)
248 return 0;
249 task_info(task, TASK_BASIC_INFO, (task_info_t)&t_info, &t_info_count);
250
92e28228 251 return t_info.resident_size;
73db2acc 252}
eddb388e 253#else
92e28228 254float zmalloc_get_rss(void) {
255 /* If we can't get the RSS in an OS-specific way for this system just
256 * return the memory usage we estimated in zmalloc()..
257 *
258 * Fragmentation will appear to be always 1 (no fragmentation)
259 * of course... */
260 return zmalloc_used_memory();
eddb388e 261}
73db2acc 262#endif
92e28228 263
264/* Fragmentation = RSS / allocated-bytes */
265float zmalloc_get_fragmentation_ratio(void) {
266 return (float)zmalloc_get_rss()/zmalloc_used_memory();
267}