|
From: Julian S. <js...@ac...> - 2008-03-29 18:58:32
|
> Yes, it's worth trying.
> [...]
> This will hardly be a complete solution though.
> Just an example from my last week's runs: I've run some test under
> Helgrind ~20 times.
> There were two reports that made me curious: one appeared in every run
> and another only appeared 2-3 times.
Yes. I agree it is not the ideal solution. But (obviously) the problem
is that to collect all this information for all memory locations is
impossibly expensive, so restricting it to cases where we have seen a
race is a good filtering heuristic. (maybe not good enough)
Even if it can be only a 90% solution, it is much better than what we
have right now. FWIW, on Friday I spent some time with HGDEV chasing
a race in the new OpenOffice 2.4, and .. it is very difficult to make
sense of the results. Basically I gave up. ("yes, ok, I agree, there
is a race here. but where did the access(es) from other threads happen?")
Although it is true, OOo is not exactly a simple or small program :-)
J
|