/*

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 */

package org.graalvm.compiler.core.test;

import org.graalvm.compiler.nodes.StructuredGraph;

import org.graalvm.compiler.nodes.memory.WriteNode;

import org.graalvm.compiler.nodes.spi.LoweringTool;

import org.graalvm.compiler.phases.common.FloatingReadPhase;

import org.graalvm.compiler.phases.common.IncrementalCanonicalizerPhase;

import org.graalvm.compiler.phases.common.LoweringPhase;

import org.graalvm.compiler.phases.tiers.HighTierContext;

import org.junit.Test;

public class MemoryGraphCanonicalizeTest extends GraalCompilerTest {

    static class TestObject {

        Object object;

        Integer integer;

        int value;

        volatile boolean written;

    }

    public static void simpleElimination(TestObject object) {

        object.object = object;

        object.value = object.integer;

        object.value = object.integer + 2;

        object.value = object.integer + 3;

    }

    @Test

    public void testSimpleElimination() {

        testGraph("simpleElimination", 2);

    }

    public static void complexElimination(TestObject object) {

        object.object = object;

        object.value = object.integer;

        object.value = object.integer + 2;

        if (object.object == null) {

            object.value = object.integer + 3;

        } else {

            object.object = new Object();

        }

        object.written = true;

        object.value = 5;

    }

    @Test

    public void testComplexElimination() {

        testGraph("complexElimination", 6);

    }

    public void testGraph(String name, int expectedWrites) {

        StructuredGraph graph = parseEager(name, StructuredGraph.AllowAssumptions.YES);

        HighTierContext context = getDefaultHighTierContext();

        int writes = graph.getNodes().filter(WriteNode.class).count();

        assertTrue(writes == expectedWrites, "Expected %d writes, found %d", expectedWrites, writes);

    }

}