20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 
  24 
  25 package org.graalvm.compiler.nodes.test;
  26 
  27 import org.junit.Assert;
  28 import org.junit.Ignore;
  29 import org.junit.Test;
  30 
  31 import org.graalvm.compiler.api.directives.GraalDirectives;
  32 import org.graalvm.compiler.core.test.GraalCompilerTest;
  33 import org.graalvm.compiler.graph.Node;
  34 import org.graalvm.compiler.nodes.IfNode;
  35 import org.graalvm.compiler.nodes.LogicNode;
  36 import org.graalvm.compiler.nodes.StructuredGraph;
  37 import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions;
  38 import org.graalvm.compiler.nodes.calc.SubNode;
  39 import org.graalvm.compiler.phases.common.CanonicalizerPhase;
  40 import org.graalvm.compiler.phases.common.ConvertDeoptimizeToGuardPhase;
  41 import org.graalvm.compiler.phases.common.IterativeConditionalEliminationPhase;
  42 import org.graalvm.compiler.phases.tiers.PhaseContext;
  43 
  44 /**
  45  * A few tests of expected simplifications by
  46  * {@link IfNode#simplify(org.graalvm.compiler.graph.spi.SimplifierTool)}.
  47  */
  48 public class IfNodeCanonicalizationTest extends GraalCompilerTest {
  49 
  50     static int value;
  51 
  52     static final byte[] testValues = {-128, -1, 0, 1, 127};
  53 
  54     @Test
  55     public void test1() {
  56         /*
  57          * exercise conversion of x - y < 0 into x < y, both by checking expected graph shape and
  58          * that the transformed code produces the right answer.
  59          */
  60         test("testSnippet1", SubNode.class, 0);

  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 
  24 
  25 package org.graalvm.compiler.nodes.test;
  26 
  27 import org.junit.Assert;
  28 import org.junit.Ignore;
  29 import org.junit.Test;
  30 
  31 import org.graalvm.compiler.api.directives.GraalDirectives;
  32 import org.graalvm.compiler.core.test.GraalCompilerTest;
  33 import org.graalvm.compiler.graph.Node;
  34 import org.graalvm.compiler.nodes.IfNode;
  35 import org.graalvm.compiler.nodes.LogicNode;
  36 import org.graalvm.compiler.nodes.StructuredGraph;
  37 import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions;
  38 import org.graalvm.compiler.nodes.calc.SubNode;
  39 import org.graalvm.compiler.phases.common.CanonicalizerPhase;
  40 import org.graalvm.compiler.loop.phases.ConvertDeoptimizeToGuardPhase;
  41 import org.graalvm.compiler.phases.common.IterativeConditionalEliminationPhase;
  42 import org.graalvm.compiler.phases.tiers.PhaseContext;
  43 
  44 /**
  45  * A few tests of expected simplifications by
  46  * {@link IfNode#simplify(org.graalvm.compiler.graph.spi.SimplifierTool)}.
  47  */
  48 public class IfNodeCanonicalizationTest extends GraalCompilerTest {
  49 
  50     static int value;
  51 
  52     static final byte[] testValues = {-128, -1, 0, 1, 127};
  53 
  54     @Test
  55     public void test1() {
  56         /*
  57          * exercise conversion of x - y < 0 into x < y, both by checking expected graph shape and
  58          * that the transformed code produces the right answer.
  59          */
  60         test("testSnippet1", SubNode.class, 0);