blob: 25f44b0755c3fa113bbca5a6b53dd9f345cb43e5 [file] [log] [blame]
njn3e986b22004-11-30 10:43:45 +00001<?xml version="1.0"?> <!-- -*- sgml -*- -->
2<!DOCTYPE book PUBLIC "-//OASIS//DTD DocBook XML V4.2//EN"
3 "http://www.oasis-open.org/docbook/xml/4.2/docbookx.dtd"
4[ <!ENTITY % vg-entities SYSTEM "vg-entities.xml"> %vg-entities; ]>
5
6<book id="FAQ" xreflabel="Valgrind FAQ">
dee9b715c2005-08-03 20:28:33 +00007<title>Valgrind FAQ</title>
8<bookinfo>
9 <subtitle>Valgrind Frequently Asked Questions</subtitle>
10 <releaseinfo>August 2005</releaseinfo>
11 <author>
12 <surname>
njn49818412005-09-26 01:11:40 +000013 <ulink url="http://www.valgrind.org/info/developers.html">Valgrind Developers</ulink>
dee9b715c2005-08-03 20:28:33 +000014 </surname>
15 <affiliation><orgname>
16 <ulink url="mailto:&vg-vemail;">&vg-vemail;</ulink>
17 </orgname></affiliation>
18 </author>
19</bookinfo>
njn3e986b22004-11-30 10:43:45 +000020
dee9b715c2005-08-03 20:28:33 +000021<sect1 id="faq.background" xreflabel="Background">
njn3e986b22004-11-30 10:43:45 +000022<title>Background</title>
23
24<qandaset id="qset.background">
25
26<qandaentry id="faq.pronounce">
27 <question>
28 <para>How do you pronounce "Valgrind"?</para>
29 </question>
30 <answer>
31 <para>The "Val" as in the world "value". The "grind" is
32 pronounced with a short 'i' -- ie. "grinned" (rhymes with
33 "tinned") rather than "grined" (rhymes with "find").</para>
34 <para>Don't feel bad: almost everyone gets it wrong at
35 first.</para>
36 </answer>
37</qandaentry>
38
39<qandaentry id="faq.whence">
40 <question>
41 <para>Where does the name "Valgrind" come from?</para>
42 </question>
43 <answer>
44 <para>From Nordic mythology. Originally (before release) the
45 project was named Heimdall, after the watchman of the Nordic
46 gods. He could "see a hundred miles by day or night, hear the
47 grass growing, see the wool growing on a sheep's back" (etc).
48 This would have been a great name, but it was already taken by
49 a security package "Heimdal".</para> <para>Keeping with the
50 Nordic theme, Valgrind was chosen. Valgrind is the name of the
51 main entrance to Valhalla (the Hall of the Chosen Slain in
52 Asgard). Over this entrance there resides a wolf and over it
53 there is the head of a boar and on it perches a huge eagle,
54 whose eyes can see to the far regions of the nine worlds. Only
55 those judged worthy by the guardians are allowed to pass
56 through Valgrind. All others are refused entrance.</para>
57 <para>It's not short for "value grinder", although that's not a
58 bad guess.</para>
59 </answer>
60 </qandaentry>
61
62</qandaset>
63
dee9b715c2005-08-03 20:28:33 +000064</sect1>
njn3e986b22004-11-30 10:43:45 +000065
66
dee9b715c2005-08-03 20:28:33 +000067<sect1 id="faq.installing"
njn3e986b22004-11-30 10:43:45 +000068 xreflabel="Compiling, installing and configuring">
69<title>Compiling, installing and configuring</title>
70<qandaset id="qset.installing">
71
72<qandaentry id="faq.make_dies">
73 <question>
74 <para>When I trying building Valgrind, 'make' dies partway with
75 an assertion failure, something like this:
76<screen>
77% make: expand.c:489: allocated_variable_append:
78 Assertion 'current_variable_set_list->next != 0' failed.
79</screen>
80 </para>
81 </question>
82 <answer>
83 <para>It's probably a bug in 'make'. Some, but not all,
84 instances of version 3.79.1 have this bug, see
85 www.mail-archive.com/bug-make@gnu.org/msg01658.html. Try
86 upgrading to a more recent version of 'make'. Alternatively,
87 we have heard that unsetting the CFLAGS environment variable
88 avoids the problem.</para>
89 </answer>
90</qandaentry>
91
92</qandaset>
dee9b715c2005-08-03 20:28:33 +000093</sect1>
njn3e986b22004-11-30 10:43:45 +000094
95
96
dee9b715c2005-08-03 20:28:33 +000097<sect1 id="faq.abort"
njn3e986b22004-11-30 10:43:45 +000098 xreflabel="Valgrind aborts unexpectedly">
99<title>Valgrind aborts unexpectedly</title>
100<qandaset id="qset.abort">
101
102<qandaentry id="faq.exit_errors">
103 <question>
104 <para>Programs run OK on Valgrind, but at exit produce a bunch
njn04be8752005-08-26 21:01:32 +0000105 of errors a bit like this:
njn3e986b22004-11-30 10:43:45 +0000106<programlisting>
107==20755== Invalid read of size 4
108==20755== at 0x40281C8A: _nl_unload_locale (loadlocale.c:238)
109==20755== by 0x4028179D: free_mem (findlocale.c:257)
110==20755== by 0x402E0962: __libc_freeres (set-freeres.c:34)
111==20755== by 0x40048DCC: vgPlain___libc_freeres_wrapper (vg_clientfuncs.c:585)
112==20755== Address 0x40CC304C is 8 bytes inside a block of size 380 free'd
113==20755== at 0x400484C9: free (vg_clientfuncs.c:180)
114==20755== by 0x40281CBA: _nl_unload_locale (loadlocale.c:246)
115==20755== by 0x40281218: free_mem (setlocale.c:461)
116==20755== by 0x402E0962: __libc_freeres (set-freeres.c:34)
117</programlisting>
118
119 and then die with a segmentation fault.</para>
njn04be8752005-08-26 21:01:32 +0000120 </question>
121 <answer>
njn3e986b22004-11-30 10:43:45 +0000122 <para>When the program exits, Valgrind runs the procedure
123 <literal>__libc_freeres()</literal> in glibc. This is a hook
124 for memory debuggers, so they can ask glibc to free up any
125 memory it has used. Doing that is needed to ensure that
126 Valgrind doesn't incorrectly report space leaks in glibc.</para>
127 <para>Problem is that running
128 <literal>__libc_freeres()</literal> in older glibc versions
129 causes this crash.</para> <para>WORKAROUND FOR 1.1.X and later
130 versions of Valgrind: use the
131 <literal>--run-libc-freeres=no</literal> flag. You may then get
132 space leak reports for glibc-allocations (please _don't_ report
133 these to the glibc people, since they are not real leaks), but
134 at least the program runs.</para>
135 </answer>
136</qandaentry>
137
138<qandaentry id="faq.bugdeath">
139 <question>
140 <para>My (buggy) program dies like this:</para>
njn3e986b22004-11-30 10:43:45 +0000141 <screen>
142% valgrind: vg_malloc2.c:442 (bszW_to_pszW): Assertion 'pszW >= 0' failed.
143</screen>
144
njn04be8752005-08-26 21:01:32 +0000145 </question>
146 <answer>
njn3e986b22004-11-30 10:43:45 +0000147 <para>If Memcheck (the memory checker) shows any invalid reads,
148 invalid writes and invalid frees in your program, the above may
149 happen. Reason is that your program may trash Valgrind's
150 low-level memory manager, which then dies with the above
151 assertion, or something like this. The cure is to fix your
152 program so that it doesn't do any illegal memory accesses. The
153 above failure will hopefully go away after that.</para>
154 </answer>
155</qandaentry>
156
157<qandaentry id="faq.msgdeath">
158 <question>
159 <para>My program dies, printing a message like this along the
160 way:</para>
njn3e986b22004-11-30 10:43:45 +0000161<screen>
162% disInstr: unhandled instruction bytes: 0x66 0xF 0x2E 0x5
163</screen>
164
njn04be8752005-08-26 21:01:32 +0000165 </question>
166 <answer>
njn3e986b22004-11-30 10:43:45 +0000167 <para>Older versions did not support some x86 instructions,
168 particularly SSE/SSE2 instructions. Try a newer Valgrind; we
169 now support almost all instructions. If it still happens with
170 newer versions, if the failing instruction is an SSE/SSE2
njnd0d64732005-04-16 14:58:34 +0000171 instruction, you might be able to recompile your program
njn3e986b22004-11-30 10:43:45 +0000172 without it by using the flag
173 <computeroutput>-march</computeroutput> to gcc. Either way,
174 let us know and we'll try to fix it.</para>
175
176 <para>Another possibility is that your program has a bug and
177 erroneously jumps to a non-code address, in which case you'll
178 get a SIGILL signal. Memcheck/Addrcheck may issue a warning
179 just before this happens, but they might not if the jump
180 happens to land in addressable memory.</para>
181 </answer>
182</qandaentry>
183
njn3e986b22004-11-30 10:43:45 +0000184</qandaset>
dee9b715c2005-08-03 20:28:33 +0000185</sect1>
njn3e986b22004-11-30 10:43:45 +0000186
187
dee9b715c2005-08-03 20:28:33 +0000188<sect1 id="faq.unexpected"
njn3e986b22004-11-30 10:43:45 +0000189 xreflabel="Valgrind behaves unexpectedly">
190<title>Valgrind behaves unexpectedly</title>
191<qandaset id="qset.unexpected">
192
njn3e986b22004-11-30 10:43:45 +0000193<qandaentry id="faq.slowthread">
194 <question>
195 <para>My threaded server process runs unbelievably slowly on
196 Valgrind. So slowly, in fact, that at first I thought it had
197 completely locked up.</para>
198 </question>
199 <answer>
200 <para>We are not completely sure about this, but one
201 possibility is that laptops with power management fool
202 Valgrind's timekeeping mechanism, which is (somewhat in error)
203 based on the x86 RDTSC instruction. A "fix" which is claimed
204 to work is to run some other cpu-intensive process at the same
205 time, so that the laptop's power-management clock-slowing does
206 not kick in. We would be interested in hearing more feedback
207 on this.</para>
208
209 <para>Another possible cause is that versions prior to 1.9.6
210 did not support threading on glibc 2.3.X systems well.
211 Hopefully the situation is much improved with 1.9.6 and later
212 versions.</para>
213 </answer>
214</qandaentry>
215
216
217<qandaentry id="faq.reports">
218 <question>
219 <para>My program uses the C++ STL and string classes. Valgrind
220 reports 'still reachable' memory leaks involving these classes
221 at the exit of the program, but there should be none.</para>
222 </question>
223 <answer>
224 <para>First of all: relax, it's probably not a bug, but a
225 feature. Many implementations of the C++ standard libraries
226 use their own memory pool allocators. Memory for quite a
227 number of destructed objects is not immediately freed and given
228 back to the OS, but kept in the pool(s) for later re-use. The
229 fact that the pools are not freed at the exit() of the program
230 cause Valgrind to report this memory as still reachable. The
231 behaviour not to free pools at the exit() could be called a bug
232 of the library though.</para>
233
234 <para>Using gcc, you can force the STL to use malloc and to
235 free memory as soon as possible by globally disabling memory
236 caching. Beware! Doing so will probably slow down your
237 program, sometimes drastically.</para>
238 <itemizedlist>
239 <listitem>
240 <para>With gcc 2.91, 2.95, 3.0 and 3.1, compile all source
241 using the STL with <literal>-D__USE_MALLOC</literal>. Beware!
242 This is removed from gcc starting with version 3.3.</para>
243 </listitem>
244 <listitem>
njn8a5ad762005-05-12 13:45:56 +0000245 <para>With gcc 3.2.2 and later, you should export the environment
njn3e986b22004-11-30 10:43:45 +0000246 variable <literal>GLIBCPP_FORCE_NEW</literal> before running
247 your program.</para>
248 </listitem>
njn8a5ad762005-05-12 13:45:56 +0000249 <listitem>
250 <para>With gcc 3.4 and later, that variable has changed name to
251 <literal>GLIBCXX_FORCE_NEW</literal>.</para>
252 </listitem>
njn3e986b22004-11-30 10:43:45 +0000253 </itemizedlist>
254
255 <para>There are other ways to disable memory pooling: using the
256 <literal>malloc_alloc</literal> template with your objects (not
257 portable, but should work for gcc) or even writing your own
258 memory allocators. But all this goes beyond the scope of this
259 FAQ. Start by reading <ulink
260 url="http://gcc.gnu.org/onlinedocs/libstdc++/ext/howto.html#3">
261 http://gcc.gnu.org/onlinedocs/libstdc++/ext/howto.html#3</ulink>
262 if you absolutely want to do that. But beware:</para>
263
264 <orderedlist>
265 <listitem>
266 <para>there are currently changes underway for gcc which are
267 not totally reflected in the docs right now ("now" == 26 Apr
268 03)</para>
269 </listitem>
270 <listitem>
271 <para>allocators belong to the more messy parts of the STL
njnd0d64732005-04-16 14:58:34 +0000272 and people went to great lengths to make it portable across
njn3e986b22004-11-30 10:43:45 +0000273 platforms. Chances are good that your solution will work on
274 your platform, but not on others.</para>
275 </listitem>
276 </orderedlist>
277 </answer>
278</qandaentry>
279
280
281<qandaentry id="faq.unhelpful">
282 <question>
283 <para>The stack traces given by Memcheck (or another tool)
284 aren't helpful. How can I improve them?</para>
285 </question>
286 <answer>
287 <para>If they're not long enough, use
288 <literal>--num-callers</literal> to make them longer.</para>
289 <para>If they're not detailed enough, make sure you are
290 compiling with <literal>-g</literal> to add debug information.
291 And don't strip symbol tables (programs should be unstripped
292 unless you run 'strip' on them; some libraries ship
293 stripped).</para>
294
njn0211ff32005-05-15 14:49:24 +0000295 <para>Also, for leak reports involving shared objects, if the shared
296 object is unloaded before the program terminates, Valgrind will discard
297 the debug information and the error message will be full of
298 <literal>???</literal> entries. The workaround here is to avoid calling
299 dlclose() on these shared objects.
300 </para>
301
njn3e986b22004-11-30 10:43:45 +0000302 <para>Also, <literal>-fomit-frame-pointer</literal> and
303 <literal>-fstack-check</literal> can make stack traces
304 worse.</para>
305
306 <para>Some example sub-traces:</para>
307
njn15d7c342005-09-30 01:43:32 +0000308 <itemizedlist>
309 <listitem>
310 <para>With debug information and unstripped (best):</para>
njn3e986b22004-11-30 10:43:45 +0000311<programlisting>
312Invalid write of size 1
313 at 0x80483BF: really (malloc1.c:20)
314 by 0x8048370: main (malloc1.c:9)
315</programlisting>
njn15d7c342005-09-30 01:43:32 +0000316 </listitem>
njn3e986b22004-11-30 10:43:45 +0000317
njn15d7c342005-09-30 01:43:32 +0000318 <listitem>
319 <para>With no debug information, unstripped:</para>
njn3e986b22004-11-30 10:43:45 +0000320<programlisting>
321Invalid write of size 1
322 at 0x80483BF: really (in /auto/homes/njn25/grind/head5/a.out)
323 by 0x8048370: main (in /auto/homes/njn25/grind/head5/a.out)
324</programlisting>
njn15d7c342005-09-30 01:43:32 +0000325 </listitem>
njn3e986b22004-11-30 10:43:45 +0000326
njn15d7c342005-09-30 01:43:32 +0000327 <listitem>
328 <para>With no debug information, stripped:</para>
njn3e986b22004-11-30 10:43:45 +0000329<programlisting>
330Invalid write of size 1
331 at 0x80483BF: (within /auto/homes/njn25/grind/head5/a.out)
332 by 0x8048370: (within /auto/homes/njn25/grind/head5/a.out)
333 by 0x42015703: __libc_start_main (in /lib/tls/libc-2.3.2.so)
334 by 0x80482CC: (within /auto/homes/njn25/grind/head5/a.out)
335</programlisting>
njn15d7c342005-09-30 01:43:32 +0000336 </listitem>
njn3e986b22004-11-30 10:43:45 +0000337
njn15d7c342005-09-30 01:43:32 +0000338 <listitem>
339 <para>With debug information and -fomit-frame-pointer:</para>
njn3e986b22004-11-30 10:43:45 +0000340<programlisting>
341Invalid write of size 1
342 at 0x80483C4: really (malloc1.c:20)
343 by 0x42015703: __libc_start_main (in /lib/tls/libc-2.3.2.so)
344 by 0x80482CC: ??? (start.S:81)
345</programlisting>
njn15d7c342005-09-30 01:43:32 +0000346 </listitem>
njn3e986b22004-11-30 10:43:45 +0000347
njn15d7c342005-09-30 01:43:32 +0000348 <listitem>
349 <para>A leak error message involving an unloaded shared object:</para>
njn0211ff32005-05-15 14:49:24 +0000350<programlisting>
35184 bytes in 1 blocks are possibly lost in loss record 488 of 713
352 at 0x1B9036DA: operator new(unsigned) (vg_replace_malloc.c:132)
353 by 0x1DB63EEB: ???
354 by 0x1DB4B800: ???
355 by 0x1D65E007: ???
356 by 0x8049EE6: main (main.cpp:24)
357</programlisting>
njn15d7c342005-09-30 01:43:32 +0000358 </listitem>
359 </itemizedlist>
njn0211ff32005-05-15 14:49:24 +0000360
njn3e986b22004-11-30 10:43:45 +0000361 </answer>
362</qandaentry>
363
njn16eeb4e2005-06-16 03:56:58 +0000364<qandaentry id="faq.aliases">
365 <question>
366 <para>The stack traces given by Memcheck (or another tool) seem to
367 have the wrong function name in them. What's happening?</para>
368 </question>
369 <answer>
370 <para>Occasionally Valgrind stack traces get the wrong function names.
371 This is caused by glibc using aliases to effectively give one function two
372 names. Most of the time Valgrind chooses a suitable name, but very
373 occasionally it gets it wrong.
374
375 Examples we know of are printing 'bcmp' instead of 'memcmp', 'index'
376 instead of 'strchr', and 'rindex' instead of 'strrchr'.</para>
377 </answer>
378</qandaentry>
379
njn3e986b22004-11-30 10:43:45 +0000380</qandaset>
dee9b715c2005-08-03 20:28:33 +0000381</sect1>
njn3e986b22004-11-30 10:43:45 +0000382
383
dee9b715c2005-08-03 20:28:33 +0000384<sect1 id="faq.notfound" xreflabel="Memcheck doesn't find my bug">
njn3e986b22004-11-30 10:43:45 +0000385<title>Memcheck doesn't find my bug</title>
386<qandaset id="qset.notfound">
387
388<qandaentry id="faq.hiddenbug">
389 <question>
390 <para>I try running "valgrind --tool=memcheck my_program" and
391 get Valgrind's startup message, but I don't get any errors and
392 I know my program has errors.</para>
393 </question>
394 <answer>
njna11b9b02005-03-27 17:05:08 +0000395 <para>There are two possible causes of this.</para>
396
397 <para>First, by default, Valgrind only traces the top-level process.
njn3e986b22004-11-30 10:43:45 +0000398 So if your program spawns children, they won't be traced by
399 Valgrind by default. Also, if your program is started by a
400 shell script, Perl script, or something similar, Valgrind will
401 trace the shell, or the Perl interpreter, or equivalent.</para>
402
403 <para>To trace child processes, use the
404 <literal>--trace-children=yes</literal> option.</para>
405
406 <para>If you are tracing large trees of processes, it can be
407 less disruptive to have the output sent over the network. Give
408 Valgrind the flag
409 <literal>--log-socket=127.0.0.1:12345</literal> (if you want
410 logging output sent to <literal>port 12345</literal> on
411 <literal>localhost</literal>). You can use the
412 valgrind-listener program to listen on that port:</para>
413<programlisting>
414valgrind-listener 12345
415</programlisting>
416
417 <para>Obviously you have to start the listener process first.
njn49818412005-09-26 01:11:40 +0000418 See the manual for more details.</para>
njna11b9b02005-03-27 17:05:08 +0000419
420 <para>Second, if your program is statically linked, most Valgrind tools
421 won't work as well, because they won't be able to replace certain
422 functions, such as malloc(), with their own versions. A key indicator of
423 this is if Memcheck says:
424<programlisting>
425No malloc'd blocks -- no leaks are possible
426</programlisting>
427when you know your program calls malloc(). The workaround is to avoid
428statically linking your program.</para>
njn3e986b22004-11-30 10:43:45 +0000429 </answer>
430</qandaentry>
431
432
433<qandaentry id="faq.overruns">
434 <question>
435 <para>Why doesn't Memcheck find the array overruns in this program?</para>
njn3e986b22004-11-30 10:43:45 +0000436<programlisting>
437int static[5];
438
439int main(void)
440{
441 int stack[5];
442
443 static[5] = 0;
444 stack [5] = 0;
445
446 return 0;
447}
448</programlisting>
njn04be8752005-08-26 21:01:32 +0000449 </question>
450 <answer>
njn3e986b22004-11-30 10:43:45 +0000451 <para>Unfortunately, Memcheck doesn't do bounds checking on
452 static or stack arrays. We'd like to, but it's just not
453 possible to do in a reasonable way that fits with how Memcheck
454 works. Sorry.</para>
455 </answer>
456</qandaentry>
457
458
njn3e986b22004-11-30 10:43:45 +0000459</qandaset>
dee9b715c2005-08-03 20:28:33 +0000460</sect1>
njn3e986b22004-11-30 10:43:45 +0000461
462
dee9b715c2005-08-03 20:28:33 +0000463<sect1 id="faq.misc"
njn3e986b22004-11-30 10:43:45 +0000464 xreflabel="Miscellaneous">
465<title>Miscellaneous</title>
466<qandaset id="qset.misc">
467
468<qandaentry id="faq.writesupp">
469 <question>
470 <para>I tried writing a suppression but it didn't work. Can
471 you write my suppression for me?</para>
472 </question>
473 <answer>
474 <para>Yes! Use the
475 <computeroutput>--gen-suppressions=yes</computeroutput> feature
476 to spit out suppressions automatically for you. You can then
477 edit them if you like, eg. combining similar automatically
478 generated suppressions using wildcards like
479 <literal>'*'</literal>.</para>
480
481 <para>If you really want to write suppressions by hand, read
482 the manual carefully. Note particularly that C++ function
483 names must be <literal>_mangled_</literal>.</para>
484 </answer>
485</qandaentry>
486
487
488<qandaentry id="faq.deflost">
489 <question>
490 <para>With Memcheck/Addrcheck's memory leak detector, what's
491 the difference between "definitely lost", "possibly lost",
492 "still reachable", and "suppressed"?</para>
493 </question>
494 <answer>
njn49818412005-09-26 01:11:40 +0000495 <para>The details are in the Memcheck section of the user manual.</para>
njn3e986b22004-11-30 10:43:45 +0000496
497 <para>In short:</para>
498 <itemizedlist>
499 <listitem>
500 <para>"definitely lost" means your program is leaking memory
501 -- fix it!</para>
502 </listitem>
503 <listitem>
504 <para>"possibly lost" means your program is probably leaking
505 memory, unless you're doing funny things with
506 pointers.</para>
507 </listitem>
508 <listitem>
509 <para>"still reachable" means your program is probably ok --
510 it didn't free some memory it could have. This is quite
511 common and often reasonable. Don't use
512 <computeroutput>--show-reachable=yes</computeroutput> if you
513 don't want to see these reports.</para>
514 </listitem>
515 <listitem>
516 <para>"suppressed" means that a leak error has been
517 suppressed. There are some suppressions in the default
518 suppression files. You can ignore suppressed errors.</para>
519 </listitem>
520 </itemizedlist>
521 </answer>
522</qandaentry>
523
524
525</qandaset>
dee9b715c2005-08-03 20:28:33 +0000526</sect1>
njn3e986b22004-11-30 10:43:45 +0000527
528
529<!-- template
dee9b715c2005-08-03 20:28:33 +0000530<sect1 id="faq."
njn3e986b22004-11-30 10:43:45 +0000531 xreflabel="xx">
532<title>xx</title>
533<qandaset id="qset.">
534
535<qandaentry id="faq.deflost">
536 <question>
537 <para></para>
538 </question>
539 <answer>
540 <para></para>
541 </answer>
542</qandaentry>
543
544</qandaset>
dee9b715c2005-08-03 20:28:33 +0000545</sect1>
njn3e986b22004-11-30 10:43:45 +0000546-->
547
548
549
dee9b715c2005-08-03 20:28:33 +0000550<sect1 id="faq.help" xreflabel="How To Get Further Assistance">
njn3e986b22004-11-30 10:43:45 +0000551<title>How To Get Further Assistance</title>
552
553
554<para>Please read all of this section before posting.</para>
555
556<para>If you think an answer is incomplete or inaccurate, please
557e-mail <ulink url="mailto:&vg-vemail;">&vg-vemail;</ulink>.</para>
558
559<para>Read the appropriate section(s) of the Manual(s):
560<ulink url="http://www.valgrind.org/docs/">Valgrind
561Documentation</ulink>.</para>
562
563<para>Read the <ulink url="http://www.valgrind.org/docs/">Distribution Documents</ulink>.</para>
564
565<para><ulink url="http://search.gmane.org">Search</ulink> the
566<ulink url="http://news.gmane.org/gmane.comp.debugging.valgrind">valgrind-users</ulink> mailing list archives, using the group name
567<computeroutput>gmane.comp.debugging.valgrind</computeroutput>.</para>
568
569<para>Only when you have tried all of these things and are still stuck,
570should you post to the <ulink url="&vg-users-list;">valgrind-users
571mailing list</ulink>. In which case, please read the following
572carefully. Making a complete posting will greatly increase the chances
573that an expert or fellow user reading it will have enough information
574and motivation to reply.</para>
575
576<para>Make sure you give full details of the problem,
577including the full output of <computeroutput>valgrind
578-v</computeroutput>, if applicable. Also which Linux distribution
579you're using (Red Hat, Debian, etc) and its version number.</para>
580
581<para>You are in little danger of making your posting too long
582unless you include large chunks of valgrind's (unsuppressed)
583output, so err on the side of giving too much information.</para>
584
585<para>Clearly written subject lines and message bodies are appreciated,
586too.</para>
587
588<para>Finally, remember that, despite the fact that most of the
589community are very helpful and responsive to emailed questions,
590you are probably requesting help from unpaid volunteers, so you
591have no guarantee of receiving an answer.</para>
592
dee9b715c2005-08-03 20:28:33 +0000593</sect1>
594
njn3e986b22004-11-30 10:43:45 +0000595
596</book>