Lines Matching refs:this

6 versions of this material appeared in a number of LWN articles, including:
66 suffices to avoid this bad outcome:
89 Line 1 starts with "C", which identifies this file as being in the
93 suffix stripped.  In this case, the actual test may be found in
100 tests, but this is a bit involved due to the use of multiple parsers.
106 to zero suffices for this test, the "{}" syntax is used, which mean the
109 example that will be presented later in this document.
146 pointer in P0()'s parameter list, this does an unordered store to global
148 is also in P0()'s parameter list, this does a release store to global
181 this directory only:
207 "exists" clause indicates a bad result.  To see this, invert the "exists"
209 of this line indicate the number of end states satisfying the "exists"
212 Another important part of this output is shown in lines 2-5, repeated here:
240 as this one complete in a few milliseconds, so "0.00" is quite common.
304 why this approach to initialization can be useful.
381 aided by the values of other variables.  Consider this litmus test
434 "exists" clause.  Someone modifying this test might wish to know the
509 techniques illustrated in this section can be used for other purposes,
570 The result of running this test is as follows:
583 The "Never" on line 9 indicates that this use of xchg_acquire() and
588 insight behind this litmus test is that spin loops have no effect on the
608 free to skip the remainder of this section.
656 execution, running this litmus test would display no executions because
673 the variables that it checks.  In this case, the "filter" clause is a
723 value stored by line 11, which is in fact what is required in this case.
730 for show in this example.  Note that the address used for line 21's load
731 depends on (in this case, "is exactly the same as") the value loaded by
736 Running this test results in the following:
859 will replace "x" with "z" in this list.
875 The "filter" clause on line 35 handles this possibility, rejecting
901 clause can be satisfied.  With this option, herd7 evaluates the above
906 of time complete in about 40 seconds with this option.  To be fair,
943 	Note that this limitation in turn limits LKMM's ability to
953 	this limitation can be overcome by modeling the interrupt or
971 		kernel provides no ordering, but LKMM models this
979 		One exception of this limitation is atomic_add_unless(),
1011 		In contrast, LKMM will interpret this as a nested pair of
1065 9.	Dynamic memory allocation is not supported, although this can