Lines Matching full:accesses
316 usually able to show both accesses involved in a race. At least
349 constraints upon the order in which memory accesses can
422 accesses to memory locations. If a location -- in this example,
425 two accesses are ordered by the happens-before relation. If so,
443 <p>What does it mean to say that two accesses from different
446 cause those accesses to happen in a particular order, irrespective of
454 immediately) locked by thread T2, then the memory accesses in T1
462 on the same CV, then the memory accesses in T1 prior to the
482 That is, all memory accesses performed by the parent prior to
483 creating the child are regarded as happening-before all the accesses
488 accesses made by the exiting thread.</p></li>
492 dependencies. It also monitors all memory accesses.</p>
499 both accesses are reads. That would be silly, since concurrent
501 <li class="listitem"><p>Two accesses are considered to be ordered by the
503 synchronisation events. For example, if T1 accesses some location
505 <code class="function">pthread_cond_signals</code> T3, which then accesses L, then
507 accesses, even though it involves two different inter-thread
580 access points, even if one of the accesses is reported to be a read.
582 accesses?</p></li>
595 any happens-before relation between the two accesses. If
852 Helgrind collects enough information about "old" accesses that
866 about previous accesses. This can be dramatically faster
889 <p>Information about "old" conflicting accesses is stored in
