|
From: Michael M. <mmc...@uc...> - 2011-03-03 18:03:18
|
Hello. This is Michael McThrow, a first year PhD student at the University of California, Santa Cruz. I am working on a project where I want to obtain information about the number and types of interference points in a running program. (Interference points are locations in a program where the execution of threads could be interleaved; e.g., portions of a multithreaded program that are not protected by locks). I am interested in using Helgrind for this analysis since it maintains information about the happens-before relationship of instructions in order to identify race conditions. I may need to make some small modifications to Helgrind in order for it to output information about the happens-before relationships it discovers (I then plan on using a simple script to then analyze the resulting table to output the results). However, I need some help figuring out what portions of the Helgrind source code actually discover and keep track of the happens-before relationships. Which areas of the Helgrind source code keep track of the happens-before relationships? Sincerely, Michael McThrow -------------------------------------------------------------- Michael McThrow 1st Year PhD Student, Computer Science University of California, Santa Cruz mmc...@uc... |
|
From: Philippe W. <phi...@sk...> - 2011-03-03 22:56:34
|
The complete helgrind code is not that big : you do not have to read the whole of valgrind to see what is happening before and after the helgrind code is called :). So, the best is to read the full set of helgrind sources which are in the helgrind directory, and (mostly) ignore what is in the other directories. Philippe |