blob: 33d7be380c190d88c80424c628cb5ed7a6768ea8 [file] [log] [blame]
sewardjde4a1d02002-03-22 01:27:54 +00001
2/*
njn25e49d8e72002-09-23 09:36:25 +00003 ----------------------------------------------------------------
4
5 Notice that the following BSD-style license applies to this one
6 file (valgrind.h) only. The entire rest of Valgrind is licensed
7 under the terms of the GNU General Public License, version 2. See
8 the COPYING file in the source distribution for details.
9
10 ----------------------------------------------------------------
11
njnc9539842002-10-02 13:26:35 +000012 This file is part of Valgrind, an extensible x86 protected-mode
13 emulator for monitoring program execution on x86-Unixes.
sewardjde4a1d02002-03-22 01:27:54 +000014
nethercotebb1c9912004-01-04 16:43:23 +000015 Copyright (C) 2000-2004 Julian Seward. All rights reserved.
sewardjde4a1d02002-03-22 01:27:54 +000016
njn25e49d8e72002-09-23 09:36:25 +000017 Redistribution and use in source and binary forms, with or without
18 modification, are permitted provided that the following conditions
19 are met:
sewardjde4a1d02002-03-22 01:27:54 +000020
njn25e49d8e72002-09-23 09:36:25 +000021 1. Redistributions of source code must retain the above copyright
22 notice, this list of conditions and the following disclaimer.
sewardjde4a1d02002-03-22 01:27:54 +000023
njn25e49d8e72002-09-23 09:36:25 +000024 2. The origin of this software must not be misrepresented; you must
25 not claim that you wrote the original software. If you use this
26 software in a product, an acknowledgment in the product
27 documentation would be appreciated but is not required.
sewardjde4a1d02002-03-22 01:27:54 +000028
njn25e49d8e72002-09-23 09:36:25 +000029 3. Altered source versions must be plainly marked as such, and must
30 not be misrepresented as being the original software.
31
32 4. The name of the author may not be used to endorse or promote
33 products derived from this software without specific prior written
34 permission.
35
36 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
37 OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
38 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
39 ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
40 DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
41 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
42 GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
43 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
44 WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
45 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
46 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
47
48 ----------------------------------------------------------------
49
50 Notice that the above BSD-style license applies to this one file
51 (valgrind.h) only. The entire rest of Valgrind is licensed under
52 the terms of the GNU General Public License, version 2. See the
53 COPYING file in the source distribution for details.
54
55 ----------------------------------------------------------------
sewardjde4a1d02002-03-22 01:27:54 +000056*/
57
58
59#ifndef __VALGRIND_H
60#define __VALGRIND_H
61
fitzhardinge39de4b42003-10-31 07:12:21 +000062#include <stdarg.h>
63
sewardjde4a1d02002-03-22 01:27:54 +000064
65/* This file is for inclusion into client (your!) code.
66
njn25e49d8e72002-09-23 09:36:25 +000067 You can use these macros to manipulate and query Valgrind's
68 execution inside your own programs.
sewardjde4a1d02002-03-22 01:27:54 +000069
70 The resulting executables will still run without Valgrind, just a
71 little bit more slowly than they otherwise would, but otherwise
sewardj285f77f2003-03-15 23:39:11 +000072 unchanged. When not running on valgrind, each client request
73 consumes about 9 x86 instructions, so the resulting performance
74 loss is negligible unless you plan to execute client requests
75 millions of times per second. Nevertheless, if that is still a
76 problem, you can compile with the NVALGRIND symbol defined (gcc
77 -DNVALGRIND) so that client requests are not even compiled in. */
sewardjde4a1d02002-03-22 01:27:54 +000078
79
80
sewardj37091fb2002-11-16 11:06:50 +000081#ifndef NVALGRIND
sewardjde4a1d02002-03-22 01:27:54 +000082/* This defines the magic code sequence which the JITter spots and
83 handles magically. Don't look too closely at this; it will rot
sewardj2e93c502002-04-12 11:12:52 +000084 your brain. Valgrind dumps the result value in %EDX, so we first
85 copy the default value there, so that it is returned when not
86 running on Valgrind. Since %EAX points to a block of mem
87 containing the args, you can pass as many args as you want like
88 this. Currently this is set up to deal with 4 args since that's
89 the max that we appear to need (pthread_create).
sewardjde4a1d02002-03-22 01:27:54 +000090*/
sewardj2e93c502002-04-12 11:12:52 +000091#define VALGRIND_MAGIC_SEQUENCE( \
92 _zzq_rlval, /* result lvalue */ \
93 _zzq_default, /* result returned when running on real CPU */ \
94 _zzq_request, /* request code */ \
95 _zzq_arg1, /* request first param */ \
96 _zzq_arg2, /* request second param */ \
97 _zzq_arg3, /* request third param */ \
98 _zzq_arg4 /* request fourth param */ ) \
99 \
100 { volatile unsigned int _zzq_args[5]; \
sewardj18d75132002-05-16 11:06:21 +0000101 _zzq_args[0] = (volatile unsigned int)(_zzq_request); \
102 _zzq_args[1] = (volatile unsigned int)(_zzq_arg1); \
103 _zzq_args[2] = (volatile unsigned int)(_zzq_arg2); \
104 _zzq_args[3] = (volatile unsigned int)(_zzq_arg3); \
105 _zzq_args[4] = (volatile unsigned int)(_zzq_arg4); \
sewardj2e93c502002-04-12 11:12:52 +0000106 asm volatile("movl %1, %%eax\n\t" \
107 "movl %2, %%edx\n\t" \
108 "roll $29, %%eax ; roll $3, %%eax\n\t" \
109 "rorl $27, %%eax ; rorl $5, %%eax\n\t" \
110 "roll $13, %%eax ; roll $19, %%eax\n\t" \
111 "movl %%edx, %0\t" \
112 : "=r" (_zzq_rlval) \
113 : "r" (&_zzq_args[0]), "r" (_zzq_default) \
114 : "eax", "edx", "cc", "memory" \
115 ); \
116 }
sewardj37091fb2002-11-16 11:06:50 +0000117#else /* NVALGRIND */
118/* Define NVALGRIND to completely remove the Valgrind magic sequence
119 from the compiled code (analogous to NDEBUG's effects on
120 assert()) */
121#define VALGRIND_MAGIC_SEQUENCE( \
122 _zzq_rlval, /* result lvalue */ \
123 _zzq_default, /* result returned when running on real CPU */ \
124 _zzq_request, /* request code */ \
125 _zzq_arg1, /* request first param */ \
126 _zzq_arg2, /* request second param */ \
127 _zzq_arg3, /* request third param */ \
128 _zzq_arg4 /* request fourth param */ ) \
129 { \
130 (_zzq_rlval) = (_zzq_default); \
131 }
132#endif /* NVALGRIND */
sewardj2e93c502002-04-12 11:12:52 +0000133
134/* Some request codes. There are many more of these, but most are not
135 exposed to end-user view. These are the public ones, all of the
njn25e49d8e72002-09-23 09:36:25 +0000136 form 0x1000 + small_number.
njnd7994182003-10-02 13:44:04 +0000137
138 Core ones are in the range 0x00000000--0x0000ffff. The non-public ones
139 start at 0x2000.
sewardj2e93c502002-04-12 11:12:52 +0000140*/
141
njn4c791212003-05-02 17:53:54 +0000142#define VG_USERREQ_SKIN_BASE(a,b) \
143 ((unsigned int)(((a)&0xff) << 24 | ((b)&0xff) << 16))
144#define VG_IS_SKIN_USERREQ(a, b, v) \
145 (VG_USERREQ_SKIN_BASE(a,b) == ((v) & 0xffff0000))
sewardj34042512002-10-22 04:14:35 +0000146
njn25e49d8e72002-09-23 09:36:25 +0000147typedef
njn4c791212003-05-02 17:53:54 +0000148 enum { VG_USERREQ__RUNNING_ON_VALGRIND = 0x1001,
149 VG_USERREQ__DISCARD_TRANSLATIONS = 0x1002,
njn3e884182003-04-15 13:03:23 +0000150
151 /* These allow any function of 0--3 args to be called from the
152 simulated CPU but run on the real CPU */
njn4c791212003-05-02 17:53:54 +0000153 VG_USERREQ__CLIENT_CALL0 = 0x1101,
154 VG_USERREQ__CLIENT_CALL1 = 0x1102,
155 VG_USERREQ__CLIENT_CALL2 = 0x1103,
156 VG_USERREQ__CLIENT_CALL3 = 0x1104,
njn3e884182003-04-15 13:03:23 +0000157
njn47363ab2003-04-21 13:24:40 +0000158 /* Can be useful in regression testing suites -- eg. can send
159 Valgrind's output to /dev/null and still count errors. */
njn4c791212003-05-02 17:53:54 +0000160 VG_USERREQ__COUNT_ERRORS = 0x1201,
njn47363ab2003-04-21 13:24:40 +0000161
nethercote7cc9c232004-01-21 15:08:04 +0000162 /* These are useful and can be interpreted by any tool that tracks
njnd7994182003-10-02 13:44:04 +0000163 malloc() et al, by using vg_replace_malloc.c. */
164 VG_USERREQ__MALLOCLIKE_BLOCK = 0x1301,
165 VG_USERREQ__FREELIKE_BLOCK = 0x1302,
rjwalshbc0bb832004-06-19 18:12:36 +0000166 /* Memory pool support. */
167 VG_USERREQ__CREATE_MEMPOOL = 0x1303,
168 VG_USERREQ__DESTROY_MEMPOOL = 0x1304,
169 VG_USERREQ__MEMPOOL_ALLOC = 0x1305,
170 VG_USERREQ__MEMPOOL_FREE = 0x1306,
njnd7994182003-10-02 13:44:04 +0000171
fitzhardinge39de4b42003-10-31 07:12:21 +0000172 /* Allow printfs to valgrind log. */
173 VG_USERREQ__PRINTF = 0x1401,
174 VG_USERREQ__PRINTF_BACKTRACE = 0x1402,
njn25e49d8e72002-09-23 09:36:25 +0000175 } Vg_ClientRequest;
sewardj2e93c502002-04-12 11:12:52 +0000176
muellerc9b36552003-12-31 14:32:23 +0000177#ifndef __GNUC__
178#define __extension__
179#endif
sewardj2e93c502002-04-12 11:12:52 +0000180
181/* Returns 1 if running on Valgrind, 0 if running on the real CPU.
182 Currently implemented but untested. */
muellerc9b36552003-12-31 14:32:23 +0000183#define RUNNING_ON_VALGRIND __extension__ \
sewardj2e93c502002-04-12 11:12:52 +0000184 ({unsigned int _qzz_res; \
185 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0 /* returned if not */, \
186 VG_USERREQ__RUNNING_ON_VALGRIND, \
187 0, 0, 0, 0); \
188 _qzz_res; \
sewardjde4a1d02002-03-22 01:27:54 +0000189 })
190
191
sewardj18d75132002-05-16 11:06:21 +0000192/* Discard translation of code in the range [_qzz_addr .. _qzz_addr +
193 _qzz_len - 1]. Useful if you are debugging a JITter or some such,
194 since it provides a way to make sure valgrind will retranslate the
195 invalidated area. Returns no value. */
196#define VALGRIND_DISCARD_TRANSLATIONS(_qzz_addr,_qzz_len) \
197 {unsigned int _qzz_res; \
198 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, \
199 VG_USERREQ__DISCARD_TRANSLATIONS, \
200 _qzz_addr, _qzz_len, 0, 0); \
201 }
202
fitzhardinge39de4b42003-10-31 07:12:21 +0000203#ifndef NVALGRIND
204
fitzhardingea09a1b52003-11-07 23:09:48 +0000205int VALGRIND_PRINTF(const char *format, ...)
206 __attribute__((format(__printf__, 1, 2)));
fitzhardinge39de4b42003-10-31 07:12:21 +0000207__attribute__((weak))
208int
fitzhardingea09a1b52003-11-07 23:09:48 +0000209VALGRIND_PRINTF(const char *format, ...)
fitzhardinge39de4b42003-10-31 07:12:21 +0000210{
211 unsigned int _qzz_res;
212 va_list vargs;
213 va_start(vargs, format);
214 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, VG_USERREQ__PRINTF,
215 (unsigned int)format, (unsigned int)vargs, 0, 0);
216 va_end(vargs);
217 return _qzz_res;
218}
219
fitzhardingea09a1b52003-11-07 23:09:48 +0000220int VALGRIND_PRINTF_BACKTRACE(const char *format, ...)
221 __attribute__((format(__printf__, 1, 2)));
fitzhardinge39de4b42003-10-31 07:12:21 +0000222__attribute__((weak))
223int
fitzhardingea09a1b52003-11-07 23:09:48 +0000224VALGRIND_PRINTF_BACKTRACE(const char *format, ...)
fitzhardinge39de4b42003-10-31 07:12:21 +0000225{
226 unsigned int _qzz_res;
227 va_list vargs;
228 va_start(vargs, format);
229 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, VG_USERREQ__PRINTF_BACKTRACE,
230 (unsigned int)format, (unsigned int)vargs, 0, 0);
231 va_end(vargs);
232 return _qzz_res;
233}
234
235#else /* NVALGRIND */
236
237#define VALGRIND_PRINTF(...)
238#define VALGRIND_PRINTF_BACKTRACE(...)
239
240#endif /* NVALGRIND */
sewardj18d75132002-05-16 11:06:21 +0000241
njn3e884182003-04-15 13:03:23 +0000242/* These requests allow control to move from the simulated CPU to the
243 real CPU, calling an arbitary function */
njn057c65f2003-04-21 13:30:55 +0000244#define VALGRIND_NON_SIMD_CALL0(_qyy_fn) \
njn3e884182003-04-15 13:03:23 +0000245 ({unsigned int _qyy_res; \
246 VALGRIND_MAGIC_SEQUENCE(_qyy_res, 0 /* default return */, \
247 VG_USERREQ__CLIENT_CALL0, \
248 _qyy_fn, \
249 0, 0, 0); \
250 _qyy_res; \
251 })
252
njn057c65f2003-04-21 13:30:55 +0000253#define VALGRIND_NON_SIMD_CALL1(_qyy_fn, _qyy_arg1) \
njn3e884182003-04-15 13:03:23 +0000254 ({unsigned int _qyy_res; \
255 VALGRIND_MAGIC_SEQUENCE(_qyy_res, 0 /* default return */, \
256 VG_USERREQ__CLIENT_CALL1, \
257 _qyy_fn, \
258 _qyy_arg1, 0, 0); \
259 _qyy_res; \
260 })
261
njn057c65f2003-04-21 13:30:55 +0000262#define VALGRIND_NON_SIMD_CALL2(_qyy_fn, _qyy_arg1, _qyy_arg2) \
njn3e884182003-04-15 13:03:23 +0000263 ({unsigned int _qyy_res; \
264 VALGRIND_MAGIC_SEQUENCE(_qyy_res, 0 /* default return */, \
265 VG_USERREQ__CLIENT_CALL2, \
266 _qyy_fn, \
267 _qyy_arg1, _qyy_arg2, 0); \
268 _qyy_res; \
269 })
270
njn057c65f2003-04-21 13:30:55 +0000271#define VALGRIND_NON_SIMD_CALL3(_qyy_fn, _qyy_arg1, _qyy_arg2, _qyy_arg3) \
njn3e884182003-04-15 13:03:23 +0000272 ({unsigned int _qyy_res; \
273 VALGRIND_MAGIC_SEQUENCE(_qyy_res, 0 /* default return */, \
274 VG_USERREQ__CLIENT_CALL3, \
275 _qyy_fn, \
276 _qyy_arg1, _qyy_arg2, _qyy_arg3); \
277 _qyy_res; \
278 })
279
280
nethercote7cc9c232004-01-21 15:08:04 +0000281/* Counts the number of errors that have been recorded by a tool. Nb:
282 the tool must record the errors with VG_(maybe_record_error)() or
njn47363ab2003-04-21 13:24:40 +0000283 VG_(unique_error)() for them to be counted. */
284#define VALGRIND_COUNT_ERRORS \
285 ({unsigned int _qyy_res; \
286 VALGRIND_MAGIC_SEQUENCE(_qyy_res, 0 /* default return */, \
287 VG_USERREQ__COUNT_ERRORS, \
288 0, 0, 0, 0); \
289 _qyy_res; \
290 })
291
njnd7994182003-10-02 13:44:04 +0000292/* Mark a block of memory as having been allocated by a malloc()-like
293 function. `addr' is the start of the usable block (ie. after any
294 redzone) `rzB' is redzone size if the allocator can apply redzones;
295 use '0' if not. Adding redzones makes it more likely Valgrind will spot
296 block overruns. `is_zeroed' indicates if the memory is zeroed, as it is
297 for calloc(). Put it immediately after the point where a block is
298 allocated.
299
300 If you're allocating memory via superblocks, and then handing out small
301 chunks of each superblock, if you don't have redzones on your small
302 blocks, it's worth marking the superblock with VALGRIND_MAKE_NOACCESS
303 when it's created, so that block overruns are detected. But if you can
304 put redzones on, it's probably better to not do this, so that messages
305 for small overruns are described in terms of the small block rather than
306 the superblock (but if you have a big overrun that skips over a redzone,
307 you could miss an error this way). See memcheck/tests/custom_alloc.c
308 for an example.
309
310 Nb: block must be freed via a free()-like function specified
311 with VALGRIND_FREELIKE_BLOCK or mismatch errors will occur. */
312#define VALGRIND_MALLOCLIKE_BLOCK(addr, sizeB, rzB, is_zeroed) \
313 {unsigned int _qzz_res; \
314 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, \
315 VG_USERREQ__MALLOCLIKE_BLOCK, \
316 addr, sizeB, rzB, is_zeroed); \
317 }
318
319/* Mark a block of memory as having been freed by a free()-like function.
320 `rzB' is redzone size; it must match that given to
321 VALGRIND_MALLOCLIKE_BLOCK. Memory not freed will be detected by the leak
322 checker. Put it immediately after the point where the block is freed. */
323#define VALGRIND_FREELIKE_BLOCK(addr, rzB) \
324 {unsigned int _qzz_res; \
325 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, \
326 VG_USERREQ__FREELIKE_BLOCK, \
327 addr, rzB, 0, 0); \
328 }
329
rjwalshbc0bb832004-06-19 18:12:36 +0000330/* Create a memory pool. */
331#define VALGRIND_CREATE_MEMPOOL(pool, rzB, is_zeroed) \
332 {unsigned int _qzz_res; \
333 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, \
334 VG_USERREQ__CREATE_MEMPOOL, \
335 pool, rzB, is_zeroed, 0); \
336 }
337
338/* Destroy a memory pool. */
339#define VALGRIND_DESTROY_MEMPOOL(pool) \
340 {unsigned int _qzz_res; \
341 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, \
342 VG_USERREQ__DESTROY_MEMPOOL, \
343 pool, 0, 0, 0); \
344 }
345
346/* Associate a piece of memory with a memory pool. */
347#define VALGRIND_MEMPOOL_ALLOC(pool, addr, size) \
348 {unsigned int _qzz_res; \
349 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, \
350 VG_USERREQ__MEMPOOL_ALLOC, \
351 pool, addr, size, 0); \
352 }
353
354/* Disassociate a piece of memory from a memory pool. */
355#define VALGRIND_MEMPOOL_FREE(pool, addr) \
356 {unsigned int _qzz_res; \
357 VALGRIND_MAGIC_SEQUENCE(_qzz_res, 0, \
358 VG_USERREQ__MEMPOOL_FREE, \
359 pool, addr, 0, 0); \
360 }
361
njn3e884182003-04-15 13:03:23 +0000362#endif /* __VALGRIND_H */