diff options
| author | Cliff Click <cliffc@acm.org> | 2025-06-13 15:42:08 -0700 |
|---|---|---|
| committer | Cliff Click <cliffc@acm.org> | 2026-10-24 15:56:44 -0700 |
| commit | b59f51486393b2fae7b0015bc5099c5514c7335a (patch) | |
| tree | 709c7ee19d0fb2467ecb353960f74722f3fd916d /src/test/java/com/seaofnodes/simple/SccpTest.java | |
| parent | 89dd0a79da85b2c7102b7c8918a1466e6238fe94 (diff) | |
| download | Simple-linear-chapter24b.tar.gz Simple-linear-chapter24b.zip | |
Chapter 24b: SCCP Across Functionslinear-chapter24b
Co-authored-by: Tamás Hadházy <85063808+Hels15@users.noreply.github.com>
Co-authored-by: Hsiang-Ying Fu <66062782+fuhsnn@users.noreply.github.com>
Co-authored-by: fuhsnn <66062782+fuhsnn@users.noreply.github.com>
Co-authored-by: Symious <14933944+symious@users.noreply.github.com>
Co-authored-by: Jun Kawasaki <jun784@gmail.com>
Co-authored-by: Hadházy Tamás <helsgithub15@gmail.com>
Co-authored-by: Claude Opus 5 <noreply@anthropic.com>
Diffstat (limited to 'src/test/java/com/seaofnodes/simple/SccpTest.java')
| -rw-r--r-- | src/test/java/com/seaofnodes/simple/SccpTest.java | 18 |
1 files changed, 5 insertions, 13 deletions
diff --git a/src/test/java/com/seaofnodes/simple/SccpTest.java b/src/test/java/com/seaofnodes/simple/SccpTest.java index afa0ec58..cad1b7de 100644 --- a/src/test/java/com/seaofnodes/simple/SccpTest.java +++ b/src/test/java/com/seaofnodes/simple/SccpTest.java @@ -7,25 +7,17 @@ import org.junit.Test; import static org.junit.Assert.*; public class SccpTest { - @Test public void testLoopFixedPoint() { - var code = new CodeGen("int x=1; while(arg) { x=2-x; arg--; } return x;").parse().iter(); - assertFalse(code.link(code._main).ret().expr()._type.isConstant()); - code.opto(); - assertSame(TypeInteger.TRUE,code.link(code._main).ret().expr()._type); - code.driver(CodeGen.Phase.LocalSched); - assertEquals("1",Eval2.eval(code,4)); - } - - @Test public void testConservativeCalls() { + @Test public void testCallArgumentFlow() { var code = new CodeGen("val f={ int x -> x+1; }; return f(1)+f(2);").parse().iter().opto(); int[] parms = {0}; code._start.walk(n -> { if( n instanceof ParmNode p && "x".equals(p._label) ) { parms[0]++; - assertSame(TypeInteger.BOT,p._type); - assertTrue(p.fun().in(1) instanceof StartNode); + TypeInteger t = (TypeInteger)p._type; + assertEquals(1,t._min); + assertEquals(2,t._max); + assertFalse(p.fun().in(1) instanceof StartNode); } - if( n instanceof CallEndNode cend ) assertEquals(1,cend.nIns()); return null; }); assertEquals(1,parms[0]); |
