summaryrefslogtreecommitdiff
path: root/chapter04/src/main/java/com/seaofnodes
diff options
context:
space:
mode:
authorHsiang-Ying Fu <66062782+fuhsnn@users.noreply.github.com>2026-09-26 06:35:22 +0800
committerGitHub <noreply@github.com>2026-09-25 15:35:22 -0700
commitdd907c2d86eaaad0910e7bfe3f0d25e5caf8bdf7 (patch)
tree8b71264016c53914912e1cd30527b1bf86ed9bf3 /chapter04/src/main/java/com/seaofnodes
parente922879e9dfa402934e2b5860900661b1169492c (diff)
downloadSimple-dd907c2d86eaaad0910e7bfe3f0d25e5caf8bdf7.tar.gz
Simple-dd907c2d86eaaad0910e7bfe3f0d25e5caf8bdf7.zip
Extend and backport SubNode peephole (#254)
* Extend and backport SubNode peephole * Add tests * Restrict subtraction zero peepholes to integer operands Require resolved integer mode in chapter 25 so zero subtraction preserves floating-point signed zero. Keep nonnumeric operands in the graph for subtraction diagnostics. Add signed-zero coverage from chapter 12 and null-subtraction diagnostics from chapter 22. Confirmed the regressions fail on the original PR. Full Make suites pass in chapters 4-25 (5462 tests), including fresh chapter 25 sys.o compilation. --------- Co-authored-by: Cliff Click <cliffc@acm.org>
Diffstat (limited to 'chapter04/src/main/java/com/seaofnodes')
-rw-r--r--chapter04/src/main/java/com/seaofnodes/simple/node/SubNode.java19
1 files changed, 19 insertions, 0 deletions
diff --git a/chapter04/src/main/java/com/seaofnodes/simple/node/SubNode.java b/chapter04/src/main/java/com/seaofnodes/simple/node/SubNode.java
index f5ad663d..c831a798 100644
--- a/chapter04/src/main/java/com/seaofnodes/simple/node/SubNode.java
+++ b/chapter04/src/main/java/com/seaofnodes/simple/node/SubNode.java
@@ -32,6 +32,25 @@ public class SubNode extends Node {
@Override
public Node idealize() {
+ Node lhs = in(1);
+ Node rhs = in(2);
+ Type t1 = lhs._type;
+ Type t2 = rhs._type;
+
+ // Keep invalid operands for type checking.
+ if( t1 instanceof TypeInteger x && t2 instanceof TypeInteger y ) {
+ if( y.isConstant() && y.value()==0 ) return lhs;
+ if( x.isConstant() && x.value()==0 ) return new MinusNode(rhs);
+ }
+
+ // x - (-y) is x+y
+ if( rhs instanceof MinusNode minus )
+ return new AddNode(lhs,minus.in(1));
+
+ // (-x) - y is -(x+y)
+ if( lhs instanceof MinusNode minus )
+ return new MinusNode(new AddNode(minus.in(1),rhs).peephole());
+
return null;
}