]>
Commit | Line | Data |
---|---|---|
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" |
67a1810b | 36 | #include "zmalloc.h" |
ec93bba3 | 37 | |
7cdc98b6 PN |
38 | #ifdef HAVE_MALLOC_SIZE |
39 | #define PREFIX_SIZE (0) | |
40 | #else | |
5ae979bf | 41 | #if defined(__sun) || defined(__sparc) || defined(__sparc__) |
7cdc98b6 | 42 | #define PREFIX_SIZE (sizeof(long long)) |
d8b5f18f | 43 | #else |
7cdc98b6 PN |
44 | #define PREFIX_SIZE (sizeof(size_t)) |
45 | #endif | |
46 | #endif | |
47 | ||
48 | /* Explicitly override malloc/free etc when using tcmalloc. */ | |
49 | #if defined(USE_TCMALLOC) | |
50 | #define malloc(size) tc_malloc(size) | |
51 | #define calloc(count,size) tc_calloc(count,size) | |
52 | #define realloc(ptr,size) tc_realloc(ptr,size) | |
53 | #define free(ptr) tc_free(ptr) | |
29d04257 | 54 | #elif defined(USE_JEMALLOC) |
55 | #define malloc(size) je_malloc(size) | |
56 | #define calloc(count,size) je_calloc(count,size) | |
57 | #define realloc(ptr,size) je_realloc(ptr,size) | |
58 | #define free(ptr) je_free(ptr) | |
d8b5f18f | 59 | #endif |
60 | ||
67a1810b | 61 | #define update_zmalloc_stat_alloc(__n,__size) do { \ |
d3277ecd | 62 | size_t _n = (__n); \ |
63 | if (_n&(sizeof(long)-1)) _n += sizeof(long)-(_n&(sizeof(long)-1)); \ | |
4ad37480 | 64 | if (zmalloc_thread_safe) { \ |
65 | pthread_mutex_lock(&used_memory_mutex); \ | |
66 | used_memory += _n; \ | |
67 | pthread_mutex_unlock(&used_memory_mutex); \ | |
68 | } else { \ | |
69 | used_memory += _n; \ | |
70 | } \ | |
71 | } while(0) | |
72 | ||
67a1810b | 73 | #define update_zmalloc_stat_free(__n) do { \ |
d3277ecd | 74 | size_t _n = (__n); \ |
75 | if (_n&(sizeof(long)-1)) _n += sizeof(long)-(_n&(sizeof(long)-1)); \ | |
4ad37480 | 76 | if (zmalloc_thread_safe) { \ |
77 | pthread_mutex_lock(&used_memory_mutex); \ | |
78 | used_memory -= _n; \ | |
79 | pthread_mutex_unlock(&used_memory_mutex); \ | |
80 | } else { \ | |
81 | used_memory -= _n; \ | |
82 | } \ | |
83 | } while(0) | |
84 | ||
ed9b544e | 85 | static size_t used_memory = 0; |
4ad37480 | 86 | static int zmalloc_thread_safe = 0; |
a69a0c9c | 87 | pthread_mutex_t used_memory_mutex = PTHREAD_MUTEX_INITIALIZER; |
ed9b544e | 88 | |
6b47e12e | 89 | static void zmalloc_oom(size_t size) { |
412a8bce | 90 | fprintf(stderr, "zmalloc: Out of memory trying to allocate %zu bytes\n", |
6b47e12e | 91 | size); |
92 | fflush(stderr); | |
93 | abort(); | |
94 | } | |
95 | ||
ed9b544e | 96 | void *zmalloc(size_t size) { |
d8b5f18f | 97 | void *ptr = malloc(size+PREFIX_SIZE); |
ed9b544e | 98 | |
6b47e12e | 99 | if (!ptr) zmalloc_oom(size); |
ec93bba3 | 100 | #ifdef HAVE_MALLOC_SIZE |
29d04257 | 101 | update_zmalloc_stat_alloc(zmalloc_size(ptr),size); |
ec93bba3 | 102 | return ptr; |
103 | #else | |
ed9b544e | 104 | *((size_t*)ptr) = size; |
67a1810b | 105 | update_zmalloc_stat_alloc(size+PREFIX_SIZE,size); |
d8b5f18f | 106 | return (char*)ptr+PREFIX_SIZE; |
ec93bba3 | 107 | #endif |
ed9b544e | 108 | } |
109 | ||
399f2f40 BK |
110 | void *zcalloc(size_t size) { |
111 | void *ptr = calloc(1, size+PREFIX_SIZE); | |
112 | ||
113 | if (!ptr) zmalloc_oom(size); | |
114 | #ifdef HAVE_MALLOC_SIZE | |
29d04257 | 115 | update_zmalloc_stat_alloc(zmalloc_size(ptr),size); |
399f2f40 BK |
116 | return ptr; |
117 | #else | |
118 | *((size_t*)ptr) = size; | |
67a1810b | 119 | update_zmalloc_stat_alloc(size+PREFIX_SIZE,size); |
399f2f40 BK |
120 | return (char*)ptr+PREFIX_SIZE; |
121 | #endif | |
122 | } | |
123 | ||
ed9b544e | 124 | void *zrealloc(void *ptr, size_t size) { |
ec93bba3 | 125 | #ifndef HAVE_MALLOC_SIZE |
ed9b544e | 126 | void *realptr; |
ec93bba3 | 127 | #endif |
ed9b544e | 128 | size_t oldsize; |
129 | void *newptr; | |
130 | ||
131 | if (ptr == NULL) return zmalloc(size); | |
ec93bba3 | 132 | #ifdef HAVE_MALLOC_SIZE |
29d04257 | 133 | oldsize = zmalloc_size(ptr); |
ec93bba3 | 134 | newptr = realloc(ptr,size); |
6b47e12e | 135 | if (!newptr) zmalloc_oom(size); |
ec93bba3 | 136 | |
67a1810b | 137 | update_zmalloc_stat_free(oldsize); |
29d04257 | 138 | update_zmalloc_stat_alloc(zmalloc_size(newptr),size); |
ec93bba3 | 139 | return newptr; |
140 | #else | |
d8b5f18f | 141 | realptr = (char*)ptr-PREFIX_SIZE; |
ed9b544e | 142 | oldsize = *((size_t*)realptr); |
d8b5f18f | 143 | newptr = realloc(realptr,size+PREFIX_SIZE); |
6b47e12e | 144 | if (!newptr) zmalloc_oom(size); |
ed9b544e | 145 | |
146 | *((size_t*)newptr) = size; | |
67a1810b | 147 | update_zmalloc_stat_free(oldsize); |
148 | update_zmalloc_stat_alloc(size,size); | |
d8b5f18f | 149 | return (char*)newptr+PREFIX_SIZE; |
ec93bba3 | 150 | #endif |
ed9b544e | 151 | } |
152 | ||
442246dd | 153 | /* Provide zmalloc_size() for systems where this function is not provided by |
154 | * malloc itself, given that in that case we store an header with this | |
155 | * information as the first bytes of every allocation. */ | |
156 | #ifndef HAVE_MALLOC_SIZE | |
157 | size_t zmalloc_size(void *ptr) { | |
158 | void *realptr = (char*)ptr-PREFIX_SIZE; | |
159 | size_t size = *((size_t*)realptr); | |
160 | /* Assume at least that all the allocations are padded at sizeof(long) by | |
161 | * the underlying allocator. */ | |
162 | if (size&(sizeof(long)-1)) size += sizeof(long)-(size&(sizeof(long)-1)); | |
163 | return size+PREFIX_SIZE; | |
164 | } | |
165 | #endif | |
166 | ||
ed9b544e | 167 | void zfree(void *ptr) { |
ec93bba3 | 168 | #ifndef HAVE_MALLOC_SIZE |
ed9b544e | 169 | void *realptr; |
170 | size_t oldsize; | |
ec93bba3 | 171 | #endif |
ed9b544e | 172 | |
173 | if (ptr == NULL) return; | |
ec93bba3 | 174 | #ifdef HAVE_MALLOC_SIZE |
29d04257 | 175 | update_zmalloc_stat_free(zmalloc_size(ptr)); |
ec93bba3 | 176 | free(ptr); |
177 | #else | |
d8b5f18f | 178 | realptr = (char*)ptr-PREFIX_SIZE; |
ed9b544e | 179 | oldsize = *((size_t*)realptr); |
67a1810b | 180 | update_zmalloc_stat_free(oldsize+PREFIX_SIZE); |
ed9b544e | 181 | free(realptr); |
ec93bba3 | 182 | #endif |
ed9b544e | 183 | } |
184 | ||
185 | char *zstrdup(const char *s) { | |
186 | size_t l = strlen(s)+1; | |
187 | char *p = zmalloc(l); | |
188 | ||
189 | memcpy(p,s,l); | |
190 | return p; | |
191 | } | |
192 | ||
193 | size_t zmalloc_used_memory(void) { | |
4ad37480 | 194 | size_t um; |
195 | ||
196 | if (zmalloc_thread_safe) pthread_mutex_lock(&used_memory_mutex); | |
197 | um = used_memory; | |
198 | if (zmalloc_thread_safe) pthread_mutex_unlock(&used_memory_mutex); | |
199 | return um; | |
200 | } | |
201 | ||
202 | void zmalloc_enable_thread_safeness(void) { | |
203 | zmalloc_thread_safe = 1; | |
ed9b544e | 204 | } |
eddb388e | 205 | |
92e28228 | 206 | /* Get the RSS information in an OS-specific way. |
207 | * | |
208 | * WARNING: the function zmalloc_get_rss() is not designed to be fast | |
209 | * and may not be called in the busy loops where Redis tries to release | |
210 | * memory expiring or swapping out objects. | |
211 | * | |
212 | * For this kind of "fast RSS reporting" usages use instead the | |
213 | * function RedisEstimateRSS() that is a much faster (and less precise) | |
214 | * version of the funciton. */ | |
73db2acc | 215 | |
216 | #if defined(HAVE_PROCFS) | |
217 | #include <unistd.h> | |
218 | #include <sys/types.h> | |
219 | #include <sys/stat.h> | |
220 | #include <fcntl.h> | |
221 | ||
92e28228 | 222 | size_t zmalloc_get_rss(void) { |
eddb388e | 223 | int page = sysconf(_SC_PAGESIZE); |
224 | size_t rss; | |
225 | char buf[4096]; | |
226 | char filename[256]; | |
227 | int fd, count; | |
228 | char *p, *x; | |
229 | ||
230 | snprintf(filename,256,"/proc/%d/stat",getpid()); | |
231 | if ((fd = open(filename,O_RDONLY)) == -1) return 0; | |
232 | if (read(fd,buf,4096) <= 0) { | |
233 | close(fd); | |
234 | return 0; | |
235 | } | |
236 | close(fd); | |
237 | ||
238 | p = buf; | |
239 | count = 23; /* RSS is the 24th field in /proc/<pid>/stat */ | |
240 | while(p && count--) { | |
241 | p = strchr(p,' '); | |
242 | if (p) p++; | |
243 | } | |
244 | if (!p) return 0; | |
245 | x = strchr(p,' '); | |
246 | if (!x) return 0; | |
247 | *x = '\0'; | |
248 | ||
249 | rss = strtoll(p,NULL,10); | |
250 | rss *= page; | |
92e28228 | 251 | return rss; |
73db2acc | 252 | } |
253 | #elif defined(HAVE_TASKINFO) | |
254 | #include <unistd.h> | |
255 | #include <stdio.h> | |
256 | #include <stdlib.h> | |
257 | #include <sys/types.h> | |
258 | #include <sys/sysctl.h> | |
259 | #include <mach/task.h> | |
260 | #include <mach/mach_init.h> | |
261 | ||
92e28228 | 262 | size_t zmalloc_get_rss(void) { |
73db2acc | 263 | task_t task = MACH_PORT_NULL; |
264 | struct task_basic_info t_info; | |
265 | mach_msg_type_number_t t_info_count = TASK_BASIC_INFO_COUNT; | |
266 | ||
267 | if (task_for_pid(current_task(), getpid(), &task) != KERN_SUCCESS) | |
268 | return 0; | |
269 | task_info(task, TASK_BASIC_INFO, (task_info_t)&t_info, &t_info_count); | |
270 | ||
92e28228 | 271 | return t_info.resident_size; |
73db2acc | 272 | } |
eddb388e | 273 | #else |
c4df22af | 274 | size_t zmalloc_get_rss(void) { |
92e28228 | 275 | /* If we can't get the RSS in an OS-specific way for this system just |
276 | * return the memory usage we estimated in zmalloc().. | |
277 | * | |
278 | * Fragmentation will appear to be always 1 (no fragmentation) | |
279 | * of course... */ | |
280 | return zmalloc_used_memory(); | |
eddb388e | 281 | } |
73db2acc | 282 | #endif |
92e28228 | 283 | |
284 | /* Fragmentation = RSS / allocated-bytes */ | |
285 | float zmalloc_get_fragmentation_ratio(void) { | |
286 | return (float)zmalloc_get_rss()/zmalloc_used_memory(); | |
287 | } |