On Thu, 2012-11-08 at 00:18 +0100, David Faure wrote:
On Wednesday 07 November 2012 23:00:51 Philippe Waroquiers wrote:
discover the bug is related to the doubful construct, not
to a race condition
If there's no race condition and no deadlock, I'm not sure what bug you want
to detect :-)
On Tuesday 06 November 2012 22:56:32 Philippe Waroquiers wrote:
On Tue, 2012-11-06 at 13:43 +0100, David Faure wrote:
On Monday 05 November 2012 23:19:42 Philippe Waroquiers wrote:
On Mon, 2012-11-05 at 18:59 +0100, David Faure wrote:
The testcase
On Wed, 2012-11-07 at 10:51 +0100, David Faure wrote:
The idea of helgrind is that it detects lock order problems and/or
race condition problems *even* if no deadlock happens and/or if no
race condition really happened.
Maybe it is very unlikely that the trylock fails. Still would be nice
On Wednesday 07 November 2012 23:00:51 Philippe Waroquiers wrote:
On Wed, 2012-11-07 at 10:51 +0100, David Faure wrote:
The idea of helgrind is that it detects lock order problems and/or
race condition problems *even* if no deadlock happens and/or if no
race condition really happened.
On Monday 05 November 2012 23:19:42 Philippe Waroquiers wrote:
On Mon, 2012-11-05 at 18:59 +0100, David Faure wrote:
The testcase http://www.davidfaure.fr/2012/qmutex_trylock.cpp
(from https://bugs.kde.org/show_bug.cgi?id=243232)
shows that an optimization inside Qt leads to a helgrind
On Tue, 2012-11-06 at 13:43 +0100, David Faure wrote:
On Monday 05 November 2012 23:19:42 Philippe Waroquiers wrote:
On Mon, 2012-11-05 at 18:59 +0100, David Faure wrote:
The testcase http://www.davidfaure.fr/2012/qmutex_trylock.cpp
(from https://bugs.kde.org/show_bug.cgi?id=243232)
