1 /*
   2  * Copyright (c) 2017, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  */
  23 
  24 
  25 package org.graalvm.compiler.core.test;
  26 
  27 import org.graalvm.compiler.nodes.StructuredGraph;
  28 import org.graalvm.compiler.nodes.StructuredGraph.AllowAssumptions;
  29 import org.graalvm.compiler.nodes.calc.AndNode;
  30 import org.graalvm.compiler.nodes.calc.NotNode;
  31 import org.graalvm.compiler.nodes.calc.OrNode;
  32 import org.graalvm.compiler.phases.common.CanonicalizerPhase;
  33 import org.junit.Assert;
  34 import org.junit.Test;
  35 
  36 public class DeMorganCanonicalizationTest extends GraalCompilerTest {
  37 
  38     public static int or(int a, int b) {
  39         return ~a | ~b;
  40     }
  41 
  42     public static int and(int a, int b) {
  43         return ~a & ~b;
  44     }
  45 
  46     @Test
  47     public void testAnd() {
  48         StructuredGraph g = parseEager("and", AllowAssumptions.NO, getInitialOptions());
  49         new CanonicalizerPhase().apply(g, getDefaultHighTierContext());
  50         Assert.assertEquals(1, g.getNodes().filter(OrNode.class).count());
  51         Assert.assertEquals(1, g.getNodes().filter(NotNode.class).count());
  52 
  53         testAgainstExpected(g.method(), new Result(and(-1, 17), null), (Object) null, -1, 17);
  54         testAgainstExpected(g.method(), new Result(and(-1, 1), null), (Object) null, -1, 1);
  55         testAgainstExpected(g.method(), new Result(and(-1, -1), null), (Object) null, -1, -1);
  56         testAgainstExpected(g.method(), new Result(and(Integer.MIN_VALUE, Integer.MIN_VALUE), null), (Object) null, Integer.MIN_VALUE, Integer.MIN_VALUE);
  57     }
  58 
  59     @Test
  60     public void testOr() {
  61         StructuredGraph g = parseEager("or", AllowAssumptions.NO, getInitialOptions());
  62         new CanonicalizerPhase().apply(g, getDefaultHighTierContext());
  63         Assert.assertEquals(1, g.getNodes().filter(AndNode.class).count());
  64         Assert.assertEquals(1, g.getNodes().filter(NotNode.class).count());
  65 
  66         testAgainstExpected(g.method(), new Result(or(-1, 17), null), (Object) null, -1, 17);
  67         testAgainstExpected(g.method(), new Result(or(-1, 1), null), (Object) null, -1, 1);
  68         testAgainstExpected(g.method(), new Result(or(-1, -1), null), (Object) null, -1, -1);
  69         testAgainstExpected(g.method(), new Result(or(Integer.MIN_VALUE, Integer.MIN_VALUE), null), (Object) null, Integer.MIN_VALUE, Integer.MIN_VALUE);
  70     }
  71 
  72 }