> I can be wrong, but my understanding is that the Eraser algorithm > (helgrind) reports any conflicting accesses to shared variables that are > not protected by proper locking, so I expect helgrind to complain on the > last COND access.
Yes. > DRD on the other hand looks for possible causes of > nondeterminism. There are no such issues in the program cv.cc, hence DRD > does not complain on any of the COND accesses in cv.cc. Yes. So I have a question: can you clarify what you mean by "possible causes of nondeterminism"? I have the impression that DRD-style algorithms are scheduling-sensitive, whereas Helgrind is not (or at least, less so). J ------------------------------------------------------------------------- SF.Net email is sponsored by: The Future of Linux Business White Paper from Novell. From the desktop to the data center, Linux is going mainstream. Let it simplify your IT future. http://altfarm.mediaplex.com/ad/ck/8857-50307-18918-4 _______________________________________________ Valgrind-developers mailing list Valgrind-developers@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/valgrind-developers
