Lines Matching full:accesses
346 usually able to show both accesses involved in a race. At least
382 constraints upon the order in which memory accesses can
455 accesses to memory locations. If a location -- in this example,
458 two accesses are ordered by the happens-before relation. If so,
476 <p>What does it mean to say that two accesses from different
479 cause those accesses to happen in a particular order, irrespective of
487 immediately) locked by thread T2, then the memory accesses in T1
495 on the same CV, then the memory accesses in T1 prior to the
515 That is, all memory accesses performed by the parent prior to
516 creating the child are regarded as happening-before all the accesses
521 accesses made by the exiting thread.</p></li>
525 dependencies. It also monitors all memory accesses.</p>
532 both accesses are reads. That would be silly, since concurrent
534 <li class="listitem"><p>Two accesses are considered to be ordered by the
536 synchronisation events. For example, if T1 accesses some location
538 <code class="function">pthread_cond_signals</code> T3, which then accesses L, then
540 accesses, even though it involves two different inter-thread
619 access points, even if one of the accesses is reported to be a read.
620 Did you perhaps forget the locking at one or other of the accesses?
635 any happens-before relation between the two accesses. If
980 Helgrind collects enough information about "old" accesses that
983 older, conflicting access. To limit memory usage, "old" accesses
996 about previous accesses. This can be dramatically faster
1019 <p>Information about "old" conflicting accesses is stored in
1043 By default Helgrind checks all data memory accesses made by your
1044 program. This flag enables you to skip checking for accesses
