src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/calc/IntegerEqualsNode.java

rev 52509 : [mq]: graal2

*** 197,207 ****
                      // nonConstant can only be 0 or 1 (respective -1), test against 0 instead of 1
                      // (respective -1) for a more canonical graph and also to allow for faster
                      // execution
                      // on specific platforms.
                      return LogicNegationNode.create(
!                                     IntegerEqualsNode.create(constantReflection, metaAccess, options, smallestCompareWidth, nonConstant, ConstantNode.forIntegerKind(nonConstant.getStackKind(), 0),
                                                      view));
                  } else if (primitiveConstant.asLong() == 0) {
                      if (nonConstant instanceof AndNode) {
                          AndNode andNode = (AndNode) nonConstant;
                          return new IntegerTestNode(andNode.getX(), andNode.getY());
--- 197,207 ----
                      // nonConstant can only be 0 or 1 (respective -1), test against 0 instead of 1
                      // (respective -1) for a more canonical graph and also to allow for faster
                      // execution
                      // on specific platforms.
                      return LogicNegationNode.create(
!                                     IntegerEqualsNode.create(constantReflection, metaAccess, options, smallestCompareWidth, nonConstant, ConstantNode.forIntegerStamp(nonConstantStamp, 0),
                                                      view));
                  } else if (primitiveConstant.asLong() == 0) {
                      if (nonConstant instanceof AndNode) {
                          AndNode andNode = (AndNode) nonConstant;
                          return new IntegerTestNode(andNode.getX(), andNode.getY());