summaryrefslogtreecommitdiff
path: root/chapter21
diff options
context:
space:
mode:
Diffstat (limited to 'chapter21')
-rw-r--r--chapter21/src/main/java/com/seaofnodes/simple/node/StoreNode.java9
-rw-r--r--chapter21/src/test/java/com/seaofnodes/simple/Chapter10Test.java23
-rw-r--r--chapter21/src/test/java/com/seaofnodes/simple/Chapter17bTest.java25
3 files changed, 55 insertions, 2 deletions
diff --git a/chapter21/src/main/java/com/seaofnodes/simple/node/StoreNode.java b/chapter21/src/main/java/com/seaofnodes/simple/node/StoreNode.java
index a5b09663..d59e5800 100644
--- a/chapter21/src/main/java/com/seaofnodes/simple/node/StoreNode.java
+++ b/chapter21/src/main/java/com/seaofnodes/simple/node/StoreNode.java
@@ -158,4 +158,13 @@ public class StoreNode extends MemOpNode {
//return _init || t.isa(_declaredType) ? null : Parser.error("Cannot store "+t+" into field "+_declaredType+" "+_name,_loc);
return null;
}
+
+ // Do not GVN Stores. Two equal Stores on two of three paths are the easy
+ // failure: sharing them makes GCM place the Store on all three paths.
+ // Sharing is safe only if every exit path goes through an original Store,
+ // or GCM splits the shared Store to keep it on those paths. Stores must
+ // sink, not run on extra paths. GVN does not check this; GCM does not split.
+ // Identity also disables generic Phi factoring of Stores.
+ // The closed-loop Store sink is a separate peep and still applies.
+ @Override public boolean eq(Node n) { return this == n; }
}
diff --git a/chapter21/src/test/java/com/seaofnodes/simple/Chapter10Test.java b/chapter21/src/test/java/com/seaofnodes/simple/Chapter10Test.java
index 8af1c71d..3e01458b 100644
--- a/chapter21/src/test/java/com/seaofnodes/simple/Chapter10Test.java
+++ b/chapter21/src/test/java/com/seaofnodes/simple/Chapter10Test.java
@@ -8,6 +8,24 @@ import static org.junit.Assert.assertEquals;
import static org.junit.Assert.fail;
public class Chapter10Test {
+ @Test public void testConditionalStoreSharing() {
+ // Sharing the writes on two of three paths must not write on the third.
+ // Return the object so Load forwarding cannot hide the physical Store.
+ String src = """
+ struct S { int x; };
+ !S !a = new S;
+ a.x = 10;
+ if (arg == 1) a.x = 9;
+ else if (arg == 2) a.x = 9;
+ return a;
+ """;
+ var code = new CodeGen(src).driver(CodeGen.Phase.LocalSched);
+ for( int arg : new int[]{0,1,2,3} ) {
+ long expected = (arg==1 || arg==2) ? 9 : 10;
+ assertEquals("S{x="+expected+"}",Eval2.eval(code,arg));
+ }
+ }
+
@Test public void testDeadReferenceReturn() {
for( String body : new String[] {
"return new S; return 0;",
@@ -530,7 +548,7 @@ return 0;
assertEquals("3",Eval2.eval(code,3));
}
- @Test public void testDropStores() {
+ @Test public void testKeepBranchStores() {
var code = new CodeGen("""
struct S { int x; };
!S !s = new S;
@@ -538,7 +556,8 @@ return 0;
return s;
""").parse().iter();
StopNode stop = code._stop;
- assertEquals(1,countMemoryNodes(stop,StoreNode.class,new BitSet()));
+ // Keep each Store on its own branch.
+ assertEquals(2,countMemoryNodes(stop,StoreNode.class,new BitSet()));
assertEquals("S{x=2}",Eval2.eval(code,0));
assertEquals("S{x=4}",Eval2.eval(code,3));
}
diff --git a/chapter21/src/test/java/com/seaofnodes/simple/Chapter17bTest.java b/chapter21/src/test/java/com/seaofnodes/simple/Chapter17bTest.java
index 8ea72c21..a761a31b 100644
--- a/chapter21/src/test/java/com/seaofnodes/simple/Chapter17bTest.java
+++ b/chapter21/src/test/java/com/seaofnodes/simple/Chapter17bTest.java
@@ -8,6 +8,31 @@ import static org.junit.Assert.fail;
public class Chapter17bTest {
+ @Test public void testSinkLoopStores() {
+ var code = new CodeGen("""
+ struct S { int x; };
+ !S !a = new S;
+ a.x = 10;
+ int i = 0;
+ while (i < arg) { a.x = i + 1; i++; }
+ return a;
+ """).driver(CodeGen.Phase.LocalSched);
+ int[] stores = {0};
+ code._stop.walk(n -> {
+ if( n instanceof com.seaofnodes.simple.node.StoreNode st && st._name.equals("x") ) {
+ assertEquals(0,st.cfg0().loopDepth()); // One final Store outside the loop.
+ stores[0]++;
+ }
+ return null;
+ });
+ assertEquals(1,stores[0]);
+ for( int arg : new int[]{-1,0,1,4} ) {
+ long expected = arg<=0 ? 10 : arg;
+ assertEquals("S{x="+expected+"}",Eval2.eval(code,arg));
+ }
+ }
+
+
@Ignore
@Test
public void testJig() {