File: hg_main.html

package info (click to toggle)
valgrind 1%3A2.4.0-2
  • links: PTS
  • area: main
  • in suites: sarge
  • size: 9,384 kB
  • ctags: 8,831
  • sloc: ansic: 67,990; sh: 4,364; perl: 1,833; makefile: 1,125; asm: 978; cpp: 101
file content (60 lines) | stat: -rw-r--r-- 2,124 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60

<html>
  <head>
    <title>Helgrind: a data-race detector</title>
  </head>

<a name="hg-top"></a>
<h2>6&nbsp; Helgrind: a data-race detector</h2>

To use this tool, you must specify <code>--tool=helgrind</code> on the
Valgrind command line.
<p>

Helgrind is a Valgrind tool for detecting data races in C and C++ programs
that use the Pthreads library.
<p>
It uses the Eraser algorithm described in 
<blockquote>
    Eraser: A Dynamic Data Race Detector for Multithreaded Programs<br>
    Stefan Savage, Michael Burrows, Greg Nelson, Patrick Sobalvarro and 
    Thomas Anderson<br>
    ACM Transactions on Computer Systems, 15(4):391-411<br>
    November 1997.
</blockquote>

We also incorporate significant improvements from this paper:

<blockquote>
    Runtime Checking of Multithreaded Applications with Visual Threads
    Jerry J. Harrow, Jr.<br>
    Proceedings of the 7th International SPIN Workshop on Model Checking of 
    Software<br>
    Stanford, California, USA<br>
    August 2000<br>
    LNCS 1885, pp331--342<br>
    K. Havelund, J. Penix, and W. Visser, editors.<br>
</blockquote>

<p>
Basically what Helgrind does is to look for memory locations which are
accessed by more than one thread.  For each such location, Helgrind
records which of the program's (pthread_mutex_)locks were held by the
accessing thread at the time of the access.  The hope is to discover
that there is indeed at least one lock which is used by all threads to
protect that location.  If no such lock can be found, then there is 
(apparently) no consistent locking strategy being applied for that
location, and so a possible data race might result.
<p>
Helgrind also allows for "thread segment lifetimes".  If the execution of two
threads cannot overlap -- for example, if your main thread waits on another
thread with a <code>pthread_join()</code> operation -- they can both access the
same variable without holding a lock.
<p>
There's a lot of other sophistication in Helgrind, aimed at
reducing the number of false reports, and at producing useful error
reports.  We hope to have more documentation one day...

</body>
</html>