Lines Matching refs:br
158 <td><code>A = 3<br />
160 <td><code>reg0 = B<br />
228 <td><code>A = true<br />
229 reg1 = B<br />
230 if (reg1 == false)<br />
232 <td><code>B = true<br />
233 reg2 = A<br />
234 if (reg2 == false)<br />
257 <td><code>reg1 = B<br />
258 <br />
259 <br />
260 A = true<br />
261 if (reg1 == false)<br />
264 <td><code><br />
265 B = true<br />
266 reg2 = A<br />
267 <br />
268 if (reg2 == false)<br />
397 <td><code>A = 41<br />
399 <td><code>loop_until (B == 1)<br />
449 <td><code>A = 41<br />
451 <td><code>loop_until (B == 1)<br />
481 <td><code>A = 41<br />
482 <em>store/store barrier</em><br />
484 <td><code>loop_until (B == 1)<br />
485 <em>load/load barrier</em><br />
528 <td><code>reg = A<br />
530 <td><code>loop_until (B == 1)<br />
545 <td><code>reg = A<br />
546 <em>load/store barrier</em><br />
548 <td><code>loop_until (B == 1)<br />
549 <em>load/store barrier</em><br />
615 <td><code>[A+8] = 41<br />
616 <em>store/store barrier</em><br />
618 <td><code>loop:<br />
619 reg0 = B<br />
620 if (reg0 == 0) goto loop<br />
621 reg1 = 8<br />
645 <td><code>[A+8] = 41<br />
646 <em>store/store barrier</em><br />
648 <td><code>loop:<br />
649 reg0 = B<br />
650 if (reg0 == 0) goto loop<br />
651 reg1 = 8 <strong>+ (reg0 & 0)</strong><br />
696 <td><code>loop_until (A == 1)<br />
698 <td><code>loop:<br />
699 reg0 = B<br />
700 if (reg0 == 0) goto loop<br />
701 reg1 = reg0 & 0<br />
745 <td><code>reg = A<br />
746 reg = reg + 1<br />
748 <td><code>reg = A<br />
749 reg = reg + 1<br />
771 <td><code>reg = 0x00000000<br />
773 <td><code>reg = 0xffffffff<br />
1593 <td><code>for (int i = 0; i < ITERATIONS; i++) {<br />
1594 a = i;<br />
1595 BB[i] = b;<br />
1597 <td><code>for (int i = 0; i < ITERATIONS; i++) {<br />
1598 b = i;<br />
1599 AA[i] = a;<br />
1624 <td><code>(initially a == 1534)<br />
1625 a = 1535<br />
1626 BB[1535] = 165<br />
1627 a = 1536<br />
1628 BB[1536] = 165<br />
1629 <br />
1630 <br />
1631 <br />
1632 <br />
1633 a = 1537<br />
1636 <br />
1637 <br />
1638 <br />
1639 <br />
1640 <br />
1641 b = 166<br />
1642 AA[166] = 1536<br />
1643 b = 167<br />
1644 AA[167] = 1536<br />
1645 <br /></code></td>
1668 <td><code>(initially a == 1534)<br />
1669 a = 1535<br />
1670 BB[1535] = 165<br />
1671 a = 1536<br />
1672 BB[1536] = 165<br />
1673 <br />
1674 <br />
1675 <br />
1676 <br />
1677 a = 1537<br />
1679 <td><code>(initially b == 165)<br />
1680 <br />
1681 <br />
1682 <br />
1683 <br />
1684 b = 166<br />
1685 AA[166] = 1536<br />
1686 b = 167<br />
1732 <td><code>flag1 = true<br />
1733 if (flag2 == false)<br />
1735 <td><code>flag2 = true<br />
1736 if (flag1 == false)<br />
1784 <td><code>reg = A<br />
1786 <td><code><em>store/store barrier</em><br />
1787 A = reg<br />
1817 <br /><a href="http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-95-7.pdf">http://www.hpl.hp.com/tec…
1821 <br /><a href="http://en.wikipedia.org/wiki/Memory_barrier">http://en.wikipedia.org/wiki/Memory_bar…
1825 <br /><a href="http://www.hpl.hp.com/personal/Hans_Boehm/c++mm/threadsintro.html">http://www.hpl.hp…
1829 <br /><a href="http://www.javaconcurrencyinpractice.com">http://www.javaconcurrencyinpractice.com</…
1833 <br /><a href="http://www.cs.umd.edu/~pugh/java/memoryModel/jsr-133-faq.html">http://www.cs.umd.edu…
1837 <br />{@link java.util.concurrent java.util.concurrent} Package Summary</dd>
1841 <br /><a href="http://www.ibm.com/developerworks/java/library/j-jtp0618.html">http://www.ibm.com/de…
1845 <br /><a href="http://www.ibm.com/developerworks/java/library/j-jtp06197.html">http://www.ibm.com/d…
1849 <br /><a href="http://www.cs.umd.edu/~pugh/java/memoryModel/DoubleCheckedLocking.html">http://www.c…
1853 <br /><a href="http://infocenter.arm.com/help/topic/com.arm.doc.genc007826/Barrier_Litmus_Tests_and…
1857 <br/><a href="http://www.kernel.org/doc/Documentation/memory-barriers.txt">http://www.kernel.org/do…
1861 <br /><a href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2010/n3090.pdf">http://www.open-s…
1862 <br/ >(intro: <a href="http://www.hpl.hp.com/techreports/2008/HPL-2008-56.pdf">http://www.hpl.hp.co…
1866 <br /><a href="http://www.open-std.org/jtc1/sc22/wg14/www/docs/n1425.pdf">http://www.open-std.org/j…
1870 <br /><a href="http://en.wikipedia.org/wiki/Dekker's_algorithm">http://en.wikipedia.org/wiki/Dekker…
1874 <br /><a href="http://linux.derkeiler.com/Mailing-Lists/Kernel/2009-05/msg11811.html">http://linux.…
1878 <br /><a href="http://www.akkadia.org/drepper/cpumemory.pdf">http://www.akkadia.org/drepper/cpumemo…
1882 <br /><a href="http://portal.acm.org/ft_gateway.cfm?id=1353528&type=pdf&coll=&dl=&CFID=96099715&CFT…
1886 <br /><a href="http://g.oswego.edu/dl/jmm/cookbook.html">http://g.oswego.edu/dl/jmm/cookbook.html</…
1890 <br /><a href="http://www.cl.cam.ac.uk/~pes20/weakmemory/draft-ppc-arm.pdf">http://www.cl.cam.ac.uk…