Lines Matching refs:this

35 	To see this, compile with a high level of optimization and run
47 	There are exceptions to this rule, including:
67 CPU before it released that same lock.  Note that this statement is a bit
69 CPU during the time that CPU was holding this same lock".  For example,
127 Consider this example:
155 value of r1 be 0.  The reason for this surprising outcome is that
204 and another CPU execute a pair of loads from this same pair of variables,
208 In the absence of any ordering, this goal may not be met, as can be seen
210 a number of ways of meeting this goal.
238 in this way to safely initialize of a slab of the stack.  Working out
269 In this example, if the final value of r0 is &x then the final value of
357 absence of any ordering it is quite possible that this may happen, as
431 In this case, if r0 and r1 both have final values of 1, then r2 must
434 The ordering in this example is stronger than it needs to be.  For
439 before CPU1()'s store to z, but this is not the case:
464 is that in this version, CPU2() is not part of the release-acquire chain.
467 Despite this limitation, release-acquire chains are low-overhead as
496 this counter-intuitive outcome.
520 Note that use of locking can greatly simplify this pattern.
527 needed in which situations, but this is not the case.  There is a pattern
533 	this type of relation.	In formal memory-modeling texts, this
537 	previous CPU read.  The SB litmus test contains only this type
538 	of relation.  In formal memory-modeling texts, this relation is
545 	this relation is often called "coherence order" and is sometimes
560 	litmus tests illustrate this case.