blob: d380ecc52f58287879605efa7a78a0ed9252658f [file] [log] [blame]
bartbedfd232009-03-26 19:07:15 +00001/* -*- mode: C; c-basic-offset: 3; -*- */
sewardjaf44c822007-11-25 14:01:38 +00002/*
bart86562bd2009-02-16 19:43:56 +00003 This file is part of drd, a thread error detector.
sewardjaf44c822007-11-25 14:01:38 +00004
bart86562bd2009-02-16 19:43:56 +00005 Copyright (C) 2006-2009 Bart Van Assche <bart.vanassche@gmail.com>.
sewardjaf44c822007-11-25 14:01:38 +00006
7 This program is free software; you can redistribute it and/or
8 modify it under the terms of the GNU General Public License as
9 published by the Free Software Foundation; either version 2 of the
10 License, or (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
20 02111-1307, USA.
21
22 The GNU General Public License is contained in the file COPYING.
23*/
24
25
26#include "drd_malloc_wrappers.h"
27#include "drd_thread.h"
28#include "pub_tool_basics.h"
29#include "pub_tool_execontext.h"
30#include "pub_tool_hashtable.h"
31#include "pub_tool_libcassert.h"
32#include "pub_tool_libcbase.h"
33#include "pub_tool_libcprint.h"
34#include "pub_tool_mallocfree.h"
35#include "pub_tool_options.h"
36#include "pub_tool_replacemalloc.h"
37#include "pub_tool_threadstate.h"
38#include "pub_tool_tooliface.h"
39
40
bart246fbf22009-02-15 14:46:17 +000041/* Local type definitions. */
sewardjaf44c822007-11-25 14:01:38 +000042
bart5fd28142009-06-10 19:24:20 +000043/**
44 * Node with per-allocation information that will be stored in a hash map.
45 * As specified in <pub_tool_hashtable.h>, the first member must be a pointer
46 * and the second member must be an UWord.
47 */
sewardjaf44c822007-11-25 14:01:38 +000048typedef struct _DRD_Chunk {
bartbedfd232009-03-26 19:07:15 +000049 struct _DRD_Chunk* next;
bart5fd28142009-06-10 19:24:20 +000050 UWord data; // pointer to actual block
51 SizeT size; // size requested
52 ExeContext* where; // where it was allocated
sewardjaf44c822007-11-25 14:01:38 +000053} DRD_Chunk;
54
bart246fbf22009-02-15 14:46:17 +000055
56/* Local variables. */
57
bartba0818d2009-05-01 12:21:39 +000058static StartUsingMem s_start_using_mem_callback;
59static StopUsingMem s_stop_using_mem_callback;
bart5fd28142009-06-10 19:24:20 +000060/* Statistics. */
bartba0818d2009-05-01 12:21:39 +000061static SizeT s_cmalloc_n_mallocs = 0;
62static SizeT s_cmalloc_n_frees = 0;
63static SizeT s_cmalloc_bs_mallocd = 0;
bart246fbf22009-02-15 14:46:17 +000064/* Record malloc'd blocks. */
bartba0818d2009-05-01 12:21:39 +000065static VgHashTable s_malloc_list = NULL;
sewardjaf44c822007-11-25 14:01:38 +000066
67
bart5fd28142009-06-10 19:24:20 +000068/* Function definitions. */
sewardjaf44c822007-11-25 14:01:38 +000069
bart5fd28142009-06-10 19:24:20 +000070/** Allocate client memory memory and update the hash map. */
bartba0818d2009-05-01 12:21:39 +000071static void* new_block(ThreadId tid, SizeT size, SizeT align, Bool is_zeroed)
sewardjaf44c822007-11-25 14:01:38 +000072{
bart5fd28142009-06-10 19:24:20 +000073 void* p;
sewardjaf44c822007-11-25 14:01:38 +000074
bart5fd28142009-06-10 19:24:20 +000075 p = VG_(cli_malloc)(align, size);
76 if (!p)
bartbedfd232009-03-26 19:07:15 +000077 return NULL;
bart5fd28142009-06-10 19:24:20 +000078 if (is_zeroed)
79 VG_(memset)(p, 0, size);
sewardjaf44c822007-11-25 14:01:38 +000080
bart5fd28142009-06-10 19:24:20 +000081 DRD_(malloclike_block)(tid, (Addr)p, size);
sewardjaf44c822007-11-25 14:01:38 +000082
bart5fd28142009-06-10 19:24:20 +000083 return p;
sewardjaf44c822007-11-25 14:01:38 +000084}
85
bartba0818d2009-05-01 12:21:39 +000086/**
87 * Store information about a memory block that has been allocated by
bart5fd28142009-06-10 19:24:20 +000088 * malloc() or a malloc() replacement in the hash map.
bartba0818d2009-05-01 12:21:39 +000089 */
90void DRD_(malloclike_block)(const ThreadId tid, const Addr p, const SizeT size)
91{
bart5fd28142009-06-10 19:24:20 +000092 DRD_Chunk* mc;
93
bartba0818d2009-05-01 12:21:39 +000094 tl_assert(p);
95
bart5fd28142009-06-10 19:24:20 +000096 if (size > 0)
97 s_start_using_mem_callback(p, size, 0/*ec_uniq*/);
bartba0818d2009-05-01 12:21:39 +000098
bart5fd28142009-06-10 19:24:20 +000099 s_cmalloc_n_mallocs++;
bartba0818d2009-05-01 12:21:39 +0000100 // Only update this stat if allocation succeeded.
101 s_cmalloc_bs_mallocd += size;
102
bart5fd28142009-06-10 19:24:20 +0000103 mc = VG_(malloc)("drd.malloc_wrappers.cDC.1", sizeof(DRD_Chunk));
104 mc->data = p;
105 mc->size = size;
106 mc->where = VG_(record_ExeContext)(tid, 0);
107 VG_(HT_add_node)(s_malloc_list, mc);
bartba0818d2009-05-01 12:21:39 +0000108}
109
bart5fd28142009-06-10 19:24:20 +0000110static void handle_free(ThreadId tid, void* p)
sewardjaf44c822007-11-25 14:01:38 +0000111{
bart5fd28142009-06-10 19:24:20 +0000112 tl_assert(p);
sewardjaf44c822007-11-25 14:01:38 +0000113
bart5fd28142009-06-10 19:24:20 +0000114 if (DRD_(freelike_block)(tid, (Addr)p))
115 VG_(cli_free)(p);
116 else
117 tl_assert(False);
sewardjaf44c822007-11-25 14:01:38 +0000118}
119
bartba0818d2009-05-01 12:21:39 +0000120/**
121 * Remove the information that was stored by DRD_(malloclike_block)() about
122 * a memory block.
123 */
124Bool DRD_(freelike_block)(const ThreadId tid, const Addr p)
sewardjaf44c822007-11-25 14:01:38 +0000125{
bartbedfd232009-03-26 19:07:15 +0000126 DRD_Chunk* mc;
sewardjaf44c822007-11-25 14:01:38 +0000127
bartba0818d2009-05-01 12:21:39 +0000128 tl_assert(p);
sewardjaf44c822007-11-25 14:01:38 +0000129
bartba0818d2009-05-01 12:21:39 +0000130 s_cmalloc_n_frees++;
131
132 mc = VG_(HT_remove)(s_malloc_list, (UWord)p);
133 if (mc)
bartbedfd232009-03-26 19:07:15 +0000134 {
135 tl_assert(p == mc->data);
136 if (mc->size > 0)
bartba0818d2009-05-01 12:21:39 +0000137 s_stop_using_mem_callback(mc->data, mc->size);
bartbedfd232009-03-26 19:07:15 +0000138 VG_(free)(mc);
bartba0818d2009-05-01 12:21:39 +0000139 return True;
bartbedfd232009-03-26 19:07:15 +0000140 }
bartba0818d2009-05-01 12:21:39 +0000141 return False;
142}
143
bart5fd28142009-06-10 19:24:20 +0000144/** Wrapper for malloc(). */
145static void* drd_malloc(ThreadId tid, SizeT n)
bartba0818d2009-05-01 12:21:39 +0000146{
bart5fd28142009-06-10 19:24:20 +0000147 return new_block(tid, n, VG_(clo_alignment), /*is_zeroed*/False);
sewardjaf44c822007-11-25 14:01:38 +0000148}
149
bart5fd28142009-06-10 19:24:20 +0000150/** Wrapper for memalign(). */
151static void* drd_memalign(ThreadId tid, SizeT align, SizeT n)
sewardjaf44c822007-11-25 14:01:38 +0000152{
bart5fd28142009-06-10 19:24:20 +0000153 return new_block(tid, n, align, /*is_zeroed*/False);
sewardjaf44c822007-11-25 14:01:38 +0000154}
155
bart5fd28142009-06-10 19:24:20 +0000156/** Wrapper for calloc(). */
157static void* drd_calloc(ThreadId tid, SizeT nmemb, SizeT size1)
158{
159 return new_block(tid, nmemb*size1, VG_(clo_alignment),
160 /*is_zeroed*/True);
161}
162
163/** Wrapper for free(). */
164static void drd_free(ThreadId tid, void* p)
165{
166 handle_free(tid, p);
167}
168
169/**
170 * Wrapper for realloc(). Returns a pointer to the new block of memory, or
171 * NULL if no new block could not be allocated. Notes:
172 * - realloc(NULL, size) has the same effect as malloc(size).
173 * - realloc(p, 0) has the same effect as free(p).
174 * - success is not guaranteed even if the requested size is smaller than the
175 * allocated size.
176*/
177static void* drd_realloc(ThreadId tid, void* p_old, SizeT new_size)
sewardjaf44c822007-11-25 14:01:38 +0000178{
bartbedfd232009-03-26 19:07:15 +0000179 DRD_Chunk* mc;
bart5fd28142009-06-10 19:24:20 +0000180 void* p_new;
181 SizeT old_size;
sewardjaf44c822007-11-25 14:01:38 +0000182
bart5fd28142009-06-10 19:24:20 +0000183 if (! p_old)
184 return drd_malloc(tid, new_size);
185
186 if (new_size == 0)
187 {
188 drd_free(tid, p_old);
189 return NULL;
190 }
191
192 s_cmalloc_n_mallocs++;
193 s_cmalloc_n_frees++;
bartba0818d2009-05-01 12:21:39 +0000194 s_cmalloc_bs_mallocd += new_size;
sewardjaf44c822007-11-25 14:01:38 +0000195
bart5fd28142009-06-10 19:24:20 +0000196 mc = VG_(HT_lookup)(s_malloc_list, (UWord)p_old);
197 if (mc == NULL)
198 {
bartbedfd232009-03-26 19:07:15 +0000199 tl_assert(0);
200 return NULL;
201 }
sewardjaf44c822007-11-25 14:01:38 +0000202
bartbedfd232009-03-26 19:07:15 +0000203 old_size = mc->size;
sewardjaf44c822007-11-25 14:01:38 +0000204
bartbedfd232009-03-26 19:07:15 +0000205 if (old_size == new_size)
206 {
207 /* size unchanged */
208 mc->where = VG_(record_ExeContext)(tid, 0);
209 p_new = p_old;
bartbedfd232009-03-26 19:07:15 +0000210 }
bart5fd28142009-06-10 19:24:20 +0000211 else if (new_size < old_size)
bartbedfd232009-03-26 19:07:15 +0000212 {
bart5fd28142009-06-10 19:24:20 +0000213 /* new size is smaller but nonzero */
bart5b61bda2009-06-09 11:12:07 +0000214 s_stop_using_mem_callback(mc->data + new_size, old_size - new_size);
bartbedfd232009-03-26 19:07:15 +0000215 mc->size = new_size;
216 mc->where = VG_(record_ExeContext)(tid, 0);
217 p_new = p_old;
bartbedfd232009-03-26 19:07:15 +0000218 }
219 else
220 {
221 /* new size is bigger */
bart5fd28142009-06-10 19:24:20 +0000222 p_new = VG_(cli_malloc)(VG_(clo_alignment), new_size);
sewardjaf44c822007-11-25 14:01:38 +0000223
bart5fd28142009-06-10 19:24:20 +0000224 if (p_new)
bartbedfd232009-03-26 19:07:15 +0000225 {
bart5fd28142009-06-10 19:24:20 +0000226 /* Copy from old to new. */
227 VG_(memcpy)(p_new, p_old, mc->size);
228
229 /* Free old memory. */
230 VG_(cli_free)(p_old);
bart83e7eb62009-07-25 13:28:24 +0000231 if (mc->size > 0)
232 s_stop_using_mem_callback(mc->data, mc->size);
bart5fd28142009-06-10 19:24:20 +0000233 VG_(HT_remove)(s_malloc_list, (UWord)p_old);
sewardjaf44c822007-11-25 14:01:38 +0000234
bart5fd28142009-06-10 19:24:20 +0000235 /* Update state information. */
236 mc->data = (Addr)p_new;
237 mc->size = new_size;
238 mc->where = VG_(record_ExeContext)(tid, 0);
239 VG_(HT_add_node)(s_malloc_list, mc);
240 s_start_using_mem_callback((Addr)p_new, new_size, 0/*ec_uniq*/);
bartbedfd232009-03-26 19:07:15 +0000241 }
242 else
243 {
244 /* Allocation failed -- leave original block untouched. */
245 }
bartbedfd232009-03-26 19:07:15 +0000246 }
sewardjaf44c822007-11-25 14:01:38 +0000247
bartbedfd232009-03-26 19:07:15 +0000248 return p_new;
sewardjaf44c822007-11-25 14:01:38 +0000249}
250
bart5fd28142009-06-10 19:24:20 +0000251/** Wrapper for __builtin_new(). */
252static void* drd___builtin_new(ThreadId tid, SizeT n)
sewardjaf44c822007-11-25 14:01:38 +0000253{
bartba0818d2009-05-01 12:21:39 +0000254 return new_block(tid, n, VG_(clo_alignment), /*is_zeroed*/False);
sewardjaf44c822007-11-25 14:01:38 +0000255}
256
bart5fd28142009-06-10 19:24:20 +0000257/** Wrapper for __builtin_delete(). */
258static void drd___builtin_delete(ThreadId tid, void* p)
sewardjaf44c822007-11-25 14:01:38 +0000259{
bart5fd28142009-06-10 19:24:20 +0000260 handle_free(tid, p);
sewardjaf44c822007-11-25 14:01:38 +0000261}
262
bart5fd28142009-06-10 19:24:20 +0000263/** Wrapper for __builtin_vec_new(). */
264static void* drd___builtin_vec_new(ThreadId tid, SizeT n)
njn8b140de2009-02-17 04:31:18 +0000265{
bart5fd28142009-06-10 19:24:20 +0000266 return new_block(tid, n, VG_(clo_alignment), /*is_zeroed*/False);
267}
njn8b140de2009-02-17 04:31:18 +0000268
bart5fd28142009-06-10 19:24:20 +0000269/** Wrapper for __builtin_vec_delete(). */
270static void drd___builtin_vec_delete(ThreadId tid, void* p)
271{
272 handle_free(tid, p);
273}
274
275/**
276 * Wrapper for malloc_usable_size() / malloc_size(). This function takes
277 * a pointer to a block allocated by `malloc' and returns the amount of space
278 * that is available in the block. This may or may not be more than the size
279 * requested from `malloc', due to alignment or minimum size constraints.
280 */
281static SizeT drd_malloc_usable_size(ThreadId tid, void* p)
282{
283 DRD_Chunk* mc;
284
285 mc = VG_(HT_lookup)(s_malloc_list, (UWord)p);
286
287 return mc ? mc->size : 0;
njn8b140de2009-02-17 04:31:18 +0000288}
289
bart246fbf22009-02-15 14:46:17 +0000290void DRD_(register_malloc_wrappers)(const StartUsingMem start_callback,
291 const StopUsingMem stop_callback)
sewardjaf44c822007-11-25 14:01:38 +0000292{
bartba0818d2009-05-01 12:21:39 +0000293 tl_assert(s_malloc_list == 0);
bart5fd28142009-06-10 19:24:20 +0000294 s_malloc_list = VG_(HT_construct)("drd_malloc_list");
295 tl_assert(s_malloc_list);
bartbedfd232009-03-26 19:07:15 +0000296 tl_assert(start_callback);
297 tl_assert(stop_callback);
sewardjaf44c822007-11-25 14:01:38 +0000298
bartba0818d2009-05-01 12:21:39 +0000299 s_start_using_mem_callback = start_callback;
300 s_stop_using_mem_callback = stop_callback;
sewardjaf44c822007-11-25 14:01:38 +0000301
bart5fd28142009-06-10 19:24:20 +0000302 VG_(needs_malloc_replacement)(drd_malloc,
303 drd___builtin_new,
304 drd___builtin_vec_new,
305 drd_memalign,
306 drd_calloc,
307 drd_free,
308 drd___builtin_delete,
309 drd___builtin_vec_delete,
310 drd_realloc,
311 drd_malloc_usable_size,
bartbedfd232009-03-26 19:07:15 +0000312 0);
sewardjaf44c822007-11-25 14:01:38 +0000313}
314
bart246fbf22009-02-15 14:46:17 +0000315Bool DRD_(heap_addrinfo)(Addr const a,
316 Addr* const data,
317 SizeT* const size,
318 ExeContext** const where)
sewardjaf44c822007-11-25 14:01:38 +0000319{
bartbedfd232009-03-26 19:07:15 +0000320 DRD_Chunk* mc;
sewardjaf44c822007-11-25 14:01:38 +0000321
bartbedfd232009-03-26 19:07:15 +0000322 tl_assert(data);
323 tl_assert(size);
324 tl_assert(where);
sewardjaf44c822007-11-25 14:01:38 +0000325
bartba0818d2009-05-01 12:21:39 +0000326 VG_(HT_ResetIter)(s_malloc_list);
327 while ((mc = VG_(HT_Next)(s_malloc_list)))
bartbedfd232009-03-26 19:07:15 +0000328 {
329 if (mc->data <= a && a < mc->data + mc->size)
330 {
331 *data = mc->data;
332 *size = mc->size;
333 *where = mc->where;
334 return True;
335 }
336 }
337 return False;
sewardjaf44c822007-11-25 14:01:38 +0000338}
339
340/*------------------------------------------------------------*/
341/*--- Statistics printing ---*/
342/*------------------------------------------------------------*/
343
bart246fbf22009-02-15 14:46:17 +0000344void DRD_(print_malloc_stats)(void)
sewardjaf44c822007-11-25 14:01:38 +0000345{
bartbedfd232009-03-26 19:07:15 +0000346 DRD_Chunk* mc;
347 SizeT nblocks = 0;
348 SizeT nbytes = 0;
sewardjaf44c822007-11-25 14:01:38 +0000349
bartbedfd232009-03-26 19:07:15 +0000350 if (VG_(clo_verbosity) == 0)
351 return;
352 if (VG_(clo_xml))
353 return;
sewardjaf44c822007-11-25 14:01:38 +0000354
bartbedfd232009-03-26 19:07:15 +0000355 /* Count memory still in use. */
bartba0818d2009-05-01 12:21:39 +0000356 VG_(HT_ResetIter)(s_malloc_list);
357 while ((mc = VG_(HT_Next)(s_malloc_list)))
bartbedfd232009-03-26 19:07:15 +0000358 {
359 nblocks++;
360 nbytes += mc->size;
361 }
sewardjaf44c822007-11-25 14:01:38 +0000362
bartbedfd232009-03-26 19:07:15 +0000363 VG_(message)(Vg_DebugMsg,
sewardj1e29ebc2009-07-15 14:49:17 +0000364 "malloc/free: in use at exit: %lu bytes in %lu blocks.\n",
bartbedfd232009-03-26 19:07:15 +0000365 nbytes, nblocks);
366 VG_(message)(Vg_DebugMsg,
sewardj1e29ebc2009-07-15 14:49:17 +0000367 "malloc/free: %lu allocs, %lu frees, %lu bytes allocated.\n",
bartba0818d2009-05-01 12:21:39 +0000368 s_cmalloc_n_mallocs,
369 s_cmalloc_n_frees, s_cmalloc_bs_mallocd);
bartbedfd232009-03-26 19:07:15 +0000370 if (VG_(clo_verbosity) > 1)
sewardj1e29ebc2009-07-15 14:49:17 +0000371 VG_(message)(Vg_DebugMsg, " \n");
sewardjaf44c822007-11-25 14:01:38 +0000372}
373
374/*--------------------------------------------------------------------*/
375/*--- end ---*/
376/*--------------------------------------------------------------------*/